Cod sursa(job #2661814)
Utilizator | Data | 22 octombrie 2020 19:12:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,c;
int ciur[2000001];
void proces(int x)
{
int i=2;
while(i*x<n)
{
ciur[i*x]=1;
i++;
}
}
int main()
{
in>>n;
for(int i=2;i<=n;i++)
{
proces(i);
}
for(int i=2;i<n;i++)
{
if(ciur[i]==0)
c++;
}
out<<c;
return 0;
}