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 A {
FastScanner in;
PrintWriter out;
void solve() {
long a = in.nextLong(), b = in.nextLong();
long ans = 0;
while (true) {
long div = a / b;
ans += div;
a -= div * b;
if (a == 0) {
break;
}
long tmp = a;
a = b;
b = ... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;
public class Main {
//static final long MOD = 1000000007L;
//static final long MOD2 = 1000000009L;
static final long MOD = 998244353L;
//static final long INF = 500000000000L;
static final int INF = 1000000005;
... | 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.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class Houses implements Runnable {
private void solve() throws IOException {
int n = nextInt();
... | nlogn | 15_A. Cottage Village | 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;
import java.util.HashSet;
public class E17 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.System.out;
public class Main {
private FastScanner scanner = new FastScanner();
public static void main(String[] args) {
new Main().solve();
}
private List<Integer>[] gr = new ArrayList[1000_000+5];
private int dp[][] = new ... | nlogn | 980_E. The Number Games | CODEFORCES |
import java.awt.Point;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
/**
*
* @author epiZend
*/
public class Cottage {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
in... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Test {
public static void main(String[] args) throws IOException{
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
//StringTokenizer st=new StringToken... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class D5 implements Runnable {
final double eps = 1e-9;
private void Solution() throws IOException {
double a = nextDouble(), v = nextDouble();
doubl... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author Trung Pham
*/
public class E {
public stat... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static final int primeCount = 452;
static final int[] prime = new int[primeCount];
static void build_prime() {
boolean[] notPrime = new boolean[3200];
for (int i = 2; i < 3200; i++) {
if (notPrime[i]) continue;
... | cubic | 1497E2 | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;import java.util.*;
import java.math.*;
public class Main{
static int max=Integer.MAX_VALUE,min=Integer.MIN_VALUE;
static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer st;
static int max(int a,int b)
{
return Math.max(a, b);
}
st... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.awt.Point;
import java.util.Arrays;
import java.util.Scanner;
public class p15a {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int t = in.nextInt();
if(n == 1) {
System.out.println(2);
return... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1515E{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int md = sc.nextInt();
int k = (n + 1) / 2;
int[][] dp = new int[k + 1][n + 1]; dp[0][0] = 1;
for (int h = 1; h <= k; h++)
for (int l = h; l <... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.util.Scanner;
/**
* Created by misanand on 9/20/14.
*/
public class Recovery {
public static void main(String [] args) {
Scanner scan = new Scanner(System.in);
int N = scan.nextInt();
if( N%2 == 0) {
System.out.println( (4)+" "+(N-4));
}
else System... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class nA {
Scanner in;
PrintWriter out;
void solve() {
int n = in.nextInt();
int a[] = new int[n];
int sum = 0;
for (int i = 0; i < n; i++) {
a[i] = in.nextInt();
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedWriter;
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.util.Arrays;
import java.util.InputMismatchException;
import java.util.*;
import java.io.*;
imp... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main
{
static HashMap<Integer,Integer> hm;
static int[] array;
static boolean marked[];
static int a , b ;
static int[] ans ;
public static void main( String args[])
{
Scanner sc = new Scanner(System.in);
int n ;
n = sc.nextInt();
a = sc.nextInt... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class CFB {
static int n;
static FastScanner in;
public static void main(String[] args) throws Exception {
in = new FastScanner(System.in);
n = in.nextInt();
int a = query(1);
if(((a % 2)+2) % 2== 1){
System.out.printl... | logn | 1019_B. The hat | CODEFORCES |
import java.security.KeyException;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeMap;
public class P15A
{
public static void main (String [] args)
{
Scanner scan = new Scanner(System.in);
int n = scan.nextInt(), t = scan.nextInt();
TreeMap<Integer,Integer> ... | nlogn | 15_A. Cottage Village | CODEFORCES |
//q4
import java.io.*;
import java.util.*;
import java.math.*;
public class q4 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));
int query = in.nextInt();
while (qu... | quadratic | 1196_D2. RGB Substring (hard version) | CODEFORCES |
import java.awt.List;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Random;
import java.ut... | logn | 1080_D. Olya and magical square | CODEFORCES |
import static java.math.BigInteger.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
public class A {
final int MOD = (int)1e9 + 7;
final double eps = 1e-12;
final int INF = (int)1e9;
public A () {
int N = sc.nextInt();
int K = sc.nextInt();
Long [] A ... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
public static void main(String ar[]) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
long k=Long.parseLong(br.readLine());
long l=1,h=1000000000000l;
long p[]=new... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
/*
TASK: CFC
LANG: JAVA
*/
public class CFC {
static int n;
static int[][] dp;
static boolean[] s;
public static void main(String[] args) throws IOException {
FastScanner in = new FastScanner(System.in); //new FileInputStream(new File("CFC.in")));
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class C {
//dp[firstInLoop][index][indentLevel]
private static int[][][] dp;
private static boolean[] wasLoop;
private 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.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Pradyumn
*/
public class M... | logn | 1019_B. The hat | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String args[])
{
FastReader input=new FastReader();
PrintWriter out=new PrintWriter(System.out);
int T=input.nextInt();
while(T-->0)
{
int n=input.nextInt();
int b[]=... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
import java.awt.geom.*;
public class FunctionHeight {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
long n = sc.nl();
long k = sc.nl();
long ans = (n+k-1)/n;
System.out.println(ans);
}
... | constant | 1036_A. Function Height | CODEFORCES |
import java.io.*;
import java.util.*;
public class C35C_BFS_Fire {
public static boolean[][] burning;
public static LinkedList<int[]> LitTrees; //which is best to use
public static int N, M;
public static int[] lastTree;
public static void main(String[] args) throws IOException {
// InputSt... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
static class Reader {
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
public Reader()
{
din = new DataInp... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.*;
public class Main
{
static double arr[][];
public static void main(String[] args)
{
try
{
Parserdoubt pd=new Parserdoubt(System.in);
PrintWriter pw=new PrintWriter(System.out);
int fishes=pd.nextInt();
arr=new double[fishes][f... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
static void solve() throws IOException {
long a = nextLong(), b = nextLong();
long answer = get(a, b);
out.println(answer);
}
private static long get(long p, long q) {
if (p == 0) {
return 0;
}
if (q == 1) {
return p;
}
if (p == 1) {
... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public static void main(String[] args) throws Throwable {
new A().go();
}
void p(String s) {
System.out.println(s);
}
void go() throws Throwable {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String[]... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class BetaRound23_A implements Runnable {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void init() throws IOException {
i... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.io.InputStreamReader;
import java.io.FileNotFoundException;
import java.io.File;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.BufferedReade... | quadratic | 908_C. New Year and Curling | CODEFORCES |
/**
* author: derrick20
* created: 11/11/20 1:03 PM
*/
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class OnTheBench {
public static void main(String[] args) {
setupCombo(301);
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.ou... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.util.Map.Entry;
public class cf2{
static int x0;
static int y0;
static int x1;
static int y1;
static HashMap<Integer,HashSet<Inte... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
public class B14G {
public static void main(String[] args) throws IOException {
init_io();
int t = nint();
while(t-- > 0) {
int N = nint();
if (N % 2 != 0) {
out.println("NO"); continue;
}
N /= 2;
... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.util.Scanner;
public class BB {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
long a=sc.nextLong();
long b=sc.nextLong();
if(b-a>(long)2){
if(a%(long)2==0){
System.out.print(a+" "+(a+1)+" "+(a+2));
return;
}else{
System.out.print(a+1+" "+(a+2)+" "+(a+3));
... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.*;
import java.util.HashMap;
import java.util.Map;
public class Round364_div2_C {
public static void main(String[] args) throws IOException {
FastReader in = new FastReader(System.in);
PrintWriter out = new PrintWriter(System.out);
solve(in, out);
out.flush();
}
... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
/**
* Codeforces 11D - A Simple Task
* Created by Darren on 14-10-21.
* O(2^n * n^2) time and O(2^n * n) space.
*
* Tag: dynamic programming, bitmask, graph
*/
public class D {
Reader in = new Reader(System.in);
PrintWriter out = new PrintWriter(System... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.println("0 0 " + n);
}
} | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.util.List;
import java.util.Map;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.HashMap;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.... | linear | 468_B. Two Sets | CODEFORCES |
// Created by Whiplash99
import java.io.*;
import java.util.*;
public class A
{
public static void main(String[] args) throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
long N,K,tmp,ans=0;
String s[]=br.readLine().trim().split(" ");
N=... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
public class NewEmpty
{
public static void main(String[] args)
{
Scanner blabla=new Scanner(System.in);
long a,b,c=0,d;
a=blabla.nextLong();
b=blabla.nextLong();
while (b!=0){
c+=(a/b);
a=a%b;
d=a;
a=b;
... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.util.Scanner;
public class A470 {
/**
* @param args
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int start=4;
while(true){
if((start%2==0||start%3==0)&&((n-start)%2==0||(n-start)%3==0))
{
System.out.println(start+" "+(... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.util.* ;
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(lst)) ;
}
sta... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
StringTokenize... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String args[])
{
FastReader input=new FastReader();
PrintWriter out=new PrintWriter(System.out);
int T=1;
while(T-->0)
{
long k=input.nextLong();
long v=9;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
public class Kaudo {
static Reader in =new Reader();
static StringBuilder Sd=new StringBuilder();
static long ans,res,lot,max;
static List<Integer>gr[];
static ArrayList<Integer> A=new ArrayList();
static String ch[];
public static void main(String [... | 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.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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import static java.lang.Math.*;
public class Main2 {
private FastScanner scanner = new FastScanner();
public static void main(String[] args) {
new Main2().solve();
}
private void... | nlogn | 976_C. Nested Segments | 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.util.Iterator;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.util.Random;
import java.io.IOException;
i... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.Scanner;
/**
* Feb 18, 2016 | 4:00:49 PM
* <pre>
* <u>Description</u>
*
* </pre>
*
* @author Essiennta Emmanuel (colourfulemmanuel@gmail.com)
*/
public class ProblemA{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
sc.next();
Syst... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class A {
public static void main(String[] args) throws Exception {
new A().doit();
}
private void doit() throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
S... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution1 {
private void solve() throws IOException {
long MOD = 1_000_000_007;
long x = in.nextLong();
long k = in.nextLong();
if (x == 0) {
System.out.println(0);
return;
}
long val = binp... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class f {
static int n;
static double[][] g;
public static void main(String[] args) throws IOException {
input.init(System.in);
PrintWriter out = new PrintWriter(System.out);
n = input.nextInt();
g = new double[n][n];
for(int i = 0; i<n; i++)
for(int j = 0; j<n; j++... | np | 16_E. Fish | CODEFORCES |
/**
* Created by Baelish on 6/18/2018.
*/
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.InputMismatchException;
public class C_3 {
public static void main(String[] args) throws Exception {
FastRe... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long itrIdx = 0;
long itr = 0;
long num = 0;
while(itrIdx < n){
itrIdx += (itr+1)*(Math.pow(10,itr+1) - Math.pow(10,... | 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.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.InputStream;
... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main (String[] args) {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
try {
String parameterStringList[] = reader.readLine(... | constant | 1054_A. Elevator or Stairs? | CODEFORCES |
/**
* Codeforces Beta Round #10
*
* @author ProjectYoung
*/
import java.util.Scanner;
public class CF11D {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
boolean[][] map = new boolean[n][n];
long[][] dp = new long[1 ... | 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.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | quadratic | 1027_E. Inverse Coloring | CODEFORCES |
//Author: Patel Rag
//Java version "1.8.0_211"
import java.util.*;
import java.io.*;
public class Main
{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader(){ br = new BufferedReader(new InputStreamReader(System.in)); }
String next()
{
while (st == null |... | nlogn | 975_C. Valhalla Siege | CODEFORCES |
import java.io.*;
import java.util.*;
public class cf908G {
final static int MOD = 1_000_000_007;
public static void main(String[] argv) {
cf908G pro = new cf908G();
InputStream fin = null;
if (System.getProperty("ONLINE_JUDGE") == null) {
try {
fin = new FileInputStream("input.txt");
} catch (F... | quadratic | 908_G. New Year and Original Order | CODEFORCES |
import java.util.ArrayList;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.Arrays;
import java.util.Random;
import java.io.FileWriter;
import java.io.PrintWriter;
/*
Solution Created: 19:12:30... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
// author @mdazmat9
public class codeforces{
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int test = 1;
for (int ind = 0; i... | constant | 911_C. Three Garlands | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader(String s) {
try {
br = new BufferedReader(new FileReader(s));
} catch (FileNotFoundException e) {
... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.*;
import java.util.*;
public class MainG {
static StdIn in = new StdIn();
static PrintWriter out = new PrintWriter(System.out);
static long M=(long)1e9+7;
public static void main(String[] args) {
char[] cs = in.next().toCharArray();
int n=cs.length;
int[] x = new int[n];
for(int i=0; i<n;... | quadratic | 908_G. New Year and Original Order | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.function.BiConsumer;
import java.util.function.Consumer;
import java.util.function.Function;
import java.util.function.Supplier;
import java.util.stream.Stream;
public class C_455
{
public static final long[] POWER2 = generatePOWER2()... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class PrB {
public static long time;
public static void main(String[] args) throws Exception {
time = System.currentTimeMillis();
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
... | linear | 224_B. Array | CODEFORCES |
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class A {
public static void main(String[] args) throws Exception{
String str = new Scanner(System.in).next();
Set<String> set = new HashSet<String>();
String max = "";
for(int l = 1; l < str.length(); ++l){
for(int i = 0; i <... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
public class B {
static int[] loyality;
static int[] level;
static int mid;
static int a, n;
static double sol;
public static void getMax(int idx, int rem) {
if (idx == loyality.length) {
double pos = 0;
for (int i = 0; i < (1 << n); i++)
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
static int[][]memo;
static int n,m,in[][];
static int dp(int col,int maxRowMask) {
if(col>=m)return 0;
if(memo[col][maxRowMask]!=-1)return memo[col][maxRowMask];
int ans=0;
for(int colMask=0;colMask<(1<<n);colMask++) {
int sum=0;
for(... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;
public class C implements Runnable {
private static final boolean USE_FILE_IO = false;
private static final String FILE_IN = "c.in";
private static final String FILE_OUT = "c.out";
BufferedReader in;
PrintWriter out;... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class CodeF
{
static class Scanner
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
public String next... | cubic | 23_A. You're Given a String... | CODEFORCES |
/**
* @author Finn Lidbetter
*/
import java.util.*;
import java.io.*;
import java.awt.geom.*;
public class TaskA {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
int n = Integ... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
static Map<BigInteger, BigInteger> mp = new HashMap<BigInteger, BigInteger>();
public static void main(String[] args) {
mp.clear();
Scanner cin = new Scanner(new BufferedInputStream(System.in));
BigInteger n... | nlogn | 903_D. Almost Difference | CODEFORCES |
import java.io.*;
import java.util.*;
public class Soln {
public static int[] io(int n) {
int[] d = new int[n];
for (int i=0;i<n;i++) d[i] = f.nextInt();
return d;
}
public static int binlog( int bits ){
int log = 0;
if( ( bits & 0xffff0000 ) != 0 ) { bits >>>= 16; log = 16; }
... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.TreeSet;
public class A {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void solve() throws I... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class OlyaAndMagicalSquare {
public static void solveCase(FastIO io) {
int N = io.nextInt();
long K = io.nextLong();
CountMap cm = new CountMap();
cm.increment(N, BigInteger.ONE);
long rem = K;
int moves = 1;
int sqSize = N;
while (sqSi... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
Scanner in;
PrintWriter out;
static class House implements Comparable <House>{
int len;
int pos;
House(Scanner in){
pos = in.nextInt() * 2;
len = in.nextInt() * ... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
public class CodeForces
{
public static void main(String[] args)
{
Scanner input = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
System.out.println(input.nextInt() / 2 + 1);
}
} | constant | 964_A. Splits | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.util.Set;
import java.util.Map.Entry;
import java.util.HashMap;
import java.util.Iterator;
public class test {
public static void main(String[] args) {
Scanner input = new Scanner(System.in... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
public class Main {
public static void main(St... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt(), k = in.nextInt();
int x[] = new int[n];
for (int i = 0; i < n; i++) {
int p = in.nextInt(), t ... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class CF267A {
public static void main(String[] args) {
int n=0, a, b;
BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
try {
n = Integer.parseInt(stdin.readLine());
} catch (IO... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class A23 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException {
in.nextToken();
return (int)in.nval;
}
s... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.Scanner;
public class GenerateLogin {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String a = scan.next();
String b = scan.next();
char last = b.charAt(0);
String ans = ""+a.charAt(0);
for(int i = 1;i<a.length();i++){
if(a.charAt(i)>=last)break;
a... | linear | 909_A. Generate Login | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
public class Problem implements Runnable {
private static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
private BufferedReader in;
private PrintWriter out;
private StringTokenizer tok = new StringTokenize... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class D implements Runnable {
public static void main(String[] args) {
new Thread(new D()).start();
}
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
String nextToken() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new Str... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
import static java.lang.Integer.*;
public class BDiv1 {
static int n;
static int a;
static int b;
static HashMap<... | linear | 468_B. Two Sets | 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... | linear | 701_C. They Are Everywhere | CODEFORCES |
/**
* Codeforces Beta Round 16
*
* @author ProjectYoung
*/
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class CF16E {
private void solve(InputReader in, PrintWriter o... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static int m;
static long pow(long b, int p) {
long ret = 1;
while (p > 0) {
if ((p&1) == 1) ret = b*ret%m;
b = b*b%m;
p >>= 1;
}
return ret;
}
public static void main(String[] args) throws IOException {
int n = readInt(); m = readInt();
... | cubic | 1515_E. Phoenix and Computers | 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 | 980_C. Posterized | CODEFORCES |
import java.io.*;
import java.util.*;
public class CC {
public static void main(String[] args)throws Throwable {
MyScanner sc=new MyScanner();
PrintWriter pw=new PrintWriter(System.out);
n=sc.nextInt();
s=new char [n];
for(int i=0;i<n;i++)
s[i]=sc.next().charAt(0);
mem=new int [2*n+1][n+1];
for(int... | quadratic | 909_C. Python Indentation | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.