number as square of two integers
Given an integer n decide if it is possible to represent it as a sum of two squares of integers.
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
cin>>X;
ReplyDeletei=sqrt(X);
j=sqrt(X-i*i);
while(i>=0 && i>=j)
{
if((i*i)+(j*j)==X)
{count = 1;break;}
i--;
j=sqrt(X-i*i);
}
if(count == 1)
cout<<"Yes";
else cout<<"No";