138 - Street Numbers
2013-04-23 14:05
260 查看
描述:有m,n两个数字,求得区间[m,n]==[1,m],输出十组m,n #include <cstdio> #include <cmath> int main() { int n=8,m=6,arr[10]={0}; printf("%10d%10d\n",m,n); arr[0]=1; for(int i=1; i<10; i++) { arr[i]=m; m*=6; m-=arr[i-1]; n=sqrt(2)*m; printf("%10d%10d\n",m,n); } }
相关文章推荐
- UVa 138 Street Numbers
- uva138 - Street Numbers
- UVa 138 - Street Numbers (门牌号)
- UVa 138 - Street Numbers
- UVA 138 Street Numbers
- UVa 138 Street Numbers(数论&Pell方程)
- uva 138 - Street Numbers
- UVA138- Street Numbers
- Street Numbers - UVa 138 水题
- UVa 138: Street Numbers
- Uva 138-Street Numbers(佩尔方程)
- uva 138——Street Numbers
- UVa OJ 138 - Street Numbers (门牌号)
- UVA 138 Street Numbers
- UVA - 138 Street Numbers 公式题
- UVA - 138 Street Numbers
- POJ1320 UVA138 Street Numbers【Pell方程+数学】
- uva 138 street numbers
- UVa 138 - Street Numbers
- UVA138 Street Numbers(数论)