Cod sursa(job #1843760)
Utilizator | Data | 9 ianuarie 2017 12:39:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream inf("ciur.in");
ofstream outf("ciur.out");
int n, sol, ciur[2000010];
int main()
{
inf>>n;
for(int i=2; i<=n; i++)
{
if(ciur[i]==0)
{
sol++;
for(int j=i*2; j<=n; j+=i)
ciur[j]=1;
}
}
outf<<sol;
return 0;
}