src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class a1 {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int a[] = new int[n];
HashMap<Integer,ArrayList<Integer>> h = new HashMap<>();
boolean... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.LinkedList;
import java.util.Locale;
import java.util.Scanner;
public class A{
void exe(){
LinkedList<Integer> list=new LinkedList<Integer>();
for(int i=2;i<=1000;i++)
if(isPrime(i))
list.add(i);
Object[] primes=list.toArray();
... | linear | 17_A. Noldbach problem | CODEFORCES |
/**
* @author derrick20
*/
import java.io.*;
import java.util.*;
public class SameSumBlocks {
public static void main(String[] args) throws Exception {
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int N = sc.nextInt();
int[] pre = new int[N +... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.*;
public class cf {
static class FastScanner {
BufferedReader br;
StringTokenizer st;
public FastScanner() {
try {
br = new BufferedReader(new InputStreamReader(System.in));
st = new StringTokenizer(br.readLine()... | constant | 964_A. Splits | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
public static void main(String ar[]) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String s1[]=br.readLine().split(" ");
int n=Integer.parseInt(s1[0]);
int S=In... | constant | 1061_A. Coins | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.function.Consumer;
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 {
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import static java.util.Arrays.*;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import java.util.*;
import java.math.*;
import java.io.*;
public class A implements Runnable
{
String file = "input";
boolean TEST = System.getProperty("ONLINE_JUDGE") == null;
void solve() thr... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
public cla... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws IOException {
PrintWriter out = new PrintWriter(System.out);
//Scanner sc = new Scanner();
Reader in = new Reader();
Main solver = new Main();
solver.... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
public class A {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
String s = sc.next();
for (int l = s.length(); l > 0; --l) {
HashSet<String> set = new HashSet<String>();
for (int i = 0; i < s.length() - l + 1; +... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
import java.util.regex.*;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
Pattern rc_style = Pattern.compile("R[0-9]+C[0-9]+");
int n = input.nextInt();
while(n-- > 0) {
String str = input.next();
Matcher m = rc_style.matcher(... | linear | 1_B. Spreadsheets | CODEFORCES |
/**
* Problem:
* Source:
* Link:
*
* @author Alexei Ostrovski
*/
import java.io.*;
import java.util.*;
public class SpidersSolver {
public static final boolean DEBUG = false;
public static void main(String[] args) {
//redirect input and output
if (DEBUG)
{
try {
System.setIn(new FileInput... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
private BufferedReader in;
private PrintWriter out;
private StringTokenizer st;
void solve() throws IOException {
String s = next();
int u = s.indexOf('R');
int v = s.indexOf('C');
if (u == 0 && v != -1 && u < v) {
String a = s.substring(u... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Govnokod {
public static void main(String args[]) {
try {
InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
while (true) {
String str = br.readLine();
int i = Integer... | constant | 84_A. Toy Army | CODEFORCES |
import java.io.BufferedReader;
// import java.io.FileInputStream;
// import java.io.FileOutputStream;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
import static java.lang.Math.abs;
import static java.lang.Math.max;
import stat... | linear | 1000_A. Codehorses T-shirts | 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 | 235_A. LCM Challenge | 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.StringTokenizer;
public class CF {
public static void main(String[] args) throws IOException {
InputStream inpu... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.util.Random;
import java.util.Comparator;
import java.io.InputStream;
/**
* @author khokharnikunj8... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
import java.util.Map.*;
public class codeforces {
static int count =0;
static boolean f=false;
static int [] arr;
static PrintWriter pw=new PrintWriter(System.out);
static void solve(int index , int mask) {
if(index==arr.l... | nlogn | 994_B. Knights of a Polygonal Table | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class cf1209e1_2 {
public static void main(String[] args) throws IOException {
int t = ri();
while (t --> 0) {
int n = rni(), m = ni(), a[][] = new int[m][n], dp[] = new int[... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;
public class Main {
static PrintWriter pw;
static _Scanner sc;
public static void main(String[] args) throws Exception {
sc = new _Scanner(System.in);
pw = new PrintWriter(System.out);
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
// VK Cup 2012 Round2 Unofficial Div2 Edition
public class Main {
void A(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int[] h = new int[n];
for(int i=0; i<n; i++){
h[i] = sc.nextInt();
}
Arrays.sort(h);
System.out.... | nlogn | 169_A. Chores | CODEFORCES |
import java.util.*;
public class Subtractions {
public static void main(String[] args) {
Scanner kb = new Scanner(System.in);
int count = kb.nextInt();
while(count > 0) {
int smaller = kb.nextInt();
int larger = kb.nextInt();
int ops = 0;
while(smaller > 0 && larger > 0) {
if(smaller > larg... | constant | 267_A. Subtractions | CODEFORCES |
//package;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.Collections;
import java.util.Comparator;
import java.util.Vector;
import java.lang.*;
import java.io.*;
import java.awt.Point;
public class evenness {
public static void main(String[] args){
try{
... | linear | 25_A. IQ test | CODEFORCES |
import javax.print.attribute.standard.RequestingUserName;
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException
{
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReade... | quadratic | 1086_C. Vasya and Templates | CODEFORCES |
/*
bts songs to dance to:
I need U
Run
ON
Filter
I'm fine
*/
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.Math.abs;
import java.util.*;
import java.io.*;
public class x1517D2
{
static final int INF = Integer.MAX_VALUE/3;
public static void main(String hi[]) thro... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
public class D {
int N,M;
int[] a,l,r;
private void solve() {
N = nextInt();
a = new int[N];
for(int i = 0;i < N;i++) {
a[i] = nextInt();
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.DataInputStream;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Collections;
public class div168C {
public static void main(String[] args) throws Exception{
div168C a=new div168C();
Parserdoubt pd=a.new Parserdoubt(System.in);
StringBuffer sb =... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Iterator;
import java.util.ListIterator;
import java.util.Collection;
import java.util.AbstractList;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Deq... | nlogn | 961_D. Pair Of Lines | CODEFORCES |
import java.util.*;
public class vas2 {
public static void main( String[] args ) {
Scanner in = new Scanner( System.in );
int n = in.nextInt();
String st = in.next();
int[] a = new int[n];
for ( int i = 0; i < n; i++ )
a[i] = st.charAt( i ) - 48;
boolean c = false;
for ( int i = 1; !c && i < n; i++ ) {... | quadratic | 1030_C. Vasya and Golden Ticket | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class P111C{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int h, w;
void run(){
h=sc.nextInt();
... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.text.*;
import java.util.*;
public class CottageVillage {
static BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer st;
static String LINE() throws Exception { return stdin.readLine(); }
static String TOKEN() throws Exception {
whil... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.*;
import java.math.*;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import static java.lang.Character.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class B {
static final int[] num = new int[7];
static {
for(int i = 1, c = 1; i <= 6; ... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.*;
public class D
{
public static void main(String args[])
{
int n;
Scanner in = new Scanner (System.in);
n= in.nextInt();
if (n%4==0 || n%7==0 || n%44==0 || n%47==0 || n%444==0 || n%447==0 ||
n%474==0 || n%477==0 || n%744==0 || n%747==0 || n%774==0 || n%777==0)
System.out.... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.*;
import java.util.*;
public class p7{
static class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
... | nlogn | 1054_D. Changing Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author Anirudh Rayabharam (anirudhrb@yandex.com)
*/
public class Mai... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.util.*;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
List<Long> fi = new ArrayList<Long>();
fi.add((long) 0);
fi.add((long) 1);
while (fi.get(fi.size()... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.OutputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.FileInputStream;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.File;
import java.io.FileNotFoundExc... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;
public class A {
public static void main(String[] args) throws IOException {
new A().run();
}
B... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author bdepwgjqet
*/
public class ... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.*;
import static java.lang.Math.*;
public class Main {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
Pr... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
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.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
class Segment {
int l, r;
Segment(int l, int r) {
this.l = l;
this.r = r;
}
@Override
public boolean equals(Object obj) {
Segment o = (Segment)obj;
return l == o.l && r == o.r;
}
@Override
public int hashCode()... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Locale;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStream inputSt... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public static void main(String args[]) {
FastScanner scn = new FastScanner();
int n = scn.nextInt();
int s = scn.nextInt();
if (s <= n) {
System.out.println(1);
} else if (s > n) {
if(s%n == 0){
... | constant | 1061_A. Coins | CODEFORCES |
//package educational.round67;
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 G {
InputStream is;
PrintWriter out... | cubic | 1187_G. Gang Up | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Queue;
import java.util.concurrent.ArrayBlockingQueue;
public class ProblemC {
static int[] dx = {1... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author codeKNIGHT
*/
public class Main {
public static void main(String[] args) {... | nlogn | 169_A. Chores | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
PrintWriter out = new PrintWriter(System.out);
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tok = new StringTokenizer("");
String next() throws IOException {
if (!tok.hasMoreToke... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class LookingForOrder {
static int[][] pos;
static int[] dp;
static int[] nextstate;
static int[][] dist;
static int r;
static int v;
static void pri... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
import java.io.*;
public class C994{
static double area(double x1,double y1,double x2,double y2,double x3,double y3){
return Math.abs((x1 * (y2 - y3) +
x2 * (y3 - y1) + x3 * (y1 - y2)) / 2.0);
}
public static void main(String args[])throws IOException{
Scanner sc=new Scanner(new ... | constant | 994_C. Two Squares | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
public class Cycles
{
public static FastInputStream fis;
public static void main(String[] args) throws IOException
{
fis = new FastInputStream(System.in);
System.out.println(solve(fis.nextInt(), fis.nextInt()));
fis.close();
}
public static l... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
public class A_Toy_Army {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner entrada = new Scanner(System.in);
while(entrada.hasNextInt())
{
int n = entrada.nextInt();
System.out.println(n+(n/2));
}
}
}
| constant | 84_A. Toy Army | CODEFORCES |
import java.io.*;
import java.util.Scanner;
import java.lang.String;
public class A23 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.nextLine();
int i=0,j=0,n=0,t=0,count=0;
n=s.length();
String s1="y",s2="yu6j";
for(t=1;t<n;t++)
{
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
import java.io.*;
public class C{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
int n=in.nextInt(),key=in.nextInt(),ans=0;
int[] a = new int[101], b = new int[101];
for (int i=1;i<=n;i++) {a[i]=in.nextInt();b[i]=in.nextInt();}
for (int i=1;i<n;i++)
for... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Scanner;
public class B1177 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long N = in.nextLong();
long answer = solve(N, 0, 1, 1);
System.out.println(answer);
}
static long solve(long N, long offset, long start, int digits... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class A {
static Scanner scanner = new Scanner(System.in);
static int s;
public static void main(String[] args) {
s = scanner.nextInt();
if (s >= 0) {
System.out.println(s);
}
else {
if (s >= -10) {
System.out.println(0);
}
else {
int ss = -s;
int ... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
// upsolve with rainboy
import java.io.*;
import java.util.*;
public class CF1187G extends PrintWriter {
CF1187G() { super(System.out, true); }
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;
... | cubic | 1187_G. Gang Up | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class problemA {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] numbs = new int[n];
int[] smallest_color = 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 A {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
long f(int x, int y) {
if (x == 0 || y == 0)
return 0;
if (x >= y) {
return x / y + f(y, x % y);
} else {
return y / x + f(x, y % x);
}
}
A() throws IOException {
br ... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String [] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int numbers[] = new int[n];
for (int i = 0; i < n; i++) {
numbers[i] = scanner.nextInt(... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class round111A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int [] coins = new int [n];
for(int i = 0 ; i < n ; ++i)
coins[i] = sc.nextInt();
Arr... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.stream.IntStream;
public class Test {
static PrintWriter writer =
new PrintWriter(new BufferedWrite... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.Locale;
import java.util.Scanner;
public class E {
public static void main(String[] args) {
new E().run();
}
private void run() {
Locale.setDefault(Locale.US);
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
double[][] p = new double[n][n];
for (int i = 0; i < n; i++) {
f... | np | 16_E. Fish | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
Ou... | quadratic | 908_C. New Year and Curling | 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 SimpleTask {
public static void main(String[] args) throws Exception {
InputReader in = new InputReader(System.in... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main {
static int n;
static long TotalTime;
static Problem[] problems;
static StringBuilder sb;
public static void main(String[] args) {
FastScanner sc = new FastScanner();
sb = new StringBuilder();... | nlogn | 913_D. Too Easy Problems | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;
public class Main {
static BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
st... | nlogn | 1005_E1. Median on Segments (Permutations Edition) | 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.util.Arr... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
private void solve() throws IOException {
out.println(solve(nl()));
out.close();
}
private long solve(long n) throws IOException {
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Cf1017A {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer... | linear | 1017_A. The Rank | CODEFORCES |
import java.util.Scanner;
public class Main
{
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
long n=sc.nextLong();
long x=1;
long ar=0;
tag:for(long i=1;;i++)
{
ar+=9*i*x;
if(ar>=n)
{
long d = n - (ar-9*i*x);
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
int N = r.nextInt();
int K = r.nextInt() - 1;
T[] a = new T[N];
for(int i = 0; i < N; i+... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
BigInteger l = sc.nextBigInteger();
BigInteger r = sc.nextBigInteger();
BigInteger a = l.add(BigInteger.ZERO);
while (a.compareTo(r) < 0) {
BigInteger b... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Codeforces
{
public StreamTokenizer st;
public PrintWriter pw;
public static final int modulo = 1000000009;
static class Point
{
public int x, y;
Point(int _x, int _y)
{
x = _x;
y = _y;
}
}
void init... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.*;
import java.util.*;
public class z3 {
public static boolean divch(int i,int a)
{ if (a>1000) return false; if ((a>0)&&(i%a==0)) return true; return (divch(i,a*10+4)||divch(i,a*10+7)); }
public static void main(String[] args) throws IOException {
Scanner in = new Scanner(System.in);
System.out.p... | constant | 122_A. Lucky Division | CODEFORCES |
import java.util.Scanner;
public class Round8_C {
/**
* @param args
*/
int n ;
int[] X, Y ;
public Round8_C() {
info_in() ;
process() ;
}
void info_in()
{
Scanner input = new Scanner(System.in) ;
int dx = input.nextInt() ;
int dy = input.nextInt() ;
n = input.nextInt() ;
X = new int... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.util.*;
public class zz{
static int mod=(int)1e9+7;
public static void main(String[] args) throws Exception{
//MScanner sc = new MScanner("chess.in");
MScanner sc = new MScanner(System.in);
PrintWriter pw=new PrintWriter(System.out);
int n=sc.nextInt(... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.ArrayList;
import java.util.List;
import java.util.Locale;
import java.util.Scanner;
public class Main implements Runnable {
/**
* @param args
*/
public static void main(String[] args) {
new Thread(n... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
import java.io.*;
public class _1036_B_DiagonalWalkingV2 {
public static void main(String[] args) throws IOException {
int Q = readInt();
while(Q-- > 0) {
long n = readLong(), m = readLong(), k = readLong();
if(Math.max(n, m) > k) println(-1);
else {
long ans = k;
if(n%2 != k... | linear | 1036_B. Diagonal Walking v.2 | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class pr1073B {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.... | linear | 1073_B. Vasya and Books | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Codeforce {
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();
}
int color = 0;
Arrays.sort(arr);
for(int i=0; i<... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class A {
static MyScanner sc;
static PrintWriter pw;
public static void main(String[] args) throws Throwable {
sc = new MyScanner();
pw = new PrintWriter(System.out);
n = sc.nextInt();
int m = sc.ne... | np | 1102_F. Elongated Matrix | CODEFORCES |
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 ce = 0;
int co = 0;
int le = 0;
int lo = 0;
for (int i = 0; i < n; i++) {
int x = sc.nextInt();
if (x % 2... | linear | 25_A. IQ test | CODEFORCES |
import java.util.Scanner;
public class b817 {
public static Scanner scn = new Scanner(System.in);
public static void main(String[] args) {
// TODO Auto-generated method stub
long n = scn.nextLong();
long s = scn.nextLong();
long lo = 0;
long hi = n ;
while(lo<=hi)
{
long mid=(lo+hi)/2;
if(c... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class G {
static final int P = 1_000_000_007;
int[][] ways;
int[][] pow;
void preCalc(int sz) {
ways = new int[sz][];
for (int i = 0; i < ways.length; i++) {
ways[i] = new int[i + 1];
ways[i][0] = ways[i][i] = 1;
for (int j = 1; j < i; j++) {
ways[i]... | quadratic | 908_G. New Year and Original Order | CODEFORCES |
/*Author: Satyajeet Singh, Delhi Technological University*/
import java.io.*;
import java.util.*;
import java.text.*;
import java.lang.*;
public class Main {
/*********************************************Constants******************************************/
static PrintWriter out=new PrintWriter(new OutputStreamWr... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Solution{
public static void main(String[] args)throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokeniz... | linear | 1197_B. Pillars | CODEFORCES |
import java.util.*;
import java.io.*;
public class Cf270a {
public static void main(String[] args) throws IOException {
InputStreamReader fin = new InputStreamReader(System.in);
Scanner scr = new Scanner(fin);
int n = scr.nextInt();
int x = 0;
int y = 0;
if (n%2 == 0)... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
/**
* Created by hama_du on 2014/09/21.
*/
public class ProblemB {
public static void main(String[] args) {
... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.Paths... | 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.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
public class A {
BufferedReader in;
StringTokenizer st;
PrintWriter out;
void solve() throws IOE... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.HashSet;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author Lo... | linear | 224_B. Array | CODEFORCES |
//package codeforces.br17;
import java.io.*;
import java.text.DecimalFormat;
public class ProblemA {
public void solve() {
boolean oj = true;
try {
Reader reader = oj ? new InputStreamReader(System.in) : new FileReader("A.in");
Writer writer = oj ? new OutputStreamWriter(S... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
public class Quiz{
static int MOD = (int)1e9 + 9;
public static void main(String[] args){
Scanner reader = new Scanner(System.in);
long n = reader.nextInt();
long m = reader.nextInt();
long k = reader.nextInt();
long r = (n + k - 1)/k;
long longDrops = n%k;
if(longDrops == ... | logn | 338_A. Quiz | CODEFORCES |
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.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map.Entry;
import java.util.Random;
import j... | np | 1242_C. Sum Balance | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
static FastScanner sc = new FastScanner(System.in);
static PrintWriter pw = new PrintWriter(System.out);
static StringBuilder sb = new StringBuilder();
static long mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template ... | linear | 1191_D. Tokitsukaze, CSL and Stone Game | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import java.util.concurrent.atomic.AtomicIntegerArray;
public class Solution {
public static void main(String[] args) throws Exception {
MyReader reader = new MyReader(System.in);
// MyReader reader =... | quadratic | 908_G. New Year and Original Order | CODEFORCES |
import java.util.*;
import java.lang.*;
public class Main{
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
String str=sc.next();
sc.close();
int maxm=0;
int ind1,ind2;
for(int i=0;i<str.length();i++){
for(int j... | 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.