Cod sursa(job #1028663)
Utilizator | Data | 14 noiembrie 2013 15:33:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[100];
int main()
{
int n,s=0,i,j;
f>>n;
for(i=2;i<=n;i++)if(v[i]==0)for(j=i+i;j<=n;j+=i)v[j]=1;
for(i=2;i<=n;i++)if(v[i]==0)s++;
g<<s;
return 0;
}