----------------解决方案--------------------------------------------------------
啥都不说了~~大家都是猛人~~
----------------解决方案--------------------------------------------------------
以下是引用Eastsun在2007-5-27 18:21:49的发言:
#include<stdio.h>
#define dist(x,n) ((x)-(n)>0?(x)-(n):(n)-(x))
main(){
int n,i,j;
while(scanf(\"%d\",&n)!=EOF){
if(n<1||n>26) return 0;
for(i=1;i<=n;i++){
for(j=1;j<=2*n-1;j++) printf(\"%c\",dist(j,n)<i?i-1-dist(j,n)+'A':' ');
printf(\"\n\");
}
}
}
程序代码:
#include<stdio.h>
#define dist(x,n) ((x)-(n)>0?(x)-(n):(n)-(x))
main(){
int n,i,j;
while(scanf(\"%d\",&n)!=EOF){
if(n<1||n>26) return 0;
for(i=1;i<=n;i++){
for(j=1;j<=2*n-1;j++) printf(\"%c\",dist(j,n)<i?i-1-dist(j,n)+'A':' ');
printf(\"\n\");
}
}
}
怎么弄的那个click me 啊???教下我嘛
----------------解决方案--------------------------------------------------------
六楼的不错.....
----------------解决方案--------------------------------------------------------
以下是引用Eastsun在2007-5-27 18:21:49的发言:
#include<stdio.h>
#define dist(x,n) ((x)-(n)>0?(x)-(n):(n)-(x))
main(){
int n,i,j;
while(scanf(\"%d\",&n)!=EOF){
if(n<1||n>26) return 0;
for(i=1;i<=n;i++){
for(j=1;j<=2*n-1;j++) printf(\"%c\",dist(j,n)<i?i-1-dist(j,n)+'A':' ');
printf(\"\n\");
}
}
}
程序代码:
#include<stdio.h>
#define dist(x,n) ((x)-(n)>0?(x)-(n):(n)-(x))
main(){
int n,i,j;
while(scanf(\"%d\",&n)!=EOF){
if(n<1||n>26) return 0;
for(i=1;i<=n;i++){
for(j=1;j<=2*n-1;j++) printf(\"%c\",dist(j,n)<i?i-1-dist(j,n)+'A':' ');
printf(\"\n\");
}
}
}
赞一个
----------------解决方案--------------------------------------------------------
1
121
12321
1234321
把那题目看成这个就简单了.
----------------解决方案--------------------------------------------------------
这个也叫旷世难题啊 ?
----------------解决方案--------------------------------------------------------