Cod sursa(job #1012542)
Utilizator | Data | 19 octombrie 2013 12:24:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
long n,s;
bool v[2000000];
int main()
{
ifstream fi("ciur.in");
fi>>n;
fi.close();
for (long i=1;i<n;i++)
v[i]=1;
v[1]=0;
for (long i=1;i*2<n;i++)
for (long j=i;j<n;j=j+i)
v[j]=0;
ofstream fo("ciur.out");
s=0;
for (long i=1;i<n;i++)
if (v[i]=1)
s++;
fo<<s;
fo.close();
return 0;
}