Cod sursa(job #2002606)
Utilizator | Data | 20 iulie 2017 13:49:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int vc[10];
int main()
{
int n,cnt;
in>>n;
cnt=0;
for(int i=2;i<=n;i++)
{
if(vc[i]==0)
{
for(int j=i+i;j<=n;j+=i)
{
vc[j]++;
}
}
}
for(int i=2;i<=n;i++)
{
if(vc[i]==0)
cnt++;
}
out<<cnt;
return 0;
}