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.

Example
inputCopy
4
1 5
4 3
8 8
8 17
outputCopy
5
2
1
3
Note
In the first test case n=1, so the array consists of one element a1 and if we make a1=5 it will be divisible by k=5 and the minimum possible.

In the second test case, we can create array a=[1,2,1,2]. The sum is divisible by k=3 and the maximum is equal to 2.

In the third test case, we can create array a=[1,1,1,1,1,1,1,1]. The sum is divisible by k=8 and the maximum is equal to

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <set>
#include <string>
#include <queue>
#include <map>
#include <stack>
#include <map>
#include <unordered_map>
#include <vector>
#include <cmath>
//#include <ext/rope>
#include <bits/stdc++.h> 

using namespace std;

#define gt(x) x = read()
#define int  long long
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
//#define x first
//#define y second

int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0}; 

//typedef __int128 INT;
typedef pair<double, int> PDI;
typedef pair<int, int> PII;
typedef unsigned long long ULL;

inline int read(int out = 0)
{
    char c;
    while((c=getchar()) < 48 || c > 57);
    while(c >= 48 && c <= 57) out=out*10+c-48,c=getchar();
    return out; 
}

const int N = 1010;
const int M = 4 * N;
const int mod = 1e4 + 7;
const int PP = 13331;
const int inf = 0x3f3f3f3f;
const int INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-10;
const double PI = acos(-1);

int yy[N];

void init1(){
	for (int i = 1; i <= 124; i ++)   yy[i] = 103;
}

void init2(){
	for (int i = 1; i <= 23; i ++)   yy[i] = i + 1;
}

signed main(){
	int T;
	scanf("%lld", &T);
	while(T --){
		int n, k;
		scanf("%lld%lld", &n, &k);
	//	int temp = k;
	//	int idx = 2;
		if (n > k){
			int cnt = n / k;
			//cout << cnt << "---" << endl;
			if (n % k != 0)   cnt ++;                              
			k = k * cnt;
		} 
		
		int ans = (k + n - 1) / n;
		printf("%lld\n", ans);
	}
	
	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 the inflation coefficients for each month as the ratio of current price increase pi to the price at the start of this month (p0+p1+⋯+pi−1).

Your boss said you clearly that the inflation coefficients must not exceed k %, so you decided to increase some values pi in such a way, that all pi remain integers and the inflation coefficients for each month don’t exceed k %.

You know, that the bigger changes — the more obvious cheating. That’s why you need to minimize the total sum of changes.

What’s the minimum total sum of changes you need to make all inflation coefficients not more than k %?

Input
The first line contains a single integer t (1≤t≤1000) — the number of test cases.

The first line of each test case contains two integers n and k (2≤n≤100; 1≤k≤100) — the length of array p and coefficient k.

The second line of each test case contains n integers p0,p1,…,pn−1 (1≤pi≤109) — the array p.

Output
For each test case, print the minimum total sum of changes you need to make all inflation coefficients not more than k %.

Example
inputCopy
2
4 1
20100 1 202 202
3 100
1 1 1
outputCopy
99
0
Note
In the first test case, you can, for example, increase p0 by 50 and p1 by 49 and get array [20150,50,202,202]. Then you get the next inflation coefficients:

5020150≤1100;
20220150+50≤1100;
20220200+202≤1100;
In the second test case, you don’t need to modify array p, since the inflation coefficients are already good:

11≤100100;
11+1≤100100;

从后往前枚举，要注意的是要除k，因为是k倍，既然是加，那么加到第一个数对后面的都有效，是最好的，那么直接加到第一个数即可

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <set>
#include <string>
#include <queue>
#include <map>
#include <stack>
#include <map>
#include <unordered_map>
#include <vector>
#include <cmath>


using namespace std;

#define gt(x) x = read()
#define int  long long
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
//#define x first
//#define y second

int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0}; 

typedef pair<double, int> PDI;
typedef pair<int, int> PII;
typedef unsigned long long ULL;

inline int read(int out = 0)
{
    char c;
    while((c=getchar()) < 48 || c > 57);
    while(c >= 48 && c <= 57) out=out*10+c-48,c=getchar();
    return out; 
}

const int N = 1010;
const int M = 4 * N;
const int mod = 1e4 + 7;
const int PP = 13331;
const int inf = 0x3f3f3f3f;
const int INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-10;
const double PI = acos(-1);

int yy[N];

void init1(){
	for (int i = 1; i <= 124; i ++)   yy[i] = 103;
}

void init2(){
	for (int i = 1; i <= 23; i ++)   yy[i] = i + 1;
}

int a[N], s[N];

signed main(){
	int T;
	scanf("%lld", &T);
	
	while(T --){
	
		int n, k;
		scanf("%lld%lld", &n, &k);
		
		int sum = 0;
		for (int i = 1; i <= n; i ++)   scanf("%lld", &a[i]);
		for (int i = 1; i < n; i ++)   sum += a[i];
		
		int ans = 0;
		for (int i = n; i >= 2; i --){
			int temp = (sum * k - a[i] * 100);
			temp = -temp;
			if (temp > 0){
				temp = (temp + k - 1) / k;
				ans += temp;
			    sum += temp;
			} 
			sum -= a[i - 1];	
		}
		
		printf("%lld\n", ans);
	
	}
	
	return 0;
}

C. Longest Simple Cycle
You have n chains, the i-th chain consists of ci vertices. Vertices in each chain are numbered independently from 1 to ci along the chain. In other words, the i-th chain is the undirected graph with ci vertices and (ci−1) edges connecting the j-th and the (j+1)-th vertices for each 1≤j<ci.

Now you decided to unite chains in one graph in the following way:

the first chain is skipped;
the 1-st vertex of the i-th chain is connected by an edge with the ai-th vertex of the (i−1)-th chain;
the last (ci-th) vertex of the i-th chain is connected by an edge with the bi-th vertex of the (i−1)-th chain.
Picture of the first test case. Dotted lines are the edges added during uniting process
Calculate the length of the longest simple cycle in the resulting graph.

A simple cycle is a chain where the first and last vertices are connected as well. If you travel along the simple cycle, each vertex of this cycle will be visited exactly once.

Input
The first line contains a single integer t (1≤t≤1000) — the number of test cases.

The first line of each test case contains the single integer n (2≤n≤105) — the number of chains you have.

The second line of each test case contains n integers c1,c2,…,cn (2≤ci≤109) — the number of vertices in the corresponding chains.

The third line of each test case contains n integers a1,a2,…,an (a1=−1; 1≤ai≤ci−1).

The fourth line of each test case contains n integers b1,b2,…,bn (b1=−1; 1≤bi≤ci−1).

Both a1 and b1 are equal to −1, they aren’t used in graph building and given just for index consistency. It’s guaranteed that the sum of n over all test cases doesn’t exceed 105.

Output
For each test case, print the length of the longest simple cycle.

Example
inputCopy
3
4
3 4 3 3
-1 1 2 2
-1 2 2 3
2
5 6
-1 5
-1 1
3
3 5 2
-1 1 1
-1 3 5
outputCopy
7
11
8
Note
In the first test case, the longest simple cycle is shown below:

We can’t increase it with the first chain, since in such case it won’t be simple — the vertex 2 on the second chain will break simplicity.

每个简单圆都有一个右边界，我们可以从 2 ~ n 枚举右边界 (1显然不能为右边界)
设 f[i] 为以第 i 条边为右边界的最大圆长度
当a[i] = b[i] 时 f[i] = c[i] - 1 + 2 (c[i] 是点数，c[i] - 1 才是边数)
否则 就有两种情况：

直接以第 i - 1 条线为左边界, 长度为： c[i] - 1 + 2 + abs(a[i] - b[i])
接在以第 i - 1 条线为右边界的圆后面，将 a[i] ~ b[i] 那一节线删去
则长度为： c[i] - 1 + 2 + f[i - 1] - abs(a[i] - b[i])
两种情况取最大就是 f[i] 的值
这边要注意初始化，f[1]为0，因为没有构成环

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <set>
#include <string>
#include <queue>
#include <map>
#include <stack>
#include <map>
#include <unordered_map>
#include <vector>
#include <cmath>
//#include <ext/rope>
#include <bits/stdc++.h> 

using namespace std;

#define gt(x) x = read()
#define int  long long
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
//#define x first
//#define y second

int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0}; 

typedef pair<double, int> PDI;
typedef pair<int, int> PII;
typedef unsigned long long ULL;

inline int read(int out = 0)
{
    char c;
    while((c=getchar()) < 48 || c > 57);
    while(c >= 48 && c <= 57) out=out*10+c-48,c=getchar();
    return out; 
}

const int N = 1e5 + 10;
const int M = 4 * N;
const int mod = 1e4 + 7;
const int PP = 13331;
const int inf = 0x3f3f3f3f;
const int INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-10;
const double PI = acos(-1);

int a[N], b[N], c[N], f[N];

signed main(){
	  int T;
	scanf("%lld", &T);
	while(T --)
	{
		int n;
		scanf("%lld", &n);
		for (int i = 1; i <= n; i ++)   scanf("%lld", &c[i]);
		for (int i = 1; i <= n; i ++)   scanf("%lld", &a[i]);
		for (int i = 1; i <= n; i ++)   scanf("%lld", &b[i]);
		
		int ans = 0;
		f[1] = 0;
		for (int i = 2; i <= n; i ++){
			if (b[i] == a[i])     f[i] = 1 + c[i];
			else{
				f[i] = max(c[i] + abs(b[i] - a[i]) - 1 + 2, f[i - 1] + c[i] - abs(a[i] - b[i]) - 1 + 2);
			}
			ans = max(ans, f[i]);
		}
		
		printf("%lld\n", ans);
	}
	
	return 0;
}