codeforces 161 Div2 A
2013-01-17 22:59
246 查看
A. Beautiful Matrix
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You've got a 5 × 5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix:
Swap two neighboring matrix rows, that is, rows with indexes i and i + 1 for some integer i (1 ≤ i < 5).
Swap two neighboring matrix columns, that is, columns with indexes j and j + 1 for some integer j (1 ≤ j < 5).
You think that a matrix looks beautiful, if the single number one of the matrix is located in its middle (in the cell that is on the intersection of the third row and the third column). Count the minimum number of moves needed to make the matrix beautiful.
Input
The input consists of five lines, each line contains five integers: the j-th integer in the i-th line of the input represents the element of the matrix that is located on the intersection of the i-th row and the j-th column. It is guaranteed that the matrix consists of 24 zeroes and a single number one.
Output
Print a single integer — the minimum number of moves needed to make the matrix beautiful.
Sample test(s)
input
output
input
output
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You've got a 5 × 5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix:
Swap two neighboring matrix rows, that is, rows with indexes i and i + 1 for some integer i (1 ≤ i < 5).
Swap two neighboring matrix columns, that is, columns with indexes j and j + 1 for some integer j (1 ≤ j < 5).
You think that a matrix looks beautiful, if the single number one of the matrix is located in its middle (in the cell that is on the intersection of the third row and the third column). Count the minimum number of moves needed to make the matrix beautiful.
Input
The input consists of five lines, each line contains five integers: the j-th integer in the i-th line of the input represents the element of the matrix that is located on the intersection of the i-th row and the j-th column. It is guaranteed that the matrix consists of 24 zeroes and a single number one.
Output
Print a single integer — the minimum number of moves needed to make the matrix beautiful.
Sample test(s)
input
0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
output
3
input
0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0
output
1 行数列数各减三去绝对值求和 附代码:
#include<stdio.h> int main( void) { int in, i, j, ans=0, temp1, temp2; for( i=1; i<=5; i++) for( j=1; j<=5; j++) { scanf("%d", &in); if( in==1) { temp1=i-3; temp2=j-3; } } if( temp1<0 ) temp1*=-1; if( temp2<0 ) temp2*=-1; ans+=temp1; ans+=temp2; printf("%d\n", ans); return 0; }
相关文章推荐
- codeforces 161 Div2 B
- codeforces基础题——#161(div2) E
- 【codeforces】Codeforces Round #283 (Div. 2) 【题解】
- 【Codeforces】Codeforces Round #373 (Div. 2)
- CodeForces 498A Round #284 div1A(div2C) Crazy Town
- Codeforces Round #439 (Div. 2) Problem C (Codeforces 869C) - 组合数学
- codeforces-div1-284-D
- CodeForces 601A The Two Routes(dijkstra最短路)——Codeforces Beta Round #333 (Div.1 Div. 2)
- [Codeforces]Educational Codeforces Round 37 (Rated for Div. 2)
- Codeforces Div. 2 #257-C. Jzzhu and Chocolate
- Codeforces 285 div2 b
- 【codeforces】Codeforces Round #277 (Div. 2) 解读
- Codeforces 410 div 2 【解题报告】
- Codeforces #211 (Div. 2) A. Soroban
- codeforces 170 div2 C
- CodeForces-428-div2-c
- Codeforces Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) B. Batch Sort(暴力)
- Codeforces Beta Round #29 (Div. 2, Codeforces format) C. Mail Stamps 拓扑排序
- codeforces 428(div2) A-D
- 【Codeforces】Round #376 (Div. 2)