?
# | Author | Problem | Lang | Verdict | Time | Memory | Sent | Judged | |
---|---|---|---|---|---|---|---|---|---|
4133871 |
Practice: HellScre4m |
268C - 37 | Java 7 | Wrong answer on test 9 | 109 ms | 20 KB | 2013-07-22 12:30:29 | 2013-07-22 12:30:29 |
import java.util.Scanner; public class P268C { public static void main (String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int m = in.nextInt(); int min = Math.min(m,n); int max = Math.max(m,n); System.out.println(min + 1); boolean xory = false; if (n == min) xory = true; for (int i=0; i<=min; i++) { int j = (i+1)%(max+1); System.out.println(xory?(i + " " + j):(j + " " + i)); } } }
?
?
?
?