Cod sursa(job #1346693)
Utilizator | Data | 18 februarie 2015 15:48:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool m[2000002];
int main()
{
int i,j,n,t=0;
long long v[100000];
in>>n;
for(i=1;i<n;i++)
v[i]=1;
for(i=2;i<n;i++)
{
if(v[i]==1)
{
m[i]=1;
for(j=2;j*i<n;j++)
{
v[i*j]=0;
}
for(i=2;i<n;i++)
{
if(v[i]==1)
{
t++;
}
}
}
}
out<<t;
return 0;
}