# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77145 | kimmypracha | Prosjek (COCI14_prosjek) | C++17 | 2 ms | 580 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long A[200] , B[200];
int main(){
int n;
scanf("%d",&n);
for(int i = 1 ; i <= n ; ++i){
scanf("%lld",&B[i]);
}
long long Sum = 0;
for(int i = 1 ; i<= n; ++i){
A[i] = B[i]*i - Sum;
Sum = B[i]*i;
printf("%lld ",A[i]);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |