solution of TIPTOP - Tip Top Game on spoj
solution-
#include<stdio.h>
#include<math.h>
int main()
{long long int t,i,n,k;
scanf("%lld",&t);
for(i=1;i<=t;i++)
{ scanf("%lld",&n);
k=sqrt(n);
if(k*k==n)
{ printf("Case %lld: Yes",i);
printf("\n");
}
else
{printf("Case %lld: No",i);
printf("\n");
}
}
}
#include<stdio.h>
#include<math.h>
int main()
{long long int t,i,n,k;
scanf("%lld",&t);
for(i=1;i<=t;i++)
{ scanf("%lld",&n);
k=sqrt(n);
if(k*k==n)
{ printf("Case %lld: Yes",i);
printf("\n");
}
else
{printf("Case %lld: No",i);
printf("\n");
}
}
}
Problem Statement:
Alim and sufian are two good friends. They loves to playing game with number recently they discover a new game name “Tip Top”. The rule of the game is they took a number (N) randomly after that they find the all divisors of N. Then they starting to play the game first alim took a divisor, then sufian so on. The person who took the last divisor will win the game.
Every time the game started with alim . Now alim wants to know when he will win.
As you a good programmer your task is to find will alim win or not.
Input:
Input starts with an integer T ( T ≤ 105 ), denoting the number of test cases. Each case starts with a line containing an integer N ( 1 ≤ N ≤ 1018 ) the number.
Output:
For each case you have to print “Yes” if alim will win otherwise “No” with case number. See the sample input/output for exact formatting.
Sample Input/Output:
Sample Input
Sample Output
2
4
5
Case 1: Yes
Case 2: No
Comments
Post a Comment