Cod sursa(job #1243751)
Utilizator | Data | 16 octombrie 2014 12:46:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,v[2000001],i,j,nr;
int main(){
fin>>n;
v[1]=1;
for(i=2;i<=n;i++)
{
if(v[i]==0){
nr+=1;
for(j=2*i;j<=n;j+=i)
v[j]=1;
}
}
fout<<nr;
}