Cod sursa(job #1150046)
Utilizator | Data | 22 martie 2014 15:27:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main ()
{
int n,i,j;
short ciur[2000000];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
ciur[i]=1;
for(i=2;i<n;i++)
if(ciur[i]==1)
for(j=i+i;j<=n;j=j+i)
ciur[j]=0;
int contor=0;
for(i=2;i<=n;i++)
if(ciur[i]==1)
contor++;
g<<contor;
return 0;
}