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