C语言Matrix编程题——[Arrays]D. Liang 6.5 Printing distinct numbers

最新推荐文章于 2021-12-28 22:34:59 发布

Kamenrider Justice

最新推荐文章于 2021-12-28 22:34:59 发布

阅读量422

点赞数

分类专栏： C语言Matrix 文章标签： c语言

本文链接：https://blog.csdn.net/weixin_45534040/article/details/105766768

版权

C语言Matrix 专栏收录该内容

46 篇文章 3 订阅

订阅专栏

[Arrays]D. Liang 6.5 Printing distinct numbers

Description:

Write a program that reads in n integers and displays distinct numbers (ie., if a number appears multiple times, it is displayed only once).

Input：

The first line is a positive integer t for the number of test cases.
Each test case contains two lines. The first line is an integer n (0<n<=100). The second line contains n integers.

Output:

For each test case, outputs the distinct numbers in order in which they were read, seperated by one blank.

Sample Input:

Sample Output:

1 2
2 1

Programme:

//Date:2020/4/26
//Author:Kamenrider Justice
#include<stdio.h>
int main()
{
   int n,i,j,k,num;//n是运行的次数,num是输入的个数
   scanf("%d",&n);
   int number[100];//储存输入的数
   int flag;   //判断是否有重复的数 
   for(i=0;i<n;i++)
   {      
      scanf("%d",&num);
      for(j=0;j<num;j++)//储存数到数组
      {
         scanf("%d ",&number[j]);
      }
      printf("%d",number[0]);
      for(j=1;j<num;j++)
      {
         flag=1;//使flag回到初始状态
         for(k=0;k<j;k++)
         {    
            if(number[j]==number[k])
            {
               flag=0;
            }
         }
         if(flag)//如果没有重复的就输出，可保证顺序和输入时一致
         {
            printf(" %d",number[j]);
         }
      }
      printf("\n");
   }
   return 0;
}