Cod sursa(job #2053412)
Utilizator | Data | 31 octombrie 2017 18:53:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool a[200000001];
int main()
{
int n,r=0;
in>>n;
for(int i=2;i<=n;i++)
{
if(!a[i])
{
r++;
for(int j=2;j*i<=n;j++)
{
a[i*j]=1;
}
}}
out<<r;
return 0;
}