Cod sursa(job #1543072)
Utilizator | Data | 5 decembrie 2015 22:01:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int prim[100000001],c;
int main()
{
ifstream f("ciur.in");
int n;f>>n;
f.close();
for(int i=2;i<=n;i++)
{
if(prim[i]==0)
{
c++;
for(int j=2*i;j<=n;j+=i)
{
prim[j]=1;
}
}
}
ofstream g("ciur.out");
g<<c;
g.close();
return 0;
}