Submission #307110

#TimeUsernameProblemLanguageResultExecution timeMemory
307110HemimorProsjek (COCI14_prosjek)C++14
50 / 50
1 ms384 KiB
#include <algorithm> #include <iostream> #include <iomanip> #include <numeric> #include <cassert> #include <vector> #include <random> #include <cmath> #include <queue> #include <set> #include <map> #define syosu(x) fixed<<setprecision(x) using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int,int> P; typedef pair<double,double> pdd; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<double> vd; typedef vector<vd> vvd; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<string> vs; typedef vector<P> vp; typedef vector<vp> vvp; typedef vector<pll> vpll; typedef pair<int,P> pip; typedef vector<pip> vip; const int inf=1<<30; const ll INF=1ll<<60; const double pi=acos(-1); const double eps=1e-8; const ll mod=998244353; const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1}; vi vin(int n,int d=0){ vi a(n); for(auto &i:a){ cin>>i; i-=d; } return a; } vl vln(int n,int d=0){ vl a(n); for(auto &i:a){ cin>>i; i-=d; } return a; } vvi gin(int n,int m,int d=1){ vvi g(n); for(int i=0;i<m;i++){ int u,v; cin>>u>>v; u-=d,v-=d; g[u].push_back(v); g[v].push_back(u); } return g; } int n; vl a; int main(){ cin>>n; a=vln(n); ll t=0; for(int i=0;i<n;i++){ ll x=a[i]*(i+1)-t; t+=x; cout<<x<<" \n"[i==n-1]; } }
#Verdict Execution timeMemoryGrader output
Fetching results...