| 5 | bool prime[100000009]; |
| 6 | |
| 7 | int main() { |
| 8 | // ���� �� �z��̏����� |
| 9 | cin >> N; |
| 10 | for (int i = 2; i <= N; i++) prime[i] = true; |
| 11 | |
| 12 | // �G���g�X�e�l�X�̂ӂ邢 |
| 13 | for (int i = 2; i * i <= N; i++) { |
| 14 | if (prime[i] == true) { |
| 15 | for (int x = 2 * i; x <= N; x += i) prime[x] = false; |
| 16 | } |
| 17 | } |
| 18 | |
| 19 | // N �ȉ��̑f�������������ɏo�� |
| 20 | for (int i = 2; i <= N; i++) { |
| 21 | if (prime[i] == true) cout << i << endl; |
| 22 | } |
| 23 | return 0; |
| 24 | } |
nothing calls this directly
no outgoing calls
no test coverage detected