Cod sursa(job #1571223)
Utilizator | Data | 17 ianuarie 2016 15:55:11 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
#include <stdlib.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{ int n,k=0,i,j;
f>>n;
bool *a=(bool*)calloc(n+1,sizeof(bool));
for(i=2; i<=n; i++)
{
if(a[i]==0)
{
k++;
for(j=i+i; j<=n; j=j+i)
a[j]=1;
}
}
g<<k;
return 0;
}