【Codeforces Round #395 (Div. 2)】Codeforces 764A Taymyr is calling you

最新推荐文章于 2022-02-25 15:42:43 发布

原创最新推荐文章于 2022-02-25 15:42:43 发布 · 375 阅读

0 ·

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

标签

#欧几里得算法

数学同时被 2 个专栏收录

229 篇文章

订阅专栏

codeforces

87 篇文章

订阅专栏

本文介绍了一个特殊的场景算法问题：为了确保房间内艺术家数量在特定时刻为零而需要被“移除”的艺术家最小数量。该问题通过求解特定时间间隔内艺术家到达与电话到达的时间交集来解决，使用了最小公倍数的数学概念。

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.

容易发现需要杀掉的就是 $x*lcm(n,m)$ 。

#include<cstdio>
int gcd(int a,int b)
{
    return b?gcd(b,a%b):a;
}
int lcm(int a,int b)
{
    return a/gcd(a,b)*b;
}
int main()
{
    int m,n,k;
    scanf("%d%d%d",&n,&m,&k);
    printf("%d\n",k/lcm(n,m));
}