Area of squares formed by joining mid points repeatedly
Given a square having a side of length L. Another square form inside the first square by joining midpoint of the side of the first square. Now 3rd square is form inside 2nd one by joining midpoints of the side of the 2nd square and so on.
You have 10 squares inside each other. and you are given side length of largest square. you have to find the area of these 10 squares.
Examples:
Input : L = 5, n = 10
Output :49.9512
Input : L = 2, n = 2
Output :7.99219
This article can be understand using diagram that depicts the whole problem.
From the diagram-
Area of outermost square will be given by L^2.
Area of 2nd square-As length of 2nd square can be calculate using Pythagoras theorem., side for this square will be \\
Area of 3rd square-
Similarly area of third square can be calculated, we get
Area of 4th square-
Similarly area of forth square can be calculated, we get
Hence this form Geometric progression, having first term as L^2 and common ratio = 1/2.
Now we have to find sum of first n terms of this GP.
C++
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
double L = 2, n = 10;
double firstTerm = L * L;
double ratio = 1 / 2.0;
double sum = firstTerm * ( pow (ratio, 10) - 1) / (ratio - 1);
cout << sum << endl;
return 0;
}
|
Java
import java.util.*;
import java.lang.*;
import java.io.*;
import java.lang.Math;
class GFG
{
public static void main (String[] args) throws java.lang.Exception
{
double L = 2 , n = 10 ;
double firstTerm = L * L;
double ratio = 1 / 2.0 ;
double sum = firstTerm * (Math.pow(ratio, 10 ) - 1 ) / (ratio - 1 );
System.out.println(sum) ;
}
}
|
Python 3
if __name__ = = '__main__' :
L = 2
n = 10
firstTerm = L * L
ratio = 1 / 2
sum = firstTerm * ((ratio * * 10 ) - 1 ) / (ratio - 1 )
print ( sum )
|
C#
using System;
class GFG{
public static void Main( string [] args)
{
double L = 2;
double firstTerm = L * L;
double ratio = 1 / 2.0;
double sum = firstTerm *
(Math.Pow(ratio, 10) - 1) /
(ratio - 1);
Console.Write(Math.Round(sum, 5));
}
}
|
Javascript
<script>
var L = 2, n = 10;
var firstTerm = L * L;
var ratio = 1 / 2.0;
var sum = firstTerm * (Math.pow(ratio, 10) - 1) / (ratio - 1);
document.write( sum.toFixed(5) );
</script>
|
Time Complexity: O(1)
Auxiliary Space: O(1)
Last Updated :
12 Oct, 2022
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...