uva 10465 Homer Simpson
2015-02-18 13:23
134 查看
[code]#include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> #include<iostream> using namespace std; int main() { int m,n,t,max,sum,i,j; while(~scanf("%d%d%d",&m,&n,&t)) { max=sum=0; for(i=0; i<=t/m; i++) for(j=0;; j++) if(i*m+j*n>t) break; else { if(i*m+j*n>sum) { max=i+j; sum=i*m+j*n; } else if(i*m+j*n==sum) { if(i+j>max) max=i+j; } } if(sum==t) printf("%d\n",max); else printf("%d %d\n",max,t-sum); } return 0; }
相关文章推荐
- UVa 10465 HomerSimpson
- UVA 10465 Homer Simpson
- uva 10465 Homer Simpson
- UVA 10465 Homer Simpson
- UVa 10465 - Homer Simpson
- UVa 10465 - Homer Simpson DP 完全背包
- UVA - 10465 Homer Simpson
- uva 10465 Homer Simpson
- UVA 10465 Homer Simpson
- Uva 10465 — Homer Simpson
- UVa 10465 - Homer Simpson
- UVA 10465 Homer Simpson
- 10465 - Homer Simpson
- 10465 - Homer Simpson
- UVA 10465 Homer Simpson 完全背包
- UVa 10465 Homer Simpson(DP 完全背包)
- Homer Simpson - UVa 10465 dp
- UVA - 10465 Homer Simpson
- uva_10465 Homer Simpson
- UVA 10465 —— 完全背包