排序
YancyKahn
这个作者很懒,什么都没留下…
展开
-
Uva-10008 (What's Cryptanalysis? )
题目链接 : https://vjudge.net/problem/UVA-10008 #include #include #include #include using namespace std; struct _Node{ char key; int cnt; bool operator < (_Node rhs) { if(原创 2018-01-13 23:22:16 · 406 阅读 · 0 评论 -
Uva-10020 (Minimal coverage)
题目链接: https://vjudge.net/problem/UVA-10020 #include #include #include using namespace std; struct _Node{ int left; int right; }; bool cmp(_Node rhs1, _Node rhs2) { return rhs1.left原创 2018-01-13 23:23:53 · 339 阅读 · 0 评论 -
Uva-10026 (Shoemaker's Problem)
题目链接: https://vjudge.net/problem/UVA-10026 #include #include #include #include using namespace std; const int MAXN = 1001; struct _Node{ int num; int time; int fine; }; bool cmp(原创 2018-01-13 23:25:02 · 257 阅读 · 0 评论 -
Uva-10062 (Tell me the frequencies!)
题目链接: https://vjudge.net/problem/UVA-10062 #include #include #include #include using namespace std; struct _Node{ char key; int cnt; }; const int MAXN = 1001; _Node arr[129]; char ke原创 2018-01-13 23:26:23 · 392 阅读 · 0 评论 -
Uva - 10152 (ShellSort)
题目链接: https://vjudge.net/problem/UVA-10152 #include #include #include using namespace std; const int MAXN = 256; char target[MAXN][MAXN]; char pattern[MAXN][MAXN]; int main() { int t, n;原创 2018-01-13 23:27:48 · 342 阅读 · 0 评论