Submission #925968

#TimeUsernameProblemLanguageResultExecution timeMemory
925968KarootProsjek (COCI14_prosjek)C++17
50 / 50
1 ms500 KiB
#include <iostream> #include <cmath> #include <unordered_map> #include <map> #include <set> #include <queue> #include <vector> #include <string> #include <iomanip> #include <algorithm> #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() using namespace std; typedef long long ll; ll linf = 1e15+1; inline void scoobydoobydoo(){ ios::sync_with_stdio(false); ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int main(){ scoobydoobydoo(); int n; cin >> n; vector<ll> ans(n), vals(n); for (int i = 0; i < n; i++){ cin >> vals[i]; vals[i] *= (i+1); } ans[0] = vals[0]; ll sum = ans[0]; for (int i = 1; i < n; i++){ ans[i] = vals[i]-sum; sum += ans[i]; } for (int i = 0; i < n; i++)cout << ans[i] << " "; cout << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...