UVA - 10474 Where is the Marble?
2016-07-08 16:13
573 查看
题目大意:输入 N 个数和 Q 个数,求这 Q 个数分别是 N 中从小到大数的第几个,如果不在 N 中,输出 not found。
解题思路:排序后判断。数组开太小 RE 了一次。以后开数组还是豪气一点比较好- -
解题思路:排序后判断。数组开太小 RE 了一次。以后开数组还是豪气一点比较好- -
#include<iostream> #include<cstdio> #include<string.h> #include<stdlib.h> using namespace std; int a[10000]; int count = 0; int cmp(const void *a, const void *b){ return *(int*)a-*(int*)b; } int main() { int N, Q; while(scanf("%d%d", &N, &Q) != EOF && N && Q) { memset (a, 0, sizeof(a)); for (int i = 0; i < N; i++) scanf("%d", &a[i]); qsort(a, N, sizeof(int), cmp); printf("CASE# %d:\n", ++count); while (Q--) { int x, tag = 0; scanf("%d", &x); for(int i = 0; i < N; i++) if(x == a[i]) { printf("%d found at %d\n", x, i+1); tag = 1; break; } if (!tag) printf("%d not found\n", x); } } return 0; }
相关文章推荐
- 1.10055 - Hashmat the brave warrior
- 2.10071 - Back to High School Physics
- 3.458 - The Decoder
- 4.694 - The Collatz Sequence
- 6.494 - Kindergarten Counting Game
- 7.490 - Rotating Sentences
- 8.414 - Machined Surfaces
- 9.488 - Triangle Wave
- A.457 - Linear Cellular Automata
- B.489 - Hangman Judge
- C.445 - Marvelous Mazes
- 1.10494 - If We Were a Child Again
- 2.424 - Integer Inquiry
- 3.10250 - The Other Two Trees
- 5.465 - Overflow
- 6.113 - Power of Cryptography
- 7.10161 - Ant on a Chessboard
- 8.621 - Secret Research
- 9.401 - Palindromes
- A.537 - Artificial Intelligence?