Pagini recente » Cod sursa (job #2851338) | Cod sursa (job #881332) | Cod sursa (job #947032) | Cod sursa (job #2089936) | Cod sursa (job #2726069)
#include <stdio.h>
int n;
int a[1000024];
int count = 0;
int wtf(int i)
{
count++;
if (count >= 19997) {
count -= 19997;
}
if (i == n - 1) {
return a[i];
}
if (a[i] < wtf(i + 1)) {
return a[i];
}
else {
return wtf(i + 1);
}
}
int min;
void wtf2() {
min = a[n - 1];
for (int i = n-2; i >= 0; i--) {
if (a[i] < min) {
min = a[i];
}
else {
count = count * 2 + (n - i - 1);
if (count >= 19997) {
count -= 19997;
}
}
}
count += n;
if (count >= 19997) {
count -= 19997;
}
}
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]);
}
wtf2();
fprintf(fout, "%d\n", count);
fclose(fin);
fclose(fout);
}