Cod sursa(job #2141625)
Utilizator | Data | 24 februarie 2018 15:07:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
char f[2000000];
int main()
{
int n,i,j,prime=0;
in>>n;
for(i=2;i<=n;i++)
if(f[i]==0)
{
prime++;
for(j=2;j<=n/i;j++)
f[i*j]=1;
}
out<<prime;
}