Pagini recente » Cod sursa (job #1184800) | Cod sursa (job #3205717) | Cod sursa (job #1153923) | Cod sursa (job #2491863) | Cod sursa (job #213258)
Cod sursa(job #213258)
#include <fstream>
using namespace std;
int main() {
ifstream f("fractii.in");
ofstream e("fractii.out");
long n, i, j, k, g, nr=1;
f>>n;
f.close();
for (i=1 ; i<=n ; i++)
for (j=1 ; j<=n ; j++) {
long x;
if (i>j) x=i;
else x=j;
g=0;
if (i==j) g=1;
else
for (k=2 ; k<=x/2 ; k++)
if (i%k==0 && j%k==0)
g=1;
if (!g) {
nr++;
e<<i<<"/"<<j<<" ";
}
}
e<<endl<<nr;
e.close();
return 0;
}