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