#include<bits/stdc++.h>
using namespace std;
int main()
{
long long T,S,l,n,c=1;
// freopen("check.txt","r",stdin);
scanf("%lld",&T);
while(T--)
{
scanf("%lld",&S);
l = ceil(sqrt(S));
n = l*l-l+1;
if(l%2==1)
if(S<n)
printf("Case %lld: %lld %lld\n",c++,l,l-n+S);
else
printf("Case %lld: %lld %lld\n",c++,l-S+n,l);
else
{
if(S<n)
printf("Case %lld: %lld %lld\n",c++,l-n+S,l);
else
printf("Case %lld: %lld %lld\n",c++,l,l-S+n);
}
}
return 0;
}
Thursday, July 30, 2015
1008 - Fibsieve`s Fantabulous Birthday
Subscribe to:
Post Comments (Atom)
Triathlon
Triathlon - CodeChef # include < bits/stdc++.h > using namespace std ; # define fi first # define se second # define mp ...
-
# include < bits/stdc++.h > using namespace std ; int main ( ) { int T , c = 1 ; double r1 , r2 , h , p ; // ...
-
# include < bits/stdc++.h > using namespace std ; int main ( ) { long long T , S , l , n , c = 1 ; // freopen(&qu...
-
# include < bits/stdc++.h > using namespace std ; int main ( ) { int T , n , p , q , c = 1 , i , w , t , arry [ 50 ] ; ...
Hi, can you please explain how the algorithm works here?
ReplyDeleteThis comment has been removed by the author.
ReplyDelete