Okabe and Future Gadget Laboratory CodeForces - 821A
2017-07-28 16:46
429 查看
题意:告诉你n*n的矩阵,问对于其中任意一个不为1的数,是否有 当前行的某个数+当前列的某个数== 这个数
思路:暴力穷举, n <=50
思路:暴力穷举, n <=50
#include <bits/stdc++.h> using namespace std; int a[55][55]; int n; bool check(int x,int y) { for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(i==y || j==x) continue; if(a[x][i]+a[j][y]==a[x][y]) return true; } } return false; } int main(void) { cin >> n; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&a[i][j]); for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(a[i][j]!=1) { if(check(i,j)==false) { printf("No\n"); return 0; } } } } printf("Yes\n"); return 0 ; }
相关文章推荐
- Codeforces 821A-Okabe and Future Gadget Laboratory
- Okabe and Future Gadget Laboratory
- #420 A. Okabe and Future Gadget Laboratory(Div.2)
- Codeforces 821 A. Okabe and Future Gadget Laboratory
- CF821A-Okabe and Future Gadget Laboratory
- Okabe and Future Gadget Laboratory
- Codeforces Round #420 (Div. 2) A. Okabe and Future Gadget Laboratory
- CF #420 A. Okabe and Future Gadget Laboratory
- 【Codeforces Round #420 (Div. 2) A】Okabe and Future Gadget Laboratory
- A. Okabe and Future Gadget Laboratory
- #420 Div.2 A. Okabe and Future Gadget Laboratory——暴力
- Codeforces Round #420 (Div. 2) E. Okabe and El Psy Kongroo
- Codeforces Round #420 B. Okabe and Banana Trees
- D - Okabe and City CodeForces - 821D
- Okabe and El Psy Kongroo CodeForces - 821E【DP+矩阵快速幂】
- Codeforces Round #420 C. Okabe and Boxes
- D. Okabe and City codeforces 最短路
- codeforces B. Okabe and Banana Trees 结论题
- Okabe and Banana Trees CodeForces - 821B
- Codeforces Round #420 (Div. 2) D. Okabe and City (最短路)