2013 Multi-University Training Contest 2
来源:互联网 发布:win7打开本地端口 编辑:程序博客网 时间:2024/05/29 19:54
从比赛开始到结束一直在搞1001,,为什么版刷题我们过不了。。。一直debug,,终于AC了。。。我写的都无力了。。。
#include<iostream>#include<cmath>#include<cstring>#include<string>#include<algorithm>#include<iomanip>#include<cstdio>using namespace std;__int64 gcd(__int64 a,__int64 b){ if(b==0) { return a; } else { return gcd(b,a%b); }}__int64 g(int n,int a,int b){ __int64 ans=0; int i=0,x1=0,y1=0,tp=0; while(i<n) { if((x1+a)>=n&&(y1+b)>=n) { ans+=(__int64)(n-i)*tp; i=n; continue; } if((x1+a)<(y1+b)) { ans+=(__int64)tp*(x1+a-i); i=x1+a; tp=i-y1; x1+=a; } else if((x1+a)==(y1+b)) { ans+=(__int64)tp*(x1+a-i); i=x1+a; x1+=a; y1+=b; tp=0; } else { ans+=(__int64)tp*(y1+b-i); i=y1+b; y1+=b; tp=i-x1; } } return ans;}int main(){ int t,n,x,y,a,b; __int64 sum,tmp,ans; scanf("%d",&t); while(t--) { scanf("%d%d%d",&n,&x,&y); if(x==y) { printf("0\n"); continue; } a=max(x,y); b=min(x,y); sum=(__int64)a/gcd(a,b)*(__int64)b; if(sum>= n) { printf("%I64d\n",g(n,a,b)); continue; } tmp=g(sum,a,b); ans=tmp*(n/sum)+g(n%sum,a,b); printf("%I64d\n",ans); } return 0;}
- 2013 Multi-University Training Contest 2
- 2013 Multi-University Training Contest 1
- 2013 Multi-University Training Contest 1
- 2013 Multi-University Training Contest 1
- 2013 Multi-University Training Contest 1
- 2013 Multi-University Training Contest 3
- 2013 Multi-University Training Contest 3
- 2013 Multi-University Training Contest 4
- 2013 Multi-University Training Contest 5
- 2013 Multi-University Training Contest 6
- 2013 Multi-University Training Contest 7
- 2013 Multi-University Training Contest 8
- 2013 Multi-University Training Contest 8 小结
- 2013 Multi-University Training Contest 9
- 2013 Multi-University Training Contest 10
- 2013 Multi-University Training Contest 4
- 【索引】2013 Multi-University Training Contest
- 2012 Multi-University Training Contest 2 Matrix
- sap workload
- asteria参考アドレス
- php模块memcache和memcached区别分析
- boost库的简单介绍
- 2013.7.25 泛型
- 2013 Multi-University Training Contest 2
- J2EE相关概念的学习
- 30个非常流行的提示信息插件(jQuery Tooltip Plugin)
- ACM计算几何题目推荐
- poj 2186 Popular Cows (Tarjan 强连通分量+压缩点)
- MyISAM 和 InnoDB 讲解
- 关于JSON与JSONP简单总结
- MyEclipse代码格式化时防止换行的方法
- php+nginx配置