src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import java.util.StringTokenizer;
public class DoubleWord implements Runnable {
boolean isLocalMode =false;
private void doJob() throws Exception {
//do here
String s = nextToken();
int max=0;
for(int i = 0;i<s.length();i++){
for(int j=i+... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.awt.geom.Point2D;
import java.text.*;
import java.math.*;
import java.util.*;
public class Main implements Runnable {
final String filename = "";
public int nextPerm(int[] a, int k) {
if (a[0] == k)
return -1;
int last = 0;
for (int i = a.length - 1; i >= 0; i--)
if (a[i]... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
StreamTokenizer in;
BufferedReader inb;
PrintWriter out;
public static void main(String[] args) throws Exception {
new Main().run();
}
public void run() throws Exception {
in = new StreamTokenizer(new BufferedReader(new... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.*;
import java.util.*;
public class C
{
String line;
StringTokenizer inputParser;
BufferedReader is;
FileInputStream fstream;
DataInputStream in;
void openInput(String file)
{
if(file==null)is = new BufferedReader(new InputStreamReader(System.in));//stdin
else
{
try{
fstrea... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main implements Runnable {
//public static final String FileName = "test";
StreamTokenizer ST;
PrintWriter out;
BufferedReader br;
Scanner in;
static final int inf = 1000000000+10;
int nextInt() throws ... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution
{
static class Reader {
BufferedReader br;
StringTokenizer st;
public Reader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringT... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
InputStream is;
int __t__ = 1;
int __f__ = 0;
int __FILE_DEBUG_FLAG__ = __f__;
String __DEBUG_FILE_NAME__ = "src/C4";
FastScanner in;
PrintWriter out;
int charToIndex(char c) {
if (Character.isLowerCase(c))
return c - 'a';
else if (Character.isU... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.InputMismatchException;
import java.io.*;
import java.util.HashMap;
/**
* Generated by Contest helper plug-in
* Actual solution is at the bottom
*/
public class Main {
public static void main(String[] args) {
InputReader in = new StreamInputReader(System.in);
PrintWriter out = n... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
public void _main() throws IOException {
int height = nextInt();
int width = nextInt();
int k = nextInt();
int[] r = new int[k];
int[] c = new int[k];
for (int i = 0; i < k; i++) {
r[i] = nextInt() - 1;
c[i] = nextInt()... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
public class Main{
void solve(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int n1 = n/10;
int n2 = n/100*10 + n%10;
int ans = n;
ans = Math.max(ans, n1);
ans = Math.max(ans, n2);
System.out.println(ans);
}
... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class VtoraiaStat implements Runnable {
boolean isLocalMode = false;
private void doJob() throws Exception {
int n = nextInt();
int[] r = new int[n];
for(int i =0;i<n;i++){
r[i]=nextInt();... | nlogn | 22_A. Second Order Statistics | 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... | logn | 1019_B. The hat | CODEFORCES |
import java.util.Scanner;
public class inversion__count {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n=s.nextInt();
int[] a = new int[n+1];
for(int i=1;i<=n;i++){
a[i]=s.nextInt();
}
int m=s.nextInt();
int count=0;
for(int i=1;i<=n;i++){
f... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
public class LookingOrder {
public static void main(String[] args) throws IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
import java.util.function.Function;
public class P1196D2 {
static boolea... | quadratic | 1196_D2. RGB Substring (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class Template implements Runnable {
private void solve() throws IOException {
int n = nextInt();
int m = nextInt();
boolean[][] g = new boolean[n][n];
for (int i = 0; i < m; ++i) {
int a = nextInt() - 1;
int b = n... | np | 11_D. A Simple Task | CODEFORCES |
//package codeforces;
import java.util.Scanner;
public class Fingerprints {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int[] code = new int[scanner.nextInt()];
int[] prints = new int[scanner.nextInt()];
for (int i = 0; i < code.length; i++) {
code[i] = scanner.ne... | quadratic | 994_A. Fingerprints | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
private static PrintWriter out;
private static FastReader in;
private static class FastReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public FastReader(InputStream inputStream) {
reader... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.Writer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class ToyArmy {
/**
* @param args
* @throws IOException
* @throws NumberFormatException
*/
public static void main(String[] args) throws NumberFormatException, IOException
{
BufferedReader br = new Buf... | constant | 84_A. Toy Army | 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;
public class C2 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
in... | cubic | 840_C. On the Bench | CODEFORCES |
import java.util.*;
import java.io.*;
/**
* Created by HREN_VAM.
*/
public class A implements Runnable{
BufferedReader in;
PrintWriter out;
StringTokenizer st;
public static final String filename = "";
public void solve() throws IOException{
int n = nextInt();
int[] a = new i... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeSet;... | np | 11_D. A Simple Task | CODEFORCES |
//package codeforces;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
public class SameSumBlocksHard {
public static void main(String[] args) {
Scanner in = new Scanner(System.in... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Round111ProbA {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[]a = new int[n];
int s =0;
for(int i =0 ; i < n;i++)
{
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;
/**
* @author khokharnikunj8
*/
public class Main {
public static void main(String[] args) {
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int m = scan.nextInt();
boolean[][] graph = new boolean[n][n];
for (int i = 0; i < m; i++) {
int u = scan.nextInt() - 1;
int v = scan.nextInt() - 1;
... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.math.*;
import static java.lang.Character.isDigit;
import static java.lang.Character.isLowerCase;
import static java.lang.Character.isUpperCase;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.text.*;
import java.util.*;
import java.math.*;
public class template {
public static void main(String[] args) throws Exception {
new template().run();
}
long MOD = 1_000_000_007;
public void run() throws Exception {
FastScanner f = new FastScanner();
PrintWriter out = new PrintW... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tokenizer=null;
public static void main(String[] args) throws IOException
{
new Main().execute();
}
void debug(Object...os)
{
System.out... | nlogn | 169_A. Chores | CODEFORCES |
//package contese_476;
import java.util.*;
public class q1
{
int m=(int)1e9+7;
public class Node
{
int a;
int b;
public void Node(int a,int b)
{
this.a=a;
this.b=b;
}
}
public int mul(int a ,int b)
{
a=a%m;
b=b%m;
return((a*b)%m);
}
public int pow(int a,int b)
{
int x=1;
while(b>0)
{
if(b%2!=0)
x=mul... | linear | 1013_B. And | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author BSRK Aditya
*/
public class Main {
public static void main(String[] ar... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
static Scanner console;
public static void main(String[] args) {
console = new Scanner(System.in);
int n = console.nextInt();
List<Integer> arr= new ArrayList<>();
for(int i = 0; i < n; i++) arr.add( console.nextInt());
Collections.sort(arr);
L... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.DataInputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
public class D {
private static void run() throws IOException {
int n = in.nextInt();
int m = in.nextInt();
in... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
... | quadratic | 1011_B. Planning The Expedition | 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... | 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.StringTokenizer;
import javax.sound.midi.Synthesizer;
public class Main {
static int V;
stati... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
public class global{
public static void main(String s[]){
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
String st = String.valueOf(n);
if(st.length()==1){
System.out.println(n);
}else{
long val = 1;
long prev=9;
long total=9;
long late=9;
for(int... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Sparsh Sanchorawala
*/
pub... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
import java.util.stream.IntStream;
public class B {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in ... | logn | 1019_B. The hat | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class C908 {
public static class mPoint implements Comparable<mPoint> {
public double a, b;
public mPoint(int a, double b) {
this.a = a; this.b = b;
}
public int compareTo(mPoint p) {
return b < p.b ? 1 : (b > p... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import static java.lang.Math.cos;
import static java.lang.Math.min;
public class E_fast {
static int g[][];
static int n, m;
static char[] s;
static int dp[], inf = (int) 2e9;
static int cost[][];
public static voi... | np | 1238_E. Keyboard Purchase | CODEFORCES |
/**
* @author: Mehul Raheja
*/
import java.util.*;
import java.io.*;
public class p4 {
/*
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 = new ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner in=new Scanner(System.in);
String str=in.next();
int cnt=0;
for(int i=0;i<str.length();++i) {
if(str.charAt(i)=='1') {
++cnt;
}
}
int i=0;
for(;i<str.length();++i) {
if(str.charAt(i)=='0') {
S... | linear | 1009_B. Minimum Ternary String | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main{
public static void main (String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt(), min[] = new int[n];
boolean used[] = new boolean[n];
HashSet<Integer> set = new HashSet<>();
for (int i = 0; i < n; i++) {
min[i] =... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.regex.*;
import static java.lang.Math.*;
public class A {
public A() throws Exception {
int n = in.nextInt();
int[] arr = new int[n];
for (int i=0;i<n;i++)
arr[i] = in.nextInt();
... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
public class b{
static class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.Scanner;
public class CodeforcesRound176B {
/**
* @param args
*/
public static void main(String[] args)
{
Scanner kde =new Scanner (System.in);
Long n = kde.nextLong(); //дома и кол труб
Long k = kde.nextLong(); // разветлители
if(((k-1)*(k-2)+2*k)<(n*(long)2))
{
System.out... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.Map.Entry;
public class ProblemA {
public static void main (String args[]) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(br.readLine());
String s1=br.readLine();
String[] s=s1.split(" ")... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.PrintWriter;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.*;
public class CF23A implements Runnable{
public static void main(String args[]){
new CF23A().run();
}
@Override
public void run(){
tr... | cubic | 23_A. You're Given a String... | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: mac
* Date: 11-12-9
* Time: 下午10:48
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringT... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception{
BufferedReader jk = new BufferedReader(new InputStreamReader( System.in)) ;
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out)) ;
StringTokenizer ana = new StringToken... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
String filename = "";
final int INF = 1_000_000_000;
void solve() {
int n = readInt();
int[] a = new int[n];
for(int i = 0;i<n;i++){
a[i] = readInt();
}
Map<Integer, Integer>[] maps = new Map[n];
... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
//package round503;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;
public class B2 {
Scanner in;
PrintWriter out;
String INPUT = "";
// 12123432
// 12343212
int qc = 0;
int n;
int[] table;
int val(int x)
{
if(table[x] != Integer.MIN_VALUE)ret... | logn | 1019_B. The hat | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Cf1017A {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer... | linear | 1017_A. The Rank | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
public class main {
public static void main(String[] args) throws IOException {
Locale.setDefault(Locale.US);
br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw = new PrintWriter(System.out);
... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import static java.util.Arrays.*;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import java.util.*;
import java.math.*;
import java.io.*;
public class B implements Runnable
{
String file = "input";
boolean TEST = false;
double EPS = 1e-8;
void solve() throws IOException
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
long b=0;long p=1;
Scanner s=new Scanner(System.in);
long m=s.nextLong();
long x=1;
do{
p=(m+b)/x;
b=10*b+10;
x++;
}while(p/(long)Math.pow(10... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
public class A {
public static void main(String args[]) {
Scanner sc = new Scanner (System.in);
int n = sc.nextInt();
int a[] = new int[n+1];
for(int i=1 ; i<=n ; i++) a[i] = sc.nextInt();
int cnt = 0;
for(int i=1 ; i<=n ; i++) {
for(int j=i-1 ; j>=1 ; j--) {
if(a[i]<a[j])
+... | quadratic | 911_D. Inversion Counting | CODEFORCES |
/*input
3
2 3
2 5 7
4 2 4
3 6
4 1 5 2 10 4
8 6 6 4 9 10
5 4 9 5 8 7
3 3
9 9 9
1 1 1
1 1 1
*/
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.StringTokenizer;
import java.util.Random;
import java.io.IOException... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Iterator;
import java.util.StringTokenizer;
import java.util.Vector;
public class B {
static Vector<Integer> primes;
public static void main(String[] args) throws IOException {
InputReader myScanner = new... | linear | 224_B. Array | CODEFORCES |
import java.util.Scanner;
public class Seq2 {
static void metod() {
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();
int min = a[0];
for (int i = 1; i < a.length; i++) {
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
public class D {
public static void main(String[] args) throws IOException {
new D().solve();
}
void solve() throws IOException {
Scanner sc = new Scanner(System.in);
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
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
{
static double p[][];
static double dp[];
static int n;
public static int BitCount(int u) {
int uCount;
uCount = u - ((u >> 1) & 03333333... | np | 16_E. Fish | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: Taras_Brzezinsky
* Date: 8/14/11
* Time: 9:53 PM
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.FileReader;
import java.util.StringTokenizer;
imp... | np | 16_E. Fish | 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 |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.text.*;
public class cf276d {
static BufferedReader br;
static Scanner sc;
static PrintWriter out;
public static void ini... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
public void _main() throws IOException {
int n = nextInt();
int even = 0, odd = 0, atEven = -1, atOdd = -1;
for (int i = 0; i < n; i++) {
if (nextInt() % 2 == 0) {
atEven = i;
++even;
}
else {
atOdd = i;
++od... | linear | 25_A. IQ test | 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.util.HashSet;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author... | quadratic | 1015_B. Obtaining the String | CODEFORCES |
//package round8;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
public class C {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int x = ni(), y = ni();
int n = ni();
int[][] co = new int... | np | 8_C. Looking for Order | CODEFORCES |
//package global14;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
public class E2 {
InputStream is;
FastWriter out;
String INPUT = "";
public static int[][] enumFIF(int n, int mod) {
int[] f = new int[n + 1];
int[] inv... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
BufferedReader in;
StringTokenizer st;
PrintWriter out;
String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(in.readLine());
return st.nextToken();
}
int nextInt() throws Exception {
return Integer... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTok... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
public static void main(String[] args)
{
Kattio io = new Kattio(System.in);
int n = io.getInt();
int ans = 0;
int V = n;
int A = n;
A -= n/2;
ans += n/2;
V -= A;
ans += A;
... | constant | 84_A. Toy Army | CODEFORCES |
import java.util.Scanner;
import java.util.Vector;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int a[] = new int[n];
int b[] = new int[n];
for (int i = 0; i < n; i++) ... | nlogn | 1010_A. Fly | 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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.PriorityQueue;
public class D_Rnd718_Explorer
{
static int row, col;
static int INF = 1_000_000_000;
static int[] dx = {0, 0, 1, -1};
static int[] dy = ... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Subtraction {
static long c=0;
public static void main(String[] args) throws IOException {
BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class TaskB {
static BufferedReader in = new BufferedReader(new InputStreamReader(
System.in));
static StringTokenizer str;
static String SK;
static String... | logn | 287_B. Pipeline | CODEFORCES |
//package com.krakn.CF.B1159;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n;
n = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
... | linear | 1159_B. Expansion coefficient of the array | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.*;
public class Main implements Runnable {
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;
p... | 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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;
... | quadratic | 1097_G. Vladislav and a Great Legend | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.*;
import java.math.*;
import static java.lang.Integer.*;
import static java.lang.Double.*;
import java.lang.Math.*;
public class A {
public static void main(String[] args) throws Exception {
new A().run();
}
public void run() throws Exception {
FastIO fi... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws IOException {
PrintWriter out = new PrintWriter(System.out);
//Scanner sc = new Scanner();
Reader in = new Reader();
Main solver = new Main();
solver.... | nlogn | 958_B2. Maximum Control (medium) | CODEFORCES |
import javax.print.DocFlavor;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;
import java.util.Stack;
public class p1523C {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
for (int i = 0; i < t ; i++) {
... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.Scanner;
//http://codeforces.com/contest/909/problem/C
public class PythInd {
public static final int MOD = 1000000007;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine());
String[] sTypes = new String[n];
for (int i = 0; i <... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
public class Rules {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int a = in.nextInt();
double maxSpeed = in.nextInt();
double len = in.nextInt();
double delayDist = in.nextInt();
double delaySpeed = in.nextInt();
// two cases: I r... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
//package round25;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class A {
private Scanner in;
private PrintWriter out;
private String INPUT = "";
public void solve()
{
int n = ni();
int[] u = new int[n];
int fe = -1, fo = -1;
int ne = -1, no = -1;
for(int i = 0... | linear | 25_A. IQ test | CODEFORCES |
import java.io.*;
import java.util.*;
public class E16 {
static double[][] grid;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
grid = new double[n][n];
for(int i = 0; i < n; i++) {
... | np | 16_E. Fish | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.Map;
import java.util.HashMap;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**... | nlogn | 1029_D. Concatenated Multiples | CODEFORCES |
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(S... | constant | 343_A. Rational Resistance | 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... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
private static FastScanner sc = new FastScanner();
private static long mod = 1000000007;
public static void main(String[] args) {
int n = sc.nextInt();
int T = sc.nextInt();
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
/**
* @author derrick20
*/
import java.io.*;
import java.util.*;
public class SameSumBlocks {
public static void main(String[] args) throws Exception {
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int N = sc.nextInt();
int[] pre = new int[N +... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String args[]) {new Main().run();}
FastReader in = new FastReader();
PrintWriter out = new PrintWriter(System.out);
void run(){
int q=in.nextInt();
for(int i=0;i<q;i++) {
work();
}
out.flush();
}
long mod=1000000007;
l... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.StringTokenizer;
public class ChainReaction im... | nlogn | 608_C. Chain Reaction | CODEFORCES |
import java.util.ArrayList;
import java.util.Scanner;
public class kosyaDetka {
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int t = scan.nextInt();
ArrayList<Integer> arr = new ArrayList<>();
for(int i = 0; i < t; i++){
arr.add( scan... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.