Detail of message

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

每一点的值 = 该点左边和上面能走到该点的值之和，初始条件：s[0][0]=1。

Posted by ACM30021 at 2005-11-09 21:43:18 on Problem 2704
In Reply To:Re:我不会，我刚开始接触数据结构，所以规划还没有讲到 Posted by:tcxgsy at 2005-11-09 21:34:40

Followed by:

注意的是，结果用__int64存储才不会溢出。 (0) ACM30021 2005-11-09 21:48:50
- Re:为什么我还是WA 啊？请高手帮帮忙看看（附程序） (612) ericsummer 2005-11-10 14:32:03
  - printf("%lld\n" , f[n][n]);改成 printf("%I64d\n" , f[n][n]);就可以了 .... (696) huicpc16 2005-11-10 14:48:55
    - 太感谢了 (0) ericsummer 2005-11-10 15:22:46
      - 不客气 (0) huicpc16 2005-11-10 15:27:17

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator