Cod sursa(job #1338053)

Utilizator Teodora2604Sas Teodora Teodora2604 Data 9 februarie 2015 19:13:20
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.4 kb
 #include<fstream>
 #define N 2000000
 using namespace std;
 int main(){
 long n,i,j;
 bool ciur[N+1];
 for(i=1;i<=n;i++) ciur[i]=true;
 ifstream fin ("ciur.in");
 ofstream fout ("ciur.out");
 int cnt=0;
 fin>>n;
 for(i=2;i<=n;i++)
    if(ciur[i]=true)
 { cnt++;
     for(j=i+i;j<=N;j=j+i)
        ciur[j]=false;
 }
 fout<<cnt;
 fin.close();
 fout.close();
   //incarca l
    return 0;
}