제출 #8394

#제출 시각아이디문제언어결과실행 시간메모리
8394cki86201Wiring (kriii2_W)C++98
1 / 4
104 ms1208 KiB
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<vector>
#include<math.h>
#include<stdlib.h>
#include<set>
#include<ctype.h>
using namespace std;

#define X first
#define Y second
typedef long long ll;
typedef pair<int,int> Pi;

set <Pi> S;

int main()
{
	int n,i,x=0,y;scanf("%d",&n);
	for(i=1;i<=n*n;i++){
		y = (x + i)%n;
		if(x!=y)S.insert(Pi(max(x,y),min(x,y)));
		x = y;
	}
	printf("%d",int(S.size()));
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...