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.util.Scanner;
public class CFA {
private void work() throws IOException {
Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(
System.in)));
while (sc.hasNextInt()) {
int n = sc.nextInt()... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.util.*;
import java.io.*;
public class CodehorsesTshirts {
/************************ SOLUTION STARTS HERE ************************/
private static void solve() {
int n = nextInt();
HashMap<String, Integer> a = new HashMap<>();
... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner keyboard = new Scanner(System.in);
int size = keyboard.nextInt();
int[] arr = new int[size];
int i = 0;
while( size != 0 )
{
arr[i] = keyboard.nextInt();
size--;
i++;
}
//System.out.pr... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class A{
public static int mod = 1000000007;
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
char s[] = new char[n];
for(int i = 0; i < n; i++)
... | quadratic | 909_C. Python Indentation | 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.io.StreamTokenizer;
import java.util.Arrays;
public class B {
// -- DEBUG switch --
static final boolean DBG = fals... | linear | 224_B. Array | CODEFORCES |
// package codeforce.Training1900;
import java.io.PrintWriter;
import java.util.*;
//https://codeforces.com/problemset/problem/1141/F2
public class SameSumBlocks {
// MUST SEE BEFORE SUBMISSION
// check whether int part would overflow or not, especially when it is a * b!!!!
public static void main(Stri... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.*;
public class codeee {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
if(n==1){System.out.println(1); return;}
int []mas=new int[n];
int sum=0;
for (int i = 0; i < n; i++) {
mas[i]=sc.next... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
import java.util.ArrayList;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution ... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class test1
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int a[]=new int[n];
int b[]=new int[n];
for(int i=0;i<n;i++)
{
a[i]=in.nextInt... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.util.*;
public class A {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long A = in.nextLong();
long B = in.nextLong();
System.out.println(f(A,B));
}
static long f(long A, long B) {
if(A==0) return 0;
if(A < B) retur... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;
public class G {
InputStream is;
PrintWriter out;
String INPUT = "";
void ... | cubic | 1187_G. Gang Up | CODEFORCES |
import java.io.*;
import java.util.HashSet;
import java.util.StringTokenizer;
public class GB_A {
FastScanner in;
PrintWriter out;
public static void main(String[] arg) {
new GB_A().run();
}
public void solve() throws IOException {
int n = in.nextInt();
int r = in.nextInt... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.*;
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;
@Override
public void run() {
try {
long startTime = System.curre... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
PrintWriter out = new PrintWriter(System.out);
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tok = new StringTokenizer("");
String next() throws IOException {
if (!tok.hasMoreToke... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
public class Subtractions
{
/************************ SOLUTION STARTS HERE ***********************/
static long modifiedEuclidGCD(int a , int b) {
return b == 0 ? 0 : (a / b) + modifiedEuclidGCD(b, a % b);
}
private static void solve(FastScanner s1, PrintWriter out){
... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
private static void solve(InputReader in, OutputWriter out) {
int n = in.nextInt();
List<List<Integer>> g = new ArrayList<>(n + 1);
for (int i = 0; i < n + 1; i++) {
g.add(new LinkedList<>());
}
int deg... | linear | 981_C. Useful Decomposition | CODEFORCES |
import java.util.*;
public class Counterexample483A
{
public static void main(String[] args)
{
// Set up scanner
Scanner sc = new Scanner(System.in);
// System.out.println("Enter l");
long l = sc.nextLong();
// System.out.println("Enter r");
long r = sc.nextLon... | constant | 483_A. Counterexample | 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... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class B {
public static PrintWriter out;
public static BufferedReader bf;
public static int n;
public static int[] a;
public static void main(String[] args) throws Exception {
bf = new BufferedReader(new Inp... | logn | 1019_B. The hat | CODEFORCES |
import java.util.Scanner;
public class A {
/**
* @param args
*/
public static void main(String[] args) {
Account acnt = new Account();
acnt.solve();
acnt.print();
}
}
class Account {
Account() {
Scanner scr = new Scanner(System.in);
n = scr.nextInt();
}
void solve() {
if (n > 0) {
ans ... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import javafx.util.Pair;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main implements Runnable
{
boolean multiple = false;
long MOD;
@SuppressWarnings({"Duplicates", "ConstantConditions"})
void solve() throws Exception
{
int k = sc.nextInt();
... | np | 1242_C. Sum Balance | CODEFORCES |
import java.util.*;
public class Main{
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int a[]=new int[n];
for(int i=0;i<n;i++)
a[i]=sc.nextInt();
Arrays.sort(a);
//boolean
int t=1,c=0;
for(int i=1;i<n;i++){
if(a[i]==a[i-1]... | linear | 1190_B. Tokitsukaze, CSL and Stone Game | CODEFORCES |
import java.awt.List;
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.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
impo... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class EdE {
static long[] mods = {1000000007, 998244353, 1000000009};
static long mod = mods[0];
public static MyScanner sc;
public static PrintWriter out;
static long[][][] paths;
static long[] powers501;
public static void main(String[] havish) throws Excep... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner read = new Scanner(System.in);
double a = (double)read.nextInt();
double v = (double)read.nextInt();
double l = (double)read.nextInt();
double d = (double)read.nextInt();
... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class Main {
private static StreamTokenizer in;
private static PrintWriter out;
private static int nextInt() throws Exception {
in.nextToken();
return (int)in.nval;
}
private static Stri... | linear | 25_A. IQ test | CODEFORCES |
import javax.print.DocFlavor;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Round584_a {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamRea... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n, t[], g[], MOD = (int) 1e9 + 7;
static int[][][] memo1, memo2[], memo3[];
static int dp1(int idx, int remCnt, int remSum) {
if (idx == n)
return remSum == 0 && remCnt==0 ? 1 : 0;
if (memo1[idx][remCnt][remSum] != -1)
return memo1[idx][r... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class p3sol{
static char[] c;
static int[][] dp;
static int mod = (int)1e9 + 7;
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
c = new... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
public class BT {
static BufferedReader in = new BufferedReader(new InputStreamReader(
System.in));
static StringToken... | linear | 224_B. Array | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author codeKNIGHT
*/
public class Main {
public static void main(String[] args) {... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.FileNotFoundException;
import java.util.Scanner;
public class P1177A {
public static void main(String[] args) throws FileNotFoundException {
Scanner in = new Scanner(System.in);
// Scanner in = new Scanner(new File("input.txt"));
System.out.println(solve(in.nextLong()));
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
/**
* Created by Baelish on 8/28/2018.
*/
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class F_DSU {
public static void main(String[] args)throws Exception {
FastReader in = new FastReader(Sys... | quadratic | 1027_F. Session in BSU | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = in.nextInt(), m = in.nextInt(), k = in.nextInt();
int[] a = n... | nlogn | 257_A. Sockets | CODEFORCES |
//package test_1177a;
import java.util.Scanner;
import java.util.Scanner;
public class test1177b{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
long k = sc.nextLong();
long k1 =0,k2 = 0;
long p = 1;
String str=... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Set;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.TreeSet;
import java.util.StringTokenizer;
import java.io.InputSt... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import static java.lang.Math.*;
public class Main {
private FastScanner scanner = new FastScanner();
public static void main(String[] args) {
new Main().solve();
}
private void ... | linear | 990_C. Bracket Sequences Concatenation Problem | CODEFORCES |
/**
* BaZ :D
*/
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main
{
static Reader scan;
static PrintWriter pw;
static int n,k,left[],right[],arr[];
static long MOD = 1000000007,count[],dp[];
public static void main(String[] args) {
new Thread(null,null... | linear | 1037_F. Maximum Reduction | CODEFORCES |
import java.io.*;
import java.util.*;
public class ProblemaNoldbaha implements Runnable{
public static void main(String[] args) throws IOException {
new Thread(new ProblemaNoldbaha()).start();
}
BufferedReader br;
StringTokenizer in;
PrintWriter out;
public String nextToken() throws IOException{
while (i... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class CFJava {
private static void println(Integer n) {
System.out.println(n);
}
private static void println(String s) {
System.out.println(s);
}
private static... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
BufferedReader in;
StringTokenizer str = null;
PrintWriter out;
private String next() throws Exception{
while (str == null || !str.hasMoreElements())
str = new StringTokenizer(in.readLine());
return str.nextToken();
}
priva... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
/** Created by huhansan on 2017/10/9. */
public class CF_8C implements Runnable {
int[] step = new int[1 << 24]... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
/**
@author KhanhNguyenn
*/
public class C{
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class PhoenixAndComputers {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
St... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.util.Scanner;
public class Main2 {
public static void main(String args[]){
Scanner input = new Scanner(System.in);
long s = input.nextLong();
long e = input.nextLong();
System.out.println(count(s,e));
}
public static long count(long s,long e){
int nco... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.TreeMap;
public class A
{
public static void main(String [] args) throws IOException
{
Scanner in = new Scanner(System.in);
System.... | constant | 343_A. Rational Resistance | 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... | quadratic | 909_C. Python Indentation | CODEFORCES |
//I'm Whiplash99
import java.io.*;
import java.util.*;
public class C
{
public static void main(String[] args) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int i,N;
int T=Integer.parseInt(br.readLine().trim());
StringBuilder sb=new ... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class AA {
static class Pair implements Comparable<Pair> {
public int x, y;
public Pair(int x, int y) {
this.x = x;
this.y = y;
}
public int compareTo(Pair p) {
if (p.x != x)
return... | nlogn | 15_A. Cottage Village | CODEFORCES |
import static java.lang.Math.*;
import static java.lang.System.currentTimeMillis;
import static java.lang.System.exit;
import static java.lang.System.arraycopy;
import static java.util.Arrays.sort;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.fill;
import java.util.*;
import java.io.*;
p... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.security.KeyPair;
import java.util.*;
public class Main {
static long[][] c ;
static long[] arr;
static long n , m , k;
static long dp[][][]... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class GFG {
public static void main (String[] args) {
Scanner sc = new Scanner (System.in);
int n = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int ans = 0;
int t= sc.nextInt();
int arr[] = new int[... | linear | 964_B. Messages | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.*;
public class Main{
static class FastScanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringT... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class Three{
public static void main(String[] args) {
Scanner in = new Scanner (System.in);
PrintWriter out = new PrintWriter(System.out);
pair[] points = new pair [3];
for (int i = 0; i < 3; ++i) {
int x = in.nextInt();
int y = in.nextInt();
points[... | nlogn | 1086_A. Connect Three | CODEFORCES |
/**
* Created with IntelliJ IDEA.
* User: yuantian
* Date: 3/24/13
* Time: 2:18 AM
* Copyright (c) 2013 All Right Reserved, http://github.com/tyuan73
*/
import java.util.*;
public class Pipeline {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.next... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.logging.Level;
import java.util.logging.Logger;
public class ProblemA {
private final BufferedReader in;
private... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import static java.lang.Math.*;
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Double.parseDouble;
import static java.lang.String.*;
public class Main {
public static void main(String[] arg... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.IOException;
import java.util.StringTokenizer;
/*
* @author Tnascimento
*/
public class MaeDosDragoes {
// public static StringTokenizer tokenizer;
// public static BufferedReader rea... | np | 839_E. Mother of Dragons | 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... | cubic | 1515_E. Phoenix and Computers | 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.Map;
import java.io.IOException;
import java.util.TreeMap;
import java.util.InputMismatchException;
import java.io.PrintStream;
import java.io.OutputStream;
import java.util.ArrayDeque;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Queue;
import java.util.Collection;
import ... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.InputMismatchException;
public class R2_D2_A {
public static void main(String[] args) {
// BufferedReader in = new BufferedReader(new
//... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n, t[], g[], MOD = (int) 1e9 + 7;
static int[][][] memo1, memo2[], memo3[];
static int dp1(int idx, int remCnt, int remSum) {
if (idx == n)
return remSum == 0 && remCnt == 0 ? 1 : 0;
if (remCnt < 0 || remSum < 0)
return 0;
if (memo1[idx... | cubic | 1185_G2. Playlist for Polycarp (hard version) | 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 numChars;
private SpaceCharF... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public class F
{
static Scanner in = new Scanner(System.in);
static PrintWriter out = new PrintWriter(System.out);
static int n,m,res=0;
static int[][] a=new int[20][10005],Min=new int[20][20],Min1=new int[20][20];
static int[][][] f=new int[1<<16][20][20];
static int G... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.io.*;
import java.util.*;
public class SolutionB {
BufferedReader in;
StringTokenizer str;
PrintWriter out;
String SK;
String next() throws IOException {
while ((str == null) || (!str.hasMoreTokens())) {
SK = in.readLine();
if (SK == null)
return null;
... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main {
static class Fast {
StringTokenizer st;
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(... | cubic | 1517_D. Explorer Space | CODEFORCES |
public class P1 {
public static void main(String[] args) {
System.out.println("25");
}
} | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.util.*;
public class TaskA {
public static void main(String[] args) throws Exception {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.nextLine();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = scanner.nextInt... | nlogn | 160_A. Twins | CODEFORCES |
//package educational.round34;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Random;
public class D {
InputStream is;
PrintWriter ... | nlogn | 903_D. Almost Difference | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* @author Don Li
*/
public class TwoSquares {
int INF = 1000;
void solve() {
int[][] s1 = new int[4][2];
for (int i = 0; i <... | constant | 994_C. Two Squares | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class A {
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
String s=r.readL... | constant | 84_A. Toy Army | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Arr... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author ZYCSwing
*/
public class Main {
public static void main(String[] arg... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.PrintW... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.*;
public class A {
public static void main(String[] args) {
JS in = new JS();
int n = in.nextInt();
int m1 = 0;
int s1 = 0;
int l1 = 0;
int ss1 = 0;
int sss1 ... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
/**
* Works good for CF
*
* @author cykeltillsalu
*/
pu... | nlogn | 160_A. Twins | CODEFORCES |
import java.awt.image.BufferedImage;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class ElongatedMatrix {
static int[][][] memo;
static int mn1[][];
static int mn2[][];
stat... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Village
{
static Scanner in = new Scanner( new BufferedReader( new InputStreamReader( System.in ) ) );
public static void main( String[] args )
{
int n = in.nextInt(), t = 2*in.nextInt(), h[][] = new int[n][2], ans = 2;
for( int i = 0; i < ... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class ProblemA {
private void solve() throws IOException {
Scanner stdin = new Scanner(new InputSt... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
static final long MOD = 998244353;
//static final long MOD = 1000000007;
static boolean[] visited;
public static void main(String[] args) throws IOException {
FastScanner sc = new FastScanner();
int Q = sc.nextInt();... | np | 1209_E1. Rotate Columns (easy version) | 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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class RoundOneProblemB {
/**
* @param args
*/
public static void main(String[] args) {
int n=1;
BufferedReader input = new BufferedReader(new InputStreamReader(Sys... | linear | 1_B. Spreadsheets | CODEFORCES |
/**
* @(#)DigitSequence.java
*
*
* @author
* @version 1.00 2019/6/1
*/
import java.io.*;
import java.util.*;
public class DigitSequence {
/**
* Creates a new instance of <code>DigitSequence</code>.
*/
public DigitSequence() {
}
/**
* @param args the command line arguments
*/
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.math.*;
import java.util.*;
import java.io.*;
public class Main{
static StreamTokenizer in=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
static BufferedReader buffer=new BufferedReader(new InputStreamReader(System.in));
static Scanner sc=new Scanner(System.in);
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class D11 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException {
in.nextToken();
return (int)in.nval;
}
s... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
// main
public static void main(String [] args) throws IOException {
// makes the reader and writer
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
/**
* Created by IntelliJ IDEA.
* User: Михаил
* Date: 25.03.12
* Time: 19:03
* To change this template use File | Settings | File Templates.
*/
public class ProblemOne {
public static void main(String [] args) {
Scanner scanner = new Scanner(System.... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.InputMismatchException;
/**
* @author Egor Kulikov (egor@egork.net)
* Created on 14.03.2010
*/
public class TaskA implements Runnable {
private InputReader in;
private PrintWri... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.lang.*;
public class Third{
static long mod=1000000007;
public static void main(String[] args) throws Exception{
InputReader in = new InputReader(System.in);
PrintW... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class tr {
static int[][] ad;
static boolean []vis;
static int []goods;
static int[][]sol;
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n=sc.nextInt()... | linear | 1092_D1. Great Vova Wall (Version 1) | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
static int mod = (int) 1e9 + 7;
public static void main(String[] args) throws FileNotFoundException {
FasterScanner s = new FasterScanner();
int test = 1;
testloop: while (test-- > 0) {
int n = s.nextInt();
int left = 1;
in... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;
public class Main {
private PrintWriter out;
private Map<Integer, Integer> map;
priva... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
MyScanner in;
PrintWriter out;
public static void main(String[] args) throws Exception {
new C().run();
}
public void run() throws Exception {
in = new MyScanner();
out = new PrintWriter(System.out);
solve();... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
public class Village {
private class House implements Comparable<House>{
Double Coordinate;
Double Sidelength;
public House(double coordinate, double sidelength) {
Coordinate = coordinate;
Sidelength = sidelength;
}
public int compareTo(House o) {
return Coordinate.compareTo(o.C... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.StringTokenizer;
public class SolutionD {
BufferedReader in;
StringTokenizer str;
PrintWriter out;
String SK;
String next() throws IOException {
while ((str == null) || (!str.hasMoreTokens())) {
SK = in.readLine();
if (SK == null)... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class A implements Runnable {
public void run() {
long startTime = System.nanoTime();
int n = nextInt();
String[] all = new String[9];
all[0] = "M";
for (int i = 0; i < 4; i++) {
String s = "";
... | linear | 1000_A. Codehorses T-shirts | 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.util.ArrayList;
import java.io.InputStream;
/**
* Built using CHel... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class B {
public static void main(String[] args) {
doIt();
}
static void doIt() {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
long n = sc.nextLong();
long k = sc.nextLong();
long msum = (k - 1) * k / 2 ... | logn | 287_B. Pipeline | 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 IQTest implements Runnable
{
public static void main(String[] args) throws Exception
{
new IQTest().run();... | linear | 25_A. IQ test | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.