回答編集履歴
3
アルゴリズムの修正
test
CHANGED
|
@@ -14,7 +14,7 @@
|
|
|
14
14
|
int main(void)
|
|
15
15
|
{
|
|
16
16
|
bool is_prime[N + 1]; // is_prime[0] is not used
|
|
17
|
-
int m = sqrt(N); // round down to integer
|
|
17
|
+
int m = sqrt(N + 0.5); // round down to integer
|
|
18
18
|
int i, j;
|
|
19
19
|
|
|
20
20
|
is_prime[1] = false;
|
2
アルゴリズムの修正
test
CHANGED
|
@@ -14,7 +14,7 @@
|
|
|
14
14
|
int main(void)
|
|
15
15
|
{
|
|
16
16
|
bool is_prime[N + 1]; // is_prime[0] is not used
|
|
17
|
-
int m = sqrt(N
|
|
17
|
+
int m = sqrt(N); // round down to integer
|
|
18
18
|
int i, j;
|
|
19
19
|
|
|
20
20
|
is_prime[1] = false;
|
1
アルゴリズムの修正
test
CHANGED
|
@@ -14,7 +14,7 @@
|
|
|
14
14
|
int main(void)
|
|
15
15
|
{
|
|
16
16
|
bool is_prime[N + 1]; // is_prime[0] is not used
|
|
17
|
-
int m = sqrt(N); // round down to integer
|
|
17
|
+
int m = sqrt(N + 1); // round down to integer
|
|
18
18
|
int i, j;
|
|
19
19
|
|
|
20
20
|
is_prime[1] = false;
|