fork(3) download 
  1. #include<stdio.h>
  2.  
  3. int main() {
  4.     int input_n,input_m;
  5.  
  6.     scanf("%d %d",&input_n,&input_m);
  7.  
  8.     int sequence[input_n],request[input_m];
  9.  
  10.     //製作1~n由小到大排序好的陣列
  11.     for(int i = 0; i < input_n; i++)
  12.         sequence[i] = i + 1;
  13.  
  14.     //把要求們記錄在陣列
  15.     for(int i = 0; i < input_m; i++)
  16.         scanf("%d",&request[i]);
  17.  
  18.  
  19.     //檢查request自己裡面有沒有重複的數字，如果有，把它設為0
  20.     for(int j = input_m - 1; j >= 0; j--) {
  21.         for(int i = j - 1; i >= 0; i--){
  22.             if(request[i] == 0)
  23.                 break;
  24.             if(request[i] == request[j])
  25.                 request[i] = 0;
  26.         }
  27.     }
  28.  
  29.     //倒著印出不為0的request、把sequence裡等於request的數字設為0
  30.     for(int i = input_m - 1; i >= 0; i--) {
  31.         if(request[i] != 0) {
  32.             printf("%d\n",request[i]);
  33.             sequence[request[i] - 1] = 0;
  34.         }
  35.     }
  36.  
  37.     //印出不為0的sequence
  38.     for(int i = 0; i < input_n; i++) {
  39.         if(sequence[i] != 0)
  40.             printf("%d\n",sequence[i]);
  41.     }
  42.  
  43.     return 0;
  44. }
  45.  
Runtime error #stdin #stdout 0s 9424KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
https://ideone.com/N3dfJf
language:
C (gcc 8.3)
created:
7 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!