Cod sursa(job #2474603)
| Utilizator | Data | 15 octombrie 2019 16:34:17 | |
|---|---|---|---|
| Problema | Reguli | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.75 kb |
#include<bits/stdc++.h>
#define maxn 500005
using namespace std;
ifstream fin("reguli.in");
ofstream fout("reguli.out");
int main()
{
int n,v[maxn],x,prim,m,i,con;
fin>>n;
for(int i=0;i<n;i++)
{
fin>>x;
if(i==0)
prim=x;
else
{
v[i]=x-prim;
prim=x;
}
}
con=1;
v[n]=v[1];
while(v[con+2]!=v[1])
con++;
m=con;
for(i=con+2;i<=n-1;i++)
{
if(v[i]!=v[i-con])
{
m++;
con++;
}
}
for(i=1;i<n-m;i++)
{
if(v[i]!=v[i+m])
m=n-1;
}
fout<<m<<"\n";
for(i=1;i<=m;i++)
{
fout<<v[i]<<"\n";
}
return 0;
}
