BlueBook

BlueBook - Sieve

View as PDF

Submit solution

All submissions

Best submissions

Points: 5

Time limit: 1.0s

Memory limit: 16M

Problem types

Given an integer $N$ $N$ , perform the Sieve of Eratosthenes on the integers from $1$ $1$ to $N$ $N$ inclusive.

Input Specification

A single integer $N$ $N$ $(1 \le N \le 500)$ $(1 \leq N \leq 500)$ .

Output Specification

$N$ $N$ lines each containing a single integer. The integer on the $i^\text{th}$ $i^{th}$ line should be 1 if $i$ $i$ is prime, or 0 if it is not a prime.

Sample Input

Copy

Sample Output

Copy

Comments

0

mariuspuzhouli commented on June 12, 2022, 1:03 a.m. ← edited →

it is simple cause 'A single integer $N$ $N$ $(1 \le N \le 500)$ $(1 \leq N \leq 500)$ .'