1 条题解
-
0
C++ :
# define MAXN 2000000000 # include <cstdio> # include <cstring> # include <cmath> # include <algorithm> using namespace std; typedef unsigned long long LL; int n,cs; int e[100]; int main() { int i; scanf("%d",&n); if(n==1) { printf("None"); return 0; } e[++cs]=1; e[++cs]=n-1; int b=sqrt(n); int c=n/2; for(i=b+1; i<c; ++i) if(((LL)i*i)%n==1) { e[++cs]=i; e[++cs]=n-i; } sort(e+1,e+cs+1); for(i=1; i<=cs; ++i)printf("%d\n",e[i]); }
- 1
信息
- ID
- 3335
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者