Codeforces Round #699 (Div. 2)

最新推荐文章于 2021-02-07 15:37:53 发布

精神小伙mqpm

最新推荐文章于 2021-02-07 15:37:53 发布

阅读量404

点赞数

分类专栏： cf题解

本文链接：https://blog.csdn.net/Adrian099/article/details/113449367

版权

本文介绍了Codeforces Round #699 (Div. 2)的比赛，包括三道题目：K-divisible Sum、Inflation和Longest Simple Cycle。K-divisible Sum要求构建一个和能被k整除且最大元素最小的数组；Inflation问题需调整价格变化以保持通胀系数不超过k%；Longest Simple Cycle涉及连接多个链以找到最长简单循环。每题分别给出了思路和代码实现。

摘要由CSDN通过智能技术生成

Codeforces Round #699 (Div. 2)

A. K-divisible Sum

You are given two integers n and k.
You should create an array of n positive integers a1,a2,…,an such that the sum (a1+a2+⋯+an) is divisible by k and maximum element in a is minimum possible.
What is the minimum possible maximum element in a?
Input
The first line contains a single integer t (1≤t≤1000) — the number of test cases.
The first and only line of each test case contains two integers n and k (1≤n≤109; 1≤k≤109).
Output
For each test case, print one integer — the minimum possible maximum element in array a such that the sum (a1+⋯+an) is divisible by k.

代码：


int T;
int main(){
   
    sd1(T);
    while(T--){
   
        LL n, k;
        sd2(n, k);
        LL ans = 0;
        if(k >= n){
   
            if(k % n == 0) ans = k / n;
            else  ans = k / n + 1;
        }
        else{
   
            if(n % k == 0){
   
                ans = 1;
            }
            else{
   
                ans = 2;
            }
        }
        cout << ans << endl;
    }
    system("pause");
    return 0;
}

B. Inflation

You have a statistic of price changes for one product represented as an array of n positive integers p0,p1,…,pn−1, where p0 is the initial price of the product and pi is how the price was increased during the i-th month.
Using these price changes you are asked to calculate