Cod sursa(job #882082)
| Utilizator | Data | 18 februarie 2013 21:14:53 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
int v[2000001];
int main ()
{
int c=0,i,n,j;
ifstream is("ciur.in");
ofstream os("ciur.out");
is>>n;
for (i=2;i<=n;i++)
{
if (v[i]==0)
{
c++;
}
for (j=i;j<=n;j++)
{
v[i*j]=1;
}
}
os<<c;
return 0;
}
