Ural 1197 - Lonesome Knight
2014-01-14 12:38
274 查看
The statement of this problem is very simple: you are to determine how many squares of the chessboard can be attacked by a knight standing alone on the board. Recall that a knight moves two squares forward (horizontally or vertically in any direction) and then one square sideways (perpedicularly to the first direction).
Problem Author: folklore Problem Source: Fifth High School Children Programming Contest, Ekaterinburg, March 02, 2002
Input
The first line contains the number N of test cases, 1 ≤ N ≤ 100. Each of the following N lines contains a test: two characters. The first character is a lowercase English letter from 'a' to 'h' and the second character is an integer from 1 to 8; they specify the rank and file of the square at which the knight is standing.Output
Output N lines. Each line should contain the number of the squares of the chessboard that are under attack by the knight.Sample
input | output |
---|---|
3 a1 d4 g6 | 2 8 6 |
// Ural Problem 1197. Lonesome Knight // Verdict: Accepted // Submission Date: 10:31:16 14 Jan 2014 // Run Time: 0.015s // // 版权所有(C)acutus。(mail: acutus@126.com) // 博客:http://www.cnblogs.com/acutus/ // [解题方法] // 简单题,直接按题意判断即可 #include<stdio.h> int countNumber(int i, int j) { int count = 0; if((i - 1) >= 1) { if((j - 2) >= 1) count++; if((j + 2) <= 8) count++; } if((i - 2) >= 1) { if((j - 1) >= 1) count++; if((j + 1) <= 8) count++; } if((i + 1) <= 8) { if((j - 2) >= 1) count++; if((j + 2) <= 8) count++; } if((i + 2) <= 8) { if((j - 1) >= 1) count++; if((j + 1) <= 8) count++; } return count; } void solve() { int N, n; char c; scanf("%d", &N); getchar(); while(N--) { scanf("%c%d", &c, &n); getchar(); printf("%d\n",countNumber(c - 'a' + 1, n)); } } int main() { solve(); return 0; }
相关文章推荐
- ural 1197. Lonesome Knight
- URAL 1197. Lonesome Knight
- Lonesome knight[Timus OJ 1197]
- Ural 1313 - Some Words about Sport
- URAL 1298. Knight(DFS啊 )
- URAL1197解题报告
- Ural Problem Set Volume 2: 1100-1197
- URAL 1197 Lonesome Knight (判断)
- URAL 1964 - Chinese Dialects(贪心)
- Ural 2070 Interesting Numbers
- URAL 1200 Horns and Hoofs 枚举
- Ural 1416 Confidential(最小生成树+次小生成树)
- Ural 1430. Crime and Punishment
- ural1007 Code Words (字符串处理)
- URAL 1250. Sea Burial 从问题中抽象出DFS
- Error: java.lang.RuntimeException: Some file crunching failed, see logs for details
- URAL 1650. Billionaires(线段树)
- POJ 2488-A Knight's Journey(DFS-象棋中的马)
- URAL 1057 Amount of Degrees (数位DP)
- SQL中All, Any, Some的意思