01
02
03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
package algs14;
import stdlib.*;
public class XPrintingLoops {
  // To Print: 
  //
  // Test variant with one, two or three nested loops
  //
  // Outermost:
  // for (long i = 1; i <= N; i = i+1)
  // for (long i = 1; i <= N; i = i*2)
  //
  // Next:
  // for (long j = 1; j <= N; j = j+1)
  // for (long j = 1; j <= i; j = j+1)
  // for (long j = 1; j <= N; j = j*2)
  // for (long j = 1; j <= i; j = j*2)
  //
  // Next:
  // for (long k = 1; k <= N; k = k+1)
  // for (long k = 1; k <= j; k = k+1)
  // for (long k = 1; k <= N; k = k*2)
  // for (long k = 1; k <= j; k = k*2)

  public static long timesTwoSum (int N, boolean print) {
    long count = 0;   
    for (long i = 1; i <= N; i = i*2) {
      for (long j = 1; j <= i; j = j+1) {
        if (print) StdOut.printf ("%02d ", i);
        count += 1;
      }
      if (print) StdOut.println ();
    }
    return count;
  }
  public static long plusOneSum (int N, boolean print) {
    long count = 0;   
    for (long i = 1; i <= N; i = i+1) {
      for (long j = 1; j <= i; j = j+1) {
        if (print) StdOut.printf ("%02d ", i);
        count += 1;
      }
      if (print) StdOut.println ();
    }
    return count;
  }
  public static void main (String[] args) {
    plusOneSum(8, true);
    timesTwoSum(8, true);
    for (int N=1; N<=4096; N*=2) {
      long p1 = plusOneSum(N, false);
      long t2 = timesTwoSum(N, false);
      StdOut.format("N=%d t2=%d p1=%d\n", N, t2, p1);
    }
  }
}