B. Inflation

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

input

2
4 1
20100 1 202 202
3 100
1 1 1

output

99
0

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <algorithm>
using namespace std;

long long p[105];
long long sum[105];

int main() {
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        int n;
        int k;
        cin >> n >> k;
        long long add=0;
        for (int j = 0; j < n; j++) {
            cin >> p[j];
            if (j == 0) {
                sum[j] = p[j];
            }
            else {
                sum[j]=sum[j - 1] + p[j];
            }
            if (j != 0) {
                if (100 * p[j] - k * sum[j - 1] <= 0) {
                    ;
                }
                else {
                    long long x;
                    long long cha = 100 * p[j] % k;
                    if (cha != 0) {
                        x = 100 * p[j] / k-  sum[j - 1] +1;
                        add = add + x;
                        sum[j]=sum[j] + x;
                        
                    }
                    else {
                        x = 100 * p[j] / k - sum[j - 1];
                        add = add + x;
                        sum[j]=sum[j] + x;
                        
                    }

                }
                
            }
        }
        cout << add << endl;
    }
}

思路：遍历数组，满足则继续，否则需加上一个数，根据条件计算出来这个数，维护前缀和后继续，记录下每次加的数的和即为答案。