codeforce Mystical Mosaic(VK Cup 2018 - Round 2)
2018-03-28 19:28
330 查看
#include<bits/stdc++.h> using namespace std; long long a[55]; int n,m; char s[55]; int main() { scanf("%d%d",&n,&m); for(int i=0;i<n;i++) { scanf("%s",s); for(int j=0;s[j];j++) a[i]=a[i]*2+(s[j]=='#'); } for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) { if(a[i]&a[j]&&a[i]!=a[j]) { printf("No\n"); return 0; } } printf("Yes\n"); return 0; }
相关文章推荐
- 【剁手】CodeForce Round 168 Div B1(熬夜就水出来一个我操)
- Codeforces Round #278 (Div. 2) B. Candy Boxes [brute force+constructive algorithms]
- codeforce round 247 div.2 B
- VK Cup 2018 - Round 1 A. Primal Sport
- VK Cup 2018 Round 2: D. Contact ATC(思维+树状数组)
- Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)
- Codeforces Round #504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) E. Down or Right
- Codeforce Round #219 Div2
- Codeforce Educational Round 6
- Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)
- CodeForce Round 219 Div2 E Watching Fireworks is Fun 单调队列DP
- Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)
- Codeforce Round #211 Div2
- Codeforce Round #400 C 签到题
- Codeforce Round #382 (div 1) A
- Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)
- VK Cup 2018 - Round 2 C - Riverside Curio 贪心
- Codeforce Round #224 Div2
- codeforce round 170 A. Learning Languages
- VK Cup 2018 Round 1: D. Picking Strings