EOJ-自适应编程学习平台

//********** Specification of Intersction **********
int Intersection(int s1[],int n1,int s2[],int n2,int r[]){
/* 
   PreCondition: 集合元素存放在s1,s2中；n1, n2分别为两个集合大小
   PostCondition: s1和s2的交集存放在r中，元素按由小到大存放；返回交集中元素个数
*/
}

#include <stdio.h>
#include <stdlib.h>
#define N 100

int Intersection(int s1[],int n1,int s2[],int n2,int r[])
{
    // Todo: your function definition
}
int main()
{
    int n1,n2,i;
    int s1[N],s2[N],r[N];

    scanf("%d",&n1);
    for(i=0;i<n1;i++)
        scanf("%d",&s1[i]);

    scanf("%d",&n2);
    for(i=0;i<n2;i++)
        scanf("%d",&s2[i]);

    int n=Intersection(s1,n1,s2,n2,r);
    for(i=0;i<n;i++)
        printf("%d ",r[i]);
    putchar('\n');

    return 0;
}