Educational Codeforces Round 12
665A - Buses Between Cities 20171129 奇奇怪怪的小数学题...推推式子就好了,边界情况比较蛋疼 #include<stdlib.h> #include<stdio.h> #include<math.h> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int a,ta,b,tb,h,m,t; int main() { scanf("%d%d%d%d",&a,&ta,&b,&tb);a*=2,ta*=2,b*=2,tb*=2; scanf("%d:%d",&h,&m),t=60*h+m-300;t*=2; printf("%d\n",min(t+ta-1,2278)/b-(t-tb+1<=-1?-b:t-tb+1)/b); return 0; } View Code 665B - Shopping 20171129 按题意模拟即可 #include<stdlib.h> #include<stdio.h> #include<math.h> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int n,m,x,k,a,p[101],ans;