Pagini recente » Cod sursa (job #1072170) | Cod sursa (job #840166) | Cod sursa (job #2300313) | Istoria paginii utilizator/teodormilitaru | Cod sursa (job #428032)
Cod sursa(job #428032)
#include<cstdio>
using namespace std;
FILE *f;
FILE *g;
int a[100001],i,n,j;
long long nr;
bool okk;
int main()
{
f=fopen("inv.in","r");
g=fopen("inv.out","w");
fscanf(f,"%d\n",&n);
for(i=1;i<=n;i++)
fscanf(f,"%d ",&a[i]);
do
{
okk=false;
for(i=1;i<=n-1;i++)
if(a[i]>a[i+1])
{
int aux=a[i+1];
a[i+1]=a[i];
a[i]=aux;
nr++;
okk=true;
}
} while (okk);
fprintf(g,"%d\n",nr%9917);
fclose(f);
fclose(g);
return 0;
}