Ural 1001. Reverse Root
2015-05-15 19:35
344 查看
呵.
#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #include<cstdlib> #include<cmath> using namespace std; long long a[1100000]; int main() { int len=0; while(scanf("%I64d",&a[++len])!=EOF); for(int i=len-1;i>=1;i--) printf("%.4lf\n",sqrt(a[i]*1.0)); return 0; }
相关文章推荐
- URAL 1001. Reverse Root
- URAL1132_Square Root
- 1001. Reverse Root
- URAL 1001 Reverse Root
- URAL - 1132 Square Root 二次剩余
- Ural 1001 Reverse Root 解题报告
- [Ural 1132] Square Root (二次剩余方程)
- URAL 1001 Reverse Root
- 1001. Reverse Root
- URAL 1123 Square Root(计算二次剩余)
- 1001. Reverse Root
- Ural水题连萌之1001_Reverse Root
- [ural1132]Square Root(cipolla算法)
- URAL 1132 Square Root(二次剩余)
- Ural 1132. Square Root 二次剩余
- Ural 1001 Reverse Root 解题报告
- Ural 1001 - Reverse Root
- URAL 1132 Square Root 暴力枚举,二次剩余.
- URAL1132 Square Root 二次剩余模版题
- URAL1001 - Reverse Root - 水题