Cod sursa(job #2263395)
Utilizator | Data | 18 octombrie 2018 17:38:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<bits/stdc++.h>
using namespace std;
bool v[20000001];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int s,i,j;
in>>s;
for(i=2;i<=s;i++)
v[i]=1;
for(i=2;i<=s;i++)
{
if(v[i]==1)
{
for(j=2;j*i<=s;j++)
v[i*j]=0;
}
}
int k=0;
for(i=1;i<=s;i++)
{
if(v[i]==1)
++k;
}
out<<k;
return 0;
}