Cod sursa(job #1665297)
Utilizator | Data | 26 martie 2016 20:02:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
long int n,t=0;
in>>n;
int v[n+1],i,j;
for(i=2;i<=n;i++)
{
v[i]=1;
}
for(i=2;i<=n;i++)
{
for(j=2*i;j<=n;j+=i)
{
v[i]=0;
}
}
for(i=2;i<=n;i++)
{
if(v[i])
{
t++;
}
}
out<<t;
return 0;
}