QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #354961 | #2816. 过河卒二 | LVJBot1 | RE | 0ms | 0kb | C++14 | 478b | 2024-03-16 09:57:54 | 2024-03-16 09:57:55 |
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std; const int fx[]={0,-2,-1,1,2,2,1,-1,-2}; const int fy[]={0,1,2,2,1,-1,-2,-2,-1}; int bx,by,mx,my; ll f[40][40]; bool s[40][40]; int main(){ scanf("%d%d%d%d",&bx,&by,&mx,&my); bx+=2;by+=2;mx+=2;my+=2; f[2][1]=1; s[mx][my]=1; for(int i=1;i<=8;i++) s[mx+fx[i]][my+fy[i]]=1; for(int i=2;i<=bx;i++){ for(int j=2;j<=by;j++){ if(s[i][j]) continue; f[i][j]=f[i-1][j]+f[i][j-1]; } } printf("%lld\n",f[bx][by]); return 0; }
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Runtime Error
input:
1737 2613 20 1695 2081 1449 1419 868 1636 879 2454 1400 1778 1364 2166 1343 1563 1229 2012 1308 1674 1712 2004 1392 1716 1118 1690 1693 1986 1641 2221 1454 1937 1554 1944 997 2083 1242 1503 990 1834 986 1438