Hdu4952 - Number Transformation - 数论(2014 Multi-University Training Contest 8)
2014-08-14 20:23
357 查看
寻找1~k内i的倍数,则这个数可以看成i*x,则下一个数为(i+1)*y,(i+1)*y>=i*x,那么可以推出,y=x-x/(i+1);
那么当x<i+1时,y==x,之后的循环也不会改变,就可以跳出。
那么当x<i+1时,y==x,之后的循环也不会改变,就可以跳出。
#include<stdio.h> __int64 x,y,k; int main() { __int64 i; int flag; __int64 sum; int cas=0; while(scanf("%I64d%I64d",&x,&k)!=EOF) { sum=x; flag=0; if(x==0&&k==0) { break; } for(i=1;i<k;i++) { y=x-x/(i+1); if(x==y) { sum=x*k; break; } x=y; sum=x*k; } printf("Case #%d: %I64d\n",++cas,sum); } }
相关文章推荐
- Hdu4952 - Number Transformation - 数论(2014 Multi-University Training Contest 8)
- 2014 Multi-University Training Contest 1/HDU4861_Couple doubi(数论/法)
- 2014(高斯消元 DP 数论)Multi-University Training Contest 1 题解
- Hdu4861 - Couple doubi - 数论(2014 Multi-University Training Contest 1-1001)
- 2014 Multi-University Training Contest 1/HDU4861_Couple doubi(数论/规律)
- hdu 4960 Another OCD Patient 2014 Multi-University Training Contest 9
- hdu 4925 Apple Tree 2014 Multi-University Training Contest 6
- 【比赛总结】2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 2---ZCC Loves Codefires
- 2014 Multi-University Training Contest 2--by 镇海中学 解题报告
- 【模拟+hash+并查集】2014 Multi-University Training Contest 2|HDU_4879 ZCC loves march
- 2014 Multi-University Training Contest 3 1007 && HDU 4893 Wow! Such Sequence ! (线段树)
- 【2014 Multi-University Training Contest 4】 Nice boat
- HDU 4898 The Revenge of the Princess’ Knight ( 2014 Multi-University Training Contest 4 )
- 2014 Multi-University Training Contest 5 HDOJ 4911 Inversion
- 2014 Multi-University Training Contest 5
- 2014 Multi-University Training Contest 6 Fighting the Landlords
- hdu 4923 Room and Moor--2014 Multi-University Training Contest 6
- HDU 4939 Stupid Tower Defense (2014 Multi-University Training Contest 7)
- 2014 Multi-University Training Contest 8【水题两道】