Okabe and Future Gadget Laboratory CodeForces
来源:互联网 发布:北斗测亩仪软件下载 编辑:程序博客网 时间:2024/06/01 10:51
题意:告诉你n*n的矩阵,问对于其中任意一个不为1的数,是否有 当前行的某个数+当前列的某个数== 这个数
思路:暴力穷举, 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 ;}
阅读全文
0 0
- Okabe and Future Gadget Laboratory CodeForces
- Okabe and Future Gadget Laboratory
- Codeforces 821 A. Okabe and Future Gadget Laboratory
- Codeforces 821A-Okabe and Future Gadget Laboratory
- Codeforces 821A Okabe and Future Gadget Laboratory 题解
- CodeForces 821A Okabe and Future Gadget Laboratory
- Codeforces Round #420 A. Okabe and Future Gadget Laboratory
- CF821A-Okabe and Future Gadget Laboratory
- Codeforces821A Okabe and Future Gadget Laboratory
- A. Okabe and Future Gadget Laboratory
- Codeforces Round #420 (Div. 2) A. Okabe and Future Gadget Laboratory
- #420 A. Okabe and Future Gadget Laboratory(Div.2)
- CodeFroces 821A Okabe and Future Gadget Laboratory
- CF #420 A. Okabe and Future Gadget Laboratory
- #420 Div.2 A. Okabe and Future Gadget Laboratory——暴力
- Okabe and Boxes CodeForces
- Codeforces#420 Okabe and Boxes
- Okabe and Banana Trees CodeForces
- 拦截器和文件上传和Struts2AJAX学习笔记
- MUI添加自定义icon图标 阿里巴巴矢量图标
- MindManager教你做一份完美的笔记
- Qt打开外部程序
- Android之library_PullToRefresh实现下拉刷新
- Okabe and Future Gadget Laboratory CodeForces
- Android6.0 获取MAC地址
- 写给大数据开发初学者的话
- 没有免费的午餐定理 NFL:(No Free Lunch Theorem)
- vue.js的devtools安装
- 集成Structs1.x
- Hdu 2568 How far away? LCA
- 2017 多校训练第二场 HDU 6050 Funny Function
- AMS-启动AMS(AMS在SystemServer中的调用轨迹)