Cod sursa(job #1331303)
Utilizator | Data | 31 ianuarie 2015 15:11:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream in("ciur.in");
ofstream out ("ciur.out");
long long n, s=0;
in>>n;
char prim[n];
for(int i=2;i<=n;i++)
prim[i]=1;
for(int i=2;i*i<n;i++)
if(prim[i]==1)
for(int j=i*i;j<n;j=j+i)
prim[j]=0;
for(int i=2;i<n;i++)
if(prim[i]==1)
s++;
out<<s;
return 0;
}