hoj Count on Canton
2012-06-23 23:14
344 查看
/*y一道纯数学题。 判断奇偶即可。水~ */ #include <stdio.h> int main() { int n,k; long long s; while(scanf("%d",&n)==1) { s=0; k=1; for(;;) { s+=k; if(s>=n) { if(k%2==0) {printf("TERM %d IS %lld/%lld\n",n,k-s+n,s-n+1);break;} else {printf("TERM %d IS %lld/%lld\n",n,s-n+1,k-s+n);break;} } k++; } } return 0; }
相关文章推荐
- HOJ 1649 Count on Canton
- Count on Canton
- POJ-1969-Count on Canton
- Count on Canton
- Count on Canton
- Count on Canton
- zoj 2185 Count on Canton
- ZOJ 2185 Count on Canton
- zoj 2185 || poj 1969 Count on Canton
- [POJ1969]Count on Canton
- SPOJ - COT Count on a tree 树上主席树+LCA+任意路径问题
- 2588: Spoj 10628. Count on a tree (主席树,树上路径第K大值)
- SPOJ COT Count on a tree
- BZOJ2588: Spoj 10628. Count on a tree
- 存储过程 SET NOCOUNT ON
- bzoj2588 Count on a tree(树上建主席树求路径第k大)
- 在编写存储过程时使用 Set NoCount On
- SET NOCOUNT { ON | OFF }实用讲解
- hdu4916 Count on the path,树dp
- [BZOJ]2588 Spoj 10628. Count on a tree 树链第k大 PE的进来看看