# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
267000 | 2020-08-15T16:00:57 Z | leductoan | Prosjek (COCI14_prosjek) | C++14 | 1 ms | 384 KB |
#include<bits/stdc++.h> using namespace std; #define task "NAME" #define lb lower_bound #define ub upper_bound #define alll(v) (v).begin(),(v).end() #define szz(v) (v).size() #define fi first #define se second #define pb push_back #define FOR(i,a,b) for (int i = (a), _b = (b); i <= _b; ++i) #define FORD(i,b,a) for (int i = (b), _a = (a); i >= _a; --i) typedef long double ld; typedef long long ll; typedef pair<int,int> pii; const int MOD=1000000007; /// 998244353 const int base=311; /// for hash actually const int N=1e2+5; int n,a[N]; void solved() { cin>>n; FOR(i,1,n) cin>>a[i]; int s=0; FOR(i,1,n) { int tam=a[i]*i; cout<<tam-s<<' '; s=tam; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); if(fopen(task".inp","r")) { freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } solved(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 0 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 384 KB | Output is correct |
9 | Correct | 1 ms | 384 KB | Output is correct |
10 | Correct | 1 ms | 384 KB | Output is correct |