Cod sursa(job #1075939)
| Utilizator | Data | 9 ianuarie 2014 19:07:40 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int v[10001],n;
void gg (int j,int a)
{
for(int i=j;i<n;i++)
if(v[i]!=0 && v[i]%a==0) v[i]=0;
}
int main()
{ifstream f("ciur.in");
ofstream g("ciur.out");
int i,j,a,s=0;
f>>n;
for(i=1;i<n;i++)
{
v[i]=i+1;
}
for(i=1;i<n;i++)
{if(v[i]!=0)
{
a=v[i];
j=i+1;
gg(j,a);
}
}
for(i=1;i<n;i++)
{
if(v[i]!=0) s++;
}
g<<s;
return 0;
}
