zoj 2481 Unique Ascending Array

//這題主要是在給出的數組中找出不重複的數，並按升序的順序排序起來！很簡單！ #include "iostream"#include "algorithm"#include "memory.h"using namespace std;int num[110], ans[110];int main(){    int N, i, j;    while (cin >> N && N)    {          memset(num, 0, sizeof(num));          memset(ans, 0, sizeof(ans));          for (i = 0; i < N; i++)          cin >> num[i];          sort(num, num + N);          ans[0] = num[0];          for (i = 1, j = 1; i < N; i++)          {              if (num[i] != num[i-1])              {                         ans[j] = num[i];                         j++;              }          }          for (i = 0; i < j; i++)          {              if (i != 0)                  cout << " ";              cout << ans[i];          }          cout << endl;    }}