Cod sursa(job #1389269)
Utilizator | Data | 16 martie 2015 09:41:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <cstdlib>
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000001];
int main()
{
long n,i,x,k=0;
f>>n;
for(i=2;i*i<=n;i++)
{ if(v[i]==0)
for(int j=i+1;j<=n;j++)
if(j%i==0)
v[j]=1;}
for(i=2;i<n;i++)
if(v[i]==0)
k++;
g<<k;}