CF 236 A Beautiful Matrix
2016-04-14 13:27
162 查看
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.
Examples
Input
Output
Input
Output
题意:给出一个1 , 最少移动多少步可以到达最中间; 找出坐标判断一下就好了;
AC代码:
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.
Examples
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
题意:给出一个1 , 最少移动多少步可以到达最中间; 找出坐标判断一下就好了;
AC代码:
#include <bits/stdc++.h> using namespace std ; int main() { int a[6][6]; int x , y ; memset(a,0,sizeof(a)); for(int i = 1 ; i<=5;i++) { for(int j = 1 ; j<=5;j++) { cin>>a[i][j]; if(a[i][j]==1) { x = i ; //*X存行 y = j ; //*Y存列; } } } int ans = 0 ; if(x<=3) ans += 3-x ; else ans+= x - 3 ; if(y<=3) ans+= 3 - y ; else ans+= y -3 ; cout<<ans<<endl; return 0 ; }
相关文章推荐
- hdu 1402 A * B Problem Plus(快速傅里叶变换模板)
- poj 3178 Backward Digit Sums (全排列)
- Android IPC机制(四):细说Binder连接池
- 厨子与大厨:伊隆·马斯克的独家配方(下)
- android 启动Activity的四种模式
- Aizu 0005 GCD and LCM【辗转相除法】
- json api 接口们地址
- 正则表达式-检测昵称是否是有汉字字母数字下划线组成,6-8位
- Redis资料整理
- Android唤醒屏幕
- 70. Climbing Stairs
- C++vector方法详解
- MySQL修改数据库编码为UTF8
- 厨子与大厨:伊隆·马斯克的独家配方(上)
- spring常用的工具类
- winbuilder安装及使用
- poj1061青蛙的约会
- The Cook and the Chef: Musk’s Secret Sauce
- 二叉搜索树的后序遍历序列
- CDOJ 1135 邱老师看电影 概率dp