fork download
  1. #include <algorithm>
  2. #include <bitset>
  3. #include <cassert>
  4. #include <climits>
  5. #include <cmath>
  6. #include <cstdio>
  7. #include <cstdlib>
  8. #include <cstring>
  9. #include <deque>
  10. #include <iomanip>
  11. #include <iostream>
  12. #include <map>
  13. #include <numeric>
  14. #include <queue>
  15. #include <set>
  16. #include <stack>
  17. #include <string>
  18.  
  19. #ifdef PRINTERS
  20. #include "printers.hpp"
  21. using namespace printers;
  22. #define tr(a) cerr<<#a<<" : "<<a<<endl;
  23. #else
  24. #define tr(a)
  25. #endif
  26.  
  27. #define ll long long
  28. #define pb push_back
  29. #define mp make_pair
  30. #define pii pair<int,int>
  31. #define vi vector<int>
  32. #define all(a) (a).begin(),(a).end()
  33. #define F first
  34. #define S second
  35. #define sz(x) (int)x.size()
  36. #define hell 1000000007
  37. #define endl '\n'
  38. #define rep(i,a,b) for(int i=a;i<b;i++)
  39. #define rep1(i,b) for(int i=1;i<=b;i++)
  40. using namespace std;
  41.  
  42.  
  43.  
  44. void solve()
  45. {
  46. int n;
  47. int A[n][n],c[n][n];
  48. rep(i,0,n){
  49. rep(j,0,n){
  50. cin>>A[i][j];
  51. c[i][j]=0;
  52. }
  53. }
  54.  
  55. rep(i,0,n){
  56. rep(j,0,n){
  57. if(A[i][j]>1)
  58. {
  59.  
  60. rep(k,0,n){
  61. rep(l,0,n){
  62. if(A[i][j] == A[i][l] +A[k][j])
  63. {c[i][j]=1;}
  64. else continue;
  65. }
  66. }
  67. }
  68. else {c[i][j]=1;}
  69. }
  70. }
  71. bool flag=0;
  72. rep(i,0,n){
  73. rep(j,0,n){
  74. if(c[i][j]==0)
  75. flag =1;
  76. }
  77. }
  78. if(flag==1) cout<<"Yes"<<endl;
  79. else cout<<"No"<<endl;
  80. }
  81.  
  82. int main(){
  83. ios_base::sync_with_stdio(false);
  84. cin.tie(0);
  85. cout.tie(0);
  86. int t=1;
  87. //cin>>t;
  88. while(t--){
  89. solve();
  90. }
  91. return 0;
  92. }
  93.  
  94.  
  95.  
Success #stdin #stdout 0s 16064KB
stdin
Standard input is empty
stdout
No