So easy

Problem Description

Small W gets two files. There are n integers in each file. Small W wants to know whether these two files are same. So he invites you to write a program to check whether these two files are same. Small W thinks that two files are same when they have the same integer set.
For example file A contains (5,3,7,7),and file B contains (7,5,3,3). They have the same integer set (3,5,7), so they are same.
Another sample file C contains(2,5,2,5), and file D contains (2,5,2,3).
The integer set of C is (2,5),but the integer set of D is (2,3,5),so they are not same.
Now you are expected to write a program to compare two files with size of n.

Input

Multi test cases (about 100). Each case contain three lines. The first line contains one integer n represents the size of file. The second line contains n integers a1,a2,a3,…,an - represents the content of the first file. The third line contains n integers b1,b2,b3,…,bn - represents the content of the second file.
Process to the end of file.
1≤n≤100
1≤ai,bi≤1000000000

Output

For each case, output "YES" (without quote) if these two files are same, otherwise output "NO" (without quote).

Sample Input

1 1 2

1 2 2

5 3 7 7

7 5 3 3

2 5 2 3

2 5 2 5

1 2 3

1 2 4

Sample Output

YES

 #include <stdio.h> 

 int main(){

     int n;

     int number;

     int i;

     int j;

     int array1[];

     int array2[];

     int length1;

     int length2;

     int temp;

     while(scanf("%d",&n)!=EOF){

         length1=;

         for(i=;i<n;i++){

             scanf("%d",&number);

             if(i==){

                 array1[]=number;

                 length1++;

                 continue;

             }

             for(j=;j<length1;j++){

                 if(number==array1[j])

                     break;

             }

             if(j==length1){

                 array1[length1]=number;

                 length1++;

             }

         }

         for(i=;i<length1-;i++){

             for(j=i+;j<length1;j++){

                 if(array1[i]>array1[j]){

                     temp=array1[i];

                     array1[i]=array1[j];

                     array1[j]=temp;

                 }

             }

         }

         /*for(i=0;i<length1;i++)

             printf("%d ",array1[i]);

         printf("\n");*/

         length2=;

         for(i=;i<n;i++){

             scanf("%d",&number);

             if(i==){

                 array2[]=number;

                 length2++;

                 continue;

             }

             for(j=;j<length2;j++){

                 if(number==array2[j])

                     break;

             }

             if(j==length2){

                 array2[length2]=number;

                 length2++;

             }

         }

         for(i=;i<length2-;i++){

             for(j=i+;j<length2;j++){

                 if(array2[i]>array2[j]){

                     temp=array2[i];

                     array2[i]=array2[j];

                     array2[j]=temp;

                 }

             }

         }

         /*for(i=0;i<length2;i++)

             printf("%d ",array2[i]);

         printf("\n");*/

         if(length1!=length2){

             printf("NO\n");

             continue;

         }

         for(i=;i<length1;i++){

             if(array1[i]!=array2[i]){

                 printf("NO\n");

                 break;

             }

         }

         if(i==length1)

             printf("YES\n");

     }

     return ;

 }

巴特西

So easy

最新文章

热门文章