src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
/**
* Created with IntelliJ IDEA.
* User: Venky
*/
import java.io.*;
import java.util.StringTokenizer;
public class Main {
static void solve() throws IOException {
String str = br.readLine();
StringBuffer sb1 = new StringBuffer(str);
StringBuffer sb2 = new StringBuffer(str);
Str... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class P015A {
public static void main(String[] args) {
Scanner inScanner = new Scanner(System.in);
int n = inScanner.nextInt();
int t = inScanner.nextInt();
House[] houses = new House[n];
for (int i = 0; i < n; i++)
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.*;
public class a {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
double w = in.nextDouble();
int tot = 2;
Interval[] houses = new Interval[n];
for(int i=0; i<n; i++) {
double center = in.nextDouble();
double wid = in.nextDouble(... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Blah
{
public static void main(String args[])
{
Scanner c = new Scanner(System.in);
String number = c.nextLine();
int i = Integer.parseInt(number);
if (i == 1)
{
System.out.println("NO");
return;
}
String line = c.nextLin... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
static boolean canWinFromOneMove(char []s,int k) {
int prefix=0;
int n=s.length;
for(int i=0;i<n && s[i]==s[0];i++)
prefix++;
int suffix=0;
for(int i=n-1;i>=0 && s[i]==s[n-1];i--)
suffix++;
return s[0]==s[n-1] && prefix+suffix+k>=n ||... | linear | 1190_C. Tokitsukaze and Duel | CODEFORCES |
import java.util.Arrays;
import java.util.Locale;
import java.util.Scanner;
public class Fish {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
in.useLocale(Locale.US);
int n = in.nextInt();
double[] dp = new double[1 << n];
Arrays.fill(dp, 0);... | np | 16_E. Fish | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class SFly {
public static void main(String[] args) throws IOException {
BufferedReader lector = new BufferedReader(new InputStreamReader(System.in));
int planet = Integer.parseInt(lector.readLine());
int ini... | linear | 1010_A. Fly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class D {
public static void main(String[] args){
FastScanner scan = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int n = scan.n... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt(),r=in.nextInt();
double[] x=new double[n];
for(int i=0; i<n; i++)
x[i]=in.nextInt();
double[] y=new double[n];
for(int i=0; i<n; i++)
{
... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
/*
height == 2, width == 3
2 3 2
1 1
1 1
1 1 1
*/
public class D {
public static void main(String[] ar... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
public class E {
public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
public static void main(String[] args) throws IOException {
readInput();
out.clo... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.* ;
import java.util.* ;
import java.text.* ;
import java.math.* ;
import static java.lang.Math.min ;
import static java.lang.Math.max ;
public class Codeshefcode{
public static void main(String[] args) throws IOException{
// Solver Machine = new Solver() ;
// Machine.Solve() ;
// Machine.Finish()... | quadratic | 911_D. Inversion Counting | 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 | 1195_B. Sport Mafia | CODEFORCES |
import java.util.Scanner;
public class Pipeline {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long k = sc.nextLong();
sc.close();
if (k * (k - 1) / 2 + 1 < n) {
System.out.println(-1);
} else {
long l = -1, r = k;
while (r - l > 1) {
... | logn | 287_B. Pipeline | CODEFORCES |
import static java.math.BigInteger.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
public class A {
final int MOD = (int)1e9 + 7;
final double eps = 1e-12;
final int INF = (int)1e9;
public A () {
int N = sc.nextInt();
int K = sc.nextInt();
Long [] A ... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class F11141 {
static class Solver {
ArrayList<int[]> ranges[];
HashMap<Long, Integer> hm = new HashMap<>();
int id(long s) {
if (!hm.cont... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main
{
class node{
int data;
node next;
public node(int val){
data=val;
next=null;
}
}
class linkedlist{
node start;
node end;
int size;
int turn;
public linkedlist(){
start=null;
end=null;
size=0;
}
void add(int val){
if(... | linear | 1179_A. Valeriy and Deque | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.ArrayDeque;
import java.util.Arrays;
public class Main {
private static StreamTokenizer in;
private static PrintWriter out;
private static int nextInt() throws Exception {... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
TreeSet<Integer> set = new TreeSet<Integer>();
for(int i=0;i<n;i++){
set.ad... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
/**
* Author: Maksim Novik
* Date: 30.06.12
* Time: 22:34
*/
public class Round125ProblemA {
public static void main(String[] args) {
InputStream in = System.in;
OutputStream out = System.out;
InputReader reader = new InputReader(in);... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import sun.reflect.generics.tree.Tree;
import java.io.*;
import java.util.*;
public class A2 {
static Scanner in; static int next() throws Exception {return in.nextInt();};
// static StreamTokenizer in; static int next() throws Exception {in.nextToken(); return (int) in.nval;}
// static BufferedReader in;
static Pr... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class G1 {
static final int mod = (int) (1e9 + 7);
static final int UNCALC = -1;
static int[][][] memo;
static int n, t[], genre[];
public static void main(String[] args) throws IOException {
Scanner sc = ... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.LinkedList;
public class D {
static LinkedList<Integer>[] E;
static int[] M;
static boolean[] visited;
static int n;
static int center;
public static bool... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.util.Scanner;
public class ReallyBigNumbers {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long s = sc.nextLong();
long m = s;
while(m-digitAdd(m)<s && m<=n){
m++;
}
System.out.println(Math.max(n-m+1, 0));
}
private s... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.math.BigInteger;
import java.util.*;
public class A {
private static Scanner in;
final int M = 1000000009;
public void run() {
int n = in.nextInt();
int m = in.nextInt();
int k = in.nextInt();
int z = n - m;
if (z >= n / k) {
System.out.println(m);
return;
}
int f = n - k * z;
i... | logn | 338_A. Quiz | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Task1b {
static int[] fromRC (String data) {
int pos = data.indexOf('C');
int res[] = new int[2];
res[0] = Integer.parseInt(data.substring(1, pos));
res[1] = Integer.parseInt(data.substring(pos + 1));
return res;
}
static in... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long l = sc.nextLong(), r = sc.nextLong();
if (l % 2 == 0 && r - l >= 2) {
System.out.println(l + " " + (l + 1) + " " + (l + 2));
} else if (l % 2 == 1 && r - l >= 3) {
System.out.pr... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.*;
import java.util.*;
public class digits {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
long k = Long.parseLong(br.readLine());
long temp = 9 * (int)Math.pow(10,0);
int count = ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
// Petya and Spiders
// 2012/08/16
public class P111C{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int h, w... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.util.*;
import java.io.*;
public class Fish
{
static double[][] prob= new double[18][18];
static double[][] dp= new double[2][1<<18];
static ArrayList<Integer>[] adj= new ArrayList[1<<18];
static int n;
public static void init()
{
for(int i=0; i<(1<<18); i++)
adj[i]= new ArrayList<Integer>();
... | np | 16_E. Fish | CODEFORCES |
import java.util.*;
public class prob
{
public static long ans(long x, long y, long p)
{
long r = 1;
x = x % p;
while (y > 0)
{
if((y & 1)==1)
r = (r * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return r;
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
public class inversioncounting {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] permutation = new int[n];
for (int i = 0; i < n; i++) {
permutation[i] = sc.nextInt();
}
int m = sc.nextInt();
int[][] reverse = new int[m][2... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class bhaa {
InputStream is;
PrintWriter o;
/////////////////// CODED++ BY++ ++ ++ ++ BHAVYA++ ARORA++ ++ ++ ++ FROM++ JAYPEE++ INSTITUTE++ OF++ INFORMATION++ TECHNOLOGY++ ////////////////
///////////////////////// Make it work, make it rig... | constant | 1080_A. Petya and Origami | CODEFORCES |
//coded by : ariefianto17 | Reza Ariefianto
import java.io.*;
import java.util.*;
import java.math.*;
public class Main
{
public static void main (String[]args)
{
Scanner read = new Scanner (new BufferedInputStream (System.in));
int n = read.nextInt();
int[]arr = new int[n];
int sum=0;
int sum2=0;
int c... | nlogn | 160_A. Twins | 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 {
// /////////////////////... | np | 8_C. Looking for Order | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class RENAMETHISBITCH {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
int n = sc.nextInt();
BigInteger m = sc.nextBigInteger();
System.out.println(m.mod(BigInteger.valueOf(2).pow(n)));
}
c... | constant | 913_A. Modular Exponentiation | CODEFORCES |
import java.lang.*;
import java.util.*;
import java.io.*;
public class Challenge {
public static void main(String[] args) throws java.lang.Exception {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWrite... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.StringTokenizer;
public class C {
public static void main(String[] args) {
FastScanner fs=new FastScanner();
int nBoxes=fs.nextInt();
long[] sums=... | np | 1242_C. Sum Balance | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.stream.Collectors;
import java.math.*;
public class E1 {
static byte[] buf = new byte[1<<26];
static int bp = -1;
public static void main(String[] args) throws IOException {
/**/
DataInputStream in = new DataInputStream(System.in);
/*/
DataInputS... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.math.*;
public class task
{
public static void main(String args[])
{
Scanner a = new Scanner(System.in);
while(a.hasNext())
{
int n = a.nextInt();
int m = a.nextInt();
if(n == 0 && m == 0) break;
boolean[][] adj = new boolean[n][n];
long res = 0;
... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Dasha {
static Scanner sc = new Scanner(System.in);
static PrintWriter pw = new PrintWriter(System.out), pw2 = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
int n=sc.nextInt();
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
//package a_vtoray_poriadkovay_statistika;
import java.util.Arrays;
import java.util.Scanner;
/**
*
* @author kal1sha
*/
public class Main {
/**
* @param args the command line arguments
*/
public ... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
//package fourninetysixDiv3;
import java.util.HashMap;
import java.util.Scanner;
public class Median_Segments_general {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int m = s.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = s.n... | nlogn | 1005_E1. Median on Segments (Permutations Edition) | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class P113A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintStream out = System.out;
//CODING TAIM
int n = sc.nextInt();
int k = sc.nextInt();
List<Te... | nlogn | 166_A. Rank List | CODEFORCES |
//package global14;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
public class B {
InputStream is;
FastWriter out;
String INPUT = "";
void solve()
{
for(int T = ni();T > 0;T--)go();
}
void go()
{
int n = ni();
i... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.util.*;
public class AA{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int t=0;
if(sc.hasNextInt()) {
t=sc.nextInt();
}
while(t>0) {
t--;
int n=sc.nextInt();
String ans="NO";
if(n%2==0) {
int p=n/2;
if(Mat... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
//package GoodBye2017;
import java.io.*;
import java.util.*;
public class c {
public static void main(String[] args) throws Exception{ new c(new Reader()); }
public c(Reader rr) throws IOException{
int n=rr.ni();
double r=rr.nd();
HashMap<Integer, Double> disk=new HashMap<Integer, Double>();
for(int i=0; i<... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/**
* @Author:
* @Date: 2021/4/23 23:55
*/
public class ExplorerSpace {
static int n;
static int m;
static int k;
static int [][] rows;
static int [][] cols;
static ... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.math.BigInteger;
import javax.naming.BinaryRefAddr;
public class acm
{
public static BigInteger n;
public static BigInteger TWO = new BigInteger("2");
public static BigInteger solve(BigInteger x, BigInteger y, BigInteger c)
{
BigInteger res = (c.add(BigInteger.O... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.HashSet;
public class Solution {
public static void main(String[] args)throws IOException {
FastReader in=new FastReader(System.in);
int t=in.nextInt();
StringBuilder sb=new StringBuilder()... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.*;
public class Beta22PA {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int minimum = 200, second = 200;
for(int i=0; i<n; i++) {
int temp = scan.nextInt();
if(temp... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
public class D {
static Scanner sc;
static PrintWriter out;
public static void main(String[] args) throws Exception {
sc = new Scanner(System.in);
out = new PrintWriter(System.out);
//int t = sc.nextInt();
for(int i=0; i<1; ... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class _817C {
static long sum = 0;
static long BSearch2(long st, long end, long lim) {
if (st > end) return 0;
long mid = (st + end) >> 1;
if (mid - sumDigit(mid) >= lim) {
sum = mid;
return BSearch2(st, mid - 1, li... | logn | 817_C. Really Big Numbers | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: aircube
* Date: 11.01.11
* Time: 4:14
* To change this template use File | Settings | File Templates.
*/
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.concurrent.Exchanger;
public class Template {
BufferedReader br;
PrintWri... | np | 16_E. Fish | CODEFORCES |
import java.util.Scanner;
public class Main2 {
public static void main(String args[]){
Scanner input = new Scanner(System.in);
String st = input.nextLine();
System.out.println(bank(st));
}
public static int bank(String st){
StringBuilder sb = new... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.util.*;
public class Main {
static int mod = 1000000007;
static int size = 200000;
static long[] fac = new long[size];
static long[] finv = new long[size];
static long[] inv = new long[size];
static int INF = Integer.MAX_VALUE;
public static void main(String[] args){
Scanner scanner = new Scann... | constant | 991_D. Bishwock | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.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
*/
public class Main {
public static void main(String[] args) {
InputStrea... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
final String filename = new String("A").toLowerCase();
void solve() throws Exception {
int n = nextInt();
int[] a = new int[n];
int m = -1;
for (int i = 0; i < n; i++) {
a[i] = nextInt();
if (m == -1 || a[i] > a[m]) {
m = i;
}
}
if (a[... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.Comparator;
import java.io.InputStream... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class A {
/**
* @param args
*/
public static void main(String[] args) {
HomeWorks hw = new HomeWorks();
hw.sol();
hw.print();
}
}
class HomeWorks {
HomeWorks(){
Scanner sc... | nlogn | 169_A. Chores | CODEFORCES |
/*
*
* @Author Ajudiya_13(Bhargav Girdharbhai Ajudiya)
* Dhirubhai Ambani Institute of Information And Communication Technology
*
*/
import java.util.*;
import java.io.*;
import java.lang.*;
public class Code3
{
public static void main(String[] args)
{
InputReader in = new InputReader(System.in);
Pr... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: Taras_Brzezinsky
* Date: 8/13/11
* Time: 6:10 PM
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.io.IOException;
public class Da... | np | 105_B. Dark Assembly | 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... | constant | 1068_A. Birthday | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class A15 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException {
in.nextToken();
return (int)in.nval;
}
s... | nlogn | 15_A. Cottage Village | 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 {
static BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
st... | nlogn | 1005_E1. Median on Segments (Permutations Edition) | CODEFORCES |
//package round15;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class A {
static StreamTokenizer in =
new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
static int nextInt(... | nlogn | 15_A. Cottage Village | CODEFORCES |
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
long n,s,p;
S... | constant | 1023_B. Pair of Toys | CODEFORCES |
import java.util.Scanner;
public class Task5d {
/**
* @param args
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double a = sc.nextDouble();
double v = sc.nextDouble();
double l = sc.nextDouble();
double d = sc.nextDouble();
double w = sc.nextDouble();
double t =... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
imp... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Array {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
/*
if ( k == 1 ){
System.out.println("1 1"); return;
}
*/
int last[] = new int[100001];
int distinc... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
private static void solve(InputReader in, OutputWriter out) {
int n = in.nextInt();
int m = in.nextInt();
String[] sa = new String[n];
for (int i = 0; i < n; i++) {
sa[i] = in.next();
}
Set<Inte... | quadratic | 985_B. Switches and Lamps | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class cf1177b {
public static void main(String[] args) throws IOException {
long k = rl(), n = -1;
for (long l = 0, r = k; l <= r; ) {
long m = l + (r - l) / 2;
i... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
FastScanner in;
PrintWriter out;
void solve() {
int n = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = in.nextInt();
}
Arrays.sort(a);
int res = 0;
for (int ... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int a = input.nextInt();
int b = input.nextInt();
int x[] = new int[n];
for (int i=0; i<n; i++) x[i]=input.nextInt();
... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
/** Built using CHelper plug-in Actual solution is at the top */
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputS... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
public class q5 {
public static void main(String[] args) throws IOException {
Reader.init(System.in);
PrintWriter out=new PrintWriter(System.out);
long n=Reader.nextInt();
long k=Reader.nextLo... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;
/**... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.util.SortedSet;
import java.util.Set;
import java.util.NavigableSet;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.InputStreamRe... | linear | 1190_C. Tokitsukaze and Duel | CODEFORCES |
/*
Roses are red
Memes are neat
All my test cases time out
Lmao yeet
*/
import java.util.*;
import java.io.*;
public class x1185G1b
{
static long MOD = 1000000007L;
public static void main(String args[]) throws Exception
{
BufferedReader infile = new BufferedReader(new InputStreamReade... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class BetaRound16_E implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
public static void main(String[] args) {
new Thread(null... | np | 16_E. Fish | CODEFORCES |
import java.util.StringTokenizer;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.io.IOException;
import java.io.BufferedReader;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Collections;
import java.util.ArrayList;
public class p3
{
static class FastReader {
B... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class A {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt... | 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.Locale;
import java.util.StringTokenizer;
public class Main {
private void solve() throws IOException {
int n = nextInt();
int x = nextInt();
int y = nextInt();
int c = ne... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
//package round43;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class C {
Scanner in;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
char[] x = in.next().toCharArray();
int t = 0;
for(int i = 0;i < n;i++){
if(x[i] == 'T'){
t++;
}
}
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
public class code_1 {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
int a[]=new int[n];
for(int i=0;i<n;i++)
a[i]=in.nextInt();
Arrays.sort(a);
for(int i=0;i<n-1;i++) {
if(a[i]!=-1) {
for(int j=i+1;j<n;j... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StringWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
import java.io.Inp... | nlogn | 1075_C. The Tower is Going Home | CODEFORCES |
import java.util.*;
import java.io.*;
public class C{
public static void main(String args[]) throws Exception{
Scanner in = new Scanner(new FileReader("input.txt"));
PrintWriter out = new PrintWriter(new File("output.txt"));
int N = in.nextInt();
int M = in.nextInt();
int K = in.nextInt();
int[] X = new... | cubic | 35_C. Fire Again | CODEFORCES |
// Main Code at the Bottom
import java.util.*;
import java.io.*;
public class Main{
//Fast IO class
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
boolean env=System.getProperty("ONLINE_JUDGE") != null;
//env=true;
if(!en... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
///package round_global_14;
import java.io.*;
import java.util.*;
public class B {
static class InputReader {
BufferedReader buffreader;
StringTokenizer strtokenizer;
public InputReader(InputStream inputstr) {
buffreader = new BufferedReader(new InputStreamReader(inputstr), 10... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner();
PrintWriter out = new PrintWriter(System.out);
int n=sc.nextInt(),k=sc.nextInt();
for(int x=0;;x++) {
if(2*1L*x+x*1L*(x+1)==2L*(k+n)) {
out.println(n-x);
b... | logn | 1195_B. Sport Mafia | CODEFORCES |
// https://codeforces.com/contest/1497/submission/110250082
import java.io.*;
import java.util.*;
public class CF1497E2 extends PrintWriter {
CF1497E2() { super(System.out); }
static class Scanner {
Scanner(InputStream in) { this.in = in; } InputStream in;
byte[] bb = new byte[1 << 15]; int i, n;
byte getc() {... | cubic | 1497E2 | CODEFORCES |
/**
* author: derrick20
* created: 3/19/21 11:57 PM
*/
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class E2_SquareFreeDivision2 {
static FastScanner sc = new FastScanner();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
//... | cubic | 1497E2 | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.stream.IntStream;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.T... | cubic | 1497E2 | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Solution{
static class Node implements Comparable<Node>{
int sum;
int l;
int r;
Node next;
int nb;
Node ini;
boolean not;
public Node(int sum,int l,int r){
this.sum... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
public class Main
{
static double arr[][];
public static void main(String[] args)
{
try
{
Parserdoubt pd=new Parserdoubt(System.in);
PrintWriter pw=new PrintWriter(System.out);
int fishes=pd.nextInt();
arr=new double[fishes][f... | np | 16_E. Fish | CODEFORCES |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.ObjectInputStream.GetField;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.ut... | cubic | 1517_D. Explorer Space | 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... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
// TODO code application logic here
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int iTotTerm, i, j, iSml = 0, iPos = 0;
iTotTerm = Integer.parseInt(br.readL... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.