Cod sursa(job #1789695)
Utilizator | Data | 27 octombrie 2016 13:48:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
bool c[2000001];
int n,i,j,p;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
{if(c[i]==0)
p++;
{
for(j=i+i;j<=n;j=j+i)
c[j]=1;
}
}
g<<p;
return 0;
}