Cod sursa(job #1348287)
| Utilizator | Data | 19 februarie 2015 16:59:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool a[2000002];
int main()
{
int n,i,j,k=0,v[100],ok=0;
in>>n;
for(i=0;i<n;i++)
{
a[i]=1;
}
for(i=2;i<n;i++)
{
if(i<=sqrt(n) && a[i]==1)
{
for(j=i*i;j<n;j++)
{
if(j%i==0)
{
a[j]=0;
}
}
}
}
for(i=2;i<n;i++)
{
if(a[i]==1)
{
ok++;
}
}
out<<ok;
return 0;
}
