src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.awt.*;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
import java.io.*;
public class Main3 {
static PrintWriter pr;
static Scanner scan;
static BufferedReader br;
static StringTokenizer st;
public static void main(String args[]) throws Exception {
... | quadratic | 1209_A. Paint the Numbers | 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.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
im... | linear | 1000_A. Codehorses T-shirts | 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.BitSet;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
import ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.BigInteger;
import java.util.Map.Entry;
import static java.lang.Math.*;
public class G extends PrintWriter {
void run() {
long mod = 1_000_000_000 + 7;
int n = nextInt();
int m = nextInt();
int[] t = new int[n];
int[]... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
public class coins
{
public static void main(String args[])throws IOException
{
InputStreamReader read=new InputStreamReader(System.in);
BufferedReader in=new BufferedReader(read);
int i,k,n,v;
String a;
a=in.readLine();
for(i=0;i<a.length();i++)
{
if(a.charAt(i)==' ')
break;
}... | constant | 1061_A. Coins | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class CottageVillage {
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
while(scan.hasNext()){
int counter = 0;
int numbCottages = scan.nextInt();
int t = scan.nextInt();
House[] cottages = new House[numbCottage... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.Arrays;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] nums = new int[n];
for(int i = 0; i < n; i++){
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
static MyScanner sc;
private static PrintWriter out;
static long M2 = 1_000_000_000L + 7;
private static HashMap<Long, Long>[] mods;
public static void main(String[] s) throws Exception {
StringBuilder stringBuilder = new Str... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
public class B {
final int MOD = (int)1e9 + 7;
final double eps = 1e-12;
final int INF = (int)1e9;
public B () {
long N = sc.nextInt();
long X = sc.nextInt() - 1;
long Y = sc.nextInt() - 1;
long C = sc.nextInt();
long [] A1 = new long ... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
int n = scn.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] ... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class B {
static long n, k;
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
n = in.nextLong();
k = in.nextL... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class MicroWorld {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = ne... | nlogn | 990_B. Micro-World | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collecti... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
public class CF_1029E_Tree_with_Small_Distances {
static ArrayList<Integer> adj[];
... | linear | 1029_E. Tree with Small Distances | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
public class Solution {
private static int[] dx = {
-1, -1, -1,
0, 0,
1, 1, 1};
private static int[] dy = {
-1, 0, 1,
-1, 1,
-1, 0, 1};
public ... | quadratic | 1059_B. Forgery | CODEFORCES |
import java.io.PrintWriter;
import java.util.Locale;
import java.util.Scanner;
public class A {
public static void main (String[] args){
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = in.nextInt();
out.printf(Locale.US, "%d", n/2*3);
out.close();
}
}
| constant | 84_A. Toy Army | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
new A().run();
}
private void run() {
Scanner sc =new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
sc.close();
boolean[] isp = new boolean[n + 1];
Arrays.fill(isp, true);
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.List;
import java.util.*;
public class realfast implements Runnable
{
private static final int INF = (int) 1e9;
long in= 1000000007;
long fac[]= new long[1000001];
long inv[]=ne... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
int n, k, a;
int[] b, l;
double best;
double calc(int i, int r, int c, double p) {
if (i == n) {
if (c <= n / 2) {
p *= 1.0 * a / (a + r);
}
return p;
} else {
retur... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class C{
public static void main(String[] args) throws IOException {
// br = new BufferedReader(new FileReader(".in"));
// out = new PrintWriter(new FileWriter(".out"));
//new Thread(null, new (), "peepee", 1<<28).start();
read();
int t= RI();
while(t-->0) {
... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.*;
public class a {
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
int n = input.nextInt();
if(n%2 == 0) System.out.println(4+" "+(n-4));
else System.out.println(9+" " +(n-9));
}
}
| constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
private static HashMap<String, Integer> nodes;
private static void dfs(String cur, PrintWriter out) {
if(cur.length() > 0) {
out.println(cur.substring(1));
}
int children = nodes.get(cur);
for(int i = 1; i <= ... | cubic | 1523_C. Compression and Expansion | 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 | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Locale;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.Map.Entry;
public class Solution implements ... | np | 105_B. Dark Assembly | 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.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.util.*;
public class ques1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int b = sc.nextInt();
ArrayList<Integer> ar=new ArrayList<>();
for(int i=0;i<b;i++){
ar.add(sc.nextInt());
}
Collections.sort(ar);
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Scanner;
import java.util.StringTokenizer;
public class Main {
static BufferedReader in=new BufferedReader(new InputStreamReader(System.in));... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.Scanner;
public class ReallyBigNumbers1
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long s = sc.nextLong();
int r = 0 ;
long l = 0L ;
long u = n ;
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
int a = ... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.StringReader;
import java.util.ArrayList;
import java.util.Arrays... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
/**
* @param args
*/
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int k = scan.nextInt()-1;
team[] t = new team[n];
for(int i = 0 ;i < n ; i++)
t[i] = new team(scan.nex... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
public class practice {
static class Reader
{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
public Reader()
{
din = new ... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class C {
public static void main(String... args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine();
int[] x = new int[n];
int max=0, pos=-1;
for(int i=0; i<n; i++) ... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.* ;
import java.io.* ;
public class PythonIndentation
{
public static void main(String args[])
{
Scanner in = new Scanner(System.in) ;
int n = in.nextInt() ;
boolean[] lst = new boolean[n] ;
for(int i=0;i<n;i++)
{
lst[i] = (in.next().equals("s"))?false:true ;
}
System.out.println(dp... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class default_dst {
public static void main(String[] args) {
in = new FastReader();
int n=ni();
int[] arr=takeIntegerArrayInput(n);
HashMap<Long,ArrayList<pair>> h... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
/**
* @author grozhd
*/
public class P3 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String s = "";
... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class A {
static BufferedReader in;
static PrintWriter out;
static StringTokenizer st;
static Random rnd;
void solve() throws IOException {
int n = nextInt();
int[] arr = new int[n];
Integer[] arrCopy = new I... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class p472a {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
if (n % 2 == 0) {
System.out.println("8 " + (n - 8));
} else {
System.out.printl... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = in.nextInt();
out.println(n+"... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import static java.lang.Integer.*;
import static java.lang.Math.*;
@SuppressWarnings("unused")
public class round35C {
static class state{
int x, y, time;
public state(int xx, int... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
public class P1517D {
// author: Nagabhushan S Baddi
// PRIMARY VARIABLES
private static int n, m, k;
privat... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* 111118315581
*
* @author pttrung
*/
public class C {
static Point hand;
static int n;
static Point[] data;
static int[] next;
static in... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
public class ehab4 {
public static void main( String[] args ) {
Scanner in = new Scanner( System.in );
int a = 0, b = 0;
System.out.println( "? 0 0 " );
System.out.flush();
int c = in.nextInt();
for ( int i = 29; i >= 0; i-- ) {
System.out.println( "? " + ( a + ( 1 << i ) ) + ... | logn | 1088_D. Ehab and another another xor problem | CODEFORCES |
import java.util.*;
public class Main {
private static Scanner in = new Scanner(System.in);
public static void main(String args[]){
int n = in.nextInt();
String s = in.next();
if(n==1)
System.out.println("1");
else{
int j=0,i=1,ans=s.length();
int h[]=new int[128];
h[(int)s.charAt(0)]=1;
whil... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.*;
public class cf11d {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
boolean[][] g = new boolean[n][n];
boolean[] ok = new boolean[1<<n];
int[] f = new int[1<<n];
for(int i=1; i<(1<<n); i++) {
ok[i] = Intege... | np | 11_D. A Simple Task | 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... | nlogn | 528_B. Clique Problem | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;
/**
* Built using CHelper p... | logn | 713_B. Searching Rectangles | CODEFORCES |
/*
* PDPM IIITDM Jabalpur
* Asutosh Rana
*/
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
long MOD = 1000000007;
InputReader in;
BufferedReader br;
PrintWriter out;
public static void main(String[] args) throws java.lang.Exception {
Main solver = new Main();
solver.in = ne... | quadratic | 911_D. Inversion Counting | 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.ArrayDeque;
import java.util.Arrays;
public class Main {
private static StreamTokenizer in;
private stat... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class loser
{
static class InputReader {
public BufferedReader br;
public StringTokenizer token;
public InputReader(InputStream stream)
{
br=new BufferedReader(new InputStreamReader(stream),32768);
... | constant | 965_A. Paper Airplanes | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Main {
static int[] a;
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = sc.nextInt();
a = sc.nextIntArray(n);... | nlogn | 986_B. Petr and Permutations | 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 | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class A558 {
static BufferedReader in = null;
static PrintWriter out = null;
static StringTokenizer st = new StringTokenizer("");
public static void main(String[] args) {
try {
in = new BufferedReader(new InputStreamReader(System.in));
out = new Pri... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class B {
final BufferedReader reader = new BufferedReader(new InputStreamReader(System... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.util.*;
public class b {
public static void main(String[] args) throws Exception {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
StringTokenizer st = new String... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.util.Scanner;
public class GiveString23A {
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
String stroke = in.next();
char[] s = new char [stroke.length()];
for (int i=0;i<stroke.length();i++)
s[i]=stroke.charAt(i);
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
/**
* Created with IntelliJ IDEA.
* User: ira
* Date: 3/23/13
* Time: 12:19 PM
*/
public class B2 {
public static void main(String[] args) throws IOEx... | logn | 287_B. Pipeline | CODEFORCES |
//contest 23. You're Given A String
import java.util.*;
public class ProblemA
{
public static void main(String[] args)
{
Scanner keyboard = new Scanner(System.in);
String input = keyboard.nextLine();
boolean con = false;
for( int i = input.length()-1; i > 0 ; i--)
{
for ( int j = 0; j+i< input.length();... | cubic | 23_A. You're Given a String... | 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;
public class Div1_503B {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(... | logn | 1019_B. The hat | CODEFORCES |
//package baobab;
import java.io.*;
import java.util.*;
public class C {
public static void main(String[] args) {
CIO io = new CIO();
try {
Csolver solver = new Csolver(io);
solver.solve();
} finally {
io.close();
}
}
}
class Csolver {
... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
public class Main {
public static void main(String [] args ) {
try{
String str;
BufferedReader br = new BufferedReader(new InputStreamReader(System... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.awt.*;
import java.io.*;
import java.util.*;
public class Abc {
public static void main(String[] args) throws IOException {
// FastReader sc = new FastReader();
Scanner sc=new Scanner(new FileReader("input.txt"));
PrintWriter out=new PrintWriter(new File("output.txt"));
in... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.Scanner;
public class p23a {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
char[] x = in.next().toCharArray();
int min = 0;
int max = x.length;
while(true) {
if(max-min == 1)
break;
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.Scanner;
public class C_1523 {
static Scanner input = new Scanner(System.in);
static int n;
public static void main(String[] args) {
int t = input.nextInt();
for(int test = 0; test < t; test++){
n = input.nextInt();
int num = input.nextInt();
if(num == 1){
n--;
recur("");
... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.*;
import java.util.regex.*;
import java.text.*;
import java.math.*;
import java.io.*;
public class Mulitple
{
public static void main(String[] args) throws IOException
{
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
String s = r.readLine();
System.out.println(n... | 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.Set;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;
/**... | 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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution i... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class Main implements Runnable {
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChar... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;
import java.util.StringTokenizer;
/**
... | constant | 84_A. Toy Army | CODEFORCES |
import java.util.*;
public class A
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
long n=sc.nextLong();
if(n==0)
System.out.println(0);
else if(n%2==1)
System.out.println((n+1)/2);
else
System.out.println(n+1);
}
... | constant | 979_A. Pizza, Pizza, Pizza!!! | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
static int MOD = 1000000007;
// After writing solution, quick scan for:
// array out of bounds
// special cases e.g. n=1?
// npe, particularly in maps
//
// Big numbers arithmetic bugs:
// in... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.Scanner;
public class MargariteBestPresent_1080B {
private static int f(int x) {
return (x%2==0)?x/2:(x-1)/2-x;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n,r,l;
n = sc.nextInt();
while(n-->0) {
l = sc.nextInt();
r = sc.nextInt();
Syst... | constant | 1080_B. Margarite and the best present | CODEFORCES |
import java.util.Scanner;
/**
* Created by carolineshi on 3/30/17.
*/
public class Subtractions {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int t = scan.nextInt();
while(t != 0) {
int f = scan.nextInt();
int s = scan.nextInt()... | constant | 267_A. Subtractions | CODEFORCES |
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
public class A {
final int MOD = (int)1e9 + 7;
final double eps = 1e-12;
final int INF = (int)1e9;
public A () {
int N = sc.nextInt();
int K = sc.nextInt();
Long [] A = sc.nextLongs();
sort(A);
Tre... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
public class AAA {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] array = new int[n];
in... | nlogn | 160_A. Twins | 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.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class CodeforcesRound159 {
/**
* @param args
*/
public static void main(String[] args)
{
Scanner kde = new Scanner(System.in);
int n =kde.nextInt(); //���������� ������� ��������
int m =kde.nextInt()... | nlogn | 257_A. Sockets | CODEFORCES |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.ObjectInputStream.GetField;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.ut... | cubic | 1517_D. Explorer Space | CODEFORCES |
/*
* Created on 17.05.2019
*/
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* @author Wolfgang Weck
*/
public class C01Easy {
public static void main(String[] args) {
try (BufferedReader r = new BufferedReader(new InputStreamReader(System.in))) {
final Strin... | linear | 958_C1. Encryption (easy) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Ok_Simple {
static BufferedReader reader;
static StringTokenizer tokenizer;
static boolean am[][];
static long dp[][];
static int n;
public static ... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
public class PaintNumbers {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = in.nextInt();
}
boolean[] visited = new b... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.BigInteger;
import java.util.Map.Entry;
import static java.lang.Math.*;
public class C extends PrintWriter {
void run() {
int n = nextInt();
int r = nextInt();
int[] x = nextArray(n);
double[] y = new double[n];
Arra... | quadratic | 908_C. New Year and Curling | 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 t=in.nextInt();
for(int i=0;i<t;i++) {
out.println(work());
}
out.flush();
}
long mod=1... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner (System.in);
public static void main(String[] args) {
int n = sc.nextInt();
int k = sc.nextInt();
char str[][] = new char[5][n];
for(int i = 0;i < 4;i ++){
for(int j = 0;j <... | linear | 980_B. Marlin | CODEFORCES |
import java.util.Arrays;
import java.util.Date;
import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int[] a = new int[n];
for(int i=0;i<n;i++)
a[i] = s.nextInt();
A... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.geom.*;
import java.util.regex.*;
public class Main implements Runnable {
StreamTokenizer ST;
PrintWriter out;
BufferedReader br;
int inf = 1000000000;
int nextInt() throws IOException{
... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
void solve() throws IOException {
int n=ni();
int k=ni();
boolean[] t = new boolean[n+1];
for(int i=2;i<=n;i++){
t[i]=false;
}
int p=2;
while(tr... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
public class Main {
static PrintWriter out;
static Reader in;
public static void main(String[] args) throws IOException {
input_output();
Main solver = new Main();
solver.solve();
out.close();
out.flush();
}
static int INF = ... | cubic | 1517_D. Explorer Space | CODEFORCES |
/*
*
* @Author Ajudiya_13(Bhargav Girdharbhai Ajudiya)
* Dhirubhai Ambani Institute of Information And Communication Technology
*
*/
import java.util.*;
import java.io.*;
import java.lang.*;
public class Code1
{
public static void main(String[] args)
{
InputReader in = new InputReader(System.in);
Pr... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.*;
public class C {
public static void main(String[] args) {
FastScanner in = new FastScanner();
int n =... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class c {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int num = in.nextInt();
int rad = in.nextInt();
int[] start = new int[num];
for(int i=0; i<num; i++)
start[i] = in.nextInt();
// If you can hac... | quadratic | 908_C. New Year and Curling | CODEFORCES |
//package learning;
import java.util.*;
import java.io.*;
import java.lang.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class NitsLocal {
static ArrayList<String> s1;
static boolean[] prime;
static int n = (int)1e7;
static void sieve() {
Arrays.fill(prime , true);
prime[... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main{
public static boolean isPrime(long num){
int divisor = 2;
boolean bandera = true;
while(bandera && divisor<num) //ponemos el while con su condicion en este caso si bandera
... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStrea... | np | 1102_F. Elongated Matrix | 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.Scanner;
/**
* @author Son-Huy TRAN
*
*/
public class P15A_CottageVillage {
/**
* @param args
*/
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int t = scanner.nextInt();
scanner.nextLine();
int[] x = new int[n];
i... | nlogn | 15_A. Cottage Village | CODEFORCES |
//package round227;
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 D {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni(), m = n... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.util.*;
public class A
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
if(n % 2 == 1)
{
System.out.println(9 + " " + (n - 9));
}
else
{
System.out.println(4 + " " + (n - 4));
}
}
}
| constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.*;
public class A23 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String s = br.readLine();
for(int length = s.length(); length > 0; length--) {
for(int start = 0; star... | cubic | 23_A. You're Given a String... | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.