Cod sursa(job #1831633)
Utilizator | Data | 18 decembrie 2016 14:24:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int v[2000000];
int main()
{
int n,nr=0,i,j;
in>>n;
for(i=2;i<=n;i++)
for(j=i+1;j<=n;j++)
{
if(j%i==0)
v[i]=1;
}
for(i=2;i<=n;i++)
{
if(v[i]==0)
nr++;
}
out<<nr-1;
return 0;
}