Pagini recente » Cod sursa (job #3230845) | Cod sursa (job #304550) | Cod sursa (job #2076356) | Cod sursa (job #1708992) | Cod sursa (job #2174047)
#include<iostream>
using namespace std;
/*int a[100][100];
int main() {
int n,m,i,j,vecin=0,an=0;
cin>>n>>m;
for(i=1; i<=n; i++) {
for(j=1; j<=m; j++) {
cin>>a[i][j];
}
}
for(i=1; i<=n; i++) {
for(j=1; j<=m; j++) {
vecin=0;
if(a[i][j] == 1) {
if(a[i][j+1] == 0) vecin++;
if(a[i-1][j] == 0) vecin++;
if(a[i+1][j] == 0) vecin++;
if(a[i][j-1] == 0) vecin++;
if(vecin > 1 && vecin < 5) an++;
}
}
}
cout<<an;
return 0;
}*/
int GCD(int A, int B)
{
if(!B)
return A;
return GCD(B, A%B);
}
int main() {
int N,i,j,cmmdc,nr=0;
cin>>N;
for(i=1; i<=N; i++) {
for(j=1; j<=N; j++) {
cmmdc = GCD(i,j);
if(cmmdc == 1) {
cout<<i<<"/"<<j<<'\n';
nr++;
}
}
}
cout<<nr;
return 0;
}