src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
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 ... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;
public class Solver {
StringTokenizer st;
BufferedReader in;
PrintWriter out;
public static void m... | logn | 256_B. Mr. Bender and Square | 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.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Aman Kumar Singh
*/
public class Main {
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.*;
public class Main
{
static Graph graph[];
public static void add_edge(in... | linear | 1029_C. Maximal Intersection | CODEFORCES |
// upsolve with rainboy
import java.io.*;
import java.util.*;
public class CF1187G extends PrintWriter {
CF1187G() { super(System.out); }
static class Scanner {
Scanner(InputStream in) { this.in = in; } InputStream in;
int k, l; byte[] bb = new byte[1 << 15];
byte getc() {
if (k >= l) {
k = 0;
try {... | cubic | 1187_G. Gang Up | CODEFORCES |
import java.util.Scanner;
public class P23A {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String input = scan.nextLine();
System.out.println(F(input));
}
static int F(String string){
int ans =0;
for (int i = 0; i < string.length(); i++) {
for (int j = 1; j < str... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.*;
import java.math.*;
/*
50
873 838 288 87 889 364 720 410 565 651 577 356 740 99 549 592 994 385 777 435 486 118 887 440 749 533 356 790 413 681 267 496 475 317 88 660 374 186 61 437 729 860 880 538 277 301 667 180 60 393
6
2 2 3 3 5 5
4... | cubic | 840_C. On the Bench | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main implements Runnable {
private void solution() throws IOException {
int n = in.nextInt();
int m = in.nextInt();
boolean[][] adj = new boolean[n][n];
long res = 0;
for (int i = 0; i < m; ++i) {
int x = in.nextInt();
int y = in.nextInt();
adj[x -... | 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 D {
public static void solve(FastScanner fs) {
int n=fs.nextInt();
int[] a=fs.readArray(n);
boolean even=((countInversions(a)&1)==0);
int ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
//package codeforces;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class D {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
PrintWriter writer = new PrintWriter(System.out);
... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.util.*;
public class Hotels {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] cities = new int[n];
int d = input.nextInt();
for (int i = 0; i<n; i++) {
cities[i] = input.nextInt();
}
int possibilities = 0;
ArrayList<Integer... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.util.*;
public class Main {
static int n=5;
static int[] arr=new int[5];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
for (int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
... | linear | 1180_B. Nick and Array | CODEFORCES |
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;
public class Main {
private static final String NO = "NO";
private static fina... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.util.*;
import java.io.*;
public class cf166a {
private static boolean[][] matrix;
private static int n;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
// long l = sc.nextLong();
// int i = sc.nextInt();
// String input = sc.nextLine();
int n = sc.nextInt();
in... | nlogn | 166_A. Rank List | CODEFORCES |
/**
* JUDGE_ID : 104262PN
* User : Денис
* Date : 09.05.11
* Time : 22:48
* ICQ : 785625
* Email : popokus@gmail.com
*/
import java.io.*;
public class s11_d {
public static void main(String[] args) throws IOException {
new s11_d().run();
}
int nextInt() throws IOExcepti... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class A {
static StreamTokenizer st;
static class Sort impl... | nlogn | 220_A. Little Elephant and Problem | 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.util.Arrays;
import java.util.Scanner;
public class B {
void run(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), k = sc.nextInt();
int[] a = new int[n+1];
for(int i=1;i<=n;i++)a[i]=sc.nextInt();
int[] c = new int[100001];
int num = 0;
... | linear | 224_B. Array | CODEFORCES |
//package global14;
import java.util.Scanner;
public class B {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int t = in.nextInt();
while(t > 0){
t --;
int n = in.nextInt();
if(n % 2 != 0){
System.out.prin... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.util.Scanner;
public class Test {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
StringBuilder text = new StringBuilder(in.nextLine()); String substr; String max="";
for(int i=2; i<=text.length(); i++){
for(int j=0; j<i; j++){
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class B {
public static void main(String[] args) throws IOException {
/**/
Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
/*/
Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(new FileInputStream... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.*;
import java.util.*;
import javax.lang.model.util.ElementScanner6;
public class codef
{
public static void main(String ar[]) throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer nk=new StringTokenizer(br.readLine());
... | nlogn | 1197_C. Array Splitting | CODEFORCES |
import java.io.*;
import java.util.*;
/*
polyakoff
*/
public class Main {
static FastReader in;
static PrintWriter out;
static Random rand = new Random();
static final int oo = (int) 1e9 + 10;
static final long OO = (long) 1e18 + 10;
static final int MOD = (int) 1e9 + 7;
static void sol... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int a = in.nextInt();
int b = in.nextInt();
int[] h = new int[3000];
for(int i = 0; i<n; i++)
... | nlogn | 169_A. Chores | CODEFORCES |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.math.*;
import java.util.*;
@SuppressWarnings("unused")
public class A {
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
int n = in.... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
public class main {
public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public static PrintWriter pw = new PrintWriter(System.out);
public static String line;
public static StringTokenizer ... | linear | 701_C. They Are Everywhere | CODEFORCES |
//package round718;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
public class D2 {
InputStream is;
FastWriter out;
String INPUT = "";//2 5 9 9 9 9 9 8 8 8 8 5 6 7 8 9";
void solve()
{
int n = ni(), m = ni(), K = ni();
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.Writer;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
impo... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.* ;
import java.util.*;
import static java.lang.Math.* ;
import static java.util.Arrays.* ;
public class A {
public static void main(String[] args) throws IOException {
new A().solveProblem();
out.close();
}
static Scanner in = new Scanner(new InputStreamReader(System.in));
//static Bu... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class A {
public static void main(String[] args) throws Exception {
int n = nex... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.AbstractList;
import java.io.Writer;
import java.util.List;
import java.io.IOException;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Aman Kumar Singh
*/
public class Main {
public static void main... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
BufferedReader in;
PrintWriter out;
StringTokenizer st = new StringTokenizer("");
int INF = Integer.MAX_VALUE >> 1;
void run() throws ... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
public static Scanner scan = new Scanner(System.in);
public static boolean bg = true;
public static void main(String[] args) throws Exception {
String k1 = scan.next();
HashSet<String> met = new HashSet();
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
/*************************************************************************
* Compilation: javac LRS.java
* Execution: java LRS < file.txt
* Dependencies: StdIn.java
*
* Reads a text corpus from stdin, replaces all consecutive blocks of
* whitespace with a single space, and then compu... | cubic | 23_A. You're Given a String... | CODEFORCES |
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
If I'm the sun, you're the moon
Because when I go up, you go down
*******************************
I'm working for the day I will surpass you
https://www.a2oj.com/Ladder16.html
*/
impor... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.util.*;
public class oK{
void pre() throws Exception{}
void solve(int TC) throws Exception{
int n=ni();
int a[]=new int[n];
for(int i=0;i<n;i++) {
a[i]=ni();
}
Arrays.sort(a);
int b[]=new int[1... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.awt.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import java.util.List;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextLong();
long x = scanner.nextLong(), y = scan... | constant | 1075_A. The King's Race | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
/**
* @author Mubtasim Shahriar
*/
public class Cgr14 {
public static void main(String[] args) {
InputStream inputStream = System.in;
... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
/**
* User: alms
* Date: 09.07.2010
* Time: 18:57:44
*/
public class Solution {
public static void main(String[] args) throws Exception {
final String str;
final BufferedReader r = new BufferedReader(new InputStreamReader(System.i... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
public class lucky
{
public static void main(String args[]) throws IOException
{
BufferedReader cin=new BufferedReader(new InputStreamReader(System.in));
String s=cin.readLine();
int l=s.length();
int n=Integer.parseInt(s);
if(s.equals("47") || s.e... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
static class Data{
int x,i;
Data(int x,int i){
this.x = x;
this.i = i;
}
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStream... | nlogn | 1006_B. Polycarp's Practice | CODEFORCES |
import java.io.*;
import java.util.regex.*;
public class Main {
private static String encode(long rowNum) {
if(rowNum<=26) {
return String.valueOf((char)('A'+rowNum-1));
}
else {
if(rowNum%26==0){
return encode((long)Math.floor((double)rowNum/26)-1)
+ String.valueOf((char)('A'+26-1))... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Scanner;
public class Word {
static String word;
private static void check(String subword) {
int i = 0;
int j = 0;
while (j + subword.length() <= word.length()) {
if (word.substring(j).startsWith(subword)){
i++;
}
j++... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
BufferedReader in = null;
PrintWriter out = null;
int dist(int x1, int y1, int x2, int y2) {
int dx = Math.abs(x1 - x2);
int dy = Math.abs(y1 - y2);
return dx * dx + dy * dy;
}
boolean testBit(int use, int p) {
... | np | 8_C. Looking for Order | 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.StringTokenizer;
public class E {
static long mod;
static long[][] dp;
static int n;
static long[] nWaysToPlaceGroupOfSiz... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.* ;
import java.io.* ;
import java.math.* ;
/************************
* *
* Lord Klotski *
* *
***********************/
public class C
{
static... | linear | 46_C. Hamsters and Tigers | 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 |
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Comparator.*;
public class Main {
FastScanner in;
P... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
public class MainClass {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int arr[] = {4,7,47,74,447,474,477,744,747,774};
int i=0, x = in.nextInt();
while (i<arr.length)
if (x%arr[i++] == 0)
{
System.out... | constant | 122_A. Lucky Division | CODEFORCES |
import java.util.*;
public class Hexadecimal {
public static void main(String args[]){
Scanner input = new Scanner(System.in);
int n = input.nextInt();
System.out.print("0 0 " + n);
}
}
| constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
public static void main(String []args){
Scanner cin = new Scanner( System.in );
int n = cin.nextInt();
int [] num = new int [ n ];
for (int i=0; i<n; i++)
num[i] = cin.nextInt();
Arrays.sort( num );
int i = 0;
while ( i < n ){
if (... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Solution {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
static class Pair implements Comparable<Pair> {
int x, a;
Pair(int x, int a) {
this.x = x;
this.a = a;
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author kanak893
*/
public class M... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
public class helloWorld
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int a = in.nextInt();
int b = in.nextInt();
int c = in.nextInt();
int n = in.nextInt();
int ans = n - (a + b - c);
if(ans < 1 || a >= n || b >= n || c > a || c > b)
ans = ... | constant | 991_A. If at first you don't succeed... | CODEFORCES |
import java.io.*;
import java.util.*;
public class program{
public static void main(String args[]) throws Exception{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
if(n==0){
System.out.println("0 0 0");
return;
}
else if(n==1){
System.out.println("0 0 1");
return;
}
else if(n==2){
... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
public class Task343A {
public static void main(String... args) throws NumberFormatException,
IOException {
... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.*;
public class A_GENERAL {
// for fast output printing : use printwriter or str... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
im... | np | 1102_F. Elongated Matrix | CODEFORCES |
import com.sun.org.apache.xml.internal.utils.StringComparable;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.text.DecimalFormat;
import java.text.NumberFormat;
import java.util.*;
public class Main {
public static void main(String[] args) {
// Test.te... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.FileNotFoundException;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;
public class Main
{
static final double eps=1e-10;
public static void main(String[] args) throws FileNotFoundException
{
new Main().solve();
}
public void solve() throws Fil... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class cf1517d {
public static void main(String[] args) throws IOException {
int n = rni(), m = ni(), k = ni(), ans[][] = new int[n][m];
WGraph g = wgraph(n * m);
for (int i = 0; ... | cubic | 1517_D. Explorer Space | CODEFORCES |
/*
* Institute DA-IICT
*/
import java.io.*;
import java.math.*;
import java.util.*;
public class C
{
InputStream in;
PrintWriter out;
void solve()
{
int n=ni();
long dp[]=new long[n+1];
dp[0]=1;
for (int i=0;i<n;)
{
i++;
if (nc()=='f')
{
//boolean flag=i==1;
i++;
int k=1;
... | quadratic | 909_C. Python Indentation | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: Nick
* Date: 08.08.2010
* Time: 20:44:02
* To change this template use File | Settings | File Templates.
*/
import java.io.*;
import java.util.*;
import java.util.regex.*;
public class B {
public static void main(String[] args) {
Scanner input = new Scanner (Sy... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public A () throws IOException {
String input = r.readLine();
int N = Integer.parseInt(input);
int [] A = new int [N];
input = r.readLine();
String [] S = input.split(" ");
for (int i = 0; i < N; ++i)
A[i] = Integer.parseInt(S[i]);
solve(N, A);
... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/**
*
* @author Antonio "Teo" Alurralde
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReade... | constant | 1033_A. King Escape | CODEFORCES |
import java.util.*;
public class a {
/**
* @param args
*/
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()%2;
int z = 0;
for(int i=0;i<n;i++) z+=(a[i] == 0)?1:0;
if (z == 1) z = 0;
... | linear | 25_A. IQ test | 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 MaxHeap
*/
public class Main ... | linear | 1062_C. Banh-mi | 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... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.Arrays;
import java.util.StringTokenizer;
public class Solution {
//<editor-fold desc="input parse" defaultstate="collapsed">
private static StringTokenizer st;
private static java.io.BufferedReader reader;
private static java.io.BufferedWriter writer;
private static long nextLo... | nlogn | 257_A. Sockets | CODEFORCES |
import java.util.*;
import java.io.*;
import java.awt.Point;
import java.math.BigDecimal;
import java.math.BigInteger;
import static java.lang.Math.*;
// Solution is at the bottom of code
public class _____A implements Runnable{
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
Buffere... | logn | 338_A. Quiz | CODEFORCES |
import static java.lang.Math.max;
import static java.lang.Math.min;
import java.io.*;
import java.util.*;
public class B {
private void solve() throws IOException {
int senators = nextInt();
int candies = nextInt();
scoreA = nextInt();
lvl = new int[senators];
unloyal = new int[senators];
for (int i = 0... | np | 105_B. Dark Assembly | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
import java.util.HashMap;
public class Main
{
static class Reader
{
private InputStream mIs;private byte[] buf = new byte[1024];private int curChar,numChars;public Reader() { this(System.in); }public Reader(InputStream is) { mIs = is;}
... | linear | 527_B. Error Correct System | CODEFORCES |
import java.util.Scanner;
/**
*
* 作者：张宇翔 创建日期：2017年6月16日 上午9:00:48 描述：写字楼里写字间，写字间里程序员； 程序人员写程序，又拿程序换酒钱。
* 酒醒只在网上坐，酒醉还来网下眠； 酒醉酒醒日复日，网上网下年复年。 但愿老死电脑间，不愿鞠躬老板前； 奔驰宝马贵者趣，公交自行程序员。
* 别人笑我忒疯癫，我笑自己命太贱； 不见满街漂亮妹，哪个归得程序员？
*/
public class Main {
private final static int Max = (int) (1e5 + 10);
private static long n,s;
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.DataInputStream;
import java.io.IOException;
import java.io.FileInputStream;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class M... | 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.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.util.*;
import java.io.*;
public class ProblemD
{
static int mod = (int) (1e9+7);
static InputReader in;
static PrintWriter out;
static void update(int i, int val, int[] bit){
for(; i < bit.length; i += (i&-i))
bit[i] += val;
}
static int query(int i, ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* @author Don Li
*/
public class LogicalExpression {
int N = 256;
void solve() {
Expression[] E = new Expression[N];
for (in... | quadratic | 913_E. Logical Expression | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class r114 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
ArrayList<Integer... | nlogn | 169_A. Chores | CODEFORCES |
import java.util.*;
import java.io.*;
public class programA {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
if(n%2 == 0)System.out.println(n/2 +1);
else System.out.println((int)Mat... | constant | 964_A. Splits | CODEFORCES |
//package com.example.programming;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import j... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
imp... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
/**
* Created by mostafa on 10/7/17.
*/
public class FireAgain {
static int n, m, k;
static int inf = (int) 1e9;
static class Pair {
int x, y;
Pair(int a, in... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
import java.io.*;
public class Chores
{
public static void main(String args[])throws IOException
{
InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
String[] line = br.readLine().split("\\W");
int n = Integer.parseInt(line[0]);
int... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
public class Main {
/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
// TODO Auto-gene... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.Map.*;
import java.math.*;
//import java.lang.*;
public class q1
{
static int MOD=1000000007;
static class Reader
{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
pr... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class CF224B {
public static void main(String[] args) throws Exception {
new CF224B().solve();
}
private void solve() throws Exception {
Scanner sc = new Scanner(System.in);
... | linear | 224_B. Array | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
String a = r.next();
char[] c = a.toCharArray();
for(int l = a.length()-1; l >= 1; l--){
for(int i = 0; i <= a.length()-l; i++){
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1185G2 {
static final int MD = 1000000007;
static int[][] solve1(int[] aa, int t, int n) {
int[][] da = new int[t + 1][n + 1];
da[0][0] = 1;
for (int i = 0; i < n; i++) {
int a = aa[i];
for (int s = t - 1; s >= 0; s--)
for (int m = 0; m < n; m++) {... | np | 1185_G1. Playlist for Polycarp (easy version) | 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.util.Scanner;
public class LCM {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n=sc.nextLong();
if(n < 3) {
System.out.println(n);
}
else if(n % 2 != 0) {
System.out.println(n * (n-1) * (n-2));
}
else if(n % 3 == 0) {
System.out.println((n-1) * (n... | constant | 235_A. LCM Challenge | CODEFORCES |
//package ContestEd69;
import java.io.*;
import java.util.StringTokenizer;
public class mainD {
public static PrintWriter out = new PrintWriter(System.out);
public static FastScanner enter = new FastScanner(System.in);
public static long[] arr;
public static void main(String[] args) throws IOException... | quadratic | 1197_D. Yet Another Subarray Problem | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Iterator;
import java.util.Set;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.Map;
import java.ut... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
long solve(long a, long b) {
return b == 0 ? 0 : a / b + solve(b, a % b);
}
public void run() {
try {
long a = reader.nextLong();
long b = reader.nextLong();
writer.println(sol... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.*;
import java.util.*;
public class Lcm
{
public static void main(String args[])throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw=new PrintWriter(System.out);
long n=Long.parseLong(br.readLine());
if(n<=2)
pw.println(n);
else
{
if(n%6==0)
{
pw.p... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.StringTokenizer;
public class ReallyBigNumbers1
{
public static void main(String[] args) throws IOException
{
BufferedReader br = ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class Main2 {
static int mod = 1000000007;
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
/* spar5h */
public class cf1 implements Runnable{
public void run() {
InputReader s = new InputReader(System.in);
PrintWriter w = new PrintWriter(System.out);
int t = 1;
while(t-- > 0) {
int n = s.nextInt(), m ... | linear | 1010_A. Fly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
/* Template for TopCoder and ACMonline. */
public class A {
private static StreamTokenizer in = null;
private static PrintWriter out ... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
/**
* BaZ :D
*/
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main
{
static MyScanner scan;
static PrintWriter pw;
static long MOD = 1_000_000_007;
static long INF = 1_000_000_000_000_000_000L;
static long inf = 2_000_000_000;
public static void main(Strin... | np | 1238_E. Keyboard Purchase | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.