CF - 764A. Taymyr is calling you - 模拟

最新推荐文章于 2020-01-04 10:12:28 发布

原创最新推荐文章于 2020-01-04 10:12:28 发布 · 718 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#acm #codeforces

模拟专栏收录该内容

53 篇文章

订阅专栏

本文介绍了一个关于计数的问题，某人每隔n分钟打电话，同时每隔m分钟有人进入房间，目标是在z分钟内确保打电话时房间内无人。通过直接模拟的方法解决此问题，并给出了解决方案。

1.题目描述：

Comrade Dujikov is busy choosing artists for Timofey's birthday and is recieving calls from Taymyr from Ilia-alpinist.

Ilia-alpinist calls every n minutes, i.e. in minutes n, 2n, 3n and so on. Artists come to the comrade every m minutes, i.e. in minutes m, 2m, 3m and so on. The day is z minutes long, i.e. the day consists of minutes 1, 2, ..., z. How many artists should be killed so that there are no artists in the room when Ilia calls? Consider that a call and a talk with an artist take exactly one minute.

Input

The only string contains three integers — n, m and z (1 ≤ n, m, z ≤ 104).

Output

Print single integer — the minimum number of artists that should be killed so that there are no artists in the room when Ilia calls.

Examples

input
1 1 10

output
10

input
1 2 5

output
2

input
2 3 9

output
1

Note

Taymyr is a place in the north of Russia.

In the first test the artists come each minute, as well as the calls, so we need to kill all of them.

In the second test we need to kill artists which come on the second and the fourth minutes.

In the third test — only the artist which comes on the sixth minute.

2.题意概述：

某人每间隔n分钟打一次房间内电话，而一些人每间隔m分钟就进入房间，要阻挠多少个人才能保证在一定时间段z内电话无人接听？

3.解题思路：

因为z<1000直接模拟就行

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 10010
#define lson root << 1
#define rson root << 1 | 1
#define lent (t[root].r - t[root].l + 1)
#define lenl (t[lson].r - t[lson].l + 1)
#define lenr (t[rson].r - t[rson].l + 1)
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
inline bool scan_d(int &num)
{
	char in; bool IsN = false;
	in = getchar();
	if (in == EOF) return false;
	while (in != '-' && (in<'0' || in>'9')) in = getchar();
	if (in == '-') { IsN = true; num = 0; }
	else num = in - '0';
	while (in = getchar(), in >= '0'&&in <= '9') {
		num *= 10, num += in - '0';
	}
	if (IsN) num = -num;
	return true;
}
bool vis[maxn];
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	int n, m, z;
	while (scan_d(n))
	{
		scan_d(m);
		scan_d(z);
		memset(vis, 0, sizeof(vis));
		int nn = n, mm = m;
		while (nn <= z)
		{
			vis[nn] = 1;
			nn += n;
		}
		int cnt = 0;
		while (mm <= z)
		{
			if (vis[mm])
				cnt++;
			mm += m;
		}
		printf("%d\n", cnt);
	}
#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}