Mai intai trebuie sa te autentifici.
Cod sursa(job #1709331)
| Utilizator | Data | 28 mai 2016 11:50:44 | |
|---|---|---|---|
| Problema | Consecutive | Scor | 0 |
| Compilator | c | Status | done |
| Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.88 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int T, N;
FILE *fin = fopen("consecutive.in", "r");
FILE *fout = fopen("consecutive.out", "w");
fscanf(fin, "%d", &T);
int aS[100000];
int aD[100000];
int i, x, SUS, JOS;
int k, c;
for(i = 1; i <= T; i++)
{
c = 0;
fscanf(fin, "%d", &N);
for(x = 2; x < N/2; x++)
{
SUS = (2*N - x*(x-1));
JOS = (2*x);
if(SUS % JOS == 0)
{
k = SUS / JOS;
c++;
//fprintf(fout, "%d %d\n", k, k+x-1);
aS[c] = k;
aD[c] = k+x-1;
}
if(k <= 1)
break;
}
fprintf(fout, "%d\n",c);
for(x = 1; x <= c; x++)
fprintf(fout, "%d %d\n", aS[x], aD[x]);
}
fclose(fin);
fclose(fout);
return 0;
}
