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