Cod sursa(job #872673)
| Utilizator | Data | 6 februarie 2013 14:47:15 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000001];
int main()
{
int n,s=0,i,j;
f >> n;
for(i = 2; i <= n; i++)
{
if(v[i]==0)
{
s++;
for(j = i + i; j <= n; j=j+i)
v[j] = 1;
}
}
g <<s;
}
