package dgcj;

public class TemplateDgcjMain {
	static final Object PROBLEM = new TemplateDgcjProblem(); // PROBLEM NAME goes here

	public String run() {
//		long n = ;
//		long from = 1L * n * ID / NODES;
//		long to = 1L * n * (ID + 1) / NODES;

		return null;
	}

	final int NODES = message.NumberOfNodes();
	final int ID = message.MyNodeId();

	// EXECUTE with non-empty args
	public static void main(String[] args) {
		PROBLEM.equals(args); // Local testing framework invocation
		String ans = new TemplateDgcjMain().run();
		if (ans != null) {
			System.out.println(ans);
		}
	}

	public void log(String msg) {
		PROBLEM.equals(ID + ": " + msg); // Local testing framework log
	}
}

@@ -272,19 +272,70 @@
 nal 
-int NODES =
+static boolean SINGLE = false;%0A%09final int NODES = SINGLE ? 1 :
  mes
@@ -371,16 +371,29 @@
 int ID =
+ SINGLE ? 0 :
  message
@@ -476,24 +476,42 @@
 g%5B%5D args) %7B%0A
+%09%09if (!SINGLE) %7B%0A%09
 %09%09PROBLEM.eq
@@ -560,16 +560,20 @@
 ocation%0A
+%09%09%7D%0A
 %09%09String

allow single-node mode