Pagini recente » Cod sursa (job #2887386) | Cod sursa (job #173977) | Cod sursa (job #1854358) | Cod sursa (job #162237) | Cod sursa (job #1815359)
#include <bits/stdc++.h>
#define MMAX 500005
#define BMAX 5000
using namespace std;
typedef long long int var;
ifstream fin ("reguli.in");
ofstream fout ("reguli.out");
var V[MMAX],P[MMAX],S[MMAX],e = BMAX - 1;
char buffer[BMAX + 1];
void parsare(var &x){
while(!isdigit(buffer[e])){
if(++e == BMAX){
fin.get(buffer,BMAX);
e = 0;
}
}
x = 0;
while(isdigit(buffer[e])){
x = x * 10 + buffer[e] - '0';
if(++e == BMAX){
fin.get(buffer,BMAX);
e = 0;
}
}
}
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 != i / p)
return 0;
}
}
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++){
parsare(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;
}