Pagini recente » Cod sursa (job #2242385) | Cod sursa (job #2100778) | Cod sursa (job #2493730) | Cod sursa (job #424708) | Cod sursa (job #1815176)
#include <bits/stdc++.h>
#define MMAX 500005
using namespace std;
ifstream fin ("reguli.in");
ofstream fout ("reguli.out");
int V[MMAX],P[MMAX],S[MMAX];
void prefix(int m){
int q = 0;
for(int i = 2; i <= m; i++){
while(q && V[i] != V[q + 1])
q = P[q];
if(V[i] == V[q + 1])
q++;
P[i] = q;
}
}
int solve(int p,int m){
int q = 0,s = 0;
for(int i = 1; i <= m; i++){
while(q && V[i] != V[q + 1])
q = P[q];
if(V[i] == V[q + 1])
q++;
if(q == p){
q = P[q];
s++;
}
}
if(s == m / p){
for(int i = m - m % p + 1,q = 1; i <= m; i++,q++)
if(V[q] != V[i])
return 0;
return 1;
}
return 0;
}
int main()
{
ios :: sync_with_stdio(false);
fin.tie(NULL);
int m;
fin >> m;
for(int i = 1; i <= m ; i++){
fin >> V[i];
}
m--;
for(int i = 1; i <= m; i++)
V[i] = V[i + 1] - V[i];
for(int i = 1; i <= m; i++){
prefix(i);
if(solve(i,m)){
fout << i << "\n";
for(int j = 1; j <= i; j++)
fout << V[j] << "\n";
i = m + 1;
}
}
return 0;
}