This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
//#include <windows.h>
int q[1001];
int w[1000][1000];
int main()
{
int N;
int k,p;
int a,b;
int i;
int cnt;
scanf("%d",&N);
q[0] = 0;
cnt = 0;
for(i=1;i<=N*N;i++)
{
q[i] = (q[i-1]+i)%N;
a = q[i];
b = q[i-1];
if( (q[i]!=q[i-1]) && (w[a][b] != 1 ) )
{
cnt ++;
w[a][b] = 1;
w[b][a] = 1;
}
}
printf("%d",cnt);
//system("pause");
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |