[ACM Timus] 1001. Reverse Root [C]

Problem Link: 1001. Reverse Root

 

http://acm.timus.ru/problem.aspx?space=1&num=1001
 
[c]
#include<stdio.h>
int main()
{
int i=0;
unsigned long long int a;
double b[131072];
while(scanf("%llu",&a)!=EOF)
{
b[i]=sqrt(a);
i++;
}
i=i-1;
for(i=i;i>=0;i–){
printf("%.4lfn",b[i]);
}
return 0;
}

[/c]

Advertisements