Cod sursa(job #1779077)
Utilizator | Data | 14 octombrie 2016 19:27:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char v[2000002];
int main(){
int n,i,j,k;
fin>>n;
k=0;
for(i=2;i<=n;i++)
{
if(v[i]==0) {
k++;
for(j=2*i;j<=n;j=j+i)
v[j]=1;
}
}
fout<<k;
fin.close();
fout.close();
return 0;
}