(2019 GDUT Rating Contest #I)H. Mixing Milk
2019-03-16 01:00
218 查看
传送门
题目大意:
农夫有3桶牛奶,给出每个桶的容量,将桶1的牛奶倒入桶2,再将桶2的牛奶倒入桶3,再将桶3的牛奶倒入桶1,然后这样倒100次,问100次后各个桶有多少牛奶?
题目分析:
真的水题,只是代码量有点长。我们先写出1一>2,2一>3,3一>1的过程,再循环33次,最后再copy 1一>2 的过程,就可以得出答案了。
代码:
#include <iostream> #include <algorithm> #include <cstdio> #include <cstring> using namespace std; typedef pair <int,int> P; int main(){ P cow[4]; for(int i=1;i<=3;i++){ cin>>cow[i].first>>cow[i].second; } for(int i=1;i<=33;i++){ if(cow[2].second+cow[1].second<=cow[2].first){ cow[2].second=cow[2].second+cow[1].second; cow[1].second=0; } else{ cow[1].second=cow[2].second+cow[1].second-cow[2].first; cow[2].second=cow[2].first; } if(cow[3].second+cow[2].second<= 4000 cow[3].first){ cow[3].second=cow[3].second+cow[2].second; cow[2].second=0; } else{ cow[2].second=cow[3].second+cow[2].second-cow[3].first; cow[3].second=cow[3].first; } if(cow[1].second+cow[3].second<=cow[1].first){ cow[1].second=cow[3].second+cow[1].second; cow[3].second=0; } else{ cow[3].second=cow[3].second+cow[1].second-cow[1].first; cow[1].second=cow[1].first; } } if(cow[2].second+cow[1].second<=cow[2].first){ cow[2].second=cow[2].second+cow[1].second; cow[1].second=0; } else{ cow[1].second=cow[2].second+cow[1].second-cow[2].first; cow[2].second=cow[2].first; } printf("%d\n%d\n%d\n",cow[1].second,cow[2].second,cow[3].second); return 0; }
相关文章推荐
- (2019 GDUT Rating Contest #I)G. Back and Forth
- 2018-2019 ACM-ICPC, Asia Jiaozuo Regional Contest F. Honeycomb
- URAL 2019 Pair: normal and paranormal (贪心) -GDUT联合第七场
- HDU 4870 Rating 2014 Multi-University Training Contest 1 J题 概率DP+高斯消元
- HDU 4870 Rating (2014 Multi-University Training Contest 1)
- 2018-2019 ACM-ICPC, Asia Jiaozuo Regional Contest[6/12]
- 2018-2019 ACM-ICPC, Asia Nanjing Regional Contest 一些题解
- 2018-2019 ICPC, NEERC, Southern Subregional Contest 7/13
- hdu 4870 Rating 2014 Multi-University Training Contest 1
- 2018-2019 Russia Open High School Programming Contest 9/13
- hdu4870 Rating 2014 Multi-University Training Contest 1
- 2018-2019 ACM-ICPC, Asia Shenyang Regional Contest 一些题解
- 【尺取+二分+三分总结】2019 GDUT Winter Training I
- 2019 GDUT Spring Training IV (Div.2) (dp,)
- hdu4870 Rating---2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 9小记
- 2012-2013 Northwestern European Regional Contest (NWERC 2012)【solved:6 / 11】
- nenu contest
- AtCoder Grand Contest 019 B: Reverse and Compare
- HDU 4031 Attack(离线+线段树)(The 36th ACM/ICPC Asia Regional Chengdu Site —— Online Contest)