Codeforces Round #209 (Div. 2) A. Table
2014-03-15 18:38
357 查看
#include <iostream> #include <vector> using namespace std; int main(){ int n,m; cin >> n >> m; int a[50][50]; bool flag = false; for(int i = 0 ; i < n ; ++ i){ for(int j = 0; j < m ; ++ j){ cin >> a[i][j]; } } for(int j = 0; j < m; ++ j){ if(a[0][j] || a[n-1][j]){ flag = true; break; } } for(int i =0 ; i < n ; ++ i){ if(a[i][0] || a[i][m-1]){ flag = true; break; } } if(flag) cout<<2<<endl; else cout<<4<<endl; }
相关文章推荐
- Codeforces Round #209 (Div. 2) A.Table
- Codeforces Round #209 (Div. 2) Problem A Table(找规律)
- Codeforces Round #209 (Div. 2) B && Codeforces 359 B(构造)
- Codeforces Round #209 (Div. 2)——Prime Number
- Codeforces Round #140 (Div. 1) D. The table 构造
- Codeforces Round #243 (Div. 2)——Sereja and Table
- Codeforces Round #345 (Div. 2) E. Table Compression
- Codeforces Round #209 (Div. 2)思路
- Codeforces Round #144 (Div. 1), problem: (B) Table DP 组合数学
- 【Codeforces Round 345 (Div 1) C】【并查集缩环+拓扑最长路】Table Compression nm矩形权值缩小大小关系不变
- Codeforces Round #345 (Div. 2) E. Table Compression 并查集
- Codeforces Round #397(Div. 1 + Div. 2 combined)C. Table Tennis Game 2【贪心】
- Codeforces Round #209 (Div. 2)C
- Codeforces Round #163 (Div. 2) / 226A Stones on the Table (字符串处理)
- Codeforces Round #100 (Div. 2) A - New Year Table
- Codeforces Round #140 (Div. 1)D The table 贪心
- 【Codeforces Round 323 (Div 2)C】【观察找规律 STL map】GCD Table 从GCD矩阵中找出所有原始元素
- Codeforces Round #209 (Div. 2) B. Permutation
- Codeforces Round #210 (Div. 2) A. Levko and Table
- 【Codeforces Round 354 (Div 2)B】【简单模拟】Pyramid of Glasses