Pagini recente » Cod sursa (job #1721890) | Cod sursa (job #1014485) | Cod sursa (job #1292461) | Cod sursa (job #368370) | Cod sursa (job #1563576)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
vector<long long> r;
int main()
{
ifstream f("reguli.in");
ofstream g("reguli.out");
int n;
long long x1, x2; f >> n >> x1 >> x2;
r.push_back(x2 - x1); x1 = x2;
for(int i = 2; i < n; i ++) {
f >> x2;
if(r[(i - 1) % r.size()] != (x2 - x1)) {
int in = r.size();
while(r.size() < i) {
for(int j = 0; j < in && r.size() < i; j ++)
r.push_back(r[j]);
}
r[r.size() - 1] = x2 - x1;
}
x1 = x2;
}
g << r.size() << "\n";
for(int i = 0; i < r.size(); i ++) g << r[i] << "\n";
return 0;
}