Cod sursa(job #1015295)
| Utilizator | Data | 24 octombrie 2013 11:07:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
fstream f("ciur.in");
ofstream g("ciur.out");
int n;
int getPrimes()
{
char vec[2000001];
int result = 0, i, j;
for(int i=2;i<=n;i++)
{
vec[i] = 1;
}
for(i=2;i<=n;i++)
{
if(vec[i] == 1)
{
result++;
for(j=i+i;j<=n;j+=i)
{
vec[j]=0;
}
}
}
return result;
}
int main()
{
f>>n;
g<<getPrimes();
f.close();
g.close();
return 0;
}