src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class A {
BufferedReader in;
StringTokenizer st;
PrintWriter out;
s... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.fill;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.sort;
public class Main {
public static void main(String[] args) throws IOException {
// try {
// if (new File("input.txt").exists()... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
class IO {
BufferedReader reader;
PrintWriter writer;
StringTokenizer tokenizer;
IO() {
reader = new BufferedReader(new InputStreamReader(System.in));
writer = new PrintWriter(new BufferedOutputStream(System.out));
tokenizer = new StringTok... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;
public class C {
public static void main(String[] args) throws IOException {
init(System.in);
BigInteger x = new BigInteger(next());
if (x.compareTo(BigInteger.ZERO) == 0) {
System.out.println(0);
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
//created at 6:06 PM 12/9/11 by Abrackadabra
public class A {
int IOMode = 0; //0 - consoleIO, 1 - <taskName>.in/out, 2 - input.txt/output.txt, 3 - test case generator
String taskName = "";
void solve() throws IOException {
int n = nextInt... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
import java.io.Writer;
import java.math.BigInteger;
import java.io.InputStream;
/**
*... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import sun.reflect.generics.tree.Tree;
import java.io.*;
import java.math.BigInteger;
import java.net.Inet4Address;
import java.util.*;
public class l {
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////... | nlogn | 527_C. Glass Carving | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.Map;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.math.BigDecimal;
import java.io.BufferedWriter;
import java.util.Locale;
import java.util.InputMismatchException;
import java.util.HashMap;
import java.util.Set;
import java.io.OutputStream;
import java.io.PrintWriter;
impo... | linear | 224_B. Array | CODEFORCES |
import java.util.*;
public class P023A {
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
String line = in.next();
HashSet<String> hash = new HashSet<String>();
int ans = 0;
for (int len = line.length()-1; len > 0; --len)
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
//import javafx.util.*;
import java.math.*;
//import java.lang.*;
public class Main
{
// static int n;static ArrayList<Integer> arr[];
// int ans[];
public static void main(String[] args) throws IOException {
// Scanner sc=new Scanner(System.in);
Pr... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws IOException {
PrintWriter out = new PrintWriter(System.out);
//Scanner sc = new Scanner();
Reader in = new Reader();
Main solver = new Main();
solver.... | nlogn | 958_B2. Maximum Control (medium) | CODEFORCES |
import java.util.*;
import java.io.*;
public class GG {
public static void main(String[] args) {
FastScanner scanner = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int N = scanner.nextInt();
int M = scanner.nextInt();
int K = scanner.nextInt();
i... | cubic | 1187_G. Gang Up | CODEFORCES |
import java.io.*;
import java.util.*;
/*
polyakoff
*/
public class Main {
static FastReader in;
static PrintWriter out;
static Random rand = new Random();
static final int oo = (int) 1e9 + 10;
static final long OO = (long) 1e18 + 10;
static final int MOD = (int) 1e9 + 7;
static int M;
... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.util.Scanner;
public class D {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
long l = s.nextLong();
long r = s.nextLong();
long a = l ^ r;
long b = a;
while (b != 0) {
a = b;
b = (b-1) & b;
}... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: dev_il
* Date: 03.08.2010
* Time: 0:59:04
* To change this template use File | Settings | File Templates.
*/
import java.io.*;
import static java.lang.Math.*;
import java.util.*;
public class IQTest implements Runnable {
BufferedReader in;
PrintWriter out;
... | linear | 25_A. IQ test | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main
{
public static void main(String args[]) throws IOException
{
new Main().run();
}
StreamTokenizer in;
PrintWriter out;
public void run() throws IOException
{
in =new StreamTokenizer(new BufferedReade... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
public class A {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class A{
private BufferedReader in;
private StringTokenizer st;
void solve() throws IOException{
int n = nextInt();
System.out.println(3 * n/2);
}
A() throws ... | constant | 84_A. Toy Army | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class a extends Thread {
BufferedReader bf;
PrintWriter out;
FastScanner in;
void solve() throws Exception {
long n = in.nextLong();
long f[] = new long[2001];
int i = 2;
f[0] = 0;
f[1] = 1;
while (true){
f[i] = f[i-1] + f[i-2];
... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution
{
public static void main(String [] args) throws IOException
{
PrintWriter pw=new PrintWriter(System.out);//use pw.println() not pw.write();
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenize... | linear | 1011_A. Stages | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class C {
static StringTokenizer st;
static BufferedReader br;... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class MainG {
static StdIn in = new StdIn();
static PrintWriter out = new PrintWriter(System.out);
static long M=(long)1e9+7;
public static void main(String[] args) {
char[] cs = in.next().toCharArray();
int n=cs.length;
int[] x = new int[n];
for(int i=0; i<n;... | quadratic | 908_G. New Year and Original Order | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class Main implements Runnable {
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numCha... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.math.*;
import java.io.PrintStream;
import static java.lang.Math.*;
public class Task275A {
public static Scanner in = new Scanner(System.in);
public static PrintStream out = System.out;
public static void main(String[] args) {
long l = in.nextLong();
long ... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class A25 {
static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
static PrintWriter out = new PrintWriter(System.out);
static int n... | linear | 25_A. IQ test | CODEFORCES |
import java.io.*;
import java.util.*;
public class MainF {
public static void main(String[]args) throws IOException{
BufferedReader br = new BufferedReader(new FileReader(new File("input.txt")));
BufferedWriter bw = new BufferedWriter(new FileWriter(new File("output.txt")));
String S = br.r... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class A implements Runnable{
public static void main (String[] args) {new Thread(null, new A(), "_cf", 1 << 28).start();}
public void run() {
FastScanner fs = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
System.err.println("Go!");
int n = fs... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.util.Scanner;
public class Fishes {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
double[][] p = new double[n][n];
double[] dp = new double[1 << 18];
for (int i = 0; i < n; i++) {
for (int j = 0; j ... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class codeforces {
public static long cnt = 0;
public static void f(int g1, int g2, int g3, int last) {
if (g1 == 0 && g2 == 0 && g3 == 0) cnt++;
if (g1 > 0 && last != 1) f(g1 - 1, g2, g3, 1);
if (g2 > 0 && ... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.awt.Point;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Bit... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
import java.util.Locale;
public class E16 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws ... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.util.*;
public class Template implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void init() throws FileNotFoundException {
in = new BufferedReader(new InputStreamReader(System.in));
out = new PrintWri... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;
imp... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
//package codeforces.contests.cf159;
import java.io.*;
import java.util.Arrays;
public class ProblemA {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));
int[] readInts() throws IOException {
Str... | nlogn | 257_A. Sockets | CODEFORCES |
//make sure to make new file!
import java.io.*;
import java.util.*;
public class B713{
public static BufferedReader f;
public static PrintWriter out;
public static void main(String[] args)throws IOException{
f = new BufferedReader(new InputStreamReader(System.in));
out = new PrintWriter(S... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
int n, m, k;
int[] a;
void run()throws IOException{
// BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
Scanner sc = new Scanner(new InputStreamReader(System.in));
n = sc.nextInt();
m = sc.nextInt();
k = sc.nextInt();
a = n... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;
public class Main {
static long MOD = (long) 1e9 + 7;
static long[][] identity = {{1, 0}, {0, 1}};
public static void main(String[] args) {
FastScanner input = new FastScanner(System.in);
long x = input.nextL... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class A implements Runnable {
public static void main(String[] args) {
new A().run();
}
class FastScanner {
BufferedReader br;
StringTokenizer st;
boolean eof;
String buf;
public FastScanner(String fileName) throws FileNotFoundException {
br = new Buffer... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class ReallyBigNumbers817c {
static long sd(String s) {
long c = 0;
for (int i = 0; i < s.length(); i++) {
c += s.charAt(i);
}
return c - s.length() * 0x30;
}
public static void main(String[] args) throws IOException... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
public class D7182 {
public static void main(String[] args) throws IOException {
init_io();
int N = nint(), M = nint(), K = nint();
if (K % 2 == 0) {
int[][][] grid = new int[K+1][N][M];
int[][][] edges = new int[4][N][M];
for (int i = 0... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
public class cf112e {
static int n,m,s;
static int[][][] memo;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
n = in.nextInt();
m = in.nextInt();
if(n > m) {
int tmp = n;
n = m;
m = tmp;
}
s = (1<<n);
memo = new int[s][s][m];
for(int i=0; i... | np | 112_E. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
Scanner cin = new Scanner(new BufferedInputStream(System.in));
long n;
long maxlcm;
void run(){
n = cin.nextInt();
if(n == 1 || n ==2)
maxlcm = n;
else if(n >= 3){
if(n % 2 != 0){
maxlcm = ... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.text.DecimalFormat;
import java.util.StringTokenizer;
public class Main {
static int N;
static int K;
static int A;
static double dl[];
static int base[];
static int needed;
static int b[] = new int[N];
s... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class Example {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(in.readLine());
} catch (Exception e) {
... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.util.Scanner;
public class CF489_C {
static long mod = 1000000007;
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
long x = s.nextLong(), k = s.nextLong();
if (x == 0) {
System.out.println(0);
return;
}
long max = x % mod;
long temp = power(2, k, mod);
t... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class C {
static boolean[][] matrix;
static long[][] dp;
static int n;
static int m;
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
n = s.nextInt();
m = s.nextInt();
matrix = new... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.io.*;
import java.util.*;
public class Mai {
public static void main(String[] args) throws IOException{
Scanner cin = new Scanner(System.in);
int t, n, m;
t = cin.nextInt();
while(t > 0) {
t--;
int sum = 0;
n = cin.nextInt();
m = cin.nextInt();
while(n > 0 && m > 0) {
... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) throws Exception {
MyReader reader = new MyReader(System.in);
// MyReader reader = new MyReader(new FileInputStream("input.txt"));
MyWriter writer = new MyWriter(System.out);
new Sol... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public class C
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
long n = Long.parseLong(in.next());
long s = Long.parseLong(in.next());
if(!check(n, s)){
System.out.println(0);
}
else
{
long min = 1;
long max = n;
while(mi... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class B {
static StringTokenizer st;
static BufferedReader br;... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
import java.util.function.Function;
public class P1196D2 {
static boolea... | quadratic | 1196_D2. RGB Substring (hard version) | CODEFORCES |
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
if (n % 2 == 0) {
System.out.printf("%d %d", 4, n - 4);
} else {
System.out.printf("%d %d", 9, n - 9);
}
... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.util.ArrayList;
import java.util.Scanner;
public class primes {
public static void main(String [] args){
ArrayList<Integer> numb=new ArrayList<Integer>();
Scanner br1 = new Scanner(System.in);
int n=br1.nextInt();
int steps=br1.nextInt();
//if(n>2)numb.add(2);
if(n>=3)numb.add(3);
for(int j=4;j<=n;j+... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
public class village {
static int[] X, A;
public void solve()
{
Scanner in = new Scanner(System.in);
int N = in.nextInt(), T = in.nextInt();
X = new int[N];
A = new int[N];
for(int i = 0; i < N; i++) {
X[i] = in.nextInt(); A[i] = in.n... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.*;
public class Solution {
public static void main(String[] args) {
class Pair {
int start;
int end;
public Pair(int start, int end) {
this.start = start;
this.end = end;
}
}
Scanner sc = n... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.util.Scanner;
public class A_Lucky_Division {
public static void main(String[] args){
Scanner input=new Scanner(System.in);
int number=input.nextInt();
int flag=0;
if(number%4==0)flag=1;
else if(number%7==0)flag=1;
else if(number%47==0)flag=1;
else if(number%74==0)flag=1;
else if(number%44... | constant | 122_A. Lucky Division | CODEFORCES |
import java.util.HashSet;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
HashSet<Integer> set = new HashSet<>();
for(int i = 0; i<n; i++){
int a = sc.nextInt();
... | linear | 992_A. Nastya and an Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Code {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
Ha... | linear | 958_D1. Hyperspace Jump (easy) | CODEFORCES |
/*
Keep solving problems.
*/
import java.util.*;
import java.io.*;
public class CFA {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
final long MOD = 1000L * 1000L * 1000L + 7;
int[] dx = {0, -1, 0, 1};
int[] dy = {1, 0, -1, 0};
void solve() throws IOException {
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.Scanner;
import java.io.PrintWriter;
/**
* @author Egor Kulikov (kulikov@devexperts.com)
*/
public class Spreadsheets implements Runnable {
private Scanner in = new Scanner(System.in);
private PrintWriter out = new PrintWriter(System.out);
private String s, ans;
public static void main(String[]... | linear | 1_B. Spreadsheets | CODEFORCES |
import com.sun.org.apache.xerces.internal.util.SynchronizedSymbolTable;
import jdk.management.cmm.SystemResourcePressureMXBean;
import java.awt.*;
import java.io.*;
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.util.List;
import java.math.*;
public class Newbie {
... | quadratic | 995_B. Suit and Tie | CODEFORCES |
import java.util.*;
import java.io.*;
public class Deltix {
static PrintWriter out;
public static void main(String[] args) {
MyScanner sc = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int t = sc.nextInt();
while (t-- > 0) {
int n = s... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
import java.awt.geom.*;
public class FunctionHeight {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
long n = sc.nl();
long k = sc.nl();
long ans = (n+k-1)/n;
System.out.println(ans);
}
... | constant | 1036_A. Function Height | CODEFORCES |
import java.awt.Point;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class FireAgain {
Point coordinate;
Queue<Point> q = new Linke... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.Reader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at th... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
public static void main(String[] argv) {
new Main().run();
}
void run() {
in = new Scanner(System.in);
out = new PrintWriter(System.out);
try {
solve();
} finally {
out.... | nlogn | 166_A. Rank List | CODEFORCES |
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(Syste... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.math.BigInteger;
import java.nio.charset.Charset;
import java.util.*;
public class CFContest {
public static void main(String[] args) throws Exception {
boolean local = System.... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.lang.*;
public class CF1003E{
public static void main(String args[]) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] s = br.readLine().split(" ");
int n = Integer.parseInt(s[0]);
int d = Integer.pars... | quadratic | 1003_E. Tree Constructing | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
// author @mdazmat9
public class codeforces{
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int test = 1;
for (int ind = 0; i... | constant | 911_C. Three Garlands | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class E implements Runnable {
public static void main (String[] args) {new Thread(null, new E(), "_cf", 1 << 28).start();}
int n, m;
char[] str;
int[][] occs, cost;
int[] dp;
public void run() {
FastScanner fs = new FastScanner();
P... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class Start {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer ... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
static int n, k;
public static void main(String[] args) throws IOException {
FastScanner sc = new FastScanner();
PrintWriter pw = new PrintWriter(System.out);
n = sc.nextInt();
k = sc.nex... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
BufferedReader in;
StringTokenizer st;
PrintWriter out;
String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(in.readLine());
return st.nextToken();
}
int nextIn... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
/**
* Road to 1600 raiting
*/
public class Main {
static class Task {
PrintWriter out;
int[] num = new int[3];
public void solve(MyScanner in, PrintWriter out) {
this.out = out;
long n = in.nextLong();
long s = i... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* Author -
* User: kansal
* Date: 9/3/11
* Time: 5:28 PM
*/
public class CF85E {
public static void main(String[] args) {
reader = new BufferedRea... | np | 112_E. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Watermelon {
static int[][] ans;static int n,m;static boolean[][] vis;
public static void main(String[] args) throws IOException {
Scanner sc=new Scanner(new File("input.txt"));
// Scanner sc=new Scanner(System.in);
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
public class Main {
final int INF = Integer.MAX_VALUE / 2;
private void doit(){
Scanner sc = new Scanner(System.in);
//while(sc.hasNext()){
int n = sc.nextInt();
if(n == 0){
System.out.println("0 0 0");
}
else i... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.util.Scanner;
public class R025A {
int n;
int[] nums;
public R025A() {
Scanner scanner = new Scanner(System.in);
n = scanner.nextInt();
nums = new int[n];
for(int i=0; i<n; i++) {
nums[i] = scanner.nextInt();
}
}
private void process() {
int[] c = new int[2];
int[] r = new int[2];
... | linear | 25_A. IQ test | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class CodeForces1177B {
public static char custBinSearch(long lower, long upper, long lowIndex, int ten, long position) {
long half = Math.round((lower + upper) / 2.0);
long lowBound = lowIndex + (half - lower... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
//package codeforces.br22;
import java.io.*;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
/**
* User: Kandy
* Date: 29.06.2010
* Time: 21:07:24
*/
public class ProblemA {
public void solve() {
boolean oj = true;
try {
Reader reader = oj ? new In... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class Etruco2 {
static String[] vals = {
"%S3L{PYzV1%SGI'>$/4Gam=^#ODu|`Q!Bys%Mw|?fA*0ti{r69RB1N`{B>YC;.:XEmm3t-i^N",
"#Y73mVxQ&J`inFO4.v<j?yg{4~O=p=t$'#UHQizDnbsn,+JyuS~@WKw0p*Gy%V:#sa5,L|9RX{",
"f0J*n]5ZaRg:d-;{f!Y47]i_'u'cTz*=K$b#=}w[U]3*f+$|4ePs'K?]p8~0loSL$h_+T^{+ik",
"@r)... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
InputReader input;
PrintWriter output;
void run(){
output = new PrintWriter(new OutputStreamWriter(System.out));
input = new InputReader(System.in);
solve();
output.flush();
}
public st... | np | 16_E. Fish | CODEFORCES |
// upsolve with rainboy
import java.io.*;
import java.util.*;
public class CF1187G extends PrintWriter {
CF1187G() { super(System.out); }
static class Scanner {
Scanner(InputStream in) { this.in = in; } InputStream in;
int k, l; byte[] bb = new byte[1 << 15];
byte getc() {
if (k >= l) {
k = 0;
try {... | cubic | 1187_G. Gang Up | CODEFORCES |
import java.util.*;
public class LCMChallenge {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.nextInt();
if(n == 1l)
System.out.println(1);
else if(n == 2l)
System.out.println(2);
else
{
long c1 = n*(n-1)*(n-2);
long c2 = n*(n-1)*(n-3);
long c3 = (... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Test3 {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int x=Integer.parseInt(br.readLine());
int ... | constant | 913_A. Modular Exponentiation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.HashMap;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class E {
static int g[][];
static int n, m;
static char[] s;
static int dp[], inf = (int) 2e9;
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
PrintWriter p... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.util.regex.*;
/**
*
* @author jon
*/
public class Fish {
double memo[] = new double[(1<<18)];
int N, FULL;
double prob[][] = new double[18][18];
Fish() {
Scanner in = new Scanner(System.in);
Arrays.fill(memo, -1);
... | np | 16_E. Fish | CODEFORCES |
import java.util.*;
public class helloWorld
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int a = in.nextInt();
int b = in.nextInt();
int c = in.nextInt();
int n = in.nextInt();
int ans = n - (a + b - c);
if(ans < 1 || a >= n || b >= n || c > a || c > b)
ans = ... | constant | 991_A. If at first you don't succeed... | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class cf2 {
static final double EPS = 1e-9;
public static void main(String[] args) thro... | constant | 994_C. Two Squares | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Solution {
private static int[] a;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), m = sc.nextInt();
a = new int[101];
for (int i = 0; i < m; i++) {
... | nlogn | 1011_B. Planning The Expedition | CODEFORCES |
import java.util.List;
import java.util.Scanner;
import java.util.Comparator;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Scanner;
public class LuckyDivision {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
if( n % 4==0 ||
n % 7==0 ||
n % 47==0 ||
n % 74==0 ||
n % 447==0 ||
... | constant | 122_A. Lucky Division | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.