src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import java.util.*;
import java.math.*;
public class Main2 {
public static void main(String[] args) throws Exception {
new Main2().run();
}
public void solve() throws Exception {
n = nextInt();
int a[]= new int[n], pos = 1;
for(int i=0; i<n; i++)
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.PrintStream;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.Writer;
import java.io.InputStream;
/**
* Built using CHelper... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.*;
import java.util.*;
public class A implements Runnable {
private MyScanner in;
private PrintWriter out;
private void solve() {
int n = in.nextInt();
int[] a = new int[n];
int max = -1, maxp = -1;
for (int i = 0; i < n; ++i) {
a[i] = in.nextInt(... | nlogn | 135_A. Replacement | 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.*;
import java.util.*;
public class B {
public static void main(String[] args) {
InputReader in = new InputReader();
int n = in.nextInt();
int k = in.nextInt();
long numCandies = 1;
int turns = 1, add = 2;
while (numCandies < k) {
++turns;
numCandies += add++;
}
int res = 0;
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Main {
private FastScanner in;
private PrintWriter out;
public void solve() throws IOException {
int N = in.nextInt();
int M = in.nextInt();
int[][] edges = new int[N][N];
for (int i = 0; i < M; i++) {
int a = in.nextInt() - 1;
int b ... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class main implements Runnable{
static ArrayList <Integer> adj[];
static int co=0,f=0;
static void Check2(int n){
adj=new ArrayList[n+1];
for(int ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
public class virtual1{
static InputReader in = new InputReader();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
long x = in.nextLong();
long k = in.nextLong();
long mod = (long)1... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long l = in.nextLong();
long r = in.nextLong();
long a = 0;
long b = 0;
long c = 0;
if (r - l < 2)
System.out.println(-1);
else if (r - l < 3 && l % 2 == 1)
System.out.println... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) {
new Main().run();
}
void run() {
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = in.nextInt(), k = in.nextInt();
int[] a = new int[n];... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main implements Runnable {
//public static final String FileName = "test";
StreamTokenizer ST;
PrintWriter out;
BufferedReader br;
Scanner in;
static final int inf = 1000000000;
int nextInt() throws IO... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class thing {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
String s = in.next();
int[][] count = new int[m][m];
int[] dp = new int[1 << m];
Arrays.fill(dp, ... | np | 1238_E. Keyboard Purchase | CODEFORCES |
//package round136;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
public class A {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
int[] a = new int[n];
int[] b = new int[n]... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.util.*;
import java.io.*;
public class D {
static final boolean stdin = true;
static final String filename = "";
static FastScanner br;
static PrintWriter pw;
public static void main(String[] args) throws IOException {
if (stdin) {
br = new FastScanner();
pw = new PrintWriter(new OutputStre... | nlogn | 988_D. Points and Powers of Two | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class DivRound584ProblemA {
static FastReader sc=new FastReader();
public static void main(String args[]) throws IOException {
int n = sc.nextInt();
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main
{
static class Reader
{
private InputStream mIs;private byte[] buf = new byte[1024];private int curChar,numChars;public Reader() { this(System.in); }public Reader(InputStream is) { mIs = is;}
public int read() {if (nu... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import static java.util.Arrays.deepToString;
public class A {
private static int[] prime = new int[] {
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,
47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, ... | linear | 17_A. Noldbach problem | CODEFORCES |
import static java.lang.Math.max;
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class GivenString implements Runnable
{
public static void main(String[] args) thro... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
import java.io.*;
public class Waw{
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[] a = new long[n];
for(int i=0;i<n;i++) a[i] = sc.nextLong();
long[] p = new long[n];
... | linear | 924_C. Riverside Curio | CODEFORCES |
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
TreeSet<Integer> set = new TreeSet<Integer>();
for(int i=0;i<n;i++){
set.add(sc.nextInt());
}
if(set.size() >= 2)
System.out.println(set.toArray()[1]);
else
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.util.InputMismatchException;
import java.io.Writer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author emotionalBlin... | nlogn | 274_A. k-Multiple Free Set | 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.util.*;
import java.math.*;
import java.io.*;
public class Main
{
public static void main(String args[]) throws IOException
{
Scanner c=new Scanner(System.in);
int n=c.nextInt();
int a=c.nextInt(); //higher
int b=c.nextInt(); //lower
int C[]=new int[n];
for(int i=0;i<n;i++)
C[i]=c.next... | nlogn | 169_A. Chores | CODEFORCES |
import java.awt.*;
import java.io.*;
import java.sql.Array;
import java.util.*;
import java.util.List;
public class Main {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(
new InputStream... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Random;
import java.io.IOException;
import java.io.Reader;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.i... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
static int n, m, a[][];
static int[][] memo;
static Integer[] indices;
static int[] getCol(int col, int shift) {
int[] ans = new int[n];
for (int i = 0, j = shift; i < n; i++, j = (j + 1) % n) {
ans[i] = a[j][col];
}
return ans;
}
static int d... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
//package codeforces;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
imp... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.MathContext;
import java.util.*;
public class Main {
static int len(long n) {
int res = 0;
while (n > 0) {
n /= 10;
res++;
}
return res;
}
static long big(int len) {
long p = 1;
while (len-- > 0) p *= 10;
retu... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import sun.rmi.transport.DGCImpl_Stub;
import java.io.*;
import java.nio.file.ClosedWatchServiceException;
import java.util.*;
public class Main {
public static void main(String[] args) throws FileNotFoundException {
ConsoleIO io = new ConsoleIO(new InputStreamReader(System.in), new PrintWriter(System.out... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.StringTokenizer;
/**
* 9:50 ~
*
*/
public ... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* @author Don Li
*/
public class LogicalExpression {
int N = 256;
void solve() {
Expression[] E = new Expression[N];
for (in... | quadratic | 913_E. Logical Expression | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class C {
static StringBuilder st = new StringBuilder();
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
Point [] sq... | constant | 994_C. Two Squares | CODEFORCES |
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.Scanner;
public class C {
private static final String REGEX = " ";
private static final Boolean DEBUG = false;
private static final String FILE_NAME = "input.txt";
public static void main(String[] args) ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class Subtractions {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner s=new Scanner(System.in);
int t=s.nextInt();
while(t--!=0){
int a=s.nextInt();
int b=s.nextInt();
int min=Math.min(a, b);
int max=Math.max(a, b);
int ops=0;... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.*;
public class E
{
public static void main(String[] args)
{
new E(new Scanner(System.in));
}
int N, M;
int[][][] memo;
int go(int i, int j, int mask)
{
if (i == N)
return go(0, j+1, mask);
if (j == M)
{
int mm = mask%(1<<N);
... | np | 112_E. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.fill;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.sort;
public class Main {
public static void main(String[] args) throws IOException {
new Thread(null, new Runnable() {
public voi... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
new Main().go();
}
PrintWriter out;
Reader in;
BufferedReader br;
Main() throws IOException {
try {
//br = new BufferedReader( new FileReader("in... | quadratic | 1141_F2. Same Sum Blocks (Hard) | 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
*/
public class Main {
public static... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.System.in;
public class Main {
public static void main(String[] args)throws IOException{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] point = new int[n][];
for(int i=0;i<n;i++) point[i] = new int[]{s... | nlogn | 528_B. Clique Problem | CODEFORCES |
import java.io.*;
public class coins
{
public static void main(String args[])throws IOException
{
InputStreamReader read=new InputStreamReader(System.in);
BufferedReader in=new BufferedReader(read);
int i,k,n,v;
String a;
a=in.readLine();
for(i=0;i<a.length();i++)
{
if(a.charAt(i)==' ')
break;
}... | constant | 1061_A. Coins | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
private BufferedReader in;
private PrintWriter out;
private StringTokenizer st;
void solve() throws IOException {
int n = nextInt();
int k = nextInt();
ArrayList<Integer> ps = new ArrayList<Integer>();
boolean[] prime = new boolean[n + 1];
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
public class Main {
public static class node implements Comparable<node>{
int l,r;
node(){}
node(int l,int r) {
this.l=l;
this.r=r;
}
@Override
public int compareTo(node rhs) {
return r-rhs.r;
}
}
public static void main(String args[]){
Scanner in = new Scanner(Syste... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;
public class Main{
static class Run implements Runnable{
//TODO parameters
final boolean consoleIO = true;
final String inFile = "input.txt";
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.*;
import java.io.*;
public class Contest176B {
public static void main(String[] args) throws IOException{
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
int k = sc.nextInt();
if( ((long)k * (long)(k + 1))/2 - 1 - (k - 2) < n){
Sys... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.Scanner;
public class A235 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long a = in.nextLong();
if (a % 2 == 0) {
long result = cal(a);
result = Math.max(result, cal(a + 1));
result = Math.max(result, cal2(a));
System.out.println(Math.max(result, ... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.concurrent.ArrayBlockingQueue;
import javax.print.attribute.HashAttributeSet;
public class CodeForces {
public void solve() throws IOException {
int n = nextInt();
int arr[]=new int[1000];
arr[0]=0;
arr[1]=1;
arr[2]=1;
if(n==0){
out.print("0 0 0... | constant | 199_A. Hexadecimal's theorem | 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... | logn | 1088_D. Ehab and another another xor problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class C43 {
static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
static PrintWriter out = new Print... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
import javafx.util.Pair;
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class TaskB implements Runnable {
boolean prime[] = new boolean[(int)1e6+10];
InputReader c;
PrintWriter w;
public void run() {
c = new InputRea... | linear | 608_B. Hamming Distance Sum | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main implements Runnable {
PrintWriter out;
BufferedReader in;
StringTokenizer st;
void solve() throws Exception {
int n = ne... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
public class Array224B {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(f.readLine());
int n = Integer.parseInt(st.nextToken());
int k = Integer.... | linear | 224_B. Array | CODEFORCES |
// Author: aman_robotics
//package math_codet;
import java.io.*;
import java.util.*;
public class lets_do {
FastReader in;
PrintWriter out;
Helper_class h;
final long mod = 1000000009;
final int MAXN = 1000005;
final int lgN = 20;
final long INF = (long)1e18;
final long MAX_Ai = (long... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.*;
public class E implements Runnable {
FastReader scn;
PrintWriter out;
String INPUT = "";
void solve() {
int t = scn.nextInt();
while(t-- > 0) {
int n = scn.nextInt(), m = scn.nextInt();
int[][] arr = scn.next2DInt(n, m);
int[][] col = new int[m][2];
for(in... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class F531 {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
int n = sc.nextInt(); int m = sc.nextInt();
long [][] mn1 = new long[n][n];
... | np | 1102_F. Elongated Matrix | 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.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
imp... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.StringTokenizer;
public class Quiz {
public static long pow(long base, long power) {
if (power == 0)
... | logn | 338_A. Quiz | 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... | logn | 1019_B. The hat | CODEFORCES |
//package round22;
import java.io.PrintWriter;
import java.io.StringReader;
import java.util.Arrays;
import java.util.Scanner;
public class A {
private Scanner in;
private PrintWriter out;
// private String INPUT = "5 1 2 3 1 1";
private String INPUT = "";
public void solve()
{
int n = ni();
int[] a = new... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.*;
public class Main{
static InputReader sc;
static PrintWriter pw;
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
sc = new InputReader(inputStream);
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
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 oce... | 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.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.*;
import java.math.BigInteger;
public class C {
private static Solver solver = new Solver();
private static long m = 1000000000L + 7L;
public static void main(String[] args) throws IOException {
solver.withProcedure(() -> {
String[] input = solver.readString().split("... | logn | 992_C. Nastya and a Wardrobe | 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... | cubic | 840_C. On the Bench | 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 |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.Scanner;
/**
*
* @author 111
*/
public class JavaApplication4 {
/**
* @param args the command line arguments
*/
static long k, n, ans;
static private long binsearch(long l, lo... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main implements Runnable {
private void solution() throws IOException {
int n = in.nextInt();
int m = in.nextInt();
boolean[][] adj = new boolean[n][n];
long res = 0;
for (int i = 0; i < m; ++i) {
int x = in.nextInt();
int y = in.nextInt();
adj[x -... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main{
public static void main(String[] Args) throws Exception {
Scanner sc = new Scanner(new FileReader("input.txt"));
int n,m,k;
Integer lx,ly;
boolean d[][];
n = sc.nextInt(); m = sc.nextInt(); k = sc.nextInt();... | cubic | 35_C. Fire Again | CODEFORCES |
// practice with kaiboy, coached by rainboy
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();
}
void main() {
int n ... | 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.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main
{
static MyScanner scan;
static PrintWriter pw;
public static void main(String[] args) {
new Thread(null,null,"_",1<<25)
{
public void run()
{
try
{... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
// Change Of Plans BABY.... Change Of Plans //
import java.io.*;
import java.util.*;
import java.util.Queue;
import static java.lang.Math.*;
public class digitSequence {
static void MainSolution() {
long k = nl() - 1;
for (int i = 1; ; i++) {
long temp=9L*i*fastPow(10,i-1);
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
/*
*
* @Author Ajudiya_13(Bhargav Girdharbhai Ajudiya)
* Dhirubhai Ambani Institute of Information And Communication Technology
*
*/
import java.util.*;
import java.io.*;
import java.lang.*;
public class Code3
{
public static void main(String[] args)
{
InputReader in = new InputReader(System.in);
Pr... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.lang.*;
import java.math.*;
public class Main{
static ArrayList a[]=new ArrayList[200001];
static int Count(int a[][],int n) {
dsu d=new dsu(n);
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
if(a[i][j]==0) {
d.union(i, j);
}... | quadratic | 990_D. Graph And Its Complement | CODEFORCES |
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.TreeSet;
public class r568p8{
private static InputReader sc;
private static PrintWriter pw;
private static long m... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class C {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
long s=0,mod=1000000009;
int n=sc.nextInt(),m=sc.nextInt(),k=sc.nextInt(),c=n/k;
if(m<=c*(k-1)+(n%k))System.out.println(m);
else {
int a=m-c*(k-1)-(n%k);
... | logn | 338_A. Quiz | CODEFORCES |
//package Educational35;
//import FastScanner.Competitive;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class D {
String INPUT = "4\n" +
"1 2 4 ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class BOOL {
static char [][]ch;
static int n,m;
private static FastReader in =new FastReader();
public static void main(String[] args) {
int n=in.nextInt();
int a[]=new int[100000... | linear | 608_C. Chain Reaction | CODEFORCES |
//package codeforces;
import java.util.*;
import java.math.BigInteger;
public class test_round_B {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
BigInteger k=sc.nextBigInteger();
BigInteger i=new BigInteger("0");
int d=0;
BigInteger... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
/**
* @author vstepanov on 3/29/2017.
*/
public class Main {
public static void main(String[] args) {
try(Scanner in = new Scanner(System.in)) {
int bx = in.nextInt();
int by = in.nextInt();
int n = in.nextInt();
... | np | 8_C. Looking for Order | CODEFORCES |
/**
* Author: Ridam Nagar
* Date: 27 February 2019
* Time: 01:17:36
**/
/*
package codechef; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.BigInteger;
/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{ ... | constant | 913_A. Modular Exponentiation | CODEFORCES |
import java.io.*;
import java.util.*;
public class icpc
{
public static void main(String[] args) throws IOException
{
Reader in = new Reader();
// BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
long n = in.nextLong();
long k = in.nextLong();
lon... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
Comp c1 = getComp(scanner);
Comp c2 = getComp(scanner);
c1.sortByPrice();
c2.sortByPrice();
int i = 0;
int j = 0;
while(i < c1.num || j < c2.num) {
Elem xi = (i < c1.num) ... | nlogn | 981_B. Businessmen Problems | CODEFORCES |
//>>>BaZ<<<//
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main
{
static int dx[] = {-1,1,0,0};
static int dy[] = {0,0,1,-1};
static long MOD = 1000000007;
static int INF = Integer.MAX_VALUE/10;
static PrintWriter pw;
static InputReader scan;
//static ... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.io.*;
import java.util.stream.Collectors;
public class P1177A {
public static void main(String[] args) throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
long n = Long.parseLong(r.readLine());
if (n < 10) {
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
public final class Subtractions
{
public static void main(String[] args)
{
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
Solver solver = new Solver(in, out);
solver.solve();
in.close();
out.... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.*;
import java.io.*;
public class C0008 {
public static void main(String args[]) throws Exception {
new C0008();
}
int n;
int target;
int pow[];
int dp[];
int next[];
int dist[][];
C0008() throws Exception {
PandaScanner sc = null;
PrintWr... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.Random;
public class ProblemC {
public static void main(String[] args) throws IOException {
init();
new ProblemC().run();
out.flush();
out.close();
}
static void init() throws IOException {
in = new StreamTokenizer(new Buffered... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
public void solve() throws IOException {
long n = nextInt(), k = nextInt();
long c = 2 * (n + k);
long l = -1, r = 200000;
while (r - l > 1) {
long m = l + (r - l) / 2;
if (m * m + 3 * m >= c) {
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in Actual solution is at the top
*
* @author MaxHeap
*/
public class Main ... | linear | 1062_C. Banh-mi | CODEFORCES |
import java.util.*;
public class main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int houses = sc.nextInt();
int size = sc.nextInt();
hizzy[] array = new hizzy[houses];
long total =2;
for(int a=0;a<houses;a++)array[a]=new hi... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
i... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class GivenString {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String s = input.nextLine();
int max = 0;
for(int i = 0; i < s.length(); i++) {
for(int j = i + 1; j <= s.leng... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class A{
public static void main(String[] args) throws Exception{
new A().run();
}
void run() throws Exception{
//Scanner sc = new Scanner(System.in);
BufferedReader sc = new BufferedReader(new InputStream... | nlogn | 135_A. Replacement | CODEFORCES |
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.System.exit;
import static java.util.Arrays.fill;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
im... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.util.Scanner;
public class B {
/**
* @param args
*/
public static void main(String[] args) {
Pipes pipes = new Pipes();
pipes.solve();
pipes.print();
}
}
class Pipes {
Pipes() {
Scanner scr = new Scanner(System.in);
n = scr.nextLong();
k = scr.nextLong();
}
long bs(long nb, lo... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.util.*;
public class D {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
double f(int dist, double initSp, int a, int maxSp) {
double distToReachMaxSpeed = 0.5 * (maxSp * maxSp - initSp * initSp)
/ a;
if (dist > distToReachMaxSpeed)
return 1d * (max... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class A483 implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
public static void main(String[] args) {
new Thread(null, new A483... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.LinkedList;
public class LuckyNumbers {
public static void main(String[] args)throws IOException
{
BufferedReader scan=new BufferedReader(new InputStreamReader(System.in));
short num=Sh... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.List;
import java.util.StringTokenizer;
public class B {
final int INF = 1_000_000_000;
void solve() {
int n = readInt();
int k = readInt();
long l ... | logn | 1195_B. Sport Mafia | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.