ZOJ 3198 Intersection of Two Sets
2010-08-20 19:59
399 查看
]// ZOJ3198.cpp : 定义控制台应用程序的入口点。 // #include "stdio.h" #include "stdlib.h" int main() { int N; scanf("%d",&N); while(N--) { int s1[100001],s2[100001]; int n1,n2; int count=0; scanf("%d",&n1); for (int i = 0; i < n1; ++i ) { scanf("%d",&s1[i]); } scanf("%d",&n2); for (int i = 0; i < n2; ++i ) { scanf("%d",&s2[i]); } int i=0,j=0; while(i<n1&&j<n2){ if (s1[i]<s2[j]) { ++i; } else if (s2[j]<s1[i]) { ++j; } else { ++count; ++i; ++j; } } printf("%d/n",count); } return 0; }
相关文章推荐
- ZOJ 3198 Intersection of Two Sets
- ZOJ 3198 Intersection of Two Sets
- zoj 3198 Intersection of Two Sets
- ZOJ 3198 Intersection of Two Sets
- Finding intersection and union of two sets.
- lintcode 中等题:Intersection of Two Linked Lists 两个链表的交叉
- Intersection of Two Linked Lists
- leetcode---Intersection of Two Linked Lists
- Leetcode-Intersection of Two Arrays-Python
- Leetcode #349 Intersection of Two Arrays
- *Intersection of Two Linked Lists
- leetcode之Intersection of Two Linked Lists
- LeetCode 160 Intersection of Two Linked Lists
- LeetCode编程练习 - Intersection of Two Linked Lists学习心得
- Intersection of Two Linked Lists
- Intersection of Two Arrays II 两数组的交
- Leetcode 之 Intersection of Two Arrays II
- [Leetcode]-Intersection of Two Linked Lists
- LeetCode题解——Intersection of Two Linked Lists
- 【leetcode】Intersection of Two Linked Lists