Cod sursa(job #920817)
| Utilizator | Data | 20 martie 2013 17:22:29 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
#include<fstream>
#include<iostream>
using namespace std;
char v[2000005];
int k,n;
int main()
{
int i,j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i])
{
k++;
for(j=i+i;j<=n;j+=i)
v[j]=0;
}
g<<k;
f.close();
g.close();
return 0;
}
