Pagini recente » Cod sursa (job #786167) | Cod sursa (job #2211658) | Cod sursa (job #506374) | Cod sursa (job #2333998) | Cod sursa (job #223237)
Cod sursa(job #223237)
#include <fstream.h>
#include <math.h>
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int ok[1000], i, j, n, s, ap = 0, log;
fin >> n;
memset (ok,1,sizeof(ok));
for ( i = 1; (i * log i) <= n; i++ )
for ( s = 1; (s*log s) <= n; s++ )
if ( ok[i/s] )
{
j = 2;
while ( (i*j)/(s*j) <= n )
{
ok[(i*j)/(s*j)] = 0;
j++;
}
}
for ( i = 1; i <= n; i++ )
for ( s = 1; s <= n ; s++ )
if ( ok[i/s] )
ap++;
fout << ap;
fin.close();
fout.close();
return 0;
}