Cod sursa(job #1667098)
| Utilizator | Data | 28 martie 2016 17:34:29 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,k,i,j;
char v[200010];
int main()
{
f>>n;
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i]!=0)
{
k++;
for(j=i+i;j<=n;j+=i)
v[j]=0;
}
g<<k;
return 0;
}
