UVA-644 Immediate Decodability

原题链接：

https://vjudge.net/problem/UVA-644

AC代码：

#include <bits/stdc++.h>
using namespace std;int main()
{string a[26];int t = 0;int flag = 0;int cases = 1;while (getline(cin, a[t])){if (a[t][0] == '9'){for (int i = 0; i < t; i++){for (int j = 0; j < t; j++){if (i == j)continue;int len = min(a[i].length(), a[j].length());int cnt = 0;for (int k = 0; k < len; k++){if (a[i][k] == a[j][k]){cnt++;}elsebreak;}if (cnt == len){flag = 1;}}}if (flag)cout << "Set " << cases << " is not immediately decodable" << endl;elsecout << "Set " << cases << " is immediately decodable" << endl;cases++;t = 0;flag = 0;}elset++;}return 0;
}

直接暴力

UVA-644 Immediate Decodability相关推荐

UVA 644 - Immediate Decodability
枚举. 第一次遇见: Your submission with number ***** for the problem 644 - Immediate Decodability has failed ...
644 - Immediate Decodability
题目http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem& ...
提取了下刘汝佳推荐的题号...
今天闲来没事上uva oj提取了下刘汝佳推荐的acm题号,原始数据如下: Volume 0. Getting Started 10055 - Hashmat the Brave Warrior ...
初学者acm的练习题指南
上机练习题参考题忘了在哪找的啦~~希望对大家有帮助呦 1. Programming Bas ...
UVa Online Judge 工具網站
UVa Online Judge 工具網站转自http://www.csie.ntnu.edu.tw/~u91029/uva.html Lucky貓的ACM園地,Lucky貓的 ACM 中譯題目 M ...
[搜索]UVa 129 困难的串
题意:将一个包含两个相邻的重复子串的子串,称为"容易的串",其他为"困难的串". 输入正整数n和l,输出由前l个字符组成的,字典序第n小的困难的串. 输入样例: ...
uva 401.Palindromes
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem ...
Uva 3767 Dynamic len(set(a[L:R])) 树套树
Dynamic len(set(a[L:R])) Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 https://uva.onlinejudge.org/in ...
UVA 11752 超级幂
UVA 11752 超级幂 Z - The Super Powers Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & ...
UVa 11174 - Stand in a Line
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&p ...

UVA-644 Immediate Decodability

UVA-644 Immediate Decodability相关推荐

最新文章

热门文章