Gammal Tech
#include <stdio.h>
int main(){
-int i,j;
-int x[6][5]//any numbers;
-for(i=0;i<6;i++){
--for(j=0;j<5;j++)
---printf("%d ",x[i][j]);
--printf("\\n");
-}
-return 0;
}
Problem statement
Ahmed was thinking about coding a new algorithm to get the unique values in an array A, which holds repetitive values N numbers. Moreover, Ahmed wants to solve it with a perfect approach in order to send it to Gammal Tech for the volunteering points.
Can you help Ahmed to get Gammal Tech volunteering points?
Input
First line contains a number N (1 ≤ N ≤ 10^3) the number of elements.
Second line contains N numbers (0 ≤ A[ i ]≤ 10^9).
Output
Print unique elements in the array.
