samples/pos-neg.mj

   1 program P
   2         final int size = 10;
   3         class Table {
   4                 int[] pos;
   5                 int[] neg;
   6         }
   7         Table val;
   8 {
   9         void main()
  10                 int x, i;
  11         { //---------- Initialize val
  12                 val = new Table;
  13                 val.pos = new int[size]; val.neg = new int[size];
  14                 i = 0;
  15                 while (i < size) {
  16                         val.pos[i] = 0; val.neg[i] = 0;
  17                         i++;
  18                 }
  19         //---------- Read values
  20                 read(x);
  21                 while (x != 0) {
  22                         if (0 <= x && x < size) {
  23                                 val.pos[x]++;
  24                         } else if (-size < x && x < 0) {
  25                                 val.neg[-x]++;
  26                         }
  27                         read(x);
  28                 }
  29
  30         // output everything
  31                 i = 0;
  32                 while (i < size) {
  33                         print(i,3);
  34                         print(val.pos[i],5);
  35                         print(val.neg[i],5);
  36                         print(chr(10));
  37                         i++;
  38                 }
  39         }
  40 }