Pagini recente » Cod sursa (job #1258899) | Cod sursa (job #3164844) | pentru_incepatori | Cod sursa (job #3263956) | Cod sursa (job #19009)
Cod sursa(job #19009)
#include <fstream.h>
#include <iostream.h>
int n,k;
long long a,b,c[11];
ifstream salut("reguli.in");
ofstream pa("reguli.out");
int main()
{
salut>>n>>a;
long i=0;
while (n-1) { salut>>b; c[i]=b-a;i++;
a=b;
n--;
}
for (i = 1; i<10; i++) if (c[0]==c[i]) break;
k=i;
pa<<k<<endl;
for ( i=0; i<k; i++) pa<<c[i]<<endl;
pa << '\n';
return 0;
}