 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
有兴趣的同学来把玩一下这道题：给一个 无穷大的格子组成的平面， 平面上有N(N<=1000) 个障碍物,坐标(xi,yi)both<=10^9 现在要从起点(0,0)沿四个方向 走到终点(ex,ey) ex<=10^9,ey<=10^9 求最短路 以及 走法数 mod (10^9+7) Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
