Cod sursa(job #1592769)
Utilizator | Data | 7 februarie 2016 22:21:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
char s[2000000];
int counter;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
int i,j;
for (i=2;i<=n;++i)
s[i]=1;
for (i=2;i<=n;++i)
{
if(s[i])
{
counter++;
for (j=i+i;j<=n;j+=i)
s[j]=0;
}
}
g<<counter;
return 0;
}