Submission #9243

#TimeUsernameProblemLanguageResultExecution timeMemory
9243yukarikoWiring (kriii2_W)C11
0 / 4
4 ms5388 KiB
#include <stdio.h> //#include <windows.h> int q[100001]; int w[1001][1001]; 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...