Google kickstart 2017
文章平均质量分 61
u010867294
这个作者很懒,什么都没留下…
展开
-
Kickstart Practice Round 2017 Problem A. Country Leader
public static void main(String[] args) { Scanner in = new Scanner(System.in); int T = Integer.parseInt(in.nextLine()); for (int t = 0; t < T; t++) { int N = Integer.parseInt(in.nextLine());原创 2017-06-28 09:48:01 · 240 阅读 · 0 评论 -
Kickstart Practice Round 2017 Problem B. Vote
static double[][] out = new double[2001][2001]; public static double help(int a, int b) { if (out[a][b] != -1) { return out[a][b]; } double re = 0; if原创 2017-06-28 15:01:56 · 337 阅读 · 0 评论 -
Kickstart Practice Round 2017 Problem C. Sherlock and Parentheses
public static void main(String[] args) { Scanner in = new Scanner(System.in); int T = in.nextInt(); for (int t = 0; t < T; t++) { int l = in.nextInt();原创 2017-06-28 15:55:42 · 343 阅读 · 0 评论 -
Kickstart Round A 2017 Problem A. Square Counting
package kick;import java.util.Scanner;public class T { public static int k = 1000000007; public static long help(long h, long l) { long min = Math.min(h, l); long re = (h原创 2017-07-02 22:58:23 · 232 阅读 · 0 评论 -
Kickstart Round A 2017 Problem C. Space Cubes
参考排名第一的代码,简单粗暴。 public static boolean check(int[][] a, int xl, int xr, int yl, int yr, int zl, int zr) { int[] v = new int[a.length]; int minx = Integer.MAX_VALUE, maxx = Inte原创 2017-07-14 20:15:09 · 419 阅读 · 0 评论 -
Kickstart Round B 2017 Problem A. Math Encoder
public static void main(String[] args) { Scanner in = new Scanner(System.in); int T = in.nextInt(); int k = 1000000007; long[] b = new long[10001]; b[1] = 1;原创 2017-07-15 16:37:19 · 266 阅读 · 0 评论 -
Kickstart Round B 2017 Problem B. Center
static double[] xx; static double[] yy; static double[] w; static double maxx, minx, maxy, miny; static double k = 0.000001; public static double calsum(double x, double y) {原创 2017-07-15 19:15:32 · 277 阅读 · 0 评论 -
Kickstart Practice Round 2 2017 Problem A. Diwali lightings
public static void main(String[] args) { Scanner in = new Scanner(System.in); int T = Integer.parseInt(in.nextLine()); for (int t = 0; t < T; t++) { String s = in.n原创 2017-07-16 10:43:56 · 257 阅读 · 0 评论 -
Kickstart Round A 2017 Problem B. Patterns Overlap
public static void main(String[] args) { Scanner in = new Scanner(System.in); int T = Integer.parseInt(in.nextLine()); for (int t = 0; t < T; t++) { String s1 = in.nextLine(); String s2 =原创 2017-07-06 23:34:24 · 249 阅读 · 0 评论