Cod sursa(job #1614590)
Utilizator | Data | 26 februarie 2016 00:04:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool c[2000001];
int n,i,j,p;
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(c[i]==0)
{
p++;
for(j=i+1;j<=n;j=i+j)
c[j]=1;
}
g<<p;
}