src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.util.*;
import java.util.Map.Entry;
import java.io.*;
import java.lang.reflect.Array;
import java.math.*;
import java.security.SecureRandom;
public class WCS {
public static class Vector implements Comparable <Vector> {
long x, y;
int position;
Vector first, second;
boolean toReverse;
publ... | nlogn | 995_C. Leaving the Bar | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class A {
public void run() throws IOException {
final int n = IOFast.nextInt();
int[] xs = new int[n];
for(int i = 0; i < n; i++) {
xs[i] = IOFast.nextInt();
}
int[] ys = xs.clone();
... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
import java.awt.geom.*;
import static java.lang.Math.*;
public class Solution implements Runnable {
public void solve() throws Exception {
int n = nextInt();
int a [] = new int [n];
for (int i = 0 ;i < n; i++) {
a[i] = nextInt();
}
Arrays.sort... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;
public class B {
static ArrayList<Integer> [] adj;
static int [] num;
static int d... | linear | 1056_D. Decorate Apple Tree | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.UnsupportedEncodingException;
import java.util.StringTokenizer;
public class Main implements Runnable {
stat... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class A{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int mod=(int)1e9+9;
long n, m, k;
void run(... | logn | 338_A. Quiz | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
private static Node[] node;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int ret = 2, del;
int n = cin.nextInt();
int t = cin.nextInt() * 2;
node = new Node[n];
for (int i = 0; i < ... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
/**
@author KhanhNguyenn
*/
public class C{
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.*;
import java.util.*;
public class D11 {
static HashMap<State, Integer> map;
static long[][] ans;
static boolean[][] connect;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringToken... | np | 11_D. A Simple Task | CODEFORCES |
//package round429;
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 C2 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
in... | cubic | 840_C. On the Bench | 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.io.*;
import java.util.*;
public class A {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
void solve() throws IOException {
int n = nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.HashMap;
import java.util.HashSet;
public class C {
private static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
private static PrintStream out = Sys... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
if (n % 4 == 0 || n % 7 == 0 || n % 47 == 0 || n % 77 == 0 || n % 74 == 0 || n % 447 == 0 || n % 474 == 0 || n % 477 == 0 || n % 747 == 0 || n % 774 == 0 || n... | constant | 122_A. Lucky Division | 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.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamW... | quadratic | 909_C. Python Indentation | CODEFORCES |
/*
* The MIT License
*
* Copyright 2016 Mouad NACIRI <mouadnaciri1@gmail.com>.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the r... | constant | 630_A. Again Twenty Five! | CODEFORCES |
//~~~~~~~~~~~~~~~~~~~~~~~@@@@@@@@@@@@@@@_____________K_____S_____J__________@@@@@@@@@@@@@@@@@@@@@@@@@@@@~~~~~~~~~~~~~~~~~~~~~~~~~~
//Date:00/00/17
//-------------
import java.util.*;
import java.io.*;
/*
[[[[[[[[[[[[[[[ ]]]]]]]]]]]]]]]
[:::::::::::::: ::::::::::::::]
[::::::::::::... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.math.BigDecimal;
import java.io.BufferedWriter;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokenizer;
import java.math.B... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.nio.charset.Charset;
import java.util.Arrays;
public class CF1209E2 {
public static void main(String[] args) throws Exception {
boolean local = System.getSecurityManager() == n... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class E2
{
PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
// BufferedReader in;
StringTokenizer tok;
public void go() throws IOExceptio... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.TreeSet;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class Main {
public static void main(String args[]) {
... | quadratic | 1209_A. Paint the Numbers | 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;
public class Task267A {
public static void main(String... args) throws NumberFormatException,
IOException {
... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Solution solution = new Solution();
System.out.println(solution.solve());
}
private int solve() {
Scanner in = new Scan... | nlogn | 1011_B. Planning The Expedition | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: Taras_Brzezinsky
* Date: 8/14/11
* Time: 9:53 PM
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.FileReader;
import java.util.StringTokenizer;
imp... | np | 16_E. Fish | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class A {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
String l[] = bf.readLine().split(" ");
System.out.println(25);
}
} | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.util.*;
public class p343A
{
static long n = 0;
static void resistance(long a, long b)
{
n += a/b;
a %= b;
if(a!=0) resistance(b, a);
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long a = in.nextLong();
... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.awt.*;
import java.io.*;
import java.math.*;
import java.util.*;
import static java.lang.Math.*;
public class BetaRound81_B implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
public static void main(String[] args) {
new Thread(... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
public class C {
private static double r, EPS=1e-10;
public static void solve(FastScanner fs) {
int n=fs.nextInt();
r=fs.nex... | quadratic | 908_C. New Year and Curling | 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 javafx.util.*;
import java.util.*;
import java.io.*;
import java.math.*;
public class Test4 {
PrintWriter pw = new PrintWriter(System.out); InputStream is = System.in;
Random rnd = new Random();
int a;
void run(){
a = ni();
for(int q=0; q<a; q++){
long nj = ni(), k... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.util.*;
import java.math.*;
// **** B. Sport Mafia ****
public class B {
static char [] in = new char [1000000];
public static void main (String [] arg) throws Throwable {
int n = nextInt();
int k = nextInt();
long ate = 0;
long ans = -1;
for (long i = 1; ans < 0; ++i) {
long test = (i *... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
public class Main
{
static int MAX = 1000;
static BitSet P = new BitSet(MAX + 1);
public static boolean Noldbach(int n)
{
n--;
int j;
for(int i=2; i<=n; i++)
{
if(!P.get(i))
{
j = i + 1;
while(P.get(j))
j++;
if(i+j == n)
{
if(!P.get(i... | linear | 17_A. Noldbach problem | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: Taras_Brzezinsky
* Date: 8/13/11
* Time: 6:10 PM
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.io.IOException;
public class Da... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
public class Main {
public static void main(String[] args) throws IOException {
// write your code here
BufferedReader reader = new Buf... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.System.out;
public class Main {
private FastScanner scanner = new FastScanner();
public static void main(String[] args) {
new Main().solve();
}
private List<Integer>[] gr = new ArrayList[1000_000+5];
private int dp[][] = new ... | nlogn | 980_E. The Number Games | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.TreeSet;
public class Main {
public static void main(String [] args ) {
try{
String str;
BufferedReader br = new BufferedReader(new In... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
/**
* Mx 04:06:52 ص 14/01/2014
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
StringBuilder line = new StringBuilder(re... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin = new Scanner(System.in);
int n;
n = cin.nextInt();
String s = cin.next();
int ans = n;
int cntH = 0,cntT = 0;
for(int i=0;i<n;i++)
{
if(s.char... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Solution {
private static int[] a;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), m = sc.nextInt();
a = new int[101];
for (int i = 0; i < m; i++) {
... | nlogn | 1011_B. Planning The Expedition | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
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.HashMap;
import java.util.HashSet;
import ja... | constant | 915_B. Browser | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
import java.awt.*;
public class PracticeProblem
{
/*
* This FastReader code is taken from GeeksForGeeks.com
* https://www.geeksforgeeks.org/fast-io-in-java-in-competitive-programming/
*
* The article was written by Rishabh Ma... | cubic | 35_C. Fire Again | 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.util.Scanner;
import java.util.InputMismatchException;
import java.util.HashMap;
import java.io.IOException;
import java.util.ArrayList... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Solution implements Runnable {
private BufferedReader in;
private PrintWriter out;
private StringTokenizer st;
private Random rnd;
double Vend;
private double calcFirstSegment(double a, double Vmax, double Vend, double l) {
double Vl = ... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.util.*;
public class Rules {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int a = in.nextInt();
double maxSpeed = in.nextInt();
double len = in.nextInt();
double delayDist = in.nextInt();
double delaySpeed = in.nextInt();
double timeToDela... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static InputReader in = new InputReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
long n = in.nextLong();
long s = in.nextLong();
if(diff(n) < s) {
System.out.println(0);
... | logn | 817_C. Really Big Numbers | CODEFORCES |
/**
* @author Juan Sebastian Beltran Rojas
* @mail jsbeltran.valhalla@gmail.com
* @veredict
* @url https://codeforces.com/problemset/problem/1238/E
* @category dp
* @date 19/10/2019
**/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.util.*;
import java.io.*;
public class _1004_A {
public static void main(String[] args) throws IOException {
int N = readInt(), D = readInt(); long arr[] = new long[N+2]; arr[0] = -3000000000L; arr[N+1] = -arr[0];
for(int i = 1; i<=N; i++) arr[i] = readInt();
int cnt = 1; if(Math.abs(arr[2]-(arr[1]... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
/* spar5h */
public class cf1 implements Runnable{
public void run() {
InputReader s = new InputReader(System.in);
PrintWriter w = new PrintWriter(System.out);
int t = 1;
while(t-- > 0) {
int n = s.nextInt(), m ... | linear | 1010_A. Fly | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Pradyumn
*/
public class M... | quadratic | 911_D. Inversion Counting | CODEFORCES |
//package contest10D;
import java.math.*;
import java.util.*;
import static java.math.BigInteger.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class Main {
static void debug(Object... os) {
System.err.println(deepToString(os));
}
public static ... | np | 11_D. A Simple Task | CODEFORCES |
// Author : RegalBeast
import java.io.*;
import java.util.*;
public class Main {
static final FastReader FR = new FastReader();
static final PrintWriter PW = new PrintWriter(new OutputStreamWriter(System.out));
public static void main(String[] args) {
StringBuilder solution = new StringBuilder();
int r... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class Prob015A
{
public static void main( String[] Args )
{
Scanner scan = new Scanner( System.in );
int numHouses = scan.nextInt();
int side = scan.nextInt() * 2;
ArrayList<Integer> sid... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.Scanner;
public class A{
public static void main(String[] args){
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int prev2=0;
int prev1=1;
int prev=1;
int curr = 2;
if(n == 0) {System.out.println("0 0 0"); return;}
else if(n == 1) {System.out.println("0 0 1");return;}
whil... | 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.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Xinyi Tao
*/
public class Main {
public static void main(String[] args) {
InputStream... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
static int[][][]memo;
static int inf=(int)1e9;
static int n,m,down[][],right[][];
static int dp(int i,int j,int k) {
if(k<=0)return 0;
if(memo[i][j][k]!=-1)return memo[i][j][k];
int ans=inf;
if(i+1<n) {
ans=Math.min(ans, down[i][j]+dp(i+1, j, k-1)... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.Scanner;
public class Digits_Sequence_Hard_Edition_Kamel {
public static void main(String [] args) {
Scanner sc = new Scanner(System.in);
long k = sc.nextLong();
getResult(k);
sc.close();
}
static void getResult(long k) {
long val = 0;;
long ten = 1;
int i = 1;
while(true) {
va... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
public class B implements Runnable {
int a;
int[] b;
int[] l;
public void solve() throws IOException {
int n = in.nextInt();
int k = in.nextInt();
a = in.nextInt();
b = new int[n];
... | np | 105_B. Dark Assembly | CODEFORCES |
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.lang.reflect.*;
public class A {
final int MOD = (int)1e9 + 7;
final double eps = 1e-12;
final int INF = (int)1e9;
public A () {
int N = sc.nextInt();
int M = sc.nextInt();
int K = sc.nextInt();
In... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static long func(long a, long b) {
if (a < b)
return func(b, a);
if (b < 2)
return a;
long q = a / b;
long r = a - q * b;
return q + func(b, r);
}
public static v... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.LinkedList;
import java.io.FileInputStream;
import java.util.Arrays;
import java.util.ArrayList;
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;
imp... | cubic | 35_C. Fire Again | CODEFORCES |
import static java.util.Arrays.deepToString;
import java.io.*;
import java.math.*;
import java.util.*;
public class A {
static int [] solve(int [] a) {
int n = a.length;
Arrays.sort(a);
a[n - 1] = (a[n - 1] > 1 ? 1 : 2);
int [] b = Arrays.copyOf(a, n);
Arrays.sort(b);
return b;
}
public static void m... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class PaintTheNumbers {
public static void main(String[] args) throws IOException {
int[] colors = new int[101];
BufferedReader f = new Bu... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
public class Village {
private class House implements Comparable<House> {
Double Coordinate;
Double Sidelength;
private House(double coordinate, double sidelength) {
Coordinate = coordinate;
Sidelength = sidelength;
}
public int compareTo(House o) {
return Coordinate.compare... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class E {
public static void main(String[] args) throws Exception {
new Thread(null ,new Runnable(){
public void run(){
try{solveIt();} catch(Exception e){e.printStackTrace(); System.exit(1);}
... | np | 1209_E1. Rotate Columns (easy version) | 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.math.BigInteger;
import java.util.Scanner;
/*
* 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.
*/
/**
*
* @author Andy Phan
*/
public class p1096f {
static long MOD = 9... | nlogn | 1096_F. Inversion Expectation | CODEFORCES |
import java.io.*;
import java.util.*;
public class TaskE {
static int[][] transpose(int[][] a, int n, int m) {
int[][] t = new int[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
t[j][i] = a[i][j];
}
}
return t;
}
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.lang.Math;
import java.io.*;
import java.util.*;
public class Main {
static BufferedReader in;
static PrintStream out;
static StringTokenizer tok;
@SuppressWarnings("empty-statement")
public static void main(String[] args) throws NumberFormatException... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.Arrays;
/**
* @author piuspratik (Piyush Das)
*/
public class TaskA {
class Contest implements Comparable<Contest>
{
int problems;
int penalty;
Contest (int problems, int penalty) {
this.problems = problems;
this.penalty = penalty;
}... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Scanner;
public class d_169 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long x=sc.nextLong();
long y=sc.nextLong();
String s=Long.toBinaryString(x);
String p=Long.toBinaryString(y);
int id=p.length()-s.length();
for (int i =1; i <=id; i++) {
s="0"+s;
}
... | 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.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... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStrea... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Contest200C {
public static void main(String[] args) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
//BufferedReader in = new BufferedReader(new FileReader("200C.in"));
StringTokenizer st = new String... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class phoenix_and_computers {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] st = br.readLi... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class OverlapedString {
public static void main(String args[]) throws Exception {
OverlapedString os = new OverlapedString();
BufferedReader stdin =
new BufferedReader(new InputStreamReader(System.in));
String line;
while ((line = std... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;
import static java.lang.Math.*;
import static java.lang.Integer.*;
import static java.lang.Long.*;
import static java.lang.Character.*;
import s... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.BufferedReader;
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.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
import java.util.TreeM... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
Long N = sc.nextLong();
Long ans;
sc.close();
if(N <= 2)
System.out.println(N);
else{
if(N % 6 == 0){
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Scanner;
/** UVA 10130 - SuperSale */
public class Main {
/** totally n products, max Weight is w */
... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class SolutionE extends Thread {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new B... | cubic | 1497E2 | CODEFORCES |
import java.util.*;
public class Main{
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int a[]=new int[n];
for(int i=0;i<n;i++)
a[i]=sc.nextInt();
Arrays.sort(a);
//boolean
int t=1,c=0;
for(int i=1;i<n;i++){
if(a[i]==a[i-1]... | linear | 1190_B. Tokitsukaze, CSL and Stone Game | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main (String[] args) {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
try {
String parameterStringList[] = reader.readLine(... | constant | 1054_A. Elevator or Stairs? | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class B {
public static void main(String[] args) throws Exception {
new B().solve(System.in, System.out);
// new FileInputStream(new File("input.txt")),
// new PrintStream(new FileOutputStream(new File("output.txt"))));
}
... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
import static java.lang.Math.*;
public class Main{
public void go(){
int n=sc.nextInt(), k=sc.nextInt(), A=sc.nextInt();
ArrayList< ArrayList< Integer > > waysGiveCandies = doit1(n, k, new ArrayList< Integer >());
/*
System.out.... | np | 105_B. Dark Assembly | CODEFORCES |
/**
*
* @author ishani
*/
import java.util.*;
public class A {
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++){
int a = sc.nextInt();
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class A implements Runnable{
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
// CodeForces Round #914 B train done
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class SportMafia {
int n,k;
int nCand;
private void readData(BufferedReader bin) throws IOExceptio... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
/**
*
* @author Fuad
*/
public class Codeforces {
private static boolean greater(long... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class P817C
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long s = scan.nextLong();
long ans = 0;
if (s > n)
{
System.out.println(0);
return;
}
if (n > s+200)
{
ans += n-... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.concurrent.atomic.AtomicReferenceArray;
public class NastyaWardrobe {
static long modulo = 1000000007;
static long ans = 0;
public static void main(String[] args) thro... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class r584p5 {
private static BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
private static PrintWriter pw = new PrintWriter(System.out);
private static int n, m, arr[][];
private static ArrayList<HashSet<Integer>> chls;
privat... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.Scanner;
/*
* 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.
*/
/**
*
* @author Madi
*/
public class A630 {
public static void main(String[] args) {
Scanne... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.StringTokenizer;
public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedRe... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.stream.IntStream;
public class Test {
static PrintWriter writer =
new PrintWriter(new BufferedWrite... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
// practice with rainboy
import java.io.*;
import java.util.*;
public class CF903F {
static final int INF = 0x3f3f3f3f;
static void fill(int[][][][] aa, int a) {
for (int h0 = 0; h0 <= 4; h0++)
for (int h1 = 0; h1 <= 4; h1++)
for (int h2 = 0; h2 <= 4; h2++)
for (int h3 = 0; h3 <= 4; h3++)
aa[h0][... | linear | 903_F. Clear The Matrix | CODEFORCES |
import java.util.*;
public class CottageVillage {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int size=sc.nextInt();
int side=sc.nextInt();
ArrayList<Pair> lis=new ArrayList<Pair>();
for(int x=0;x<size;x++)
{
lis.add(new Pair(sc.nextInt(), sc.nextInt()));
}
Coll... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.security.SecureRandom;
import java.util.*;
import java.math.*;
import java.awt.geom.*;
import static java.lang.Math.*;
public class Solution implements Runnable {
class Pair implements Comparable<Pair> {
int col;
int time;
int place;
... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map.Entry;
import java.util.Random;
import j... | np | 1242_C. Sum Balance | CODEFORCES |
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.concurrent.LinkedBlockingQueue;
public class D {
static long n;
static long x;
static long y;
static long c;
static long f(long t){
long s=0;
if(t==0)... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.