oj.uz

Submission #914923

# Submission time Handle Problem Language Result Execution time Memory
914923 2024-01-23T00:19:54 Z jpfr12 Prosjek (COCI14_prosjek) C++14
50 / 50
 0 ms 452 KB 
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <math.h>
#include <cmath>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <fstream>
#include <bitset>
#include <iomanip>
 
typedef long long ll;
using namespace std;
int MOD = (int)1e9;
int MAXN = 1e6;
 
//classes

 
 
//global


int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  //ifstream fin("input.txt");
  //ofstream fout("output.txt");
  //stop
  int n;
  cin >> n;
  vector<ll> vec(n);
  for(ll& i: vec){
    cin >> i;
  }
  ll sum = 0;
  vector<ll> A(n);
  for(int i = 0; i < n; i++){
    if(i == 0){
      A[0] = vec[i];
      sum += A[0];
      cout << A[i] << " ";
    }
    else{
      A[i] = vec[i] * (i+1) - sum;
      sum += A[i];
      cout << A[i] << " ";
    }
  
  }
  cout << '\n';
  return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 452 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct