Cod sursa(job #3298435)
Utilizator | Data | 29 mai 2025 20:42:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,v[2000001],C;
int main()
{
fin>>n;
for(int i=2; i*i<=n; ++i)
for(int j=i; j*i<=n; ++j)
v[j*i]=1;
for(int i=2; i<=n; ++i)
{
if(v[i]==0)
C++;
}
fout<<C;
return 0;
}