Submission #461327

#TimeUsernameProblemLanguageResultExecution timeMemory
461327JasperLProsjek (COCI14_prosjek)C++14
50 / 50
1 ms300 KiB
#include <iostream> #include <vector> using namespace std; typedef long long ll; #define maxn 105 int n; ll a[maxn], b[maxn]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> b[i]; } a[0] = b[0]; for (ll i = 1; i < n; i++) { a[i] = b[i] * (i+1) - b[i-1] * i; } for (int i = 0; i < n; i++) { cout << a[i] << " "; } cout << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...