oj.uz

답안 #546678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
546678 2022-04-08T05:55:28 Z epicci23 평균 (COCI14_prosjek) C++17
50 / 50
 1 ms 320 KB 
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n"
#define mod 1000000007
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

const int N=100003;
const int LOG=17;
typedef pair<int,int> pii;
typedef long long ll;
//sunlari dusun//
/*
 * kodu kisaltcak  fonksiyon
 * cevaba binary search ya da normal bs
 * segment tree / sparse table
 * stack
 * teklik ciftlik
 * precomputation
 * EN ONEMLISI OVERKILLEME
 * edge case dusun
 * constraintlere bak
 * indisleri kontrol et
 * dp
 * greedy
 * sorting
 * dfs bfs
 * sieve
*/


void solve(){
	int n;
    cin >> n;
    int sum=0;
    for(int i=1;i<=n;i++)
    {
      int a;
      cin >> a;
      int b=a*i;
      cout << b-sum  << " ";
      sum+=b-sum;
    }
}

int32_t main(){


      cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
 int t=1;//cin>> t;

   for(int i=1;i<=t;i++)
  {
	  //cout << "Case #" << i << ":" << endl;
	  solve();
  }
 return 0;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct