src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.util.*;
import java.util.Map.Entry;
import java.io.*;
public class Main {
public static class node implements Comparable<node> {
int l,r;
node(){}
node(int l,int r) {
this.l=l;
this.r=r;
}
@Override
public int compareTo(node rhs) {
return r-rhs.r;
}
}
public static void main(String... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.*;
public class algo_2701
{
public static void main(String args[])
{
Scanner ex=new Scanner(System.in);
int n=ex.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++)
arr[i]=ex.nextInt();
Arrays.sort(arr);
int ans=0;
int check[]=ne... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
private int n;
private int m;
private boolean[][] g;
private long[][] dp;
private int[] count;
private int[] first;
private void solve(... | np | 11_D. A Simple Task | 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.ArrayList;
import java.util.Map;
import java.util.StringTokenizer;
import java.util.TreeMap;
public class A {
p... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution extends Thread {
final static int MAXNUM = 1 << 20;
public void run() {
try {
in = new BufferedReader(new InputStreamReader(System.in));
st = new StringTokenizer("");
int tests = nextInt();
int num = 1;
for (int test = 0; test < tests; te... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(new InputStreamReader(System.in));
int n = sc.nextInt();
String s = sc.next();
sc.close();
int cH = 0;
for (int i... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.FileNotFoundException;
import java.util.Scanner;
/**
* Date: 19.02.2010
* Time: 14:56:28
*
* @author Sergey Bankevich (Sergey.Bankevich@gmail.com)
*/
public class B1 {
static Scanner in;
public static void main( String[] args ) throws FileNotFoundException {
in = new Scanner( Syste... | linear | 1_B. Spreadsheets | CODEFORCES |
//package ContestEd69;
import java.io.*;
import java.util.StringTokenizer;
public class mainD {
public static PrintWriter out = new PrintWriter(System.out);
public static FastScanner enter = new FastScanner(System.in);
public static long[] arr;
public static void main(String[] args) throws IOException... | quadratic | 1197_D. Yet Another Subarray Problem | CODEFORCES |
import java.util.* ;
public class PythonIndentation
{
public static void main(String args[])
{
Scanner in = new Scanner(System.in) ;
int n = in.nextInt() ;
boolean[] lst = new boolean[n] ;
for(int i=0;i<n;i++)
{
lst[i] = (in.next().equals("s"))?false:true ;
}
System.out.println(dp(lst)) ;
}
stati... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.awt.List;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
imp... | np | 11_D. A Simple Task | CODEFORCES |
//package educational35;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class ProblemD {
public static PrintWriter out = new PrintWriter(new OutputStreamWriter(Syste... | 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;
public class A22 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException {
in.nextToken();
ret... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.text.ChoiceFormat;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.*;
import java.io.*;
public class c implements Runnable{
int N;
int[] arr;
public static void main(String[] args) { new Thread(null, new c(), "", 1<<27).start(); } public void run() {
arr = new int[N = nextInt()];
for(int n=0;n<N;n++) {
// System.out.println(n+" s");
if(nextString().charAt... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import static java.lang.Math.*;
public final class FollowTrafficRules {
private static double[] acce(double i, double a, double v) {
double[] r = new double[2];
r[0] = (v - i)/a;
r[1] = 1d/2d * a * pow(r[0], 2) + i * r[0];
return r;
}
private static doub... | constant | 5_D. Follow Traffic Rules | 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 | 909_C. Python Indentation | CODEFORCES |
//package cf584d12;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class A {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
int n = sc.nextInt();
Integer[] a = new Integer[n];
for(int i = 0; i < n; i++)
a[i] = sc.nextInt();
Arrays.sort(a);
boolean... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
import java.util.TreeSet;
/*
* To change this template, choose Too... | cubic | 23_A. You're Given a String... | CODEFORCES |
//package jsr.codeforces;
import java.util.HashMap;
import java.util.Scanner;
public class AMatchLists {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int N = in.nextInt();
HashMap<String, Integer> map = new HashMap<>();
for(int i=0; i<N; i++){
... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.RoundingMode;
import java.util.*;
import java.util.Map.Entry;
public class Main {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
// int X1, Y1, X2, Y2;
// int X3, Y3, X4, Y4;
// {
// X1 = 1;
// Y1 = 2;
// X2 = 3;
// Y2 = 4;
//
// X3 = 5;
// Y3 = 1;
// X4 = 5;
// Y4 = 5;
// }
int ask(int x1, int y1, int x... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
int N = r.nextInt();
System.out.println(N + " " + 0 + " " + 0);
}
}
| constant | 199_A. Hexadecimal's theorem | CODEFORCES |
//package round23;
import java.io.PrintWriter;
import java.io.StringReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
public class A {
private Scanner in;
private PrintWriter out;
// private String INPUT = add("a", 100);
private String INPUT = "";
public void solve()
{
Stri... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
static int ar[];
static HashMap<String, ArrayList<String>> map;
static int location = 0;
static StringBuilder sb;
static int N;
public static void main(String[] args) throws NumberFormatException, IOException {
// TODO Auto-generated method stub
Buff... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.Scanner;
public class Prob235A {
public static void main(String[] Args) {
Scanner scan = new Scanner(System.in);
int x = scan.nextInt();
if (x < 3) {
if (x == 1)
System.out.println(1);
else
System.out.println(2);
} else {
long answer = x;
if (x % 2 == 1) {
answer *= x ... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner cin = new Scanner(System.in);
String str;
int i,j,k;
int cnt = 0;
char [] strArray;
str = cin.next();
strArray = str.toCharArray();
for(i = 0; i < strArray.length; i ++)
for(j = i + 1; j < strArray.le... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
import java.io.*;
public class B {
public static PrintStream out = System.out;
public static InputReader in = new InputReader(System.in);
static class Node implements Comparable<Node> {
int res;
Node(int pp) {
p = pp;
}
int p;
@Override... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokenizer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.util.Scanner;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author madi
*/
public class CottageTown {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String[] in = sc.nextLine().split(" ")... | nlogn | 15_A. Cottage Village | 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... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.util.*;
public class HelloWorld{
public static void main(String []args){
final long MOD = 1000000007;
Scanner scan = new Scanner(System.in);
int now = 1;
int maxStatements = scan.nextInt();
long[] dp = new long[maxStatements + 1];
dp[now] = 1;
w... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/**
*
* @author Haya
*/
public class CommentaryBoxes {
public static void main(String[] args) {
FastReader in = new FastReader();
long n = in.nextLo... | linear | 990_A. Commentary Boxes | CODEFORCES |
import java.util.*;
public class temp {
public static void main(String str[]){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
int arr[][] = new int[n][m];
int cross[][] = new int[n][m-1];
int up[][] = ne... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.lang.*;
// StringBuilder uses java.lang
public class mC {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
StringBuilder st = new StringBuilder();
int t = 1;
for (int test = 0; test < t; test++) {
... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.util.Scanner;
public class J472A {
private static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int a = scan.nextInt();
if(a % 2 == 0) {
System.out.println(4 + " " + (a - 4));//ż���4
} else {
System.out.println(9 + " " + (a - 9));//������
}
}
}
| constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.*;
public class file{
public static void main(String []args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
while(n-->0)
{
int a=sc.nextInt();
int b=sc.nextInt();
int ans=f(a,b);
System... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.*;
import java.util.*;
public class n2{
public static void main(String[] args) throws Exception{
BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(in.readLine());
int[] S=new int[4];
int[] L=new int[4];
int m=0;
... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
//package com.krakn.CF.D1159;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n, k;
n = sc.nextInt();
k = sc.nextInt();
int a = (n - k) / 2;
StringBuilder s = new StringBuilder();
... | linear | 1159_D. The minimal unique substring | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class DigitSeq {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
/**
* Created by James on 1/29/2015.
*/
public class Driver {
private static int [][] distances, parents;
private static int [] distance, parent;
private static String [][] longNames;
... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.Scanner;
public class Solution {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
String s = sc.next();
StringBuilder ans = new StringBuilder();
int count = 0;
int open = 0;
for (int i = 0; i <... | linear | 1023_C. Bracket Subsequence | 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 | 713_B. Searching Rectangles | CODEFORCES |
/**
* @author: Mehul Raheja
*/
import java.util.*;
import java.io.*;
public class p3{
/*
Runtime = O()
*/
static int N, M, K;
static String s;
static StringTokenizer st;
static int[] d;
public static void main(String[] args) throws Exception {
BufferedReader br = ... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.io.*;
public class C{
public static void main(String[] args) {
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
Solver solver = new Solver();
solver.solve(in, out);
out.close();
}
static class Solver{
public void solve(InputRead... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
static ArrayList<BigInteger> bs = new ArrayList<>();
static void getBs(int n, BigInteger k) {
BigInteger four = BigInteger.valueOf(4);
BigInteger tmp4 = BigInteger.valueOf(1);
BigInt... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Solve4 {
public static void main(String[] args) throws IOException {
FastReader sc = new FastReader();
int x= sc.nextInt();
int y= sc.nextInt();
int z... | constant | 1054_A. Elevator or Stairs? | CODEFORCES |
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws FileNotFoundException {
// TODO Auto-generated method stub
Scanner read = new... | cubic | 35_C. Fire Again | CODEFORCES |
/*Author: Satyajeet Singh, Delhi Technological University*/
import java.io.*;
import java.util.*;
import java.text.*;
import java.lang.*;
import java.math.*;
public class Main{
/*********************************************Constants******************************************/
static PrintWrite... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.*;
public class A
{
public static void main(String args[])
{
boolean[] b = new boolean[11000];
Arrays.fill(b, true);
b[0] = b[1] = false;
for(int i=2;i < b.length;i++)
{
if(!b[i])
continue;
for(int j=2;i*j<b.length;j++)
b[i*j] = false;
}
int[] p = new int[11000];
int... | linear | 17_A. Noldbach problem | CODEFORCES |
/*
* Author: Nikhil Garg
* Date: 2010-12-05
*
*/
import java.io.*;
import java.util.*;
import java.math.*;
public class javatemp
{
static String map(int a)
{
if( a == 0) return "S";
else if ( a == 1 ) return "M";
else if ( a == 2 ) return "L";
else if ( a == 3 ) return "XL";
else if ( a == 4 ) return "XX... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokenizer;
import java.io.InputSt... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
public class Task2 {
public static void main(String[] args) throws IOException {
new Task2().solve();
}
//ArrayList<Integer>[] g;
int mod = 1000000007;
PrintWriter out;
int n;
int ... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class CoveredPointsCount {
//UPSOLVE
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStre... | nlogn | 1000_C. Covered Points Count | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class ATestingRound5 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int T = in.nextInt();
while(T --> 0) {
int a = in.nextInt();
int b = in.nextInt();
int count = 0;
int[] arr = {a, b};
Arrays.sort(arr)... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class F1141 {
private static class Interval {
publ... | quadratic | 1141_F2. Same Sum Blocks (Hard) | 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 |
//package round599;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
public class C {
InputStream is;
PrintWriter out;
String INPU... | np | 1242_C. Sum Balance | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class A implements Runnable {
final boolean LOCAL = System.getProperty("ONLINE_JUDGE") == null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok;
public static void main(String[] args) {
new Thread(null, new A(), "", 256*10... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class DigitQueries {
public static void main(String[] args) throws IOException {
FastReader in = new FastRea... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = sc.nextInt(), k = sc.nextInt();
long rhs = 2l * (n + k);
... | logn | 1195_B. Sport Mafia | CODEFORCES |
/*
Author : Imran Khan
Language: Java
*/
import java.io.*;
import java.util.*;
public class Main
{
public class BasicInputOutput
{
private StringTokenizer strtoken;
private BufferedReader bufferReader;
private BufferedWriter bufferWriter;
private String delim = " \t\n\r\f";
BasicInputOutput()
{
d... | np | 16_E. Fish | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class D {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt(), sum = 0;
int [] a = new int[n+1];
for (int i = 1; i <= n; i++) {
a[i] = in.nextInt();
}
... | quadratic | 911_D. Inversion Counting | 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 boolean i... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Math.abs;
import static java.lang.Math.max;
import static java.lang.Math.sqrt;
import static java.lang.System.exit;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
impo... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.Queue;
public class FireAgain {
public static void main(String[] args) throws IOException {
BufferedReader readData = new BufferedRead... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
import java.io.*;
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();
}
private int nextInt() thr... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
// Created by @thesupremeone on 23/04/21
public class ExplorerSpace {
int[][] horizontal, vertical;
int n, m;
long[][][] dp;
int large = Integer.MAX_VALUE;
boolean isValid(int i, int j){
return i>=0 && j>=0 && i<n && j<m;
}
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.sql.Time;
import java.util.*;
import java.math.BigInteger;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import static java.util.Arrays.*;
public class Main{
void run(){
Locale.setDefault(... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.util.*;
import java.text.*;
import java.math.*;
public class Main{
static double EPS=1e-10;
static double PI=Math.acos(-1.0);
static double p[][]=new double[25][25];
static double f[]=new double[1<<20];
static int n;
public static void PR(String s){
Syst... | np | 16_E. Fish | 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 |
//package codeforces.Educational35;
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.StringTokenizer;
public class ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exception {
int i,j,k;
int counter[] = new int[2];
int a[] = new int[200];
int needed;
Buffered... | linear | 25_A. IQ test | CODEFORCES |
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
If I'm the sun, you're the moon
Because when I go up, you go down
*******************************
I'm working for the day I will surpass you
https://www.a2oj.com/Ladder16.html
*/
impor... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.util.*;
import java.io.*;
public class code839E
{
public static void main(String[] args) throws Exception{
BufferedReader bff=new BufferedReader(new InputStreamReader(System.in));
PrintWriter wff=new PrintWriter(System.out);
String[] st=bff.readLine().split(" ");
int V=I... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.util.*;
import java.io.*;
public class candies {
public void run() throws Exception {
Scanner file = new Scanner(System.in);
int actions = file.nextInt();
int left = file.nextInt();
int start = 0;
int c = 1;
while (true) {
start += c;
if (c + (start - left) == actions) break;
c++;
}... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class ProblemE {
public static int w, h;
public static int MAX = 9999999;
public static Set<Integer> result = new HashSet<Integer>();
public static void dfs(int n, int m, int mask... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.util.*;
public class A {
public static double EPS = .001;
public class House implements Comparable<House> {
int x;
int a;
public House(int mx, int ma) {
x = mx;
a = ma;
}
public int compareTo(House o) {
return x - o.x;
}
public double right() {
return (double)x + ((d... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class A{
void solve(){
int n=ni();
s=new char[n+1];
s[0]='.';
for(int i=1;i<=n;i++) s[i]=ns().charAt(0);
dp=new long[5001][5001];
dp[1][0]=1;
long sum[]=new long[n+2];
sum[0]=1;
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
public class FireAgain {
int k, i, j,n,m,x,y;
void run() {
try {
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class Mainn {
public static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader() {
reader = new BufferedReader(new InputStreamReader(System.in), 32768);
tokenizer = null;
}
public InputReader(InputStrea... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public final class round_364_c
{
static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
static FastScanner sc=new FastScanner(br);
static PrintWriter out=new PrintWriter(System.out);
public static void main(String args[]) throws Exception
{
in... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
boolean eof;
public static void main(String[] args) throws IOException {
new Main().run();
}
public String nextToken() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (Exception e) {
e... | constant | 343_A. Rational Resistance | CODEFORCES |
/*
Keep solving problems.
*/
import java.util.*;
import java.io.*;
public class CFA {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
private static final long MOD = 1000 * 1000 * 1000 + 7;
private static final int[] dx = {0, -1, 0, 1};
private static final int[] dy = ... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class C {
public static void main(String[] args){
try(Scanner sc = new Scanner(System.in)){
final ... | quadratic | 909_C. Python Indentation | CODEFORCES |
/**
* Created by Aminul on 3/14/2019.
*/
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import static java.lang.Math.max;
public class E_2 {
public static void main(String[] args) throws Exception {
F... | linear | 1082_E. Increasing Frequency | CODEFORCES |
/**
* @author: Mehul Raheja
*/
import java.util.*;
import java.io.*;
public class indent {
/*
Runtime = O()
*/
static int N, M, K;
static String s;
static StringTokenizer st;
static int[] d;
static long MOD = (int)1e9 + 7;
public static void main(String[] args) throws Exce... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import java.io.*;
public class P1 {
public static void main(String[] args) {
String s = null;
// citire
try {
// Scanner sc = new Scanner(new File("in.txt"));
Scanner sc = new Scanner(System.in);
s = sc.next();
}
catch (Exception e) {
e.printStackTrace();
}
int n = ... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.List;
public class Q6 {
public static void main(String[] args)... | 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.math.BigInteger;
import java.util.*;
public class A {
private void solve() throws IOException {
int n = nextInt();
int a = nextInt();
int b = nextInt();
... | nlogn | 169_A. Chores | CODEFORCES |
import java.util.Scanner;
import java.math.BigInteger;
import java.io.*;
public class Main{
/**
* @param args
*/
static BigInteger n, x, y, c;
static BigInteger mk[] = new BigInteger[8];
public static BigInteger f(BigInteger t) {
return t.multiply(t);
}
public static BigInteger g(BigInteger t) {
retur... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.*;
import java.util.*;
public class a
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int N=sc.nextInt();
solve(N);
}
static void solve(int a)
{
if((a-8)%3==0)
{
System.out.println(8+" "+(a-8));
return ;
}
if((a-4)%3==0)
{
Syst... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author be... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.BufferedInputStream;
import java.util.HashMap;
import java.util.ArrayList;
import java.io.FilterInputStream;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Comparator;
impo... | 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.math.BigInteger;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHe... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.Scanner;
public class D {
static long max;
public static long[] getOneRange(long min, long max,int bit) {
long st=(min&(((1l<<63)-1)&~((1l<<(bit+1))-1)))|(1l<<bit);
long end=st|((1l<<(bit+1))-1);
long interSt=Math.max(st,min);
long interEnd=Math.min(end, max)... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.System.in;
public class Main {
public static void main(String[] args)throws IOException{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] point = new int[n][];
for(int i=0;i<n;i++) point[i] = new int[]{s... | nlogn | 528_B. Clique Problem | CODEFORCES |
import java.util.*;
public class A
{
public static void main(String args[])
{
Scanner scan = new Scanner(System.in);
String str = scan.next();
for(int i=str.length();i >= 1;i--)
{
for(int j=0;j + i <= str.length();j++)
{
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
public class Main
{
public static void main(String []args)throws Exception
{
String inp="";
String res="";
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
inp=br.readLine();
for(int i=0;i<inp.length();i++)//counts the length
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class A {
static BufferedReader in;
static PrintWriter out;
static StringTokenizer st;
static Random rnd;
void solve() throws IOException {
int n = nextInt();
int[] arr = new int[n];
Integer[] arrCopy = new Integer[n];
for (int i = 0; i <... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
import java.util.StringTokenizer;
public class Solution {
l... | logn | 817_C. Really Big Numbers | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.