排序与检索
冰阔落
Stay hungry, Stay foolish, Stop when you are perfect.
展开
-
UVA 120 - Stacks of Flapjacks
题目大意:一摞盘子,从上到下。个数N:1~30,盘子直径D,1~100,求:每次只能执行从顶部到某一个的反转,也就是像堆栈一样,先倒出来,再倒回去,最终实现,从顶到底有序(升序)。输出每次反转的位置(即每次反转的底层位置),编号从底到顶从1~N。(没要求最优,能够实现就可以)。 解题思路:模拟。原创 2014-08-19 11:01:54 · 1535 阅读 · 0 评论 -
UVA 10420 (暑假-排序、检索 -B - List of Conquests)
#include #include //#include #include using namespace std; int strcompare(const void *_a, const void *_b) { char *a = (char*)_a; char *b = (char*)_b; return strcmp(a, b); } int main() { con原创 2014-07-12 10:05:37 · 1697 阅读 · 0 评论 -
UVA 10785 (暑假-排序、检索(2)-E-The Mad Numerologist )
#include #include #include #include using namespace std; int main() { char sound[] = {"AUEOI"}; char consonant[] = {"JSBKTCLDMVNWFXGPYHQZR"}; int t, k = 0; scanf("%d", &t); while (k++ < t原创 2014-07-26 14:23:29 · 1605 阅读 · 0 评论 -
UVA 299 Train Swapping
#include int main() { int t; scanf("%d", &t); while (t--) { int n; scanf("%d", &n); int arr[60] = {0}; for (int i = 0; i < n; i++) scanf("%d", &arr[i]); for (int i = 0; i < n; i++)原创 2014-07-28 09:48:39 · 1513 阅读 · 0 评论 -
UVA 10474 (暑假-排序、检索 -C - Where is the Marble?)
#include int main() { int n, q; int count = 0; while (scanf("%d%d", &n, &q) && n) { printf("CASE# %d:\n", ++count); int arr[10100], brr[10100]; for (int i = 0; i < n; i++) { scanf("%d",原创 2014-07-27 20:17:52 · 1558 阅读 · 0 评论 -
UVA 755 (暑假-排序、检索(2)-D-487--3279 )
#include #include #include #include #include using namespace std; char chan[27] = {"22233344455566677778889999"}; //字符变为数字函数 int change(char *str) { int sum = 0; for (int i = 0; i < strlen(s原创 2014-07-26 14:18:35 · 1496 阅读 · 0 评论 -
UVA 123 (暑假-排序、检索(2)-B-Searching Quickly)
#include #include #include #include using namespace std; int cmp_string(const void *_a, const void *_b) { return strcmp((char*)_a, (char*)_b); } int main() { char word[55][15]; char title[210原创 2014-07-26 14:18:58 · 1771 阅读 · 0 评论 -
UVA 400 (暑假-排序、检索(2)-F- Unix ls)
#include #include #include int cmp(const void *a,const void *b) { return strcmp((char *)a,(char *)b); } int main() { int i,j,k,max_len,n; int h_num,l_num,num_len; char str[110][100]; while(scanf(原创 2014-07-26 14:25:57 · 1555 阅读 · 0 评论 -
UVA 156 (暑假-排序、检索(2)-A-Ananagrams)
#include #include #include using namespace std; int cmp_char(const void *_a, const void *_b) { char *a = (char*)_a; char *b = (char*)_b; return *a - *b; } int cmp_string(const void *_a, const原创 2014-07-26 14:09:44 · 1582 阅读 · 0 评论 -
UVA 152 (暑假-排序、检索 -D - Tree's a Crowd)
#include #include int main() { int arr[100010][3]; int n = 0 ; for ( int i = 0; scanf("%d%d%d", &arr[i][0], &arr[i][1], &arr[i][2]) && (arr[i][0] || arr[i][1] || arr[i][2]); i++, n++); int brr[原创 2014-07-28 08:51:30 · 1634 阅读 · 0 评论 -
UVA 340 (暑假-排序、检索 -A - Master-Mind Hints)
#include #include int main() { const int Max = 1050; int str_1[Max], str_2[Max], str_3[Max]; int t = 1, n; while (scanf("%d", &n), n) { //getchar(); printf("Game %d:\n", t++); // gets(str原创 2014-07-12 10:10:22 · 1592 阅读 · 0 评论