Cod sursa(job #2069438)
Utilizator | Data | 18 noiembrie 2017 13:54:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
int main()
{
int n;
fi>>n;
int a[n+1],S=0;
for (int x=1;x<=n;x++)
a[x]=1;
{
for(int i=2; i<=n; i++)
{
if(a[i]==1)
{ S++;
for(int j=i*2;j<=n;j=j+i)
a[j]=0;
}
}
fo<<S;
}
return 0;
}