Pagini recente » Cod sursa (job #2377444) | Cod sursa (job #792266) | Cod sursa (job #1435242) | Cod sursa (job #1572011) | Cod sursa (job #1709183)
#include <stdio.h>
int n;
int a[1000024];
int count = 0;
int wtf(int i, int &count)
{
count++;
if (count >= 19997) {
count -= 19997;
}
if (i == n - 1) {
return a[i];
}
int cnt2 = 0;
int x = wtf(i + 1, cnt2);
count += cnt2;
count %= 19997;
if (a[i] < x) {
return a[i];
} else {
count += cnt2;
count %= 19997;
return x;
}
}
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]);
}
wtf(0, count);
fprintf(fout, "%d\n", count);
fclose(fin);
fclose(fout);
}