Submission #2228152
Source Code Expand
var i,n,ans:longint; function prime(n:longint):boolean; var i:longint; begin i:=2 to trunc(sqrt(n)) do if n mod i=0 then exit(false); exit(true); end; begin readln(n); for i:=2 to n do if prime(i) then inc(ans); writeln(ans); end.
Submission Info
Submission Time | |
---|---|
Task | A - 与えられた数より小さい素数の個数について |
User | shaojiayu |
Language | Pascal (FPC 2.6.2) |
Score | 0 |
Code Size | 270 Byte |
Status | CE |