-
Notifications
You must be signed in to change notification settings - Fork 0
/
1078.cpp
86 lines (77 loc) · 1.05 KB
/
1078.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#define MAX_LENGTH 10010
int occupied[MAX_LENGTH];
int position[MAX_LENGTH];
int input[MAX_LENGTH];
bool is_prime(int x)
{
double sqrtx = sqrt(x*1.0);
if (1 == x)
{
return false;
}
if (2 == x)
{
return true;
}
for (int i = 2; i < sqrtx+1; ++i)
{
if (0 == x%i)
{
return false;
}
}
return true;
}
int main()
{
int Msize, N;
int pos;
int tmp;
scanf("%d %d", &Msize, &N);
while (!is_prime(Msize))
{
++Msize;
}
for (int i = 0; i != N; ++i)
{
scanf("%d", input+i);
}
for (int i = 0; i != N; ++i)
{
pos = input[i]%Msize;
tmp = 1;
do
{
if (0 == occupied[pos])
{
occupied[pos] = 1;
position[i] = pos;
break;
}
pos = (input[i]%Msize + tmp*tmp)%Msize;
++tmp;
} while (tmp < Msize);
if (tmp >= Msize)
{
position[i] = -1;
}
}
printf("%d", position[0]);
for (int i = 1; i < N; ++i)
{
if (-1 == position[i])
{
printf(" -");
}
else
{
printf(" %d", position[i]);
}
}
printf("\n");
system("pause");
return 0;
}