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 |
|---|---|---|---|---|---|
C20082 | C20025 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | 0 | 0 |
C20082 | C20012 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... |
public class CGConst {
public static final int INF = 99999999;
public static final double EPS = 1e-9;
public static final double pi = Math.PI;
}
| 0 | 1 |
C20082 | C20069 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package com.brootdev.gcj2012.common;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.PrintWriter;
public class DataUtils {
public static int readIntLine(BufferedReader in) throws IOException {
return Integer.valueOf(in.readLine());
}
public static long readLongLine(Buff... | 0 | 2 |
C20082 | C20039 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package jp.funnything.competition.util;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import org.apache.commons.compress.archivers.zip.ZipArchiveEntry;
import org.apache.commons.compress.archivers.zip.ZipArchiveOutputStream;
import org.apache.commons.io.FileUtils;
import org.apache.... | 0 | 3 |
C20082 | C20031 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public enum Square {
ME,
MIRROR,
EMPTY;
public static Square parse(char in) {
if (in == '#') return MIRROR;
else i... | 0 | 4 |
C20082 | C20003 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | import java.io.*;
import java.util.*;
public class D {
public static class Pair {
public int r;
public int c;
public Pair(int r, int c) {
this.r = r;
this.c = c;
}
@Override
public boolean equals(Object o) {
if (o == null)
return false;
if (!(o instanceof Pair))
return false;
... | 0 | 5 |
C20082 | C20029 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public class Ray {
private final Fraction expiryLengthSquared;
public RayVector vector;
private FractionPoint currentLocatio... | 0 | 6 |
C20082 | C20040 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 7 |
C20082 | C20035 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public class Surround {
private Square[][] surround;
public Surround(Square[][] surround) {
this.surround = surround;
}
... | 0 | 8 |
C20082 | C20045 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 9 |
C20082 | C20052 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 10 |
C20082 | C20073 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* Main.java
*
* Created on 14.04.2012, 10:03:46
*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package codejam12;
import qualification.CodeJamQuali;
/**
*
* @author Besitzer
*/
public class Main {
/**
* @param args the command line arguments
... | 0 | 11 |
C20082 | C20043 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package jp.funnything.competition.util;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import org.apache.commons.compress.archivers.zip.ZipArchiveEntry;
import org.apache.commons.compress.archivers.zip.ZipArchiveOutputStream;
import org.apache.commons.io.FileUtils;
import org.apache.... | 0 | 12 |
C20082 | C20083 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
public class QuestionD {
public static void doPuzzle() {
try {
File question... | 0 | 13 |
C20082 | C20023 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package template;
import java.util.ArrayList;
import java.util.Map;
import java.util.HashMap;
public class TestCase {
private boolean isSolved;
private Object solution;
private Map<String, Integer> intProperties;
private Map<String, ArrayList<Integer>> intArrayProperties;
private Map<String, Arra... | 0 | 14 |
C20082 | C20086 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | //input file must be in.txt in this directory
//output file will be out.txt
import java.io.*;
import java.util.*;
public class D
{
public static Scanner in;
public static PrintStream out;
public static void main(String [] args) throws Throwable
{
in = new Scanner(new File("in.txt"));
int cases = in.nextInt()... | 0 | 15 |
C20082 | C20075 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Scanner;
public class CodeJamD
{
public static void main(String args[]) throws Exception
{
Scanner in = new Scanner(new File("in.txt"));
BufferedWriter out = new BufferedWriter(new FileWriter... | 0 | 16 |
C20082 | C20048 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 17 |
C20082 | C20074 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package codejam2012.q;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;
public class D
{
static int H, W, D;
static char[][] hall;
static int startx, starty;
static public int test(int dx, int dy, int dirx, int diry)
{
//System.out.println("test "... | 0 | 18 |
C20082 | C20019 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package template;
import java.util.ArrayList;
import java.util.Set;
import java.util.HashSet;
public class TestCaseSolver implements Runnable {
private ArrayList<TestCase> testCases;
private int ref;
public TestCaseSolver(ArrayList<TestCase> tcs, int ref) {
testCases = tcs;
this.ref = re... | 0 | 19 |
C20082 | C20021 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package template;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.util.ArrayList;
public class TestCaseIO {
public static ArrayList<TestCase> loadFromFile(String infile) {
//inc checks on #lines, length of splits, etc.
BufferedReader br = Utils.newBufferedReader(infile);... | 0 | 20 |
C20082 | C20044 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package jp.funnything.competition.util;
import java.util.Comparator;
import com.google.common.base.Objects;
public class Pair< T1 , T2 > {
public static < T1 extends Comparable< T1 > , T2 extends Comparable< T2 > > Comparator< Pair< T1 , T2 > > getFirstComarator() {
return new Comparator< Pair< T1 , T2 >... | 0 | 21 |
C20082 | C20066 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package jp.funnything.competition.util;
import java.util.Comparator;
import com.google.common.base.Objects;
public class Pair< T1 , T2 > {
public static < T1 extends Comparable< T1 > , T2 extends Comparable< T2 > > Comparator< Pair< T1 , T2 > > getFirstComarator() {
return new Comparator< Pair< T1 , T2 >... | 0 | 22 |
C20082 | C20041 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package jp.funnything.competition.util;
import java.util.Arrays;
import java.util.Iterator;
/**
* Do NOT change the element in iteration
*/
public class Permutation implements Iterable< int[] > , Iterator< int[] > {
public static int[] fromNumber( long value , final int n ) {
final int[] data = new int[... | 0 | 23 |
C20082 | C20068 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package com.brootdev.gcj2012.common;
import java.io.*;
public class Data {
public final BufferedReader in;
public final PrintWriter out;
public Data(String inFile, String outFile) throws IOException {
in = new BufferedReader(new FileReader(inFile));
out = new PrintWriter(new BufferedWrit... | 0 | 24 |
C20082 | C20017 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package problem.d.hall.of.mirrors;
import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;
/**
*
* @author Park
*/
public class ProblemDHallOfMirrors {
static int ... | 0 | 25 |
C20082 | C20042 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 26 |
C20082 | C20013 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | import java.awt.Color;
import java.awt.Graphics2D;
import java.awt.image.BufferedImage;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
import javax.imageio.ImageIO;
class findRes
{
double angle;
double... | 0 | 27 |
C20082 | C20000 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | import static java.lang.Math.*;
import java.io.*;
import java.util.*;
/**
* @author Chris Dziemborowicz <chris@dziemborowicz.com>
* @version 2012.0415
*/
public class HallOfMirrors
{
public static void main(String[] args)
throws Exception
{
// Get input files
File dir = new File... | 0 | 28 |
C20082 | C20071 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package qual;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.List;
public class D {
static class Ray{
// directions
public static byte U = 0; // up
public static byte L = 1; // left
public sta... | 0 | 29 |
C20082 | C20010 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;
import java.util.Stack;
public class codejamp4 {
public sta... | 0 | 30 |
C20082 | C20070 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package com.brootdev.gcj2012.problemD;
import com.brootdev.gcj2012.common.Data;
import java.io.IOException;
import java.util.logging.Level;
import java.util.logging.Logger;
public class Main {
private static final Logger logger = Logger.getLogger(Main.class.getSimpleName());
private static final double PI2 ... | 0 | 31 |
C20082 | C20055 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | package jp.funnything.competition.util;
import java.util.Arrays;
import java.util.Iterator;
/**
* Do NOT change the element in iteration
*/
public class Permutation implements Iterable< int[] > , Iterator< int[] > {
public static int[] fromNumber( long value , final int n ) {
final int[] data = new int[... | 0 | 32 |
C20082 | C20077 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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;
... | 0 | 33 |
C20082 | C20024 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 =... | 0 | 34 |
C20082 | C20001 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 35 |
C20082 | C20049 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 36 |
C20082 | C20034 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* 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 | 37 |
C20082 | C20036 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* 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 | 38 |
C20082 | C20081 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 39 |
C20082 | C20038 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 40 |
C20082 | C20058 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 41 |
C20082 | C20011 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... |
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 | 42 |
C20082 | C20032 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* 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 | 43 |
C20082 | C20033 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* 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 | 44 |
C20082 | C20014 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... |
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 | 45 |
C20082 | C20053 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 46 |
C20082 | C20046 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 47 |
C20082 | C20061 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 48 |
C20082 | C20087 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... |
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 | 49 |
C20082 | C20079 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 50 |
C20082 | C20047 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 51 |
C20082 | C20007 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 52 |
C20082 | C20028 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* 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 | 53 |
C20082 | C20022 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 54 |
C20082 | C20016 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | // 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 | 55 |
C20082 | C20072 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* 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 | 56 |
C20082 | C20037 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* 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 | 57 |
C20082 | C20054 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 58 |
C20082 | C20080 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 59 |
C20082 | C20084 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 60 |
C20082 | C20027 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* 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 | 61 |
C20082 | C20009 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 62 |
C20082 | C20060 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 63 |
C20082 | C20004 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 64 |
C20082 | C20005 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 65 |
C20082 | C20065 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 66 |
C20082 | C20006 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 67 |
C20082 | C20067 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 68 |
C20082 | C20008 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 69 |
C20082 | C20063 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 70 |
C20082 | C20015 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 71 |
C20082 | C20050 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 72 |
C20082 | C20085 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 73 |
C20082 | C20020 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 74 |
C20082 | C20062 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 75 |
C20082 | C20059 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 76 |
C20082 | C20064 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 77 |
C20082 | C20076 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 78 |
C20082 | C20026 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 79 |
C20082 | C20078 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 80 |
C20082 | C20057 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 81 |
C20082 | C20030 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | /*
* 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 | 82 |
C20082 | C20002 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 83 |
C20082 | C20056 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 84 |
C20082 | C20018 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 85 |
C20082 | C20051 | import java.util.*;
import java.io.*;
class Frac
{
public static int gcd(int u, int v)
{
while (v != 0)
{
int t = v;
v = u % v;
u = t;
}
return Math.abs(u);
}
public int n;
public int d;
public Frac(int n, int d)
... | 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 | 86 |
C20025 | C20012 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... |
public class CGConst {
public static final int INF = 99999999;
public static final double EPS = 1e-9;
public static final double pi = Math.PI;
}
| 0 | 87 |
C20025 | C20069 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | package com.brootdev.gcj2012.common;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.PrintWriter;
public class DataUtils {
public static int readIntLine(BufferedReader in) throws IOException {
return Integer.valueOf(in.readLine());
}
public static long readLongLine(Buff... | 0 | 88 |
C20025 | C20039 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | package jp.funnything.competition.util;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import org.apache.commons.compress.archivers.zip.ZipArchiveEntry;
import org.apache.commons.compress.archivers.zip.ZipArchiveOutputStream;
import org.apache.commons.io.FileUtils;
import org.apache.... | 0 | 89 |
C20025 | C20031 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public enum Square {
ME,
MIRROR,
EMPTY;
public static Square parse(char in) {
if (in == '#') return MIRROR;
else i... | 0 | 90 |
C20025 | C20003 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | import java.io.*;
import java.util.*;
public class D {
public static class Pair {
public int r;
public int c;
public Pair(int r, int c) {
this.r = r;
this.c = c;
}
@Override
public boolean equals(Object o) {
if (o == null)
return false;
if (!(o instanceof Pair))
return false;
... | 0 | 91 |
C20025 | C20029 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public class Ray {
private final Fraction expiryLengthSquared;
public RayVector vector;
private FractionPoint currentLocatio... | 0 | 92 |
C20025 | C20040 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | 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 | 93 |
C20025 | C20035 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | /*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package uk.co.epii.codejam.hallofmirrors;
/**
*
* @author jim
*/
public class Surround {
private Square[][] surround;
public Surround(Square[][] surround) {
this.surround = surround;
}
... | 0 | 94 |
C20025 | C20045 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | 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 | 95 |
C20025 | C20052 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | 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 | 96 |
C20025 | C20073 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | /*
* Main.java
*
* Created on 14.04.2012, 10:03:46
*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package codejam12;
import qualification.CodeJamQuali;
/**
*
* @author Besitzer
*/
public class Main {
/**
* @param args the command line arguments
... | 0 | 97 |
C20025 | C20043 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | package jp.funnything.competition.util;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import org.apache.commons.compress.archivers.zip.ZipArchiveEntry;
import org.apache.commons.compress.archivers.zip.ZipArchiveOutputStream;
import org.apache.commons.io.FileUtils;
import org.apache.... | 0 | 98 |
C20025 | C20083 | package j2012qualifier;
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class D {
public static String inputDirectory="src/j2012qualifier/";
public static String inputFile="... | import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
public class QuestionD {
public static void doPuzzle() {
try {
File question... | 0 | 99 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.