Thursday, 6 April 2017

Geeksforgeeks Solution For " Count Squares "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- 

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
using namespace std;
int main()
 {
int t;
cin>>t;
while(t--)
{
   unsigned long long int n,res=0;
   cin>>n;
   res=sqrt(n-1);
   cout<<res<<endl;
}
return 0;
}

Output:-



Geeksforgeeks Solution For " Count Squares "

No comments:
Write comments

Recommended Posts × +