POJ 1969
2013-06-10 12:29
225 查看
数列:
1/1 1/2 1/3 1/4 1/5 ... 2/1 2/2 2/3 2/4 3/1 3/2 3/3 4/1 4/2 5/1
题目要求输入一个数字N,输出该N在数列中所对应的数字,也就是第N个数。
代码:
#include<iostream>using namespace std;int main(){int num;while(cin>>num){int line,n=num;for(line=1;num>line;line++)
//计算第n个数是第几行的以及是该行的第num个数字num-=line;if(line%2==0)cout<<"TERM
"<<n<<"
IS "<<num<<"/"<<line-num+1<<endl;elsecout<<"TERM
"<<n<<"
IS "<<line-num+1<<"/"<<num<<endl;}return 0;}
复制搜索复制搜索
相关文章推荐
- poj&nbsp;1502&nbsp;MPI&nbsp;Maelstrom(dijkstra)
- poj 3468 A Simple Problem with I…
- poj&nbsp;1364&nbsp;King&nbsp;(差分约束)
- poj 2828 Buy Tickets
- poj&nbsp;3264&nbsp;Balanced&nbsp;Lineup(线段树)
- poj 2001 Shortest Prefixes
- poj&nbsp;3267&nbsp;The&nbsp;Cow&nbsp;Lexicon(DP)
- poj&nbsp;3321&nbsp;Apple&nbsp;Tree(树状数组)
- poj 2001 Shortest Prefixes
- poj&nbsp;2250&nbsp;Compromise(DP)
- poj&nbsp;2446&nbsp;Chessboard(二分图匹配)
- POJ&nbsp;1929
- poj 2676
- poj 3268 简单的SPFA算法运用
- poj 3592 有点难度的强…
- POJ 1083 Moving Tables(水题)
- POJ 1552 Doubles (水题)
- Poj 2886 Who Gets the Most Candi…
- 总结: 求逆序对 递归分治(与poj 22…
- ACM: 图论题 poj 2253 (poj上的dou…