该博客介绍了ACM南太平洋地区2003年的题目——Postal Vans。问题涉及计算一个有N条南北街道的矩形网格郊区中，从邮局出发经过每个交叉路口恰好一次并返回邮局的不同路线数量。博客内容包括原题描述、输入输出格式、示例及代码实现，最终展示了一个成功的AC（Accepted）结果。
一 原题
Postal Vans
Tiring of their idyllic fields, the cows have moved to a new suburb. The suburb is a rectangular grid of streets with a post office at its Northwest corner. It has four avenues running East-West and N (1 <= N <= 1000) streets running North-South.
For example, the following diagram shows such a suburb with N=5 streets, with the avenues depicted as horizontal lines, and the post office as a dark blob at the top-left corner:
Each day the postal van leaves the post office, drives around the suburb and returns to the post office, passing exactly once through every intersection (including those on borders or
最低0.47元/天 解锁文章
965
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
