您的位置:首页 > 其它

Codeforces 665A - Buses Between Cities

2016-04-30 22:11 169 查看
题目的意思就是给出一个区间, 然后让你找出与这个区间相交的情况有多少种,区间是个开区间。

#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstdio>

using namespace std;

inline void file()
{
freopen("D:\\go.txt", "r", stdin);
freopen("D:\\leave.txt", "w", stdout);
}

int main()
{
//file();
int a, ta;
int b, tb;
int h, m;
scanf("%d%d", &a, &ta);
scanf("%d%d", &b, &tb);
scanf("%d:%d", &h, &m);
int leave_time_b = 300;
int leave_time_a = h * 60 + m;
int arrive_time_a = leave_time_a + ta;
int res = 0;
for (int i = leave_time_b; i < 1440;i += b)
{
if ((i != arrive_time_a && i + tb != leave_time_a) && (i < arrive_time_a && i + tb > leave_time_a))
{
//cout << "i = " << i << endl;
res++;
}
}
printf("%d\n", res);

return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: