提交记录 #82

提交时间：2024-10-30 11:28:48
语言：c 状态：Accepted
编译情况：编译成功 
code.c: In function ‘fill’:
code.c:5:5: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
    5 |     if(n<0) return; int m=(1<<n+2)-1;
      |     ^~
code.c:5:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
    5 |     if(n<0) return; int m=(1<<n+2)-1;
      |                     ^~~
code.c:5:32: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
    5 |     if(n<0) return; int m=(1<<n+2)-1;
      |                               ~^~
code.c:9:24: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
    9 |     for(int i=2;i<(1<<n+1)-1;i++) c[x+i][y+(1<<n+1)-i]='/';
      |                       ~^~
code.c:9:49: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
    9 |     for(int i=2;i<(1<<n+1)-1;i++) c[x+i][y+(1<<n+1)-i]='/';
      |                                                ~^~
code.c:10:24: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
   10 |     for(int i=2;i<(1<<n+1)-1;i++) c[x+i][y+(1<<n+1)+i-1]='\\';
      |                       ~^~
code.c:10:49: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
   10 |     for(int i=2;i<(1<<n+1)-1;i++) c[x+i][y+(1<<n+1)+i-1]='\\';
      |                                                ~^~
code.c:11:17: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
   11 |     fill(x+(1<<n+1),y+(1<<n),n-1);
      |                ~^~
code.c: In function ‘main’:
code.c:15:23: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
   15 |     for(int i=0;i<1<<n+2;i++) for(int j=0;j<1<<n+2;j++) c[i][j]=' ';
      |                      ~^~
code.c:15:49: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
   15 |     for(int i=0;i<1<<n+2;i++) for(int j=0;j<1<<n+2;j++) c[i][j]=' ';
      |                                                ~^~
code.c:16:36: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
   16 |     fill(0,0,n); for(int i=0;i<1<<n+2;i++) printf("%s\n",c[i]);
      |                                   ~^~
固定测试点#1:
acAccepted
time 0.001s
memory 492 kB
固定测试点#2:
acAccepted
time 0.000s
memory 236 kB
固定测试点#3:
acAccepted
time 0.000s
memory 228 kB
固定测试点#4:
acAccepted
time 0.000s
memory 228 kB
固定测试点#5:
acAccepted
time 0.000s
memory 228 kB
固定测试点#6:
acAccepted
time 0.000s
memory 228 kB
固定测试点#7:
acAccepted
time 0.001s
memory 232 kB
附加测试点暂不可用
... 不可用
time N/A
memory N/A

H12【选做•学长出题】囧囧有神的囧rz 

#include<stdio.h>
#include<string.h>
char c[513][513];
void fill(int x,int y,int n){
    if(n<0) return; int m=(1<<n+2)-1;
    for(int i=x+1;i<x+m;i++) c[i][y]=c[i][y+m]='|';
    for(int j=y+1;j<y+m;j++) c[x][j]=c[x+m][j]='-';
    c[x][y]=c[x+m][y]=c[x+m][y+m]=c[x][y+m]='+';
    for(int i=2;i<(1<<n+1)-1;i++) c[x+i][y+(1<<n+1)-i]='/';
    for(int i=2;i<(1<<n+1)-1;i++) c[x+i][y+(1<<n+1)+i-1]='\\';
    fill(x+(1<<n+1),y+(1<<n),n-1);
}
int main(){
    int n; scanf("%d",&n);
    for(int i=0;i<1<<n+2;i++) for(int j=0;j<1<<n+2;j++) c[i][j]=' ';
    fill(0,0,n); for(int i=0;i<1<<n+2;i++) printf("%s\n",c[i]);
    return 0;
}
京ICP备2024093084 号