Educational Codeforces Round 103 (Rated for Div. 2) 1476B - Inflation Solution


  

Problem Link: https://codeforces.com/contest/1476/problem/B

Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t;
    cin>>t;
    while(t--)
    {
        ll n,k,x,s=0;
        cin >> n >> k;
        vector <ll > v, presum;
        forint i = 0; i < n; i++)
        {
            cin>>x;
            v.push_back(x);
            s+=x;
            presum.push_back(s);
        }
        ll mx=0;
        for(int i = 1; i<n ; i++)
        {
            x = (((v[i]*100)-(k*presum[i-1]))+k-1)/k;    ///ceil(n/k)=(n+k-1)/k
            mx = max(mx,x);
        }
        cout << mx << endl;
    }
}








No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.