Pagini recente » Cod sursa (job #2473646) | Cod sursa (job #1413318) | Cod sursa (job #534042) | Monitorul de evaluare | Cod sursa (job #963790)
Cod sursa(job #963790)
#include<cstdio>
struct nod{
int x,y;
}
v[1005];
int n,i,j,k,m;
int euclid(int a,int b)
{
int r=a%b;
while (r) a=b,b=r,r=a%b;
return b;
}
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n-1;i++) v[i].x=i,v[i].y=2*n-1;
for (i=n;i<=2*n-1;i++) k+=i;
v[n].x=k;v[n].y=2*n-1;
for (i=1;i<=n;i++) k=euclid(v[i].x,v[i].y),v[i].x=v[i].x/k,v[i].y=v[i].y/k;
for (i=n;i>=1;i--) printf("%d %d\n",v[i].x,v[i].y);
return 0;
}