Cod sursa(job #2241255)
Utilizator | Data | 15 septembrie 2018 13:33:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, counter=0;
char a[2000001];
int main()
{
fin>>n;
for(int i=2;i<=n;i++)
{
if(a[i]==0)
{
counter++;
for(int j=2*i;j<=n;j=j+i)
{
a[j]=1;
}
}
}
fout<<counter;
return 0;
}