Cod sursa(job #1552098)
Utilizator | Data | 17 decembrie 2015 11:21:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
int v[1000001],i,n,j,nr;
ifstream fin ("ciur.in")
ofstream fout ("ciur.out")
using namespace std;
int main()
{
fin >> n;
for(i=2;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
if(j%i==0)
{if(v[i]<mi)
{
mi=v[i];
}
v[j]=1;
}
}
}
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
nr=nr+1;;
}
}
fout << nr;
}