Skip to content

Instantly share code, notes, and snippets.

View hiroshi-cl's full-sized avatar

Hiroshi YAMAGUCHI hiroshi-cl

  • Some company
  • Tokyo, Japan
View GitHub Profile
@hiroshi-cl
hiroshi-cl / Guide.java
Created June 25, 2013 07:46
2010年 夏合宿4日目 Problem E : Psychic Accelerator [Licence: NYSL Version 0.9982]
import java.util.*;
import static java.lang.Math.*;
public class Guide {
public static void main(String... args) {
new Guide().run();
}
public void run() {
Scanner sc = new Scanner(System.in);
@hiroshi-cl
hiroshi-cl / Alien.java
Created June 25, 2013 07:42
2010年 夏合宿4日目 Problem A : Alien's Counting [Licence: NYSL Version 0.9982]
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class Alien {
public static void main(String... args) throws Exception {
new Alien().run();
}
@hiroshi-cl
hiroshi-cl / Main.java
Created June 25, 2013 07:36
2012年4月 春コンテスト Problem J: Tree Allocation (貪欲にひと捻り加えてみました) [Licence: NYSL Version 0.9982]
import java.util.*;
import java.io.*;
public class Main implements Runnable {
private final int N, B;
private final int[] next;
public Main(final int n, final int b, final int[] nx) {
N = n;
B = b;
@hiroshi-cl
hiroshi-cl / Main.java
Created June 25, 2013 07:29
2012年4月 春コンテスト Problem I: Three-way Branch [Licence: NYSL Version 0.9982]
import java.util.*;
public class Main implements Runnable {
private static final long MOD = 1000000009;
private static final int MAX = 62;
@Override
public void run() {
Scanner sc = new Scanner(System.in);
@hiroshi-cl
hiroshi-cl / Main.java
Created June 25, 2013 07:26
2012年4月 春コンテスト Problem E: Dungeon Creation (BigInteger.modInverse を使っているのでちょっと邪道) [Licence: NYSL Version 0.9982]
import java.util.*;
import java.math.*;
public class Main implements Runnable {
private static final long MOD = 1000000007;
private static final BigInteger BMOD = BigInteger.valueOf(MOD);
private static long inv(final long l) {
return BigInteger.valueOf(l).modInverse(BMOD).longValue();
}
@hiroshi-cl
hiroshi-cl / Main.java
Last active December 18, 2015 22:48
2012年4月 春コンテスト Problem B: AYBABTU (貪欲に森を大きく) [Licence: NYSL Version 0.9982]
import java.util.*;
public class Main implements Runnable {
private final V[] bases;
private final int n, k;
private Main(V[] bases, int n, int k) {
this.bases = bases;
this.n = n;
@hiroshi-cl
hiroshi-cl / Main.java
Created June 25, 2013 07:20
2012年4月 春コンテスト Problem B: AYBABTU (貪欲に切断) [Licence: NYSL Version 0.9982]
import java.util.*;
public class Main implements Runnable {
private final V s;
private final int k;
private Main(V s, int k) {
this.s = s;
this.k = k;
@hiroshi-cl
hiroshi-cl / Main.java
Created June 25, 2013 07:18
2012年3月 冬コンテスト Problem E: Multi Ending Story [Licence: NYSL Version 0.9982]
import java.util.*;
import static java.lang.Math.min;
public class Main {
private final int N;
private final int[] L;
private final int[] R;
@hiroshi-cl
hiroshi-cl / Main.java
Created June 25, 2013 07:17
2012年3月 冬コンテスト Problem A: Carpenter's Language [Licence: NYSL Version 0.9982]
import java.util.*;
public class Main {
public static void main(String...args) {
Scanner sc = new Scanner(System.in);
int q = sc.nextInt();
long d = 0;
for (int i = 0; i < q; i++) {
sc.next();
if (sc.next().charAt(0) == '(')
d += sc.nextInt();
@hiroshi-cl
hiroshi-cl / Main.java
Created June 25, 2013 07:15
2011年11月 模擬地区予選 Problem I: Mobile Network (解法2) [Licence: NYSL Version 0.9982]
import java.io.*;
import java.util.*;
public class Main {
static final int L = 50;
public void run() {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {