Cod sursa(job #1017135)
Utilizator | Data | 27 octombrie 2013 12:26:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
int main()
{
f>>n;
int result = 0;
char vec[2000005];
for(int i=2;i<=n;i++)
{
vec[i] = 1;
}
for(int i=2;i<=n;i++)
{
if(vec[i]==1)
{
for(int j=2*i;j<=n;j+=i)
{
vec[j]= 0;
}
}
}
for(int i=2;i<=n;i++)
{
if(vec[i]==1) result++;
}
g<<result;
return 0;
}