Cod sursa(job #1708997)
Utilizator | Matei Bogdan bogdan0707 | Data | 28 mai 2016 10:29:50 |
---|---|---|---|
Problema | Twoton | Scor | 0 |
Compilator | cpp | Status | done |
Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.44 kb |
#include <stdio.h>
int n;
int a[1000024];
int count = 0;
int main()
{
FILE *fin = fopen("twoton.in", "r");
FILE *fout = fopen("twoton.out", "w");
fscanf(fin, "%d", &n);
for (int i = 0; i < n; ++i) {
fscanf(fin, "%d", &a[i]);
}
for (int i = 0; i < n - 1; i++)
{
count += n - 2 + i;
if (a[i] > a[i + 1])
count += n - 2 + i;
count %= 19997;
}
fprintf(fout, "%d\n", count);
fclose(fin);
fclose(fout);
}