Cod sursa(job #2258331)
Utilizator | Data | 11 octombrie 2018 11:23:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int pas,i,j,n;
char f[2000010];
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;i++)
{
if(f[i]==0)
{
for(j=i*2;j<=n;j+=i)
{
f[j]=1;
}
pas++;
}
}
fout<<pas;
return 0;
}