Pagini recente » Cod sursa (job #1284057) | Cod sursa (job #2068845) | Cod sursa (job #92002) | Cod sursa (job #240117) | Cod sursa (job #2471385)
#include <fstream>
#define FAST std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
long long v[500005];
int main()
{
FAST
ifstream cin("reguli.in");
ofstream cout("reguli.out");
long long n,aux,x,ans;
c>>n>>aux;
for(long long i=1;i<=n-1;i++)
{
cin>>x;
v[i]=x-aux;
aux=x;
}
long long cnt=1;
v[n]=v[1];
while(v[cnt+2]!=v[1])
{
cnt++;
}
ans=cnt;
for(long long i=cnt+2;i<=n-1;i++)
{
if(v[i]!=v[i-cnt])
{
ans++;
cnt++;
}
}
for(long long i=1;i<n-ans;i++)
if(v[i]!=v[i+ans])
ans=n-1;
cout<<ans<<'\n';
for(long long i=1;i<=ans;i++)
{
cout<<v[i]<<'\n';
}
return 0;
}