Cod sursa(job #1644004)
Utilizator | Data | 9 martie 2016 21:07:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main ()
{
int n;
fin>>n;
bool a[n];
for (int i=2;i<=n;i++)
{
a[i]=0;
}
int ct=0;
for (int i=2;i<=n;i++)
{
if (a[i]==0)
{
ct++;
for (int j=i+i;j<=n;j=j+i)
{
a[j]=1;
}
}
}
fout<<ct;
}