- 博客(77)
- 收藏
- 关注
RSS订阅
原创 [索引]AOAPC I: Beginning Algorithm Contests (Rujia Liu)
AOAPC I: Beginning Algorithm Contests (Rujia Liu)
2014-08-14 08:38:14
1172
原创 [索引] Rujia Liu's Problems for Beginners
AOAPC I: Beginning Algorithm Contests (Rujia Liu) Volume 3. Brute Force::Rujia Liu's Problems for Beginners11218 - KTV11198 - Dancing Digits10274 - Fans and Gems11210 -
2014-08-30 19:11:25
746
原创 [索引] 哈希 / STL集合
AOAPC I: Beginning Algorithm Contests (Rujia Liu) Volume 3. Brute Force::Hashing / Sets188 - Perfect Hash10282 - Babelfish10391 - Compound Words10125 - Sumsets10887 - Co
2014-08-30 19:11:00
749
原创 [索引] 隐式图
AOAPC I: Beginning Algorithm Contests (Rujia Liu) Volume 3. Brute Force::Implicit Graph Traversal10603 - Fill10422 - Knights in FEN10085 - The most distant state310 - L-
2014-08-30 19:05:11
963
1原创 [索引] 回溯 - 困难
AOAPC I: Beginning Algorithm Contests (Rujia Liu) Volume 3. Brute Force::Backtracking - Hard10123 - No Tipping10160 - Servicing Stations197 - Cube185 - Roman Numerals307 - S
2014-08-30 10:46:27
707
原创 [索引] 回溯 - 简单
AOAPC I: Beginning Algorithm Contests (Rujia Liu) Volume 3. Brute Force::Backtracking - Easy10474 - Where is the Marble?216 - Getting in Line639 - Don't Get Rooked539 -
2014-08-30 10:36:11
1535
原创 [索引] 直接枚举、下一次排列
AOAPC I: Beginning Algorithm Contests (Rujia Liu) Volume 3. Brute Force::Elementary Skills10167 - Birthday Cake11205 - The Broken Pedometer131 - The Psychic Poker Player146
2014-08-30 10:33:32
712
原创 uva 10624(dfs)
题意：题解：#include #include using namespace std;const int N = 100;int val[N], n, m, flag;int judge(int cur) { int k = 0; for (int i = 1; i <= cur; i++) { k = k * 10 + val[i]; k = k % cur;
2014-08-30 10:24:54
718
原创 hdu 1495(bfs)
题解：gei#include #include #include #include using namespace std;const int N = 105;struct ST { int ke[3]; int step;}st, st1;queue q;int vis[N][N];int n, m, s, flag[3];int judge(ST temp)
2014-08-29 18:40:26
759
原创 fzu 2064(暴力)
题解：三层循环，连找n个0ji#include #include const int N = 105;int m[N][N], row, col, ans, n;int main() { int t; scanf("%d", &t); while (t--) { ans = 0; scanf("%d%d%d", &row, &col, &n); for (int
2014-08-29 18:22:54
625
原创 uva 11218(暴力求解)
题意：9个人ch题解：#include #include const int N = 90;int n, com[N][3], score[N], vis[10];int main() { int cases = 1; while (scanf("%d", &n) && n) { for (int i = 0; i < n; i++) { for (int j =
2014-08-27 21:43:43
954
原创 uva 141(哈希)
题意：题解：#include #include #include #include #include #include using namespace std;const int N = 55;int n, row, col, ans1, ans2, flag;string keep;char m[N][N];char c;map vis;string has
2014-08-27 18:47:38
912
原创 uva 10887(哈希)
题意：把两次给出的单词题解：#include #include #include #include #include using namespace std;const int N = 1005;string str1[N], str2[N];map m;int main() { int t, n1, n2, cases = 1, ans; scanf
2014-08-26 23:41:39
847
原创 uva 10282(哈希)
题意：题解：#include #include #include #include using namespace std;string str;map m;int n;int main() { int i; m.clear(); while (getline(cin, str)) { if (str == "") break; else {
2014-08-26 18:29:23
745
原创 uva 10391(哈希)
题意：给出一堆单词，输出其中能切开分成两个同样出现在这些单词里的单词，按字典序输出。题解：先读入，然后按长短排个序，然后在hash()里分出两个子串，判断是否出现过，如果是就放到另一个数组内，最后排序输出。#include #include #include #include #include #include using namespace std;const int
2014-08-26 10:01:47
742
原创 uva 321(隐式图搜索)
题意：题解：#include #include #include #include using namespace std;const int N = 15;const int MAX = 800;struct ST { int room, step, lst, step1[MAX], step2[MAX];}st, st1, ans;int r, d, s,
2014-08-26 09:02:43
864
原创 uva 310(隐式图搜索)
题意：题解：#include #include #include #include #include #include #include using namespace std;string a, b, sta, fin;queue q;int flag;map m;void init() { flag = 0; while (!q.empty()) q
2014-08-25 13:52:59
765
原创 [索引] 数学 - 几何
::Maths - Simple Geometry10250 - The Other Two Trees579 - ClockHands375 - Inscribed Circles and Isosceles Triangles10387 - Billiard10112 - Myacm Triangles
2014-08-24 19:07:30
760
原创 [索引] 数学 - 数论
AOAPC I: Beginning Algorithm Contests (Rujia Liu) Volume 1. Elementary Problem Solving::Maths - Number Theory575 - Skew Binary10110 - Light, more light550 - Multiply
2014-08-24 19:01:48
623
原创 [索引] 图
AOAPC I: Beginning Algorithm Contests (Rujia Liu)Volume 2. Data Structures::Graphs572 - Oil Deposits657 - The die is cast784 - Maze Exploration705 - Slash Maze439 - Knight Moves532 - Dungeon M
2014-08-24 18:49:20
717
原创 uva 705(图)
题意：gangkais题解：#include #include const int N = 250;int row, col, pos[N][N], flag, count, max, step;int flag1[4] = {0, 0, 1, -1};int flag2[4] = {1, -1, 0, 0};void init() { memset(pos, 0, si
2014-08-24 18:44:26
782
原创 [索引] 二叉树
AOAPC I: Beginning Algorithm Contests (Rujia Liu)Volume 2. Data Structures::Browse Problems112 - Tree Summing548 - tree297 - Quadtrees712 - S-Trees699 - The Falling Leaves327 - Evaluating Simp
2014-08-24 17:32:54
902
原创 [索引] 线性表
AOAPC I: Beginning Algorithm Contests (Rujia Liu) Volume 1. Elementary Problem Solving::Big Number
2014-08-24 17:27:39
834
原创 uva 10603(隐式图搜索)
题意：给出三个杯子的容量，前两个是空的，第三个装满水，然后给出了一个目标水量，问如果杯子之间的水互相倾倒（一杯空或另一杯满算倒水一次）是否某个杯子里的水能达到目标水量，如果可以输出最小倒水量和目标水量的值，否则将目标水量减少，最接近目标水量且能够实现的同样输出最小倒水量和此时目标水量的值。题解：普通的倒水用bfs能够得到最少倒水次数以达到目标水量，但是这道题让求的是最少倒水量，所以在原本b
2014-08-23 19:58:53
787
原创 uva 502(模拟)
题意：题解：#include #include #include #include using namespace std;const int N = 1000 + 5;string str[N];string del1[N];string del2[N];string save1[N];string save2[N];char ans1[N];char ans2
2014-08-23 00:04:07
690
原创 uva 565(暴力+枚举)
题意：题解：#include #include #include #include #include using namespace std;const int N = 100;string s[N];int n;struct ST { int ye, no;}sta[N];void init() { n = 0; memse
2014-08-21 17:16:15
810
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人