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<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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |