fork(1) download
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int n = 0;
  5. int sort_data[28] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,
  6. 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27};
  7.  
  8. int compare(const void *pa, const void *pb)
  9. {
  10. printf("%d x %d = %d\n", n/8+2, n%8+2, (n/8+2)*(n%8+2));
  11. n++;
  12.  
  13. return (*((int*)pa) - *((int*)pb));
  14. }
  15.  
  16. int main(void)
  17. {
  18. qsort(sort_data, 28, sizeof(int), compare);
  19.  
  20. return 0;
  21. }
Success #stdin #stdout 0s 4364KB
stdin
Standard input is empty
stdout
2 x 2 = 4
2 x 3 = 6
2 x 4 = 8
2 x 5 = 10
2 x 6 = 12
2 x 7 = 14
2 x 8 = 16
2 x 9 = 18
3 x 2 = 6
3 x 3 = 9
3 x 4 = 12
3 x 5 = 15
3 x 6 = 18
3 x 7 = 21
3 x 8 = 24
3 x 9 = 27
4 x 2 = 8
4 x 3 = 12
4 x 4 = 16
4 x 5 = 20
4 x 6 = 24
4 x 7 = 28
4 x 8 = 32
4 x 9 = 36
5 x 2 = 10
5 x 3 = 15
5 x 4 = 20
5 x 5 = 25
5 x 6 = 30
5 x 7 = 35
5 x 8 = 40
5 x 9 = 45
6 x 2 = 12
6 x 3 = 18
6 x 4 = 24
6 x 5 = 30
6 x 6 = 36
6 x 7 = 42
6 x 8 = 48
6 x 9 = 54
7 x 2 = 14
7 x 3 = 21
7 x 4 = 28
7 x 5 = 35
7 x 6 = 42
7 x 7 = 49
7 x 8 = 56
7 x 9 = 63
8 x 2 = 16
8 x 3 = 24
8 x 4 = 32
8 x 5 = 40
8 x 6 = 48
8 x 7 = 56
8 x 8 = 64
8 x 9 = 72
9 x 2 = 18
9 x 3 = 27
9 x 4 = 36
9 x 5 = 45
9 x 6 = 54
9 x 7 = 63
9 x 8 = 72
9 x 9 = 81