| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1314717 | panhcutizz | Prosjek (COCI14_prosjek) | C++20 | 0 ms | 340 KiB |
#include <iostream>
#include <vector>
#include <random>
#include <algorithm>
#include <chrono>
#include <queue>
#define all(x) x.begin(), x.end()
#define pb push_back
#define fi first
#define se second
#define compact(v) v.erase(unique(all(v)) , v.end())
#define pi pair<int , int>
#define vi vector<int>
#define eb emplace_back
#define FOR(i , l , r) for(int i = l; i <= r; ++ i)
#define FORD(i , l , r) for(int i = l; i >= r; -- i)
template <class T> bool maximize(T &a , T b){return (a < b ? a = b , true : false);}
template <class T> bool minimize(T &a , T b){return (a > b ? a = b , true : false);}
using namespace std;
typedef long long ll;
#define int long long
const int nd = 2e5 + 5 , mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> dist(1 , (int)2e9);
int add(int a , int b){
a += b;
return (a >= mod ? a - mod : a);
}
int sub(int a , int b){
a -= b;
return (a < 0 ? a + mod : a);
}
int mul(ll a , ll b){return (a * b) % mod;}
int xpow(int a , int b){
if(b == 1) return a;
int x = xpow(a , b / 2);
if(b & 1) return mul(a , mul(x , x));
else return mul(x , x);
}
void solve(){
int n;
cin >> n;
int pref = 0;
FOR(i , 1 , n){
int v;
cin >> v;
cout << v * i - pref << " ";
pref = v * i;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
#define task "task"
if(fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
solve();
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
