Pagini recente » Cod sursa (job #1601052) | Cod sursa (job #2790073) | Cod sursa (job #455065) | Cod sursa (job #52047) | Cod sursa (job #118686)
Cod sursa(job #118686)
#include <stdio.h>
int n;
void solve(int x)
{
int i,j;
for (i=1;i<=x;i++) printf("%d %d\n",1,n+1);
for (i=1;i<=x;i++) printf("%d %d\n",i+1,1);
for (i=1;i<=x;i++) printf("%d %d\n",n+1,i+1);
for (i=1;i<=x+1;i++) printf("%d %d\n",2,n+1);
for (i=3;i<=x+1;i++)
for (j=1;j<=x+1;j++) printf("%d %d\n",i,i-1);
for (i=1;i<=x+1;i++) printf("%d %d\n",n+1,x+1);
for (i=1;i<=x+1;i++) printf("%d %d\n",1,n+1);
for (i=1;i<=x+1;i++) printf("%d %d\n",x+1,1);
for (i=1;i<=x+1;i++) printf("%d %d\n",n+1,x+1);
}
int main()
{
freopen("tije.in","r",stdin);
freopen("tije.out","w",stdout);
scanf("%d ",&n);
int i;
for (i=n-1;i>0;i--) solve(i);
return 0;
}