| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1348867 | branches1029 | Lego Wall (EGOI22_legowall) | C++20 | 140 ms | 327680 KiB |
#include <stdio.h>
int main()
{
int i,j,k;
int s,t;
int w,h;
long long const mod=1e9+7;
scanf("%d",&w);
scanf("%d",&h);
int C[h+1][h+1];
for(i=0;i<h+1;i++){
C[i][0]=1;
C[i][i]=1;
}
for(i=2;i<h+1;i++){
for(j=1;j<i;j++){
C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
}
}
int a[w+1][h+1]={0};
a[1][0]=1;
for(i=2;i<w+1;i++){
for(j=1;j<h+1;j++){
s=0;
for(k=0;k<h-j+1;k++){
s+=(a[i-1][k]*C[h-k][j])%mod;
s=s%mod;
}
a[i][j]=s;
}
}
int W=0;
for(i=0;i<h+1;i++){
W+=a[w][i]%mod;
W=W%mod;
}
printf("%d",W);
return 0;
}컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
