更好的阅读体验

Portal

Portal1: Codeforces

Portal2: Luogu

Description

Recently a Golden Circle of Beetlovers was found in Byteland. It is a circle route going through \(n \cdot k\) cities. The cities are numerated from \(1\) to \(n \cdot k\), the distance between the neighboring cities is exactly \(1\) km.

Sergey does not like beetles, he loves burgers. Fortunately for him, there are \(n\) fast food restaurants on the circle, they are located in the \(1\)-st, the \((k + 1)\)-st, the \((2k + 1)\)-st, and so on, the \(((n-1)k + 1)\)-st cities, i.e. the distance between the neighboring cities with fast food restaurants is \(k\) km.

Sergey began his journey at some city \(s\) and traveled along the circle, making stops at cities each \(l\) km (\(l > 0\)), until he stopped in \(s\) once again. Sergey then forgot numbers \(s\) and \(l\), but he remembers that the distance from the city \(s\) to the nearest fast food restaurant was \(a\) km, and the distance from the city he stopped at after traveling the first \(l\) km from \(s\) to the nearest fast food restaurant was \(b\) km. Sergey always traveled in the same direction along the circle, but when he calculated distances to the restaurants, he considered both directions.

Now Sergey is interested in two integers. The first integer \(x\) is the minimum number of stops (excluding the first) Sergey could have done before returning to \(s\). The second integer \(y\) is the maximum number of stops (excluding the first) Sergey could have done before returning to \(s\).

Input

The first line contains two integers \(n\) and \(k\) (\(1 \le n, k \le 100\,000\)) — the number of fast food restaurants on the circle and the distance between the neighboring restaurants, respectively.

The second line contains two integers \(a\) and \(b\) (\(0 \le a, b \le \frac{k}{2}\)) — the distances to the nearest fast food restaurants from the initial city and from the city Sergey made the first stop at, respectively.

Output

Print the two integers \(x\) and \(y\).

Sample Input1

2 3
1 1

Sample Output1

1 6

Sample Input2

3 2
0 0

Sample Output2

1 3

Sample Input3

1 10
5 3

Sample Output3

5 5

Hint

In the first example the restaurants are located in the cities \(1\) and \(4\), the initial city \(s\) could be \(2\), \(3\), \(5\), or \(6\). The next city Sergey stopped at could also be at cities \(2, 3, 5, 6\). Let's loop through all possible combinations of these cities. If both \(s\) and the city of the first stop are at the city \(2\) (for example, \(l = 6\)), then Sergey is at \(s\) after the first stop already, so \(x = 1\). In other pairs Sergey needs \(1, 2, 3\), or \(6\) stops to return to \(s\), so \(y = 6\).

In the second example Sergey was at cities with fast food restaurant both initially and after the first stop, so \(l\) is \(2\), \(4\), or \(6\). Thus \(x = 1\), \(y = 3\).

In the third example there is only one restaurant, so the possible locations of \(s\) and the first stop are: \((6, 8)\) and \((6, 4)\). For the first option \(l = 2\), for the second \(l = 8\). In both cases Sergey needs \(x=y=5\) stops to go to \(s\).

Solution

我们根据题目的\(a, b, k\)计算出\(l\)的\(4\)种可能:

  1. \(a + b\)

  2. \(k - a + b\)

  3. \(k + a - b\)

  4. \(k - a - b\)

每走一步的答案就是\(\frac{n \times k}{\gcd(n \times k, step)}\)。

然后枚举找个最大的与最小的就可以了。

Code

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath> using namespace std; typedef long long LL;
const LL INF = 1e18;
LL n, k, a, b, step;
int main() {
scanf("%lld%lld%lld%lld", &n, &k, &a, &b);
LL Max = -INF, Min = INF;
step = fabs(a + b);//第1种情况
while (step <= n * k) {//枚举步数
if (step) {
Max = max(Max, n * k / __gcd(n * k, step));
Min = min(Min, n * k / __gcd(n * k, step));
}
step += k;
}
step = fabs(k - a + b);//第2种情况
while (step <= n * k) {//枚举步数
if (step) {
Max = max(Max, n * k / __gcd(n * k, step));
Min = min(Min, n * k / __gcd(n * k, step));
}
step += k;
}
step = fabs(k - b + a);//第3种情况
while (step <= n * k) {//枚举步数
if (step) {
Max = max(Max, n * k / __gcd(n * k, step));
Min = min(Min, n * k / __gcd(n * k, step));
}
step += k;
}
step = fabs(k - a - b);//第4种情况
while (step <= n * k) {//枚举步数
if (step) {
Max = max(Max, n * k / __gcd(n * k, step));
Min = min(Min, n * k / __gcd(n * k, step));
}
step += k;
}
printf("%lld %lld\n", Min, Max);
return 0;
}

『题解』Codeforces1142A The Beatles的更多相关文章

  1. 『题解』洛谷P1063 能量项链

    原文地址 Problem Portal Portal1:Luogu Portal2:LibreOJ Portal3:Vijos Description 在\(Mars\)星球上,每个\(Mars\)人 ...

  2. 『题解』Codeforces1142B Lynyrd Skynyrd

    更好的阅读体验 Portal Portal1: Codeforces Portal2: Luogu Description Recently Lynyrd and Skynyrd went to a ...

  3. 『题解』洛谷P1993 小K的农场

    更好的阅读体验 Portal Portal1: Luogu Description 小\(K\)在\(\mathrm MC\)里面建立很多很多的农场,总共\(n\)个,以至于他自己都忘记了每个农场中种 ...

  4. 『题解』洛谷P2296 寻找道路

    更好的阅读体验 Portal Portal1: Luogu Portal2: LibreOJ Description 在有向图\(\mathrm G\)中,每条边的长度均为\(1\),现给定起点和终点 ...

  5. 『题解』洛谷P1351 联合权值

    更好的阅读体验 Portal Portal1: Luogu Portal2: LibreOJ Description 无向连通图\(\mathrm G\)有\(n\)个点,\(n - 1\)条边.点从 ...

  6. 『题解』Codeforces656E Out of Controls

    更好的阅读体验 Portal Portal1: Codeforces Portal2: Luogu Description You are given a complete undirected gr ...

  7. 『题解』洛谷P2170 选学霸

    更好的阅读体验 Portal Portal1: Luogu Description 老师想从\(N\)名学生中选\(M\)人当学霸,但有\(K\)对人实力相当,如果实力相当的人中,一部分被选上,另一部 ...

  8. 『题解』洛谷P1083 借教室

    更好的阅读体验 Portal Portal1: Luogu Portal2: LibreOJ Portal3: Vijos Description 在大学期间,经常需要租借教室.大到院系举办活动,小到 ...

  9. 『题解』Codeforces9D How many trees?

    更好的阅读体验 Portal Portal1: Codeforces Portal2: Luogu Description In one very old text file there was wr ...

随机推荐

  1. 从零开始入门 K8s | Kubernetes 网络概念及策略控制

    作者 | 阿里巴巴高级技术专家  叶磊 一.Kubernetes 基本网络模型 本文来介绍一下 Kubernetes 对网络模型的一些想法.大家知道 Kubernetes 对于网络具体实现方案,没有什 ...

  2. 使用dynamic来简化反射实现,调用指定方法或构造函数

    dynamic是Framework4.0的新特性,dynamic的出现让C#具有了弱语言类型的特性,编译器在编译的时候,不再对类型进行检查,不会报错,但是运行时如果执行的是不存在的属性或者方法,运行程 ...

  3. Python函数参数与参数解构

    1 Python中的函数 函数,从数学的角度来讲是,输入一个参数,经过一个表达式的处理后得到一个结果的输出,即就是x-->y的一个映射.同样,在Python或者任何编程语言中,函数其实就是实现一 ...

  4. PHP 利用闭包偷窥马对人类的想法

    <?php /** * reference:http://www.php.net/manual/en/reflectionmethod.getclosure.php * Learn this a ...

  5. springboot pagehelper分页无效

    springboot pagehelper分页无效 遇到的问题把所有的数据都查出来了 -然后跟踪代码发现PageHelper.startPage没有生效,生成的sql也没有分页的信息 依赖也引入了 & ...

  6. LeetCode 1: single-number

    Given an array of integers, every element appears twice except for one. Find that single one. soluti ...

  7. (day31) Event+协程+进程/线程池

    目录 昨日回顾 GIL全局解释器锁 计算密集型和IO密集型 死锁现象 递归锁 信号量 线程队列 FOFI队列 LIFO队列 优先级队列 今日内容 Event事件 线程池与进程池 异步提交和回调函数 协 ...

  8. 数据库优化 - SQL优化

    前面一篇文章从实例的角度进行数据库优化,通过配置一些参数让数据库性能达到最优.但是一些"不好"的SQL也会导致数据库查询变慢,影响业务流程.本文从SQL角度进行数据库优化,提升SQ ...

  9. MyBatis(3)-- Mapper映射器

    一.select元素 1.select元素的应用 id为Mapper的全限定名,联合称为一个唯一的标识 paremeterType标识这条SQL接收的参数类型 resultType标识这条SQL返回的 ...

  10. 数据结构(四十二)散列表查找(Hash Table)

    一.散列表查找的基础知识 1.散列表查找的定义 散列技术是在记录的存储位置和它的关键字之间建立一个确定的对应关系f,使得每个关键字key对应一个存储位置f(key).查找时,根据这个确定的对应关系找到 ...