Pagini recente » tema_1_lot | Cod sursa (job #309777) | Cod sursa (job #2462082) | Cod sursa (job #2173135) | Cod sursa (job #250544)
Cod sursa(job #250544)
#include<algorithm>
#include<vector>
using namespace std;
int n,a[500001],b[500001],aux[500001];
void solve(){
int i;
scanf("%d",&n);
for(i=1; i<=n; ++i)
scanf("%d",&a[i]);
for(i=1; i<n; b[i]=(a[i+1]-a[i]),++i);
for(i=2; i<n-1&&b[i]!=b[1]; ++i);
for(i=1; i<n; ++i)
printf("%d ",b[i]);}
int main(){
freopen("reguli.in","r",stdin);
freopen("reguli.out","w",stdout);
solve();
return 0;}