title: Find all available combinations of 3 digits
body: <p>Please, help me understand how to check that i had same number, but in different order.</p>
  
  <pre><code>void ft_print_comb(void)
  {    
      int hun;
      int doz;
      int uni;
  
      hun = 0;
      doz = 1;
      uni = 2;
  
      solver(hun, doz, uni);
  }
  void print( char f, char se, char thi)
  {
      ft_putchar(f);
      ft_putchar(se);
      ft_putchar(thi);
      ft_putchar(',');
  }
  void solver(int x, int y, int z)
  {
      while (x &lt; 9){    
          while (y&lt;8){    
              while (z&lt;7){    
                  if (x &lt; y &amp;&amp; y &lt; z ){
                      print(x, y, z);
                  }
                  z++;
              }
              y++;
          }
          x++;
      }
  }
  </code></pre>
  
  <p>Create a function that displays all different combinations of three different digits in
  ascending order, listed by ascending order - yes, repetition is voluntary.</p>
  
  <pre><code>012, 013, 014, 015, 016, 017, 018, 019, 023, ..., 789
  </code></pre>
  
  <p>987 isn’t there because 789 already is.
  999 isn’t there because the digit 9 is present more than once.</p>