Submission #10359

#TimeUsernameProblemLanguageResultExecution timeMemory
10359tncks0121Prosjek (COCI14_prosjek)C++14
50 / 50
0 ms1088 KiB
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> #include <string.h> #include <memory.h> #include <math.h> #include <assert.h> #include <stack> #include <queue> #include <map> #include <set> #include <algorithm> #include <string> #include <functional> #include <vector> #include <deque> #include <utility> #include <bitset> #include <limits.h> using namespace std; typedef long long ll; typedef unsigned long long llu; typedef double lf; typedef unsigned int uint; typedef long double llf; typedef pair<int, int> pii; const int N_ = 105; int N, B[N_]; int main() { // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); scanf("%d", &N); ll last = 0; for(int i = 1; i <= N; i++) { scanf("%d", B+i); ll sum = (ll)B[i] * i; printf("%lld ", sum - last); last = sum; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...