src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.PrintWriter;
import java.util.Scanner;
public class D {
public void solve(Scanner in, PrintWriter out) {
int n = in.nextInt();
int[] a = new int[n + 1];
for(int i = 1; i <= n; ++i) a[i] = in.nextInt();
int[] rangeInv = new int[n + 1];
BIT bit = new BIT(n + 1);
for(int i = 1; i <= n; +... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import java.io.*;
public class B {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
public static void main(String[] args) throws Exception {
String[] split = br.r... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.math.*;
public class fuck {
public static int[] a;
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
long r = input.nextLong();
long l = input.nextLong();
if((l - r + 1) < 3){
System.out.println(-1);
}
else
{
if(r % 2 == 0)
System... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class cf8c {
static int n;
stati... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
private static final double EPS = 1e-11;
public static void main(String[] args) throws IOException {
new Main().run();
}
BufferedReader in;
PrintWriter out;
StringTokenizer st = new StringTokeniz... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
public class Main {
private static void solve() {
long x = nl();
long k = nl();
long mod = 1000000000 + 7;
if (x == 0) {
System.out.println(0);
} else if (k == 0) {
System.out.println(x * 2 % mod);
} else {
//x > 0, n > 0
x %= mod;
long a;
a ... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class B {
static BufferedReader in;
static StringTokenizer st;
... | linear | 224_B. Array | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution i... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Test5 {
static StreamTokenizer st = new StreamTokenizer(new InputStreamReader(System.in));
static int[] m;
public static void main(String[] z) throws Exception {
PrintWriter pw = new PrintWriter(System.out);
Scanner ... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.util.*;
import java.io.*;
public class P911d {
private static void solve() {
int n = nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
public class maestro{
public static long inversions(long[] arr) {
long x = 0;
int n = arr.length;
for (int i = n - 2; i >= 0; i--) {
for (int j = i + 1; j < n; j++) {
if (arr[i] > arr[j]) {
x++;
//temp++;... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class A implements Runnable{
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE")!=null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new Stri... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.*;
import java.awt.*;
public class A
{
static Comparator<Point> cmp = new Comparator<Point>()
{
public int compare(Point a, Point b)
{
if(a.x < b.x)
return -1;
else if(a.x > b.x)
return 1;
return 0;
}
};
public static void main(String args[])
{
Scanner scan = new Scanne... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.OutputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.FileInputStream;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collection;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTok... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static final int MAXN= 1005;
static final long MOD =1_000_000_007;
static final boolean DEBUG= false;
static int n, m;
static long stlr[][]= new long[MAXN][MAXN],bell[]= new long[MAXN],occ[];
static PrintStream cerr=System.err;
public static void main(S... | quadratic | 908_E. New Year and Entity Enumeration | CODEFORCES |
import java.io.*;
import java.util.*;
public class History {
static final int INF = (int)1E9;
static final double EPS = 1E-9;
static final long MOD = INF + 9;
static long powmod(long p) {
long res = 1;
long d = 2;
while (p > 0) {
if (p % 2 == 1) {
res = (res * d) % MOD;
p--;
}
else {
d... | logn | 338_A. Quiz | CODEFORCES |
import java.text.DecimalFormat;
import java.util.Scanner;
/**
*
* @author Alvaro
*/
public class Main{
public static int n;
public static double [] dp;
public static double [][] p;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
n = in.nextInt();
... | np | 16_E. Fish | CODEFORCES |
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
//package newpackage;
import java.util.*;
/**
*
* @author parpaorsa
*/
public class NewClass {
static Scanner in=new Scanner(Sys... | linear | 1159_A. A pile of stones | 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.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... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class C {
static final int MOD = (int)1e9 + 7;
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
long x = sc.nextLong(), k = sc.ne... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
public void _main() throws IOException {
int n = nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
Arrays.sort(a);
for (int i = 1; i < n; i++)
if (a[i] != a[0]) {
out.print(a[i]);
return... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class A {
public static void main(String[] args) {
OutputStream outputStream = System.out;
PrintWriter out = new PrintWriter(outputStream);
Application solver = new Application();
solver.solve(System.in, out);
... | constant | 313_A. Ilya and Bank Account | 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.StringTokenizer;
public class D5 {
static StringTokenizer st;
static BufferedReader in;
public st... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception{
FastReader sc=new FastReader();
... | quadratic | 987_C. Three displays | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
// TODO Auto-generated method stub
BufferedReader in = new Buf... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class TestClass {
static PrintWriter out = new PrintWriter(System.out);
public static void main(String args[] ) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String s[] = in.readLine().split(" ");
long ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.math.BigInteger;
import java.util.HashMap;
import java.util.Locale;
import java.util.Map;
import java.util.Scanner;
public class Main implements Runnable {
/**
* @param args
*/
public static void main(Strin... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.Set;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.HashSet;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
/** Oct 21, 2012 **/
import java.util.InputMismatchException;
import java.util.LinkedList;
/**
* @author DOAN Minh Quy
* @email mquy.doan@gmail.com
*/
public class C236 {
/**
* @param arg... | constant | 235_A. LCM Challenge | 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.StringTokenizer;
public class A {
private static StringTokenizer tokenizer;
private static BufferedReader bf... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
FastIO io = new FastIO();
int test=io.nextInt();
while(test>0)
{
int n=io.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++)arr[i]=io.nextInt();
List<int[]> list=new A... | cubic | 1523_C. Compression and Expansion | 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.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
public class D {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int t = 1;
for (int i = 0; i < t; i++) {
solve(sc, pw);
}
pw.close... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.lang.*;
public class Practice {
public static long mod = (long) Math.pow(10, 9) + 7;
public static long tt = 0;
public static void main(String[] args) throws Exc... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException{
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new PrintStream(System.out));
int n=Integer.parseInt(f.readLine());... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main implements Runnable {
private int n;
priva... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;
public final class Solution {
BufferedReader br;
StringTokenizer st;
{
st = null;
br = new BufferedReader(new InputStreamReader(System.in));
}
public static void main(String[] args) throws Exc... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.List;
import java.util.LinkedList;
import java.util.StringTokenizer;
public class Problem {
public static Pair solve(Forest f, List<Pair> queue){
Pair current = null, next = null;
int index = 0;
while(queue.size() > 0){
current = queue.remove(0);
index = f.desk[current... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.HashMap;
import java.util.ArrayList;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public cl... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
public class ProblemA {
static final int INF = 100000000;
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new Inpu... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.util.Scanner;
import java.util.StringTokenizer;
/**
* Created with IntelliJ IDEA.
* User: Саша
* Date: 08.08.12
* Time: 14:12
*/
public class LuckyDivision {
public final String check (String s) {
String result = "NO";
StringTokenizer stringTokenizer = new StringTokenizer(s, "47")... | constant | 122_A. Lucky Division | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class e1515 {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
solve(s.nextInt(), s.nextLong());
}
public static long inv(long n, long mod) {
if (n == 1) return 1;
return (inv(mod % n, ... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
static final int MAX_N = 1000010;
static final ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class A {
BufferedReader reader;
StringTokenizer tokenizer;
PrintWriter out;
long MOD = 1000000009;
public long mod_add(long n1, long n2){
ret... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
public class Compute {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long M = sc.nextInt();
long fact[] = new long[n+1];
long inv[] = new long[n+1];
long ifact[] = new long[n+1];
long d... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class Contest1_1{
public static void main(String ar[]) throws Exception {
BufferedReader buff = new BufferedReader(new InputStreamReader(System.in));
int input = Integer.parseInt(buff.readLine());
if(input==0){
System.... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.util.Arrays;
/**
* Created by IntelliJ IDEA.
* User: piyushd
* Date: 3/26/11
* Time: 10:53 PM
* To change this template use File | Settings | File Templates.
*/
public class TaskC {
final int INF = 123456;
int[][][] memo;
int N, M;
int solve(int row, int prevFreeMask, int curStayMa... | np | 112_E. Petya and Spiders | CODEFORCES |
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class temp
{
void solve()
{
FastReader sc =new FastReader();
int n = sc.nextInt();
ArrayList<String> a[] = new ArrayList[5];
for(int i=0;i<=4;i++)
a[... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main implements Runnable {
private int n;
priva... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
public class LCM235A
{
public static void main(String[] args)
{
// Set up scanner
Scanner sc = new Scanner(System.in);
// System.out.println("Enter n");
long n = sc.nextLong();
if (n==1)
{
System.out.println(1);
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main{
/**
* @param args
*/
public static void main(String[] args) {
Parser p = new Parser(System.in);
PrintWri... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.*;
public class A {
public void run() throws Exception {
FastScanner sc = new FastScanner();
int n = sc.nextInt();
int[] arr = new int[n];
int[] color = new int[n];
for (int i = 0; i<n; i++) {
arr[i] =sc.nextInt();
}
Array... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class LCM {
public static long gcd(long a,long b) {
while(true) {
a=a%b;
if (a==0) return b;
b=b%a;
if (b==0) return a;
}
}
public static void main (String[] args) throws java.lang.Exception {
Scanner in=new Scanner(Sys... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static BufferedReader reader;
static StringTokenizer tokenizer;
static PrintWriter writer;
static int nextInt() throws NumberFormatException, IOException {
return Integer.parseInt(nextToken());
}
static long nextLong() throws NumberFormatException, I... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.*;
public class Pizza {
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
long num = sc.nextLong() + 1;
sc.close();
System.out.println(num % 2 == 0 || num == 1 ? num / 2 : num);
}
}
| constant | 979_A. Pizza, Pizza, Pizza!!! | CODEFORCES |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.lang.System.out;
import static java.util.Collections.*;
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
static boolean LOCAL = System.getSecurityManager() == null;
Scanner in = new Scanner(System.in);
... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import javax.annotation.processing.SupportedSourceVersion;
import java.io.*;
import java.util.*;
import java.util.regex.Matcher;
public class Main {
public static void main(String[] args) throws IOException {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
Inpu... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.Scanner;
public class x23A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String input = sc.next();
//input+="3";
int longest=0;
if(input.length()==1){
System.out.println(0);
System.exit(0);
}
if(input.length()==2){
if(input.charAt(0)==input.char... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
public class c8 {
static int n;
static int[] ds;
static int[][] g;
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
int x = input.nextInt(), y = input.nextInt();
int n = input.nextInt();
int[] xs = new int[n], ys = new int[n];
for(int i... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
import java.io.*;
public class SolutionC{
public static void main(String[] args) throws Exception{
Scanner sc = new Scanner(new File("input.txt"));
PrintWriter output = new PrintWriter("output.txt");
int N = sc.nextInt();
int M = sc.nextInt();
int K = sc.nextInt();
int[] x = new int[K]... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.Scanner;
public class Training {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long index = in.nextLong();
if (index < 10) {
//one digit
System.out.println(index);
} else if (index < 190) {
//two ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class A implements Runnable {
private void solve() throws IOException {
String str = nextToken();
for (int i=str.length()-1; i>=0; --i)
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
import java.util.StringTokenizer;
public class c {
public st... | nlogn | 912_C. Perun, Ult! | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static class Reader
{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
public Reader()
{
din = new DataInputS... | np | 1242_C. Sum Balance | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.PrintWriter;
public class C992
{
static class Scanner
{
BufferedReader br;
StringTokenizer tk=new StringTokenizer("");
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
static BufferedReader reader;
static StringTokenizer st;
private static void setReader() {
reader = new BufferedReader(new InputStreamReader(System.in))... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.util.*;
public class A
{
public static void main(String args[])
{
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int odd = -1;
int even = -1;
int oc = 0;
int ec = 0;
for(int i=0;i < n;i++)
{
... | linear | 25_A. IQ test | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class B {
public static void main(String[] args) throws IOException {
MyScanner sc = new MyScanner();
PrintWriter out = new PrintWriter(System.out);
... | logn | 1019_B. The hat | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.stream.IntStream;
public class Test {
static PrintWriter writer =
new PrintWriter(new BufferedWrite... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
/*
*/
public class e1 {
static int n;
static int m;
static int[][] mat;
public static void main(String[] args){
JS scan = new JS();
PrintWriter out = new PrintWriter(System.out);
int t = scan.nextInt();
for(int q = 1; q <= t; q++){
ans = 0;
n = scan.nextInt()... | np | 1209_E1. Rotate Columns (easy version) | 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 | 1019_B. The hat | CODEFORCES |
import java.util.*;
import java.io.*;
public class D0005 {
public static void main(String args[]) throws Exception {
new D0005();
}
D0005() throws Exception {
PandaScanner sc = null;
PrintWriter out = null;
try {
sc = new PandaScanner(System.in);
ou... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.HashSet;
import java.util.StringTokenizer;
public class Main {
public static String conv(String str) {
boolean[] Arr =... | constant | 975_B. Mancala | CODEFORCES |
//package round35;
import java.io.File;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class C {
Scanner in;
PrintWriter out;
// String INPUT = "3 3 1 1 1";
String INPUT = "";
void solve()
{
int n = ni();
int m = ni();
int k = ni();
int[] x = new int[k];
int[] y... | cubic | 35_C. Fire Again | CODEFORCES |
//package round584;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
public class E4 {
InputStream is;
PrintWriter out;
String INPUT = "";
void s... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.PrintStream;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(new BufferedInputStream(System.in));
PrintStream out=System.out;
int n=in.nextInt();
if (n>=0) out.println(n);
else out.println(Math.... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
//stan hu tao
//join nct ridin by first year culture reps
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.Math.abs;
import static java.lang.System.out;
import java.util.*;
import java.io.*;
import java.math.*;
public class x1209E
{
public static void main(String hi[]) th... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.util.*;
public class A912 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int A = scan.nextInt();
int B = scan.nextInt();
long x = scan.nextInt();
long y = scan.nextInt();
long z = scan.nextInt();
long requiredA =... | constant | 912_A. Tricky Alchemy | CODEFORCES |
import java.util.Scanner;
public class Solution {
public static void main(String [] args){
Scanner stdin = new Scanner(System.in);
long n = stdin.nextLong();
if(n<3) System.out.println(n);
else {
if(n%2==0){
long a=0,b=0;
if(n%3!=0) a = (n*... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
FastReader in = new FastReader();
int n = in.nextInt();
int[] a = new int[101];
for (int i = 0; i < n; i++) {
a[in.nextInt()]++;
}
int count = 0;
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class A135 {
public static void main(String[] args) throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(r.readLine());... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Round1B {
public static void main(String[] args) throws Exception {
new Round1B().run();
}
private void run() throws Exception {
Scanner sc = new Scanner(System.in);
int tc = Integer.parseInt(sc.nextLine()... | linear | 1_B. Spreadsheets | CODEFORCES |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.Scanner;
/**
*
* @author dilshan
*/
public class Test {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
Scanner s = new Scanner(S... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
public class Main implements Runnable {
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilte... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
static int n, exp;
static double arr[][],dp[], dies[][];
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new ... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.BigInteger;
import java.math.BigDecimal;
public class Main {
static class Task {
void solve(int test, FastScanner in, PrintWriter out) throws IOException {
int n = in.nextInt();
int d = in.nextInt();
... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.*;
import java.util.*;
public class icpc
{
public static void main(String[] args) throws IOException
{
Reader in = new Reader();
// BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
int n = in.nex... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class p7{
static class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
... | nlogn | 1054_D. Changing Array | CODEFORCES |
import java.util.*;
import java.io.*;
import java.awt.Point;
import java.math.BigInteger;
public class stacks {
public static void main(String[] args) throws Exception {
FastIO sc = new FastIO(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
int m = sc.nextInt();
long r... | nlogn | 1061_B. Views Matter | CODEFORCES |
import java.io.*;
import java.util.*;
public class ProblemB {
InputReader in; PrintWriter out;
void solve() {
int n = in.nextInt();
int x = in.nextInt();
int y = in.nextInt();
int c = in.nextInt();
int cur = 1;
for (int k = 1; k <= c; k++) {
// out.print... | logn | 256_B. Mr. Bender and Square | 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.FileReader;
import java.io.InputStreamReader;
import java.io.FileNotFoundException;
import java.io.... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class D {
static Scanner in = new Scanner(new BufferedInputStream(System.in));
static PrintWriter out = new PrintWriter(System.out);
static double getTime(double v, double a, double l, double r) {
return (-v + Math.sqrt(v * v - 2 * a * (l - r))) / a;
}
static dou... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import static java.lang.Math.*;
public class Main{
public static void main(String[] args){
new Main().run();
}
void run(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int t = sc.nextInt() * 2;
H[] tbl = new H[n];
for(int i = 0; i < n; i++)tbl[i] = new... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
StreamTokenizer in;
PrintWriter out;
public static void main(String[] args) throws Exception {
new Main().run();
}
public void run() throws Exception {
Locale.setDefault(Locale.US);
in = new StreamTokenizer (new Bu... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Equator {
public static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
public static ... | linear | 962_A. Equator | CODEFORCES |
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintStream;
import java.util.Scanner;
public class P35C {
int n, m;
int [][]fire;
public P35C() throws FileNotFoundException {
Scanner in = new Scanner(new FileReader("input.txt"));
n = in.nextInt();
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class A
{
String line;
StringTokenizer inputParser;
BufferedReader is;
FileInputStream fstream;
DataInputStream in;
String FInput="";
void openInput(String file)
{
if(file==null)is = new BufferedReader(new InputStreamReader(System.in));//stdin
else
{
try... | nlogn | 166_A. Rank List | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.