Cod sursa(job #1510559)
Utilizator | Data | 25 octombrie 2015 12:18:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
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 main()
{
int n,i,j,nr=0;
in>>n;
int a[n+1];
for(i=1;i<=n;i++)
{
a[i]=i;
}
i=2;
while(i*i<n)
{
for(j=i*i;j<=n;j+=i)
{
a[j]=0;
}
i++;
}
for(i=2;i<=n;i++)
if(a[i]!=0) nr++;
out<<nr;
in.close();
out.close();
return 0;
}