src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.util.Scanner;
public class Main {
final static long Mod = 1000000009;
static long n, m, k, t, l, u, ans;
static Scanner cin = new Scanner(System.in);
static long multi_mod(long base, long cur) {
long res = 1;
while(cur > 0) {
if(cur % 2 == 1) res = (re... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
public class C
{
static long mod=(long)(1e9+7);
public static long powMod(long e,long b)
{
/*e=e%mod;*/
long res=1;
while(e>0)
{
if(e%2==1)
res=res*b%mod;
e/=2;
b=b*b%mod;
}
return res;
}
public static void main(String[] args) throws IOException... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static int gcd(int a , int b) {
if (b == 0) return 0;
else {
return a / b + gcd (b , a % b);
}
}
public static void main(String[] args) {
Scanner sc = new Scanner (System.in);
int testCase = sc.nextInt();
while (te... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Solve4 {
public static void main(String[] args) throws IOException {
FastReader sc = new FastReader();
int x= sc.nextInt();
int y= sc.nextInt();
int z... | constant | 1054_A. Elevator or Stairs? | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author be... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.Scanner;
public class A1 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long size = scan.nextLong();
int numberOfSpecial = scan.nextInt();
long pageSize = scan.nextLong... | linear | 1190_A. Tokitsukaze and Discard Items | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class B {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new Out... | linear | 1190_B. Tokitsukaze, CSL and Stone Game | 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... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class CoveredPointsCount {
//UPSOLVE
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStre... | nlogn | 1000_C. Covered Points Count | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class e {
public static class FastReader {
BufferedReader br;
StringTokenizer st;
//it reads the data about the specified point and divide the data about it... | constant | 1100_C. NN and the Optical Illusion | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringJoiner;
import java.util.StringTokenizer;
import java.util.function.Function;
public class Main {
static String S;
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
S = sc.next();
Sy... | linear | 1025_C. Plasticine zebra | CODEFORCES |
import java.io.*;
import java.util.*;
/*
* Raudel Ravelo Suarez
* Problem:
*/
public class C
{
Scanner sc;
BufferedReader in;
PrintStream out;
StringTokenizer tok;
public C() throws NumberFormatException, IOException
{
//sc = new Scanner(System.in);
//sc = new Scanner(new FileReader("in.txt"));
in ... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.Scanner;
public class D {
public static void main(String [] args){
Scanner in = new Scanner(System.in);
long a = in.nextLong();
long b = in.nextLong();
String sa = Long.toBinaryString(a);
String sb = Long.toBinaryString(b);
long ans = 0;
if(sb.length()-sa.length()>0){
for(int i = 0 ... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter out;
static InputReader ir;
static void solve() {
int n = ir.nextInt();
int[] a ... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class C {
static final int M = 1000000007;
public static void main(String[] args) throws IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class C
{
static int mod = (int) (1e9+7);
static InputReader in;
static PrintWriter out;
public static void main(String[] args)
{
in = new InputReader(System.in);
out = new PrintWriter(System.out);
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.lang.reflect.Array;
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[] colors = 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 Main {
private static void solve(InputReader in, OutputWriter out) {
int n = in.nextInt();
List<List<Integer>> g = new ArrayList<>(n + 1);
for (int i = 0; i < n + 1; i++) {
g.add(new LinkedList<>());
}
int deg... | linear | 981_C. Useful Decomposition | CODEFORCES |
/**
* DA-IICT
* Author : Savaliya Sagar
*/
import java.io.*;
import java.math.*;
import java.util.*;
public class C817 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve() {
long n = nl();
long s = nl();
long l = 1;
long r = n;
long ans = 0;
while(l<=r){
long mid = (l+r)/2;
long... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;import java.io.*;import java.math.*;
public class Main
{
public static void process()throws IOException
{
int n=ni();
int[]A=new int[n];
int point = -1;
for(int _i=0;_i<n;_i++){
int x =ni();
if(x==1){
point++;
... | cubic | 1523_C. Compression and Expansion | 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 SequenceTransformation {
void solve() {
int p = 1, n = in.nextInt();
while (n > 0) {
if (n ==... | linear | 1059_C. Sequence Transformation | CODEFORCES |
import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
public class D {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
// System.err.println(f(1... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.*;
import java.util.*;
import java.util.LinkedList;
import java.math.*;
import java.lang.*;
import java.util.PriorityQueue;
import static java.lang.Math.*;
@SuppressWarnings("unchecked")
public class Solution implements R... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.util.LinkedList;
import java.io.FileInputStream;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.Collection;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Queue;
import java.io.IOException;
import java.io.FileOutputStr... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main (String[] args) throws IOException {
BufferedReader reader = new BufferedReader (new InputStreamReader (System.in));
String[] splitted = reader.readLine().split(" ");
int n = Integer.parseInt(splitted[0]);
int m = Integer.parseI... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.prefs.NodeChangeEvent;
import java.math.*;
public class Main implements Runnable {
private BufferedReader in;
private PrintWriter out;
private StringTokenizer st;
private Random rnd;
private void solve() throws IOException {
int n = nextInt();
int[] ... | nlogn | 135_A. Replacement | 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();
HashSet<String> set = new HashSet<String>();
int ans = 0;
for (int i = 0; i < s.length(); ++i) {
for (int ... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
import java.awt.Polygon;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.*;
import java.util.Collection;
public cl... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class TaskA {
/**
* @param args
*/
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
new TaskA().solve(in, out);
in.close();
out.close();
}... | nlogn | 257_A. Sockets | CODEFORCES |
import java.util.*;
import java.io.*;
public class MotherOfDragons {
public static void main(String[] args) {
FastScanner scanner = new FastScanner();
PrintWriter out = new PrintWriter(System.out, false);
int n = scanner.nextInt();
double k = scanner.nextInt();
long[] graph ... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class JavaApplication2 {
public static void main(String[] args) throws IOException {
BufferedReader sc= new BufferedReader(new InputStreamReader(System.in));
... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java .util.*;
import java .io.*;
public class Main{
public static void main(String[]YAHIA_MOSTAFA){
Scanner sc =new Scanner(System.in);
long n=sc.nextLong(),x=sc.nextLong(),y=sc.nextLong();
long xb,xw,yb,yw;
xw=x-1;yw=y-1;xb=n-x;yb=n-y;
if (x==n&&y==n){
System.out.println("Black");return;
}
lon... | constant | 1075_A. The King's Race | CODEFORCES |
import java.io.*;
import java.util.*;
public class B2 {
String s = null;
String[] ss = null;
int[][] sn = null;
int n = 0;
double ans = 1;
int A = 0;
public void run() throws Exception{
BufferedReader br = null;
File file = new File("input.txt");
if(file.exists()){
br = new BufferedReader(new F... | np | 105_B. Dark Assembly | 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.IOException;
import java.io.InputStreamReader;
import java.math.BigDecimal;
import java.util.StringTokenize... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
public class A {
void solve(){
long k = readLong();
long x = 9;
long y = 1;
while(k > x * y){
k... | logn | 1177_B. Digits Sequence (Hard 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.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at ... | constant | 630_A. Again Twenty Five! | CODEFORCES |
//package round113;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
public class A {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni(), k = ni();
int[]... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Scanner;
public class CF275Ad2 {
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
long l = scan.nextLong();
long r = scan.nextLong();
long diff = r-l;
boolean exists = false;
if(diff >= 3){
if(l%2 == 1){
l++;
}
exist... | constant | 483_A. Counterexample | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
static long MOD=1000000007;
public static long pow(long x,long k){
long base=x%MOD;
long res=1;
while(k>0){
if((k&1)==1){
res=(res*base)%MOD;
}
base=(base*base)%MOD;
k>>=1;
}
return res;
}
public static void m... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author khokharnikunj8
*/
public ... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class EhabAndAnotherAnotherXorProblem implements Closeable {
private InputReader in = new InputRead... | logn | 1088_D. Ehab and another another xor problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
public class CF1195B {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static BufferedWriter... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class CoveredPointsCount {
//UPSOLVE
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStre... | nlogn | 1000_C. Covered Points Count | CODEFORCES |
import java.io.*;
import java.lang.reflect.*;
public class D {
final int MOD = (int)1e9 + 7;
final double eps = 1e-12;
final int INF = (int)1e9;
public D () {
long L = sc.nextLong();
long R = sc.nextLong();
for (int i = 60; i >= 0; --i) {
long b = (1L << i);
long A = (L & b), B = (R & b);
if (... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class e {
public static class FastReader {
BufferedReader br;
StringTokenizer st;
//it reads the data about the specified point and divide the data about it... | constant | 1100_C. NN and the Optical Illusion | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author a... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import javafx.util.Pair;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
public class ElongatedMatrix {
private static int n;
/**
* if the rows are arranged in some permutation [p_1, p_2,...i,j,...p_n],
*... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
static final int MAXN = 24;
int[] x = new int[MAXN];
int[] y = new int[MAXN];
int[][] dist = new int[MAXN][MAXN];
int[] single = new int[MAXN];
int sqr(int x) { return x * x; }
void run(int nT) {
int xs = cin.n... | np | 8_C. Looking for Order | CODEFORCES |
//package timus;
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.io.Reader;
import java.io.StreamTokenizer;
import java.io.Writer;
import java.ma... | cubic | 23_A. You're Given a String... | CODEFORCES |
//package contese_476;
import java.util.*;
public class q1
{
int m=(int)1e9+7;
public class Node
{
int a;
int b;
public void Node(int a,int b)
{
this.a=a;
this.b=b;
}
}
public int mul(int a ,int b)
{
a=a%m;
b=b%m;
return((a*b)%m);
}
public int pow(int a,int b)
{
int x=1;
while(b>0)
{
if(b%2!=0)
x=mul... | linear | 1013_B. And | CODEFORCES |
import java.util.Scanner;
public class A235 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
long n = sc.nextInt();
if (n == 1) {
System.out.println(1);
return;
} else if (n == 2) {
... | constant | 235_A. LCM Challenge | CODEFORCES |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author Gaurav
*/import java.io.*;
public class a23 {
public static void main(String arg[])throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.BufferedReader;
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 ProblemE {
static final int INF = 1000000;
public static void main(String[] ... | np | 16_E. Fish | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.Writer;
im... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
public class IQTest {
public static void main(String args[]) throws Exception {
BufferedReader stdin =
new BufferedReader(new InputStreamReader(System.in));
String line;
line = stdin.readLine... | linear | 25_A. IQ test | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.StringTokenizer;
public class P {
public static void main(String[] args) throws NumberFo... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
pu... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
//stan hu tao
//join nct ridin by first year culture reps
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.Math.abs;
import static java.lang.System.out;
import java.util.*;
import java.io.*;
import java.math.*;
public class x1497E
{
static final int MAX = 10000000;
pu... | cubic | 1497E2 | 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
*/
public class Main {
public static void main(String[] args) {
InputStream inputSt... | nlogn | 257_A. Sockets | CODEFORCES |
//package round455;
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 C {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
int... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import java.io.*;
public class E {
void solve(BufferedReader in) throws Exception {
int[] xx = toInts(in.readLine());
int n = xx[0];
double k = xx[1];
int[][] board = new int[n][n];
for(int i = 0; i<n; i++) board[i] = toInts(in.readLine());
int fst... | np | 839_E. Mother of Dragons | CODEFORCES |
// @author Sanzhar
import java.io.*;
import java.util.*;
import java.awt.Point;
public class Template {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(in.readLine()... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.*;
import java.util.*;
public class Codechef{
public static void main(String []args){
Scanner in = new Scanner(System.in);
long n=in.nextLong();
long m=in.nextLong();
long k=in.nextLong();
long l=in.nextLong();
long j=((k+l)/m);
if((k+l)%m!=0)j++;
if((k+l>n) || j*m>n) {
... | constant | 1068_A. Birthday | 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.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.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author George Marcus
*/
public class Main {
public static void main(String[] args) {
Inpu... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class A {
static StringTokenizer st;
static Buffered... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.*;
import java.util.*;
public class LCMChallenge {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
long n = Long.parseLong(f.readLine());
if (n == 1 || n == 2)
System.out.println(... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
import java.lang.*;
public class Main
{
static Input in;
static Output out;
public static void main(String[] args) throws IOException
{
in = new Input(System.in);
out = new Output(System.out);
run();
out.close();... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
//package round15;
import java.io.BufferedOutputStream;
import java.io.PrintStream;
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;
public void solve()
{
int n = ni();
int t = ni();
P... | nlogn | 15_A. Cottage Village | 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 C8 {
static int[] mem;
static int[] bag;
static int[][] items;
static int[] close;
static Pri... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class A_122 {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(bf.readLine());
Sy... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.StringTokenizer;
import java.io.BufferedRead... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import java.io.*;
public class PythonIndentation {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(in.readLine());
int[][] dp = new int[N][N];
dp[0][0] = 1;
for(int i = 1; i < N... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
public class q5 {
static NoD[] arr;
static int index,count,zc;
static ArrayList<NoD> pos,neg;
static long[][][][] dp;
static long solve(int a,int b, int c,int d, long mod) {
long[][][][] a2=dp;
int p=-1;
if... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.*;
import static java.lang.Math.*;
public class Main {
static int hx, hy;
static int[] X, Y;
static int N;
static int[] DP;
static int pw(int a) {
return a * a;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
hx = sc.nextInt();
hy = sc.nextInt();
... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;
/**
* @author khokharnikunj8
*/
public class Main {
public static void main(String[] args) {
n... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
import java.io.*;
public class ExplorerSpace {
private static class MyScanner {
BufferedReader br;
StringTokenizer st;
public MyScanner() {
b... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class CF22_1 {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int num=sc.nextInt();
if(num!=1)
{
ArrayList<Integer>data=new ArrayList<Integer>();
for (in... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class E implements Runnable {
public static void main (String[] args) {new Thread(null, new E(), "_cf", 1 << 28).start();}
int n, m;
char[] str;
int[][] occs, cost;
int[] dp;
public void run() {
FastScanner fs = new FastScanner();
P... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.HashMap;
public class B {
/... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
static class Sort implements Comparable<Sort> {
int x,a;
public int compareTo(Sort o) {
if (this.x==o.x)
return this.a-o.a;
return this.x-o.x;
}
}
public static void main(St... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int N = sc.nextInt();
long dest = sc.nextLong();
long max = (long)... | nlogn | 1098_C. Construct a tree | CODEFORCES |
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.PrintStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.math.BigInteger;
import java.io.InputStr... | nlogn | 257_A. Sockets | CODEFORCES |
import java.util.*;
import java.io.*;
public class _1000_A {
public static void main(String[] args) throws IOException {
HashMap<String, Integer> map1 = new HashMap<>(), map2 = new HashMap<>(); int N = readInt();
for(int i = 1; i<=N; i++) {
String s = read(); if(!map1.containsKey(s)) map1.put(s, 1); else map1... | 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.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Comparator;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution i... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.util.Scanner;
public class Hello {
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int m = scan.nextInt();
boolean[][] graph = new boolean[n][n];
for(int i = 0; i < m; i++) {
int from = scan.nextInt() - 1;
int to = scan.... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main
{
public static void main(String args[]) throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String x[]=br.readLine().split(" ");
long l=Long.parseLong(x[0]);
long r=Long.parseLong(x[1]);
if(l%2!=0)
{
l++;
... | constant | 483_A. Counterexample | CODEFORCES |
import java.util.Scanner;
public class Problem {
public static void main(String[] args) throws Exception {
Scanner input = new Scanner(System.in);
int side = input.nextInt()-1;
int x = input.nextInt()-1;
int y = input.nextInt()-1;
long target = input.nextLong();
... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int i(String s) { return Integer.parseInt(s); }
public static void main(String[] args) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String[] arr = in.readLine().split(" ");
int n = i(arr[0]);
int k = ... | linear | 224_B. Array | CODEFORCES |
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.ArrayList;
import java.util.Scanner;
/**
*
* @author Ahmed
*/
public class Watermelon {
static class Pas... | linear | 608_A. Saitama Destroys Hotel | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Solution{
public static long mod = 1000000007;
public static void main(String[] args)throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.Scanner;
public class A {
public static boolean realbig (long num, long s) {
String str = num + "";
String[] digs = str.split("");
int sum = 0;
for(String dig : digs) {
sum+= Integer.parseInt(dig);
}
if(num-sum < s) {
return false;
} else {
return true;
}
}
public sta... | logn | 817_C. Really Big Numbers | CODEFORCES |
// package cf1209;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.Random;
public class CFA {
privat... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
// LM10: The next Ballon d'or
import java.util.*;
import java.io.*;
import java.math.*;
import javafx.util.Pair;
public class Main
{
static class FastReader
{
private InputStream mIs;private byte[] buf = new byte[1024];private int curChar,numChars;public FastReader() { this(System.in); }public FastRead... | linear | 1038_D. Slime | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
import java.util.HashMap;
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;}
... | linear | 527_B. Error Correct System | CODEFORCES |
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.LinkedList;
import java.util.Scanner;
public class C {
static class Struct {
int x, y, count;
public Struct(int xx, int yy, int c) {
x = xx;
y = yy;
count = c;
... | cubic | 35_C. Fire Again | 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 | 1195_B. Sport Mafia | CODEFORCES |
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
public class c {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int numbOfStatements = in.nextInt();
long[] dp = new long[n... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import static java.lang.Math.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Map.Entry;
import java.util.StringTokenizer;
import java.util.TreeMap;
/**
*
* @author pttr... | np | 111_C. Petya and Spiders | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.