1*5971e316Smrg if (n >= 2) 2*5971e316Smrg for (int c0 = 1; c0 <= n; c0 += 1) { 3*5971e316Smrg for (int c1 = 2; c1 <= c0; c1 += 1) 4*5971e316Smrg for (int c3 = 1; c3 < c1; c3 += 1) 5*5971e316Smrg s1(c3, c1, c0); 6*5971e316Smrg for (int c1 = c0 + 1; c1 <= n; c1 += 1) { 7*5971e316Smrg for (int c3 = 1; c3 < c0; c3 += 1) 8*5971e316Smrg s1(c3, c1, c0); 9*5971e316Smrg s0(c0, c1); 10*5971e316Smrg } 11*5971e316Smrg } 12