src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.PrintWriter;
import java.util.Locale;
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
new Main().run();
}
void run(){
Locale.setDefault(Locale.US);
try(Scanner in=new Scanner(System.in);
PrintWriter out=new PrintWriter(System.out)){
solve(in, ou... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Test {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String s = in.readLine();
int ans = 0;
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class D {
private void solve() {
br = new BufferedReader(new InputStreamReader(System.in));
out = new PrintWriter(System.out);
int n = nextInt(), m = nextI... | quadratic | 1179_B. Tolik and His Uncle | CODEFORCES |
import java.util.Arrays;
/**
* Created by IntelliJ IDEA.
* User: piyushd
* Date: 12/31/10
* Time: 1:30 PM
* To change this template use File | Settings | File Templates.
*/
public class SimpleCycle {
int first(int x){
return x - (x & (x - 1));
}
void run(){
int N = nextInt(), M = nextInt();
int[] g... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* Author -
* User: kansal
* Date: 9/3/11
* Time: 5:28 PM
*/
public class CF85E {
public static void main(String[] args) {
reader = new BufferedRea... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.util.*;
import java.io.*;
public class code{
public static void main(String[] args) throws IOException{
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int ok,ok2;
int va,vb;
va = 0;
vb = 0;
out.println("? "+va+"... | logn | 1088_D. Ehab and another another xor 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.io.InputStream;
import java.math.BigInteger;
import java.util.Arrays;
/**
* Built using CHelper plug-in
* Actual solution ... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class D909 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
char[] line = br.readLin... | linear | 909_D. Colorful Points | CODEFORCES |
import java.io.*;
import java.util.*;
public class D {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
String toStr(long a) {
String s = Long.toBinaryString(a);
while (s.length() < 64)
s = "0" + s;
return s;
}
void solve() throws IOException {
long a = nextLong();
long b = ... | logn | 276_D. Little Girl and Maximum XOR | 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.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution ... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;
public class CFTemplate {
static final long MOD = 1000000007L;
//static final long MOD2 = 1000000009L;
//static final long MOD = 998244353L;
//static final long INF = 500000000000L;
static final int INF = 1100000000... | cubic | 1497E2 | CODEFORCES |
import java.util.*;
import java.lang.Math.*;
public class Main {
static Scanner in = new Scanner(System.in);
static Coor[] p;
static Coor ori;
static int n;
static int dp[];
static Coor pre[];
public static void main(String[] args) {
ori = new Coor(in.nextInt(),in.nextInt());
n = in.nextInt();
p = new Co... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1515E extends PrintWriter {
CF1515E() { super(System.out, true); }
Scanner sc = new Scanner(System.in);
public static void main(String[] $) {
CF1515E o = new CF1515E(); o.main(); o.flush();
}
int[] ff, gg; int md;
long ch(int n, int k) {
return (long) ff[... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String [] args){
Scanner in= new Scanner(System.in);
int n=in.nextInt();
int a=in.nextInt();
int b=in.nextInt();
int []deals=new int[n];
for(int i=0; i<n; i++){
... | nlogn | 169_A. Chores | CODEFORCES |
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Math.min;
import static java.lang.System.exit;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public cla... | linear | 1091_F. New Year and the Mallard Expedition | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.lang.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.regex.*;
import java.util.stream.LongStream;
public class Main{
static ArrayList a[]=new ArrayList[5000001];
static Vector<pair>schedule_it(ArrayList<pair> v) {... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author walker
*/
public class Main {
public static void main(S... | constant | 235_A. LCM Challenge | CODEFORCES |
// upsolve with rainboy
import java.io.*;
import java.util.*;
public class CF1187G extends PrintWriter {
CF1187G() { super(System.out); }
static class Scanner {
Scanner(InputStream in) { this.in = in; } InputStream in;
int k, l; byte[] bb = new byte[1 << 15];
byte getc() {
if (k >= l) {
k = 0;
try {... | cubic | 1187_G. Gang Up | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
public class A {
public ... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
/*
Keep solving problems.
*/
import java.util.*;
import java.io.*;
public class CFA {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
private static final long MOD = 1000L * 1000L * 1000L + 7;
private static final int[] dx = {0, -1, 0, 1};
private static final int[] dy... | linear | 1004_A. Sonya and Hotels | 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;
public class D11 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException {
in.nextToken();
ret... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Bag implements Runnable {
private void solve() throws IOException {
int xs = nextInt();
int ys = nextInt();
int n = nextInt... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class CF_111_A {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int n = in.nextInt(), sum = 0, sum2 = 0;
int[] a = new int[n];
for (int i = 0; i < n; i++){
a[i] = in.nextInt();
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
public class Answer17A{
public static void main(String[] args){
try{
BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
String[] tmp=reader.readLine().split(" ");
int n=Integer.parseInt(tmp[0]);
int k=Integer.parseInt(tmp[1]);
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class CF1197B {
public static void main(String[] args) {
FastReader input = new FastReader();
int n = input.nextInt();
int[] arr = new int[n];
int ma... | linear | 1197_B. Pillars | CODEFORCES |
import java.io.*;
import java.text.*;
import java.math.*;
import java.util.*;
public class Hexadec implements Runnable {
final static String taskname = "filename";
public void solve() throws Exception {
// int n = iread();
int n = Integer.parseInt(in.readLine());
out.write(n ... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.util.*;
public class c {
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
long a = input.nextLong(), b = input.nextLong();
System.out.println(gcd(a, b));
}
static long gcd(long a, long b)
{
if(b==1) return a;
if(a==1) return b;
if(a>b) return a/b + gcd... | constant | 343_A. Rational Resistance | CODEFORCES |
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
What do you think? What do you think?
1st on Billboard, what do you think of it
Next is a Grammy, what do you think of it
However you think, I’m sorry, but shit, I have no fcking inter... | np | 1242_C. Sum Balance | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class A {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void solve() throws IOException {
final int mod = 1000*1000*1000+9;
... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.*;
import static java.lang.Math.*;
public class Solution implements Runnable {
public long gcd(long a, long b) {
long tmp;
while (b > 0) {
a %= b;
tmp = a;
a = b;
b = tmp;
}
return a;
}
public void solve() throws Exc... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class LightItUp {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new ... | linear | 1000_B. Light It Up | CODEFORCES |
import java.util.Scanner;
public class Task1 {
public static void main(String[] args) {
int n = new Scanner(System.in).nextInt();
System.out.println(n*3/2);
}
}
| constant | 84_A. Toy Army | CODEFORCES |
import java.io.*;
import java.util.*;
public class Sol2{
final public static int MXN = (1<<21);
public static int good[][];
public static void main(String[] args) throws IOException{
FastIO sc = new FastIO(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = sc.nextInt();
int m = sc.nextInt();
... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class BetaRound35_C implements Runnable {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void init() ... | cubic | 35_C. Fire Again | CODEFORCES |
//package practice;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.Stack;
import java.util.regex.Pattern;
public class ROUGH {
public static class FastReader {
BufferedReader br;
StringTokenizer st;
//it reads the data about the specified point and divide the data about it... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
public class Main {
public static void main(String args[]) throws IOException {
BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
String line = stdin.readLine();
int n = Integer.parseInt(line);
if (n >= 0) {
System.out.println(n);
} else if ... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.io.ObjectInputStream.GetField;
import java.security.KeyStore.Entry;
import java.util.ArrayList;
import ... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.StringTokenizer;
public class Main {
pu... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
// 1 -> n/2 XX n/2 + 1 -> n
public class MotherOfDragons
{
static boolean[][... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.util.*;
import java.io.*;
public class Traffic extends Template{
public double search1(int a, int w, int d){
double s = 0;
double l = 2*w+2*a*d;
int repeat = 100;
while( repeat-- > 0 ){
double x = (s+l)/2;
if( a*a*x*x + 2*a*w*x - w*w - 4*a*d > 0 ){
l = x;
} else {
s = x;
}
}
... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class A {
static StreamTokenizer st;
static PrintWriter pw... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
String[] s = {"XXXS", "XXS", "XS", "S", "M", "L", "XL"... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.util.*;
import static java.lang.Math.*;
import java.io.*;
public class SolutionB {
public static void main(String args[])throws IOException{
Scanner sc = new Scanner(System.in);
int a[] = new int[1501];
for(int i = 0; i < 3; i++){
a[sc.ne... | constant | 911_C. Three Garlands | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.InputMismatchException;
public class F547 {
public static void main(String[] args) {
FastScanner in = new FastScanner(System.in);
int N = in.nextInt();
... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class C{
static int n;
static double sqr(double v) {return (v*v);}
static double sqrt(double v) {return Math.sqrt(v);}
static double r,x[],res[];
static void MainMethod()throws Exception{
n=reader.nextInt();
r=reader.nextDouble();
int i,j;
... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.*;
import java.util.*;
public class ProblemA {
public static void main(String[] args) throws Exception{
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(bf.readLine());
StringTokenizer st1 = new StringTokenizer(bf.readLine());
... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.io.*;
import java.awt.Point;
public class Main{
public static void main(String[] args)throws FileNotFoundException,IOException{
File file = new File("input.txt");
Scanner sc = new Scanner(file);
File outFile = new File("output.txt");
PrintWriter pw = new PrintWriter(new Buffere... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedInputStream;
import java.util.Scanner;
public class HamstersAndTigers { //Round #XX - Hamsters and Tigers
public static void main(String[] args) {
Scanner sc = new Scanner(new BufferedInputStream(System.in));
int numAnimals = sc.nextInt();
String positions = sc.next();
int numTigers =... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.LinkedList;
import jav... | cubic | 35_C. Fire Again | 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.StringTokenizer;
public class ProblemA {
String fileName = "prizes";
public void solve() throws IOException {
int n = nextI... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
/*************************************************************************
> File Name: cf111c.java
> Author: Yuchen Wang
> Mail: wyc8094@gmail.com
> Created Time: Sat Feb 11 16:51:01 2017
************************************************************************/
import java.util.*;
import java.io.*;
... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.util.*;
public class j
{
public static void main(String a[])throws IOException
{
BufferedReader b=new BufferedReader(new InputStreamReader(System.in));
int k=0,i=0,j=0,n=0,p=0,t=0;
String s;
s=b.readLine();
StringTokenizer c=new StringTokenizer(s);
n=Integer.parseInt(c.nextToken());
k=Inte... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class CodeForces {
public void solve() throws IOException {
int n=nextInt();
int t=nextInt();
double larr[]=new double [n];
double rarr[]=new double [n];
for(int i=0;i<n;i++){
double x=nextDouble();
double r=nextDou... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class E implements Runnable {
public static void main (String[] args) {new Thread(null, new E(), "_cf", 1 << 28).start();}
long oo = (long)2e18;
public void run() {
FastScanner fs = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
System.err.pr... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.*;
import java.util.*;
public final class PythonIndentation
{
public static void main(String[] args)
{
new PythonIndentation(System.in, System.out);
}
static class Solver implements Runnable
{
static final int MOD = (int) 1e9 + 7;
int n;
char[] arr;
long[][] dp;
BufferedReader in;
Pr... | quadratic | 909_C. Python Indentation | CODEFORCES |
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
What do you think? What do you think?
1st on Billboard, what do you think of it
Next is a Grammy, what do you think of it
However you think, I’m sorry, but shit, I have no fcking inter... | np | 1102_F. Elongated Matrix | CODEFORCES |
import org.omg.PortableServer.AdapterActivator;
import java.io.*;
import java.lang.reflect.Array;
import java.net.CookieHandler;
import java.util.*;
import java.math.*;
import java.lang.*;
import java.util.concurrent.LinkedBlockingDeque;
import static java.lang.Math.*;
public class TaskA implements Runnable {
lo... | nlogn | 996_B. World Cup | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class CF113_Div2_A implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok;
final boolean ONLINE_JUDGE = (System.getProperty("ONLINE_JUDGE") != null);
public static void main(String[] args) {
new Thread(null, ... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String args[]) {new Main().run();}
FastReader in = new FastReader();
PrintWriter out = new PrintWriter(System.out);
void run(){
int q=in.nextInt();
for(int i=0;i<q;i++) {
out.println(work());
}
out.flush();
}
long mod=1... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class D911 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
StringTokeni... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exception {
//System.setIn(new FileInputStream("1"));
... | linear | 25_A. IQ test | 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;
public class C {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(Syste... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
//201920181
public class Polycarp{
public static void main(String args[]){
Scanner s = new Scanner(System.in);
int rem[] = new int[3];
Arrays.fill(rem,-1);
rem[0] = 0;
char ch[] = s.next().toCharArray();
int n = ch.length;
long dp[] = new long[n];
int sum =... | linear | 1005_D. Polycarp and Div 3 | CODEFORCES |
//package CF;
// Div One
import java.util.*;
public class CFA_200 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long x = sc.nextLong();
long y = sc.nextLong();
System.out.println(Wilf_tree(x, y));
sc.close();
}
static long Wilf_tree(long a,long b)
{
if(a==0|... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Iterator;
import java.util.Set;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.St... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
public class pr988B {
public static void main(String[] args) throws IOException {
BufferedReader b... | nlogn | 988_B. Substrings Sort | 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.util.*;
import java.io.*;
public class D {
static InputReader in = new InputReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
boolean even = true;
int n = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i+... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class HexadecimalTheorem {
/**
* @param args
*/
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
PrintWriter out = new PrintWriter(System.out);
out.printf("%d %d %d%n", 0, 0, n);
out.flush(... | constant | 199_A. Hexadecimal's theorem | 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.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String inp = in.nextLine();
System.out.println(25);
}
}
| constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
import java.util.Comparator;
public class Main {
private static StreamTokenizer in;
private static PrintWriter out;
private static int nextInt() throws Exception {... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.*;
public class GFG {
static int count=0;
public static void main (String[] args) {
Scanner ob=new Scanner(System.in);
int n;
long MOD=(long)(1e9+7);
int f=0,s=0;
n=ob.nextInt();
long dp[][]=new long[n+2][n+2];
dp[0][1]=1;
char ch='s';
char p;
for(int i=1;i<=n;i++)
{
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
public void _main() throws IOException {
long n = nextLong();
long m = nextLong();
long k = nextLong();
long numBlocks = Math.min(Math.min(n / k, n - m), m / (k - 1));
n -= numBlocks * k;
m -= numBlocks * (k - 1);
long numFul... | logn | 338_A. Quiz | CODEFORCES |
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.util.Arrays.copyOf;
import static java.util.Arrays.deepToString;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class C {
static int[] dx = new int[] { 0, 1, 0, -1, 0 };
static int[] dy = new int[] { 0,... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Locale;... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Naldbah implements Runnable {
boolean isLocalMode = false;
public static void main(String[] args) {
new Naldbah().run();
}
BufferedReader reader;
StringTokenizer tokenizer;
PrintWriter writer;
... | linear | 17_A. Noldbach problem | CODEFORCES |
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
long n,s,p;
S... | constant | 1023_B. Pair of Toys | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Solution {
static BufferedReader br;
static int[] ans;
public static void main(String[] args) throws Exception{
br = new BufferedReader(new InputStreamReader(System.in));... | logn | 713_B. Searching Rectangles | CODEFORCES |
//package que_a;
import java.io.*;
import java.util.*;
import java.math.*;
public class utkarsh {
InputStream is;
PrintWriter out;
long mod = (long)(1e9 + 7), inf = (long)(3e18);
void solve() {
//SZ = sieve(); //SZ = 1000001;
int q = ni();
while(q-- > 0) {
... | logn | 1080_D. Olya and magical square | 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.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author Dzmitry Paulenka
*/
public class Main {
public static void main(String[] args) {
InputSt... | logn | 287_B. Pipeline | CODEFORCES |
/**
*
* @author Mohammad Hadi
*/
public class A630 {
public static void main(String[] args) {
System.out.println(25);
}
}
| constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.util.*;
import java.io.*;
/*
* Heart beats fast
* Colors and promises
* How to be brave
* How can I love when I am afraid...
*/
public class Main
{
public static void main(String[]args) throws Exception
{
int n=ni();
double ke=ni();
boolean[][]a=new boolean[n][n];
for(int i=0; i<... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.lang.*;
import java.math.BigInteger;
import java.io.*;
import java.util.*;
public class Solution implements Runnable{
public static BufferedReader br;
public static PrintWriter out;
public static StringTokenizer stk;
public static boolean isStream = true;
public static void main(String... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class C{
public static void main (String[] args) throws java.lang.Exception{
Scanner scan=new Scanner(System.in);
long x=scan.nextLong(), k=scan.nextLong();
long MOD = 1000000007;
if(x==0){
System.out.println("0");
return;
}
x %= MOD;
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
/* package whatever; // don't place package name! */
import java.util.*;
;
/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
Scanner s = new Scanner(System.in);
long n = s.nextLo... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.*;
import java.util.*;
public class D11 {
static boolean[][] g;
static int n, m;
public static void main(String[] args) throws IOException {
input.init(System.in);
PrintWriter out = new PrintWriter(System.out);
n = input.nextInt();
m = input.nextInt();
g = new boolean[n][n];
for(int i = 0; i<m; i... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
public class substring
{
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
String s = input.nextLine();
Boolean found = false;
int i = s.length();
while(found==false)
{
i--;
ArrayList<String> sub = new ArrayList<String>();
for(int j = 0; j <= s.length() - i; j++)
{
if(... | cubic | 23_A. You're Given a String... | 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.io.PrintWriter;
import java.util.*;
/*
10
R1C1
A1
R1C26
Z1
R1C27
AA1
R1C28
AB1
R1C52
AZ1
*/
public class Main {
Scanner in;
PrintWriter out;
boolean isFirst(String line){
int pos = 0;
while( pos<line.length() && Character.isLetter(line.charAt(pos))){
pos++;
}
while( pos<line.length() && ... | linear | 1_B. Spreadsheets | 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.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.StringTokenizer;
public class Solution {
private BufferedReader cin;
private PrintWriter cout;
priv... | constant | 472_A. Design Tutorial: Learn from Math | 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.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper... | cubic | 1517_D. Explorer Space | CODEFORCES |
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Collections;
import java.util.HashSet;
/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
public static void main (String[] args) throws java.lang.E... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOExcept... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
public class cf256b {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.nextLong();
long x = in.nextLong()-1;
long y = in.nextLong()-1;
long c = in.nextLong();
long lo = 0, hi = 2*n+10;
while(hi - lo > 2) {
long mid = (hi+lo)/2;
if(cal... | logn | 256_B. Mr. Bender and Square | 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;
public class f {
static int n, m;
static int start;
static int[][] memo;
static int[][] arr;
static int[... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.util.*;
import java.io.*;
public class C {
FastScanner in;
PrintWriter out;
boolean systemIO = true;
public static void quickSort(int[] a, int from, int to) {
if (to - from <= 1) {
return;
}
int i = from;
int j = to - 1;
int x = a[from + (new Random()).nextInt(to - from)];
while (i <= j... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.