Cod sursa(job #1288960)
Utilizator | Data | 9 decembrie 2014 11:53:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{ int n,s=0,i,j,k;
in>>n;
for(i=1;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
{
for(j=i;j<=n;j++)
{
if(j%i==0) s++;
for(k=i*2;k<=n;k+=k)
v[k]=0;
}
}
out<<s;
}