Cod sursa(job #1331311)
| Utilizator | Data | 31 ianuarie 2015 15:13:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
void solve (int n,int v[100001])
{
int i,j,k=0;
for(i=2;i*i<=n;i++)
{
if(v[i]==1)
{
for(j=i*i;j<=n;j+=i)
v[j]=0;
}
}
for(i=2;i<=n;i++)
if(v[i]==1)
k++;
g<<k;
}
int main()
{
int v[100001],i;
int n;
f>>n;
for(i=1;i<=n;i++)
v[i]=1;
solve(n,v);
return 0;
}
