src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.text.DecimalFormat;
import java.util.Arrays;
import java.util.Scanner;
public class E {
static Scanner sc = new Scanner(System.in);
static int N;
static double[][] p;
static DecimalFormat format = new DecimalFormat("0.000000");
public static void main(String[] args) throws Exception {
N = sc.nextIn... | np | 16_E. Fish | CODEFORCES |
import java.util.Scanner;
public class A961_Tetris {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int platforms = input.nextInt();
int in = input.nextInt();
int[] cols = new int[platforms];
int[] squares = new int[in];
for (int i = 0; i < in; i ++) {
squares[i... | quadratic | 961_A. Tetris | CODEFORCES |
/**
* Created by ankeet on 7/22/16.
*/
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class C701 {
static FastReader in = null;
static PrintWriter out = null;
public static void solve()
... | linear | 701_C. They Are Everywhere | 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 PrintWriter saida = new PrintWriter(System.out, false);
public st... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.io.*;
import java.util.*;
public class P035C {
private class Pair {
private int x;
private int y;
private Pair(int x, int y) {
this.x = x;
this.y = y;
}
public int hashCode() {
return 37 * x + y;
}
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class ehsan
{
public static BigInteger f(BigInteger m,BigInteger n){
BigInteger s,l;
s=n.multiply(m.add(BigInteger.valueOf(1)));
l=m.multiply(m.add(BigInteger.valueOf(1)));
l=l.divide(BigInteger.valueOf(2));
s=s.subtract(l);
s=s.subtract(m);
... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.geom.*;
import static java.lang.Math.*;
public class Solution implements Runnable {
public void solve () throws Exception {
int n = sc.nextInt();
int k = sc.nextInt();
TreeSet<Integer> bad = new TreeSet<>();
int a [] = new int [n... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a[] = new int[100004];
int b[] = new int[100004];
int n, m, ans = 0, dau, cuoi=-1;
n = sc.nextInt();
m = sc.nextInt();
for(int i=0;i<1000... | linear | 224_B. Array | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class Main {
// static int INF=1<<28;
//int x,y;
static int sum=0;
//static ArrayList<Integer> lis = new ArrayList<Integer>();
public static void main(Strin... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.*;
import java.io.*;
public class D1517 {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
int[][] costRight = new int[n][m - 1]... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
public class TwentyFive {
public static void main(String[] args)
{
System.out.println("25");
}
}
| constant | 630_A. Again Twenty Five! | 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
*/
public class... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.reflect.Array;
public class codeforces
{
public static void main(String[] args)
{
InputReader in = new InputReader(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = in.nextInt();
long U = in.nextLong();
long[] E = ne... | nlogn | 957_C. Three-level Laser | CODEFORCES |
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.NoSuchElementException;
import java.util.Objects;
impo... | np | 1242_C. Sum Balance | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
public class B {
/**
* @param args
*/
public static void main(String[] args) throws Exception {
// System.setIn(new FileInputStream("b.in"));
BufferedReader bf = new BufferedReader(new ... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class LookingForOrder {
static final int INF = (int)1e9;
static Point a[];
... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOExcept... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Subtractions {
public static void main(String[] args) {
InputReader r = new InputReader(System.in);
int n = r.nextInt();
wh... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.*;
public class cf573 {
public static void main(String[] args){
Scanner scan=new Scanner(System.in);
int n=0;
if(scan.hasNext())
n=scan.nextInt();
TreeSet<Integer> set=new TreeSet<>();
for(int i=0;i<n;i++){
if(scan.hasNext())
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
public class Codeforces {
static long MOD = 1_000_000_007L;
static void main2() throws Exception {
int n = ni();
int[] arr = nia(n);
Map<Integer, List<Pair<Integer, Integer>>> map = new HashMap<>();
... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.StringTokenizer;
import java.util.Vector;
public class nal... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Codechef
{
static class FastScanner {
BufferedReader br;
StringTokenizer stok;
FastScanner(InputStream is) {
br = new BufferedReader(new InputStreamReader(is));
}
String next() throws IOExc... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.Scanner;
/**
* User: serparamon
*/
public class Codeforces_2012_08_31_A {
public static void main(String[] args) throws IOException {
//Scanner in = new Scanner(System.in);
StreamTokenizer in = new StreamTokenizer(new BufferedReader(new... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOExcept... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.Scanner;
public class D
{
public static void main(String[] args)
{
new D();
}
D()
{
Scanner in = new Scanner(System.in);
double a = in.nextDouble();
double v = in.nextDouble();
double l = in.nextDouble();
double d = in.nextDoub... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.util.*;
import java.math.*;
public class Solution{
private long [] sums;
private void solve(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
int [] arr = new int[n];
this.sums = new long[n];
... | quadratic | 1197_D. Yet Another Subarray Problem | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main{
public void run(){
Locale.setDefault(Locale.US);
Scanner in = new Scanner(System.in);
int n = in.nextInt();
double a[][] = new double[n][n];
for(int i=0;i<n;i++) for(int j=0;j<n;j++) a[i][j] = in.nextDouble();
double f[] = new double[... | np | 16_E. Fish | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
public class R015A {
final double EPS = 1e-9;
boolean isEqual(double x, double y) {
return Math.abs(x-y) <= EPS * Math.max(Math.abs(x), Math.ab... | nlogn | 15_A. Cottage Village | 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 | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
/**
* CodeForces Round 5D. Follow Traffic Rules
* Created by Darren on 14-9-14.
*/
public class Main {
Reader in = new Reader(System.in);
PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
Scanner in;
static PrintWriter out;
static class Scanner {
StreamTokenizer in;
Scanner(InputStream is) {
in = new StreamTokenizer(new BufferedReader(new InputStreamReader(is)));
in.resetSyntax();
in.... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.util.*;
public class b {
static int n,k,A;
static int[] l,p;
static double [][][] memo;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
n = in.nextInt();
k = in.nextInt();
A = in.nextInt();
memo = new double[n+1][n+1][1<<n];
l = new int[n];
p = new int[n];
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class KeyboardPurchase {
static final int INF = 1000000000;
public static void main(String[] args) {
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out, false);
int... | np | 1238_E. Keyboard Purchase | 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 hheng
*/
public class Main {
public static void main(String[] args) {
In... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.IOException;
import java.util.Scanner;
public class TC
{
static long N;
static int k;
static long WHOLESUM;
static long SUM( long k )
{
long res=k*( k+1 )/2;
return res-1;
}
static long returnPipes( int mid )
{
long not=SUM( mid-1 );
... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Bit... | logn | 817_C. Really Big Numbers | CODEFORCES |
//package round429;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
// 203530
public class C {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = n... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.ArrayList;
import java.util.List;
import java.util.Locale;
import java.util.Scanner;
public class Main implements Runnable {
/**
* @param args
*/
public static void main(Stri... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static double[] dp;
static double[][] P;
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
int n = r.nextInt();
double[][] g = new double[n][n];
for(int i = 0... | np | 16_E. Fish | CODEFORCES |
import static java.lang.Math.*;
import static java.util.Arrays.* ;
import java.math.BigInteger;
import java.util.*;
import java.io.*;
public class D
{
int [][] adjList ;
int dfs(int u , int p )
{
int size = 1 ;
for(int v : adjList[u])
if(v != p )
{
i... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.Scanner;
public class prob1177b {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
long k,c,n,d;
c=1;
d=9;
n=1;
k= sc.nextLong();
while(k>(c*d)) {
k-=(c*d);
n*=10;
d*=10;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author madis
*/
public class Pjar {
static int a[][];
public static void main(Strin... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
public class MyClass {
static class Pair implements Comparable<Pair>{
int x,y;
Pair(int x,int y){
this.x=x; this.y=y;
}
public int compareTo(Pair p){
return Integer.compare(this.y,p.y);
}
}
public static void main(String arg... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
import java.util.TreeMap;
public class D {
static long l, r;
static long[][][][][] dp;
public static void main(String[] args) thr... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.InputMismatchException;
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 is at the to... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map.Entry;
import java.util.Stack;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] ar... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] wide = new int[n], sta = new int[n];
HashMap<Integer, Integer> hm = new HashMap<Integer, Integer>();
for (int i = 0; i < n; i++)... | nlogn | 982_B. Bus of Characters | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
private static void solve(InputReader in, OutputWriter out) {
int n = in.nextInt();
if (n < 6) {
out.println(-1);
} else {
int m = (n - 2);
for (int i = 2; i <= m; i++) {
out.prin... | linear | 959_C. Mahmoud and Ehab and the wrong algorithm | CODEFORCES |
//package com.company;
import java.io.*;
import java.util.*;
public class Main {
public static class Task {
public class Maxflow {
class Edge {
int t, rev;
long cap, f;
public Edge(int t, int rev, long cap) {
this.t = t;
... | cubic | 1187_G. Gang Up | CODEFORCES |
import java.util.*;
public class a{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String str = in.next();
int max = 0;
for(int i=0; i<str.length(); i++) {
for(int j=i+1; j<=str.length(); j++) {
String first = str.substring(i,j);
for(int k=i+1; k<=str.length()-first.l... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class Main {
StreamTokenizer in;
//BufferedReader in;
PrintWriter out;
public static void main(String[] args) throws IOException {
new Main().run();
}
i... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class paintNumbers {
public static int minIndex(List<Integer> list) {
int min = list.get(0);
int minIndex = 0;
for (int i = 0; i < list.size(); i++) {
if (list.get(i) < min) {
min = list.get(i);
minIndex = i;
}
}
return minIndex;... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.StringTokenizer;
im... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedInputStream;
import java.util.Scanner;
/**
* Created by jizhe on 2016/1/29.
*/
public class LCMChallenge {
public static void main(String[] args) {
Scanner in = new Scanner(new BufferedInputStream(System.in));
long N = in.nextLong();
if( N == 1 || N == 2 )
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class Start {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer... | nlogn | 257_A. Sockets | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solve{
public static void main(String[] args) throws Exception{
Scanner sc=new Scanner(System.in);
PrintWriter out =new PrintWriter(System.out);
int size=(int)1e7+1;
int[] pr=new int[size];
for(int i=0;i<size;i++){
... | cubic | 1497E2 | CODEFORCES |
import java.util.*;
import java.io.*;
import java.util.Map.Entry;
public class Codeforces {
static int n;
static double max;
static int[] pre;
public static void findIntensity(int l){
for(int i = 0, j = i + l; j < n + 1; i++, j++){
double res = (pre[j] - pre[i]) / (double) l;
... | quadratic | 1003_C. Intense Heat | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
public class ProblemD {
static int N;
static boolean[][] graph;
public static void main(String[] args) throws IOExc... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
/**
* @author Egor Kulikov (kulikov@devexperts.com)
*/
public class Order implements Runnable {
private Scanner in = new Scanner(System.in);
private PrintWriter out = new PrintWriter(System.out);
private int xs, ys, n;
private int[] x... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class SolA {
static Scanner in;
static PrintWriter out;
public static void main(String[] args) {
in = new Scanner(System.in);
out = new PrintWriter(System.out);
new SolA().run();
in.close();
out.close();
}
privat... | nlogn | 160_A. Twins | CODEFORCES |
import java.math.BigInteger;
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.Stream;
public class Practice {
public static void main(String []args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
sc.nextLine();
String s... | linear | 976_A. Minimum Binary Number | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
public class G_PlaylistForPolycarp {
static final int mod = 1000000007;
static int dp[][];
public static void main(String[] args) throws IOException {
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class problemA {
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[] hs = new int[n];
for(int i = 0; i < n; i++... | nlogn | 169_A. Chores | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class C113A{
static BufferedReader br;
public static void main(String args[])throws Exception{
br=new BufferedReader(new InputStreamReader(System.in));
int nm[]=toIntArray();
int n=nm[0];
int k=nm[1];
... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Random;
import java.util.StringTokenizer;
public class A {
public static void main(String[] args) {
InputScanner scanner = new InputScanne... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.util.Arrays.*;
public class A {
private static final int mod = (int)1e9+9;
final IOFast io = new IOFast();
long k;
long rec(long n, long m, long cur) {
long pow = 1;
long margin = 10;
... | logn | 338_A. Quiz | CODEFORCES |
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.*;
public class B {
public static void main(String[] args) throws IOException {
Reader scan = new Reader();
int t = scan.nextInt();
for(int tt = 0;tt<t;tt++) {
int n = scan.nextInt();
int ... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
import java.io.*;
import java.util.*;
/**
*
* @author kamranmaharov
*/
public class Main {
public static void main(Stri... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.nextLine();
String[] info = s.split(" ");
long n = Long.parseLong(info[0]);
long k = Long.parseLong(info[1]);
sc.close();
... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.*;
public class A
{
public static int palin(String str)
{
int flag=0;
int l=str.length();
for(int i=0;i<l/2;i++)
{
if(str.charAt(i)!=str.charAt(l-i-1))
{
flag=1;
break;
}
}
if(fla... | linear | 981_A. Antipalindrome | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)throws java.lang.Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String s = br.readLine();
int max = 0;
for (int i = 0; i... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Comparator;
import java.util.Random;
import java.util.StringTokenizer;
/**
* @author Polyarniy Nickolay
*/
public class ProblemD {
private BufferedReader in;
private Prin... | logn | 276_D. Little Girl and Maximum XOR | 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 = 1000L * 1000L * 1000L + 7;
private static final int[] dx = {0, -1, 0, 1};
private static final int[] dy... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.*;
public class AA {
static class O implements Comparable<O> {
int problems;
int penalty;
public O(int p, int pp) {
problems = p;
penalty = pp;
}
public int compareTo(O arg0) {
if (problems == arg0.problems) {
return penalty - arg0.penalty;
}
return -(... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
public static void main(String ar[]) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String s1[]=br.readLine().split(" ");
int n=Integer.parseInt(s1[0]);
long x=L... | nlogn | 1061_D. TV Shows | CODEFORCES |
// Working program using Reader Class
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main2
{
static class Reader
{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class A {
int INF = 1 << 28;
void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
long[] chores = new long[n];
... | nlogn | 169_A. Chores | CODEFORCES |
import java.util.*;
import java.io.*;
public class EdA {
static long[] mods = {1000000007, 998244353, 1000000009};
static long mod = mods[0];
public static MyScanner sc;
public static PrintWriter out;
public static void main(String[] omkar) throws Exception{
// TODO Auto-generated method stub
sc = new MyS... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int in = sc.nextInt();
if(
in%4==0||
in%7==0||
in%44==0||
in%47==0||
in%74==0||
... | constant | 122_A. Lucky Division | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in =new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
int[] arr = new int[n];
for(int i = 0; i < n; i++)
arr[i] = in.nextInt();
for(int i = n-1; i > 0; i--)
arr[i] -= arr[i-1];
arr[0] = 0;
A... | nlogn | 1197_C. Array Splitting | CODEFORCES |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
import java.io.*;
public class Main {
void solve() {
double a = sc.nextDouble();
double v = sc.nextDouble();
double l = sc.nextDouble();
double d = sc.nextDouble();
double w = sc.nextDouble();
double res = calc(a, v, l... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.io.Writer;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author palayutm
*/
pub... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.util.Scanner;
public class ProblemC {
public static void main(String[] args) {
ProblemC problem = new ProblemC();
problem.solve();
}
private void solve() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String s = sc.next();
int ret... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
public class Main2 {
static List<List<Integer>> getLayers(int[] numbers, int a, int b) {
boolean[] used = new boolean[numbers.length];
HashSet<Integer> hs ... | linear | 468_B. Two Sets | 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 | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
public class RationalResistance {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(f.readLine());
long a = Long.parseLong(st.nex... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class A235 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n = scan.nextInt();
BigInteger res = null;
if (n >= 3) {
if (n % 2 != 0) {
res = BigInteger.va... | constant | 235_A. LCM Challenge | 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... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class ehsan
{
public static BigInteger f(BigInteger m,BigInteger n){
BigInteger s,l;
s=n.multiply(m.add(BigInteger.valueOf(1)));
l=m.multiply(m.add(BigInteger.valueOf(1)));
l=l.divide(BigInteger.valueOf(2));
s=s.subtract(l);
s=s.subtract(m);
... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class CodeD
{
static class Scanner
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
public String next... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class e {
public static class FastReader {
BufferedReader br;
StringTokenizer st;
//it reads the data about the specified point and divide the data about it... | constant | 1100_C. NN and the Optical Illusion | CODEFORCES |
// discussed with rainboy
import java.io.*;
import java.util.*;
public class CF915E {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw = new PrintWriter(System.out);
int n = Integer.parseInt(br.readLine());
int... | nlogn | 915_E. Physical Education Lessons | CODEFORCES |
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class A23 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
Map<String, Boolean> map = new HashMap<String, Boolean>();
for (int i = s.length(); i >= 1; i--) {
map.clear();
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
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 is at the top
*/
public class Main {
public stat... | constant | 483_A. Counterexample | CODEFORCES |
import java.util.*;
import java.io.*;
public class DigitSequenceA {
public static void main(String[] args) throws IOException{
FastReader in = new FastReader();
double digit = in.nextDouble();
double temp = digit;
long[] seq = new long[13];
for(int i = 1; i<13; i++){
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.text.*;
import java.util.*;
import java.math.*;
public class G1 {
public static void main(String[] args) throws Exception {
new G1().run();
}
int MOD = 1_000_000_007;
public void run() throws Exception {
FastScanner f = new FastScanner();
PrintWriter out = new PrintWr... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
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 is at the top
* @author she... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Math.min;
import static java.lang.System.exit;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public cla... | linear | 1091_F. New Year and the Mallard Expedition | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class Hexadecimaltheorem {
public static void main(String[] args) {
BufferedReader buf = new BufferedReader(
new InputStreamReader(System.in));
int x;
ArrayList<Integer> arr = new ... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.