Pagini recente » Cod sursa (job #2822568) | Cod sursa (job #1882996) | Cod sursa (job #2820431) | Cod sursa (job #572952) | Cod sursa (job #1113431)
#include <stdio.h>
using namespace std;
long Minimum( long a, long b )
{
if( a >= b )
return b;
return a;
}
int main()
{
long i, j, k, nr=0, min, n;
int ok;
FILE *f = fopen( "fractii.in", "r" ), *g = fopen("fractii.out", "w");
fscanf( f, "%ld", &n );
for( i=1; i<=n; i++ )
{
for( j=1; j<=n; j++ )
{
min = Minimum( i, j );
ok = 1;
for( k=2; k<=min; k++ )
{
if( i%k == 0 && j%k == 0 )
ok = 0;
}
if( ok )
nr++;
}
}
fprintf( g, "%ld\n", nr );
fclose( f );
fclose( g );
return 0;
}