Cod sursa(job #1394263)
| Utilizator | Data | 20 martie 2015 10:16:55 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char ciur[1000009];
int n,a;
long long i,j,s=0;
int main ()
{
fin>>n;
ciur[1]=1;
for(i=2;i<=n;i++)
{
if(ciur[i]==0)
{
for(j=i*i;j<=n;j=j+i)
{
ciur[j]=1;
}
}
}
for(i=1;i<=n;i++)
{
if(ciur[i]==0)
{
s++;
}
}
fout<<s;
return 0;
}
