f1 stringlengths 6 6 | f2 stringlengths 6 6 | content_f1 stringlengths 149 20.2k | content_f2 stringlengths 149 20.2k | flag int64 0 1 | __index_level_0__ int64 0 3.83k |
|---|---|---|---|---|---|
C20077 | C20034 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import uk.co.epii.codejam.common.AbstractProcessor;
/**
*
* @author jim
*/
public class HallO... | 0 | 2,400 |
C20077 | C20036 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public class Fraction implements Comparable<Fraction> {
public final int n;
public final int d;
public Fraction(int i) {
this... | 0 | 2,401 |
C20077 | C20081 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import java.util.Scanner;
public class Program
{
static final int RANGE = 50;
static Board board;
static double dist;
public static void main(String[] args) throws Exception
{
Scanner in = new Scanner(new java.io.FileReader("in"));
int t = in.nextInt();
for (int test = 0; test < t; test++)
{
board = ... | 0 | 2,402 |
C20077 | C20038 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import java.io.*;
import java.util.*;
import static java.lang.System.*;
public class D {
public static void main (String [] args) throws IOException {new D().run();}
public void run() throws IOException{
Scanner file = new Scanner(new File("D-large.in"));
PrintWriter out = new PrintWriter(new BufferedWriter(new ... | 0 | 2,403 |
C20077 | C20058 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.util.List;
import com.google.common.collect.Lists;
public class Lists2 {
public static < T > List< T > newArrayListAsArray( final int length ) {
final List< T > list = Lists.newArrayListWithCapacity( length );
for ( int index = 0 ; index < leng... | 0 | 2,404 |
C20077 | C20011 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... |
public class CG {
/** get the intersection between a segment (p1, p2), and a project line from the origin
* with an angle.
* @return Point(INF, INF) if there is no intersection
* */
public static Point intersectSegmentOri(Point p1, Point p2, double angle)
{
Point ori = new Point(0.0, 0.0), out = new Point(... | 0 | 2,405 |
C20077 | C20032 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
import uk.co.epii.codejam.common.AbstractMain;
/**
*
* @author jim
*/
public class Main {
/**
* @param args the command line arguments
*/
public static vo... | 0 | 2,406 |
C20077 | C20033 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public enum RayStep {
EXPIRES,
REFLECTS_HORIZONTALLY,
REFLECTS_VERTICALLY,
INVERTS,
CONTINUES,
HITS;
}
| 0 | 2,407 |
C20077 | C20014 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... |
public class Point {
public double x, y;
public Point(double x, double y)
{
this.x = x;
this.y = y;
}
public Point() {
x=0; y=0;
}
@Override
public boolean equals(Object arg0) {
Point pt = (Point)arg0;
return CG.dblcmp(pt.x, x) == 0 && CG.dblcmp(pt.y, y) == 0;
}
public Point minus(Point p)
... | 0 | 2,408 |
C20077 | C20053 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.util.Iterator;
/**
* Do NOT change the element in iteration
*/
public class Combination implements Iterable< int[] > , Iterator< int[] > {
private final int _n;
private final int _k;
private int[] _data;
public Combination( final int n , final int... | 0 | 2,409 |
C20077 | C20046 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.math.BigInteger;
/**
* Utility for BigInteger
*/
public class BI {
public static BigInteger ZERO = BigInteger.ZERO;
public static BigInteger ONE = BigInteger.ONE;
public static BigInteger add( final BigInteger x , final BigInteger y ) {
return... | 0 | 2,410 |
C20077 | C20061 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.util.Iterator;
/**
* Do NOT change the element in iteration
*/
public class Combination implements Iterable< int[] > , Iterator< int[] > {
private final int _n;
private final int _k;
private int[] _data;
public Combination( final int n , final int... | 0 | 2,411 |
C20077 | C20087 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... |
import java.io.*;
import java.util.*;
public class CodeJam2012_Q_D {
public int calc(int H, int W, int D, String[] mirror) {
int[][] seen = new int[D*2+1][D*2+1];
int sx=0,sy=0;
for(int i=0; i<D*2+1; i++)
Arrays.fill(seen[i], -1);
boolean[][] m = new boolean[H][W];
for(int i=0; i<H; i++) {
if(mir... | 0 | 2,412 |
C20077 | C20079 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | public class Frac implements Comparable<Frac> {
public static final Frac ZERO = new Frac(0);
public static final Frac ONE = new Frac(1);
public final int num, denom;
public Frac(int num) {
this(num, 1);
}
public Frac(int num, int denom) {
if (denom == 0) {
if (num < 0)
this.num = -1;
else if (num ... | 0 | 2,413 |
C20077 | C20047 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
public class Prof {
private long _start;
public Prof() {
reset();
}
private long calcAndReset() {
final long ret = System.currentTimeMillis() - _start;
reset();
return ret;
}
private void reset() {
_start = Sys... | 0 | 2,414 |
C20077 | C20007 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package qualificationRound;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class P4 {
public static String[] map;
public static int x = 0, y = 0;
public static int calGCD(int n, int m) {
if (m == 0)
return n;
if (n == 0)
return m;
... | 0 | 2,415 |
C20077 | C20028 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
import java.awt.Point;
/**
*
* @author jim
*/
public class Hall {
public final int H;
public final int W;
public final int D;
public final FractionPoint meLo... | 0 | 2,416 |
C20077 | C20022 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package template;
//standard libraries potentially used:
//Apache commons http://http://commons.apache.org/
//Google Guava http://code.google.com/p/guava-libraries/
import java.util.ArrayList;
public class Template {
public static void main(String[] args) {
//test();
//Utils.die("Done testing"... | 0 | 2,417 |
C20077 | C20016 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | // Author: Alejandro Sotelo Arevalo
package qualification;
import java.awt.*;
import java.awt.geom.*;
import java.io.*;
import java.util.*;
public class D_HallOfMirrors {
//--------------------------------------------------------------------------------
private static String ID="D";
private static String NAME="... | 0 | 2,418 |
C20077 | C20072 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | /*
* CodeJamTester1A.java
*
* Created on 28.07.2008, 14:20:39
*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package qualification;
import java.util.*;
import java.io.*;
import java.math.*;
/**
*
* @author Besitzer
*/
public class CodeJamQuali {
int tes... | 0 | 2,419 |
C20077 | C20037 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public class FractionPoint {
public final Fraction x;
public final Fraction y;
public FractionPoint(Fraction x, Fraction y) {
... | 0 | 2,420 |
C20077 | C20054 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.math.BigDecimal;
import java.math.BigInteger;
import org.apache.commons.io.IOUtils;
public class QuestionReader {
pr... | 0 | 2,421 |
C20077 | C20080 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import static java.lang.Double.parseDouble;
import static java.lang.Integer.parseInt;
import static java.lang.Integer.signum;
import static java.lang.Long.parseLong;
import static java.lang.Math.abs;
import static java.lang.System.exit;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStr... | 0 | 2,422 |
C20077 | C20084 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package google.codejam2012.qualification;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import static java.lang.Math.*;
final class BinaryMatrix {
private int[] data;
public BinaryMatrix(int height, int width) {
data = new int[height];
}
public void se... | 0 | 2,423 |
C20077 | C20027 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
import java.awt.Point;
import java.util.ArrayList;
import uk.co.epii.codejam.common.DatumConverter;
/**
*
* @author jim
*/
public class HallFactory implements DatumConverter... | 0 | 2,424 |
C20077 | C20009 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package com.forthgo.google.g2012r0;
import com.forthgo.math.Helper;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
/**
* Created by Xan Gregg.
* Date: 4/14/12
*/
public class ProblemD {
private static final int SELF = 2;
pr... | 0 | 2,425 |
C20077 | C20060 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.math.BigInteger;
/**
* Utility for BigInteger
*/
public class BI {
public static BigInteger ZERO = BigInteger.ZERO;
public static BigInteger ONE = BigInteger.ONE;
public static BigInteger add( final BigInteger x , final BigInteger y ) {
return... | 0 | 2,426 |
C20077 | C20004 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import java.util.*;
public class D
{
public static boolean wall[][];
public static int X;
public static int Y;
public static int[] dxs;
public static int[] dys;
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int T = in.nextInt();
for(int c = 1; c <= ... | 0 | 2,427 |
C20077 | C20005 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package gcj;
import com.sun.org.apache.xerces.internal.impl.xs.opti.DefaultXMLDocumentHandler;
import java.util.*;
import java.io.*;
public class HallOfMirrors {
final static String PROBLEM_NAME = "mirrors";
final static String WORK_DIR = "D:\\Gcj\\" + PROBLEM_NAME + "\\";
int H, W, D;
double stX, s... | 0 | 2,428 |
C20077 | C20065 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.prototype;
import static java.lang.Math.abs;
import java.io.File;
import java.io.IOException;
import jp.funnything.competition.util.CompetitionIO;
import jp.funnything.competition.util.Packer;
import org.apache.commons.io.FileUtils;
import org.apache.commons.math.fraction.Fraction;
import org.... | 0 | 2,429 |
C20077 | C20006 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package problemD;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
public class ProblemD {
static Rational posX = null;
static Rational posY = null;
static Rational tarX = null;
static Rational tarY = null;
static boolean[][] array = null;
public static void main(String[] ... | 0 | 2,430 |
C20077 | C20067 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import java.io.*;
import java.util.*;
public class Solution {
private StringTokenizer st;
private BufferedReader in;
private PrintWriter out;
final String file = "D-large";
public void solve() throws IOException {
int tests = nextInt();
for (int test = 0; test < tests; ++test) {
int n = nextInt();
... | 0 | 2,431 |
C20077 | C20008 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
public class SimpleMirrors {
public static void ma... | 0 | 2,432 |
C20077 | C20063 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import org.apache.commons.io.IOUtils;
public class AnswerWriter {
private static final String DEFAULT_FORMAT = "Case #%d: %s\n";
private final BufferedWriter _wr... | 0 | 2,433 |
C20077 | C20015 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package qualification;
import java.io.*;
import java.util.Scanner;
/**
* @author Roman Elizarov
*/
public class D {
public static void main(String[] args) throws IOException {
new D().go();
}
Scanner in;
PrintWriter out;
private void go() throws IOException {
in = new Scanner(new File("src\\qualificatio... | 0 | 2,434 |
C20077 | C20050 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
public enum Direction {
UP , DOWN , LEFT , RIGHT;
public int dx() {
switch ( this ) {
case UP:
case DOWN:
return 0;
case LEFT:
return -1;
case RIGHT:
return 1;
default:
throw... | 0 | 2,435 |
C20077 | C20085 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import java.util.Scanner;
import java.io.IOException;
import java.util.Arrays;
import java.util.ArrayList;
import java.io.PrintStream;
import java.io.OutputStream;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.io.FileInputStream;
import java.io.InputStream;
/**
* Built using CHelper plug-in... | 0 | 2,436 |
C20077 | C20020 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package template;
import java.io.*;
import java.util.ArrayList;
import java.util.Random;
public class Utils {
static String logfile = "";
public static BufferedWriter newBufferedWriter(String filename, boolean append) {
BufferedWriter bw = null;
try {
bw = new BufferedWriter(new ... | 0 | 2,437 |
C20077 | C20062 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
public enum Direction {
UP , DOWN , LEFT , RIGHT;
public int dx() {
switch ( this ) {
case UP:
case DOWN:
return 0;
case LEFT:
return -1;
case RIGHT:
return 1;
default:
throw... | 0 | 2,438 |
C20077 | C20059 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.io.File;
import java.math.BigDecimal;
import java.math.BigInteger;
import org.apache.commons.io.FileUtils;
public class CompetitionIO {
private final QuestionReader _reader;
private final AnswerWriter _writer;
/**
* Default constructor. Use latest... | 0 | 2,439 |
C20077 | C20064 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
public class Prof {
private long _start;
public Prof() {
reset();
}
private long calcAndReset() {
final long ret = System.currentTimeMillis() - _start;
reset();
return ret;
}
private void reset() {
_start = Sys... | 0 | 2,440 |
C20077 | C20076 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import java.io.*;
import java.math.*;
import java.util.*;
public class D {
final static boolean DEBUG = true;
class S implements Comparable<S> {
int a;
int [] b;
public int compareTo(S s) {
if (a != s.a)
return a - s.a;
else
return b[0] - s.b[0];
}
boolean merge(S s) {
if (a == s.a... | 0 | 2,441 |
C20077 | C20026 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import java.io.*;
import java.util.*;
import java.math.*;
class D
{
private static final boolean DEBUG_ON = true;
private static final boolean ECHO_ON = true;
private static BufferedReader input;
private static BufferedWriter output;
private static final int INF = Integer.MAX_VALUE / 2;
private static final in... | 0 | 2,442 |
C20077 | C20078 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import java.awt.Point;
public class FracVec {
public final Frac row, col;
public FracVec(Frac row, Frac col) {
this.row = row;
this.col = col;
}
public FracVec(Point pos) {
row = new Frac(pos.y);
col = new Frac(pos.x);
}
public FracVec flipHoriz() {
return new FracVec(row, col.neg());
}
public Fr... | 0 | 2,443 |
C20077 | C20057 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.util.Arrays;
import java.util.List;
import com.google.common.collect.Lists;
import com.google.common.primitives.Ints;
import com.google.common.primitives.Longs;
public class Prime {
public static class PrimeData {
public int[] list;
public boole... | 0 | 2,444 |
C20077 | C20030 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public class RayVector {
public final int x;
public final int y;
public RayVector(int x, int y) {
this.x = x;
this.y ... | 0 | 2,445 |
C20077 | C20002 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | import java.util.*;
import java.io.*;
import java.math.*;
import java.awt.*;
import static java.lang.Math.*;
import static java.lang.Integer.parseInt;
import static java.lang.Double.parseDouble;
import static java.lang.Long.parseLong;
import static java.lang.System.*;
import static java.util.Arrays.*;
import static jav... | 0 | 2,446 |
C20077 | C20056 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.math.BigDecimal;
/**
* Utility for BigDeciaml
*/
public class BD {
public static BigDecimal ZERO = BigDecimal.ZERO;
public static BigDecimal ONE = BigDecimal.ONE;
public static BigDecimal add( final BigDecimal x , final BigDecimal y ) {
return... | 0 | 2,447 |
C20077 | C20018 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package template;
import java.util.Objects;
public class Pair<T1, T2> implements Comparable<Pair<T1, T2>>{
private T1 o1;
private T2 o2;
public Pair(T1 o1, T2 o2) {
this.o1 = o1;
this.o2 = o2;
}
@Override
public boolean equals(Object other) {
if (!(other instanceof P... | 0 | 2,448 |
C20077 | C20051 | import java.awt.Point;
import java.util.Scanner;
public class Mirrors {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int cases = scan.nextInt();
for (int trial = 1; trial <= cases; trial++) {
System.out.print("Case #" + trial + ": ");
int height = scan.nextInt() * 2;
... | package jp.funnything.competition.util;
import java.util.List;
import com.google.common.collect.Lists;
public class Lists2 {
public static < T > List< T > newArrayListAsArray( final int length ) {
final List< T > list = Lists.newArrayListWithCapacity( length );
for ( int index = 0 ; index < leng... | 0 | 2,449 |
C20024 | C20001 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.io.*;
import java.util.*;
class Mirrors {
static class Direction {
int x;
int y;
Direction(int a, int b){
x = a;
y = b;
}
}
static class Point {
double x;
double y;
Point(double a, double b){
x = a;
y = b;
}
}
static class Cell {
int x;
int y;
Cell(int a, int b){
... | 0 | 2,450 |
C20024 | C20049 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.util.Arrays;
import java.util.List;
import com.google.common.collect.Lists;
import com.google.common.primitives.Ints;
import com.google.common.primitives.Longs;
public class Prime {
public static class PrimeData {
public int[] list;
public boole... | 0 | 2,451 |
C20024 | C20034 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import uk.co.epii.codejam.common.AbstractProcessor;
/**
*
* @author jim
*/
public class HallO... | 0 | 2,452 |
C20024 | C20036 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public class Fraction implements Comparable<Fraction> {
public final int n;
public final int d;
public Fraction(int i) {
this... | 0 | 2,453 |
C20024 | C20081 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.util.Scanner;
public class Program
{
static final int RANGE = 50;
static Board board;
static double dist;
public static void main(String[] args) throws Exception
{
Scanner in = new Scanner(new java.io.FileReader("in"));
int t = in.nextInt();
for (int test = 0; test < t; test++)
{
board = ... | 0 | 2,454 |
C20024 | C20038 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.io.*;
import java.util.*;
import static java.lang.System.*;
public class D {
public static void main (String [] args) throws IOException {new D().run();}
public void run() throws IOException{
Scanner file = new Scanner(new File("D-large.in"));
PrintWriter out = new PrintWriter(new BufferedWriter(new ... | 0 | 2,455 |
C20024 | C20058 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.util.List;
import com.google.common.collect.Lists;
public class Lists2 {
public static < T > List< T > newArrayListAsArray( final int length ) {
final List< T > list = Lists.newArrayListWithCapacity( length );
for ( int index = 0 ; index < leng... | 0 | 2,456 |
C20024 | C20011 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... |
public class CG {
/** get the intersection between a segment (p1, p2), and a project line from the origin
* with an angle.
* @return Point(INF, INF) if there is no intersection
* */
public static Point intersectSegmentOri(Point p1, Point p2, double angle)
{
Point ori = new Point(0.0, 0.0), out = new Point(... | 0 | 2,457 |
C20024 | C20032 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
import uk.co.epii.codejam.common.AbstractMain;
/**
*
* @author jim
*/
public class Main {
/**
* @param args the command line arguments
*/
public static vo... | 0 | 2,458 |
C20024 | C20033 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public enum RayStep {
EXPIRES,
REFLECTS_HORIZONTALLY,
REFLECTS_VERTICALLY,
INVERTS,
CONTINUES,
HITS;
}
| 0 | 2,459 |
C20024 | C20014 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... |
public class Point {
public double x, y;
public Point(double x, double y)
{
this.x = x;
this.y = y;
}
public Point() {
x=0; y=0;
}
@Override
public boolean equals(Object arg0) {
Point pt = (Point)arg0;
return CG.dblcmp(pt.x, x) == 0 && CG.dblcmp(pt.y, y) == 0;
}
public Point minus(Point p)
... | 0 | 2,460 |
C20024 | C20053 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.util.Iterator;
/**
* Do NOT change the element in iteration
*/
public class Combination implements Iterable< int[] > , Iterator< int[] > {
private final int _n;
private final int _k;
private int[] _data;
public Combination( final int n , final int... | 0 | 2,461 |
C20024 | C20046 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.math.BigInteger;
/**
* Utility for BigInteger
*/
public class BI {
public static BigInteger ZERO = BigInteger.ZERO;
public static BigInteger ONE = BigInteger.ONE;
public static BigInteger add( final BigInteger x , final BigInteger y ) {
return... | 0 | 2,462 |
C20024 | C20061 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.util.Iterator;
/**
* Do NOT change the element in iteration
*/
public class Combination implements Iterable< int[] > , Iterator< int[] > {
private final int _n;
private final int _k;
private int[] _data;
public Combination( final int n , final int... | 0 | 2,463 |
C20024 | C20087 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... |
import java.io.*;
import java.util.*;
public class CodeJam2012_Q_D {
public int calc(int H, int W, int D, String[] mirror) {
int[][] seen = new int[D*2+1][D*2+1];
int sx=0,sy=0;
for(int i=0; i<D*2+1; i++)
Arrays.fill(seen[i], -1);
boolean[][] m = new boolean[H][W];
for(int i=0; i<H; i++) {
if(mir... | 0 | 2,464 |
C20024 | C20079 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | public class Frac implements Comparable<Frac> {
public static final Frac ZERO = new Frac(0);
public static final Frac ONE = new Frac(1);
public final int num, denom;
public Frac(int num) {
this(num, 1);
}
public Frac(int num, int denom) {
if (denom == 0) {
if (num < 0)
this.num = -1;
else if (num ... | 0 | 2,465 |
C20024 | C20047 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
public class Prof {
private long _start;
public Prof() {
reset();
}
private long calcAndReset() {
final long ret = System.currentTimeMillis() - _start;
reset();
return ret;
}
private void reset() {
_start = Sys... | 0 | 2,466 |
C20024 | C20007 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package qualificationRound;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class P4 {
public static String[] map;
public static int x = 0, y = 0;
public static int calGCD(int n, int m) {
if (m == 0)
return n;
if (n == 0)
return m;
... | 0 | 2,467 |
C20024 | C20028 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
import java.awt.Point;
/**
*
* @author jim
*/
public class Hall {
public final int H;
public final int W;
public final int D;
public final FractionPoint meLo... | 0 | 2,468 |
C20024 | C20022 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package template;
//standard libraries potentially used:
//Apache commons http://http://commons.apache.org/
//Google Guava http://code.google.com/p/guava-libraries/
import java.util.ArrayList;
public class Template {
public static void main(String[] args) {
//test();
//Utils.die("Done testing"... | 0 | 2,469 |
C20024 | C20016 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | // Author: Alejandro Sotelo Arevalo
package qualification;
import java.awt.*;
import java.awt.geom.*;
import java.io.*;
import java.util.*;
public class D_HallOfMirrors {
//--------------------------------------------------------------------------------
private static String ID="D";
private static String NAME="... | 0 | 2,470 |
C20024 | C20072 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | /*
* CodeJamTester1A.java
*
* Created on 28.07.2008, 14:20:39
*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package qualification;
import java.util.*;
import java.io.*;
import java.math.*;
/**
*
* @author Besitzer
*/
public class CodeJamQuali {
int tes... | 0 | 2,471 |
C20024 | C20037 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public class FractionPoint {
public final Fraction x;
public final Fraction y;
public FractionPoint(Fraction x, Fraction y) {
... | 0 | 2,472 |
C20024 | C20054 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.math.BigDecimal;
import java.math.BigInteger;
import org.apache.commons.io.IOUtils;
public class QuestionReader {
pr... | 0 | 2,473 |
C20024 | C20080 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import static java.lang.Double.parseDouble;
import static java.lang.Integer.parseInt;
import static java.lang.Integer.signum;
import static java.lang.Long.parseLong;
import static java.lang.Math.abs;
import static java.lang.System.exit;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStr... | 0 | 2,474 |
C20024 | C20084 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package google.codejam2012.qualification;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import static java.lang.Math.*;
final class BinaryMatrix {
private int[] data;
public BinaryMatrix(int height, int width) {
data = new int[height];
}
public void se... | 0 | 2,475 |
C20024 | C20027 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
import java.awt.Point;
import java.util.ArrayList;
import uk.co.epii.codejam.common.DatumConverter;
/**
*
* @author jim
*/
public class HallFactory implements DatumConverter... | 0 | 2,476 |
C20024 | C20009 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package com.forthgo.google.g2012r0;
import com.forthgo.math.Helper;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
/**
* Created by Xan Gregg.
* Date: 4/14/12
*/
public class ProblemD {
private static final int SELF = 2;
pr... | 0 | 2,477 |
C20024 | C20060 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.math.BigInteger;
/**
* Utility for BigInteger
*/
public class BI {
public static BigInteger ZERO = BigInteger.ZERO;
public static BigInteger ONE = BigInteger.ONE;
public static BigInteger add( final BigInteger x , final BigInteger y ) {
return... | 0 | 2,478 |
C20024 | C20004 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.util.*;
public class D
{
public static boolean wall[][];
public static int X;
public static int Y;
public static int[] dxs;
public static int[] dys;
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int T = in.nextInt();
for(int c = 1; c <= ... | 0 | 2,479 |
C20024 | C20005 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package gcj;
import com.sun.org.apache.xerces.internal.impl.xs.opti.DefaultXMLDocumentHandler;
import java.util.*;
import java.io.*;
public class HallOfMirrors {
final static String PROBLEM_NAME = "mirrors";
final static String WORK_DIR = "D:\\Gcj\\" + PROBLEM_NAME + "\\";
int H, W, D;
double stX, s... | 0 | 2,480 |
C20024 | C20065 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.prototype;
import static java.lang.Math.abs;
import java.io.File;
import java.io.IOException;
import jp.funnything.competition.util.CompetitionIO;
import jp.funnything.competition.util.Packer;
import org.apache.commons.io.FileUtils;
import org.apache.commons.math.fraction.Fraction;
import org.... | 0 | 2,481 |
C20024 | C20006 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package problemD;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
public class ProblemD {
static Rational posX = null;
static Rational posY = null;
static Rational tarX = null;
static Rational tarY = null;
static boolean[][] array = null;
public static void main(String[] ... | 0 | 2,482 |
C20024 | C20067 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.io.*;
import java.util.*;
public class Solution {
private StringTokenizer st;
private BufferedReader in;
private PrintWriter out;
final String file = "D-large";
public void solve() throws IOException {
int tests = nextInt();
for (int test = 0; test < tests; ++test) {
int n = nextInt();
... | 0 | 2,483 |
C20024 | C20008 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
public class SimpleMirrors {
public static void ma... | 0 | 2,484 |
C20024 | C20063 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import org.apache.commons.io.IOUtils;
public class AnswerWriter {
private static final String DEFAULT_FORMAT = "Case #%d: %s\n";
private final BufferedWriter _wr... | 0 | 2,485 |
C20024 | C20015 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package qualification;
import java.io.*;
import java.util.Scanner;
/**
* @author Roman Elizarov
*/
public class D {
public static void main(String[] args) throws IOException {
new D().go();
}
Scanner in;
PrintWriter out;
private void go() throws IOException {
in = new Scanner(new File("src\\qualificatio... | 0 | 2,486 |
C20024 | C20050 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
public enum Direction {
UP , DOWN , LEFT , RIGHT;
public int dx() {
switch ( this ) {
case UP:
case DOWN:
return 0;
case LEFT:
return -1;
case RIGHT:
return 1;
default:
throw... | 0 | 2,487 |
C20024 | C20085 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.util.Scanner;
import java.io.IOException;
import java.util.Arrays;
import java.util.ArrayList;
import java.io.PrintStream;
import java.io.OutputStream;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.io.FileInputStream;
import java.io.InputStream;
/**
* Built using CHelper plug-in... | 0 | 2,488 |
C20024 | C20020 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package template;
import java.io.*;
import java.util.ArrayList;
import java.util.Random;
public class Utils {
static String logfile = "";
public static BufferedWriter newBufferedWriter(String filename, boolean append) {
BufferedWriter bw = null;
try {
bw = new BufferedWriter(new ... | 0 | 2,489 |
C20024 | C20062 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
public enum Direction {
UP , DOWN , LEFT , RIGHT;
public int dx() {
switch ( this ) {
case UP:
case DOWN:
return 0;
case LEFT:
return -1;
case RIGHT:
return 1;
default:
throw... | 0 | 2,490 |
C20024 | C20059 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.io.File;
import java.math.BigDecimal;
import java.math.BigInteger;
import org.apache.commons.io.FileUtils;
public class CompetitionIO {
private final QuestionReader _reader;
private final AnswerWriter _writer;
/**
* Default constructor. Use latest... | 0 | 2,491 |
C20024 | C20064 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
public class Prof {
private long _start;
public Prof() {
reset();
}
private long calcAndReset() {
final long ret = System.currentTimeMillis() - _start;
reset();
return ret;
}
private void reset() {
_start = Sys... | 0 | 2,492 |
C20024 | C20076 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.io.*;
import java.math.*;
import java.util.*;
public class D {
final static boolean DEBUG = true;
class S implements Comparable<S> {
int a;
int [] b;
public int compareTo(S s) {
if (a != s.a)
return a - s.a;
else
return b[0] - s.b[0];
}
boolean merge(S s) {
if (a == s.a... | 0 | 2,493 |
C20024 | C20026 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.io.*;
import java.util.*;
import java.math.*;
class D
{
private static final boolean DEBUG_ON = true;
private static final boolean ECHO_ON = true;
private static BufferedReader input;
private static BufferedWriter output;
private static final int INF = Integer.MAX_VALUE / 2;
private static final in... | 0 | 2,494 |
C20024 | C20078 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.awt.Point;
public class FracVec {
public final Frac row, col;
public FracVec(Frac row, Frac col) {
this.row = row;
this.col = col;
}
public FracVec(Point pos) {
row = new Frac(pos.y);
col = new Frac(pos.x);
}
public FracVec flipHoriz() {
return new FracVec(row, col.neg());
}
public Fr... | 0 | 2,495 |
C20024 | C20057 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.util.Arrays;
import java.util.List;
import com.google.common.collect.Lists;
import com.google.common.primitives.Ints;
import com.google.common.primitives.Longs;
public class Prime {
public static class PrimeData {
public int[] list;
public boole... | 0 | 2,496 |
C20024 | C20030 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public class RayVector {
public final int x;
public final int y;
public RayVector(int x, int y) {
this.x = x;
this.y ... | 0 | 2,497 |
C20024 | C20002 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | import java.util.*;
import java.io.*;
import java.math.*;
import java.awt.*;
import static java.lang.Math.*;
import static java.lang.Integer.parseInt;
import static java.lang.Double.parseDouble;
import static java.lang.Long.parseLong;
import static java.lang.System.*;
import static java.util.Arrays.*;
import static jav... | 0 | 2,498 |
C20024 | C20056 | package pl.helman.codejam.Hall;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class Hall {
private static int checkSpecialCases(boolean[][] map, int startX,
int startY, int d) {
int ret = 0;
// horizontal to left
int x = startX, y =... | package jp.funnything.competition.util;
import java.math.BigDecimal;
/**
* Utility for BigDeciaml
*/
public class BD {
public static BigDecimal ZERO = BigDecimal.ZERO;
public static BigDecimal ONE = BigDecimal.ONE;
public static BigDecimal add( final BigDecimal x , final BigDecimal y ) {
return... | 0 | 2,499 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.