Submission #1188390

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188390		Haciyev12	Prosjek (COCI14_prosjek)	C++20	50 / 50	0 ms	328 KiB

prosjek

#include "bits/stdc++.h"
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define pb push_back
#define in insert
#define F first
#define S second
#define vll vector<ll>
#define all(v) v.begin(), v.end()
#define rep(a, b, c) for (int(a) = (b); (a) < (c); (a)++) // i, 0, n
#define endl '\n'
#define pii pair<ll,ll>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
using namespace std;
const ll INF = 1e18, mod = 1e9 + 7, N = 1e5 + 5;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return (a / gcd(a, b)) * b;
}

ll modpow(ll a, ll b) {
    ll ans = 1;
    while(b > 0) {
        if(b % 2 == 1) {
            ans *= a;
            ans %= mod;
        }
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ans % mod;
}

ll inv(ll a) {
    return modpow(a, mod-2) % mod;
}
void solve(){
    ll n;
    cin >> n;

    ll a[n + 1];

    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    vll v;
    ll nums = 0;
    for(int i = 1; i <= n; i++){
        if(i == 1){
            nums += a[i];
            v.pb(a[i]);
            continue;
        }
        //  x + y /2 = a[i]

        ll sum = a[i] * i;
        v.pb(sum - nums);
        nums  += sum - nums;

    }
    for(auto i : v) cout << i << " ";

   
}
int main() {
    fast;
    ll t = 1;
   //  cin >> t;
    while(t--){
        solve();
    }
}

• Subtask 1: 50 / 50