fork download 
  1. #include <stdio.h>
  2.  
  3. int main(void) {
  4.     int arrA[] = {1,2,3,4,2,3,5,6,1};     
  5.     int length = sizeof(arrA)/sizeof(arrA[0]);    
  6.     int arrB[length];
  7.     int arrC[length];
  8.     int k,p,s;    
  9.     k=0;
  10.     p=0;
  11.     for (int i = 0; i < length; i++) {    
  12.     	// 記錄重複元素
  13.         for (int j = i + 1; j < length; j++) {    
  14.             if (arrA[i] == arrA[j]) {
  15.                 arrB[k]=arrA[i];
  16.                 k=k+1;
  17.             }
  18.         } 
  19.         // 記錄非重複元素
  20.         s=0;
  21.         for (int j = 0; j < length; j++) {    
  22.             if (arrA[i] == arrA[j]) {
  23.                s=s+1;
  24.             }
  25.             if (j==(length-1)) {
  26.                 if (s==1) {
  27.                	  arrC[p]=arrA[i];
  28.                   p=p+1;
  29.                 }
  30.             }
  31.         }
  32.     } 
  33.     //
  34.     printf("重複元素 \n");    
  35.     for(int i = 0; i < k; i++) { 
  36.       printf("%d\n", arrB[i]);  	
  37.     }
  38.     //
  39.     printf("非重複元素 \n"); 
  40.     for(int i = 0; i < p; i++) { 
  41.       printf("%d\n", arrC[i]);  	
  42.     }
  43. 	return 0;
  44. }
  45.  
  46.  
  47.  
Success #stdin #stdout 0s 4932KB
comments (?)
stdin 
Standard input is empty
stdout 
重複元素 
1
2
3
非重複元素 
4
5
6
https://ideone.com/5yQfVk
language:
C (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!