Cod sursa(job #1246039)
Utilizator | Data | 20 octombrie 2014 14:10:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long int v[200000000],n;
int main()
{
int i,j,t=0;
fin>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
{
for(j=2;j*i<=n;j++)
v[i*j]=1;
t=t+1;
}
fout<<t;
return 0;
}