Problem A: CD

Problem A: CD

时间: 10ms        内存:128M

描述:

Problem A: CD

Jack and Jill have decided to sell some of their Compact Discs, while they still have some value. They have decided to sell one of each of the CD titles that they both own. How many CDs can Jack and Jill sell?

Neither Jack nor Jill owns more than one copy of each CD.

输入:

The input consists of a sequence of test cases. The first line of each test case contains two non-negative integers N and M, each at most one million, specifying the number of CDs owned by Jack and by Jill, respectively. This line is followed by N lines listing the catalog numbers of the CDs owned by Jack in increasing order, and M more lines listing the catalog numbers of the CDs owned by Jill in increasing order. Each catalog number is a positive integer no greater than one billion. The input is terminated by a line containing two zeros. This last line is not a test case and should not be processed.

输出:

For each test case, output a line containing one integer, the number of CDs that Jack and Jill both own.

示例输入:

3 3
1
2
3
1
2
4
0 0

示例输出:

2

提示:

参考答案(内存最优[756]):

#include <stdio.h>
#include <assert.h>

int i,j,n, s[2000];
main(){
   while (1 == scanf("%d",&n) && n) {
      for (i=0;i<n;i++) scanf("%d",&s[i]);
      for (i=0;i<1322;) {
         for (j=0;j < n && (s[j] <= i || s[j] > i+200); j++) {}
         if (j == n) break;
         i = s[j];
      }
      if (i < 1322) printf("IMPOSSIBLE\n");
      else printf("POSSIBLE\n");
   }
   assert(!n);
}

参考答案(时间最优[4]):

#include <stdio.h>
#include <assert.h>

int i,j,n, s[2000];
main(){
   while (1 == scanf("%d",&n) && n) {
      for (i=0;i<n;i++) scanf("%d",&s[i]);
      for (i=0;i<1322;) {
         for (j=0;j < n && (s[j] <= i || s[j] > i+200); j++) {}
         if (j == n) break;
         i = s[j];
      }
      if (i < 1322) printf("IMPOSSIBLE\n");
      else printf("POSSIBLE\n");
   }
   assert(!n);
}

题目和答案均来自于互联网,仅供参考,如有问题请联系管理员修改或删除。

点赞

发表评论

电子邮件地址不会被公开。必填项已用 * 标注