#include <stdio.h>
#include <assert.h>
// 2016 March; I think this code was based on a confusion and is not useful.
// This computes how many CSAs can be employed at each logic level.
// Each output line reports how many signals of each weight remain at a given level.
// This version uses only CSAs which are 2 logic levels.
int B = 20;

int main(){
int c[B+B]; for(int j=0; j<B+B; ++j) c[j] = 0;
for(int j=0; j<B; ++j) for(int i = 0; i<B; ++i) ++c[i+j];
{int S=0, l=0; while(1){int n[B+B]; for(int j=0; j<B+B; ++j) n[j] = 0;
  for(int j=0; j<B+B; ++j) printf("%2d ", c[j]);
  {int s=0; for(int j=0; j<B+B; ++j) 
      while(c[j] > 2) {assert(j<B+B-1); ++n[j]; ++n[j+1]; c[j] -= 3; ++s;}
      printf("s=%d\n", s);
      S += s; ++l; if(!s) break;}
  for(int j=0; j<B+B; ++j) c[j] += n[j];}
  printf("S=%d, l=%d, 52^2=%d\n", S, l, 52*52);}
  return 0;}