src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import java.util.*;
public class CF1027D {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
int[] cc = new in... | linear | 1027_D. Mouse Hunt | CODEFORCES |
//package round43;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class C {
static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer st;
static PrintWri... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF387D {
static class A {
ArrayList<Integer> list = new ArrayList<>();
int u, v, d;
}
static int INF = Integer.MAX_VALUE;
static boolean bfs(A[] aa, int n) {
LinkedList<Integer> q = new LinkedList<>();
for (int u = 1; u <= n; u++)
if (aa[u].v > 0)
a... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.PrintWri... | np | 111_C. Petya and Spiders | CODEFORCES |
/**
* @author egaeus
* @mail sebegaeusprogram@gmail.com
* @veredict Accepted
* @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;
import static... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner t=new Sca... | constant | 483_A. Counterexample | 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.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextLong();
long s = scanner.nextLong();
long l = 0, r = n + 1;
while(r - l > 1) {
long mid = (l + r) / 2;
long k = mid, sum = 0... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Problem {
public static void main(String[] arg){
FastScanner scan = new FastScanner(System.in);
PrintWriter out = new PrintWriter(System.out);
... | np | 16_E. Fish | CODEFORCES |
import java.util.*;
public class Solution
{
public static void main(String[] args)
{
new Solution().calc();
}
void calc()
{
Scanner cin = new Scanner(System.in);
String s = cin.next();
int ret = 0;
for (int i = 0; i < s.length(); i++)
{
f... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class AAA {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = in.nextInt();
int max = a[0];
... | nlogn | 135_A. Replacement | CODEFORCES |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
Class<?> here = new Object(){}.getClass().getEnclosingClass();
try {
String packageName = here.getPackage().getName();
package... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class cf337c {
static long mod,n,m,k;
public static void ... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import java.text.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int T =sc.nextInt();
int t =T/2;
System.out.println(t*3);
}
} | constant | 84_A. Toy Army | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Bit... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.util.*;
import java.io.*;
public class cf5722{
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st=new StringTokenizer(br.readLine());
long n=Long.parseLong(st.nextToken());
long k=Long.parseLong(st.ne... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
Task solver = new Task();
solver.solv... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.regex.*;
public class Main {
static Scanner scan = new Scanner (System.in);
static PrintStream out = System.out;
static int n;
static void solve () {
System.out.println (0 + " " + 0 + " " + n);
}
public static void main (String[] args) {
n = scan.ne... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.Random;
import java.util.StringJoiner;
import java.util.StringTokenizer;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.Function;
public class Main {
static int T;
public static void main(String[] args) {
FastScanne... | nlogn | 1027_C. Minimum Value Rectangle | CODEFORCES |
import java.io.*;
import java.util.*;
public class C implements Runnable{
public static void main (String[] args) {new Thread(null, new C(), "_cf", 1 << 28).start();}
long MOD = (long)1e9+7;
public void run() {
FastScanner fs = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
System.err.pr... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class A {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int N = s.nextInt();
int K = s.nextInt();
int[] primes = getPrimesFast(N);
Set<Integer> ints = new HashSet... | linear | 17_A. Noldbach problem | CODEFORCES |
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
public static void main (String[] args) throws java.lang.Exception
{
BufferedReader br=new Bu... | nlogn | 903_D. Almost Difference | CODEFORCES |
import java.util.ArrayList;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.io.BufferedReader;
import java.util.List;
import java.util.Map;
import java.math.BigInteger;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.ut... | linear | 468_B. Two Sets | 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.util.ArrayList;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author... | quadratic | 1015_B. Obtaining the String | CODEFORCES |
import java.io.*;
import java.util.*;
public class test
{
public static void main(String[] args)
{
new test().run();
}
PrintWriter out = null;
void run()
{
Scanner in = new Scanner(System.in);
out = new PrintWriter(System.out);
int n = in.nextInt();
int a = in.nextInt();
int b = in.nextInt();
... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.Collection;
import java.io.FileWriter;
import java.io.IOException;
import java.io.FileInputStream;
import java.io.InputStreamReader;
i... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
long k;
private void solve() throws IOException {
long n = nl();
k = nl();
... | logn | 287_B. Pipeline | CODEFORCES |
import java.text.DecimalFormat;
import java.util.Scanner;
public class A {
public static void main(String[] args){
try{
Scanner scanner = new Scanner(System.in);
String in = scanner.next();
int max = 0;
for(int j=0;j<in.length()-1;j++){
for(in... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
public class ElevatorOrStairs {
private static final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static final OutputStreamWriter writer = new OutputStreamWriter(System.out);
... | constant | 1054_A. Elevator or Stairs? | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException{
Scanner cin = new Scanner(System.in);
int t, n, m;
t = cin.nextInt();
while(t > 0) {
t--;
int sum = 0;
n = cin.nextInt();
m = cin.nextInt();
while(n > 0 && m > 0) {
... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.*;
public class KingEscape {
public static void main(String[] args) {
Reader read = new Reader();
int n = read.nextInt();
int a1 = read.nextInt();
... | constant | 1033_A. King Escape | CODEFORCES |
import java.util.Scanner;
public class D {
static long[][][] dp;
static int[][] hor, ver;
static int n, m;
static int[][] dir = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
public static boolean isValid (int row, int col) {
return row >= 0 && col >= 0 && row < n && col < m;
}
public static... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
Outpu... | constant | 472_A. Design Tutorial: Learn from Math | 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.*;
import java.util.*;
public class ProblemD {
InputReader in; PrintWriter out;
void solve() {
long l = in.nextLong();
long r = in.nextLong();
long ans = 0;
boolean add = false;
for (int k = 62; k >= 0; k--) {
long cb = (1L << k);
i... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Problem220A {
static int[] numbers;
static int[] numbersCopy;
public static void main(String[] args) throws IOException {
BufferedRe... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.util.*;
import java.io.*;
public class a {
public static void main(String[] args) throws IOException
{
input.init(System.in);
int n = input.nextInt(), k = input.nextInt();
TreeSet<Integer> ts = new TreeSet<Integer>();
int[] data = new int[n];
for(int i = 0; i<n; i++)
{
data[i... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class A {
BufferedReader reader;
StringTokenizer tokenizer;
PrintWriter out;
public void solve() throws IOException {
long A = nextLong();
long B ... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Bit... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exception {
InputStream inputStream =... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.TreeSet;
public class E {
static Scanner in; static int next() throws Exception {return in.nextInt();};
// static StreamTokenizer in; static int next() throws Exception {in.nextToken(); return (int) in.nval;}
// static BufferedReader in;
st... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Solution {
static class Team implements Comparable<Team> {
int pr;
int time;
int id;
public Team(int P, int T, int I)... | nlogn | 166_A. Rank List | CODEFORCES |
import java.awt.*;
import java.awt.event.*;
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;
/*
br = new BufferedReader(new FileReader("input.txt"));
pw = new PrintWriter(new BufferedWriter(new FileWriter("outp... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
public class B {
public static void main (String[] args) throws IOException {
BufferedReader b = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(b.readLine());
while (n-- > 0) {
String s = b.readLine();
if (s.matches("... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in =new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
int[] arr = new int[n];
for(int i = 0; i < n; i++)
arr[i] = in.nextInt();
for(int i = n-1; i > 0; i--)
arr[i] -= arr[i-1];
arr[0] = 0;
A... | nlogn | 1197_C. Array Splitting | CODEFORCES |
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;
import java.util.Scanner;
import java.util.ArrayList;
public class Main {
static int d[][];
static int N;
static boolean used[];
static class point
... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
public class Main{
Scanner sc=new Scanner(System.in);
void run(){
int n = sc.nextInt();
int x[] = new int [n];
for (int i=0;i<n;i++)
x[i] = sc.nextInt();
java.util.Arrays.so... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
import java.io.*;
public class E74 {
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();
String s = sc.next();
long t... | np | 1238_E. Keyboard Purchase | CODEFORCES |
// Don't place your source in a package
import javax.swing.*;
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
import java.util.stream.Stream;
// Please name your class Main
public class Main {
static FastScanner fs=new F... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main
{
public static void main(String[] args) throws IOException
{
PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
Scanner in=new Scanner(new File("input.txt"));
int n,m,k;
n=in.nextInt();
m=in.nextInt();
... | 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.Arrays;
import java.util.List;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
impo... | cubic | 840_C. On the Bench | CODEFORCES |
import java.util.*;
import java.io.*;
public class LCMChallenge
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
if(n < 3)
{
System.out.println(n);
}
else if(n % 2 == 1)
{
System.out.println((long)n * (n - 1) * (n - 2));
}
else
{
... | constant | 235_A. LCM Challenge | 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();
if(r-l < 2 ){
System.out.println("-1");
}
else if... | constant | 483_A. Counterexample | 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.
*/
//package NumberTheory;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
*
* @autho... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class ChainReaction {
public static void main(String [] args) {
Scanner kb = new Scanner(System.in);
int num = kb.nextInt();
int[] beacons = new int[1000002];
for (int i=0; i<num; i++) {
beacons[kb.nextInt()] = kb.nextInt();
}
int [] dp = new int[1000002];
int... | linear | 608_C. Chain Reaction | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Train_A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int [] h = new int[n];
for (int i = 0; i < n; i... | nlogn | 169_A. Chores | 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... | logn | 1019_B. The hat | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
/**
* Created by IntelliJ IDEA.
* User: piyushd
* Date: Dec 5, 2010
* Time: 4:09:41 PM
* To change this template use File | Settings | File Templates.
*/
public class HamstersTigers {
private BufferedReader in;
private PrintWriter out;
private Strin... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
import java.io.*;
public class ASimpleTask
{
/************************ SOLUTION STARTS HERE ***********************/
static long memo[][];
static int graph[];
static long hamiltonianPath(int mask , int u) {
if(memo[mask][u] != -1)
return memo[mask][u];
else if(u == Intege... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static InputReader in = new InputReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
static long oo = 1000000000000L;
public static void main(String[] args) throws IOException {
int n = in.nextInt();
int q = in.nextInt()... | linear | 1180_C. Valeriy and Deque | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class PipelineRedo {
public static void main(String[] args){
FastScanner sc = new FastScanner();
long n = sc.next... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class ProblemB3 {
Map<Integer, List<int[]>> dest;
private ProblemB3() throws IOException {
BufferedReader rd = new BufferedReader(new InputStreamReader(System.in));
String h ... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class Main {
static StreamTokenizer st=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
public static void main(String[] args) {
in... | nlogn | 1159_C. The Party and Sweets | CODEFORCES |
import java.io.*;
import java.util.*;
public class a23
{
public static void main(String args[])throws IOException
{
InputStreamReader read=new InputStreamReader(System.in);
BufferedReader in=new BufferedReader(read);
String s,subs;
// System.out.println("Enter");
s=in.read... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
public class cf343a {
static FastIO in = new FastIO(), out = in;
public static void main(String[] args) {
out.println(go(in.nextLong(),in.nextLong()));
out.close();
}
static long go(long a, long b) {
return b==0?0:(go(b,a%b) + a/b);
}
static class FastIO ... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.util.Scanner;
public class TreasureHunt {
public static String Solve() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine();
String kuro = sc.nextLine(), shiro = sc.nextLine(), katie = sc.nextLine();
sc.close();
String[] output = {"Kuro", "Shiro", "Katie", "Draw"};
if... | linear | 979_B. Treasure Hunt | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHel... | logn | 817_C. Really Big Numbers | CODEFORCES |
/*
Keep solving problems.
*/
import java.util.*;
import java.io.*;
public class CFA {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
private static long MOD = 1000L * 1000L * 1000L + 7;
private static final int[] dx = {0, -1, 0, 1};
private static final int[] dy = {1,... | nlogn | 1080_E. Sonya and Matrix Beauty | CODEFORCES |
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner x=new Scanner(System.in);
int n=x.nextInt();
if(n%2==0){
System.out.println((n-4)+" "+"4");
}
... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String [] args){
Scanner in=new Scanner(System.in);
int n=in.nextInt();
double value[][]=new double[n][n];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)value[i][j]=in.nextDouble();
double ans[]=new double[1<<n];
int mask=(1<<n);
ans[(1<<n)-1]=1.0;
... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
/**
* Created by aditya on 5/3/17.
*/
public class Main3 {
static long x, k;
static long MOD = (long)1e9 + 7;
public static void main(String args[]) throws Exception{
FastInput fi = new FastInput(new InputStreamReader(System.in)... | 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.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Jeel Vaishnav
*/
public cl... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.SplittableRandom;
import java.math.BigInteger;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using C... | nlogn | 903_D. Almost Difference | 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 ... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class Noldbach
{
public Scanner in = new Scanner(System.in);
public PrintStream out = System.out;
public boolean[] yes;
public int n, k;
public void main()
{
n = in.nextInt();
k = in.nextInt();
genPrime();
int i;
yes = new boolean[n+1];
int x;
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.Scanner;
public class C {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long s = scan.nextLong();
long low = 0;
long high = n + 1;
while (high-low>1) {
long sum = 0;
long mid = (high + low) / 2;
long value = findSum(mi... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.S... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.Locale;
import java.util.Scanner;
public class PipelineSolver {
private long n;
private long k;
public static void main(String[] args) {
PipelineSolver solver = new PipelineSolver();
solver.readData();
int solution = solver.solve();
solver.print(solution... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class E_fast {
static int g[][];
static int n, m;
static char[] s;
static int dp[], inf = (int) 2e9;
static int cost[][];
public static void main(String[] args) throws Exception {
InputReader in = new InputRea... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution
{
public static void main(String [] args) throws IOException
{
PrintWriter pw=new PrintWriter(System.out);//use pw.println() not pw.write();
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenize... | linear | 1011_A. Stages | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class MAIN
{
public static void main(String args[])
{
Scanner sn=new Scanner(System.in);
int n,n1,n2,n3;
int arr[]={0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,17711,28657,46368,75025,121393,196418,317811,514229,83... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner scan=new Scanner(System.in);
long ... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class utkarsh{
BufferedReader br;
PrintWriter out;
int game(int s, int mid, int e, int[] a){
int i, j, n, m;
n = mid - s + 1;
m = e - mid;
int b[] = new int[n];
int c[] = new int[m];
for(i = 0; i < n; i++) b[i] = a[s + i];
for(j = 0; j < m; j++) c[j] = a[m... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
static long mod = 1000000007;
static int INF = 1000000000;
public static void main(String[] args){
FastScanner scanner = new FastScanner();
int n = scanner.nextInt();
int m = scanner.nextInt();
String s = scanner.next();
int[][] cnt = new int[20][... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import sun.reflect.generics.tree.Tree;
import java.io.*;
import java.math.BigInteger;
import java.net.Inet4Address;
import java.util.*;
public class l {
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////... | nlogn | 527_C. Glass Carving | CODEFORCES |
import java.util.Scanner;
public class B2 {
public static void main (String args[]){
Scanner in = new Scanner(System.in);
long n = in.nextLong();
long k = in.nextLong();
long upn = k;
long tmp=upn;
if(n==1){
System.out.println(0);
return;
}
if(n<=k){
System.out.println(1);
return;
}
/... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String ...args) throws Throwable {
Scanner in = new Scanner(System.in);
String init = in.nextLine();
HashSet<String> h = new HashSet<String>();
for (int len = init.length() - 1; len... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.HashMap;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.io.InputStream;
/**
* Bui... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.*;
public class a{
static BufferedReader br;
static PrintWriter pw;
static int N, M, K;
static ArrayList<Integer> graph[][];
public static void main(String args[]) throws IOException{
br = new BufferedReader(new InputStreamReader(System.in));
pw = ... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author hheng
*/
public class Main {
public static void main(String[] args) {
In... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Solution implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
int[] x;
int[] y;
int n;
int X, Y;
int[] d;
int[][] dist;
int sqr(int a) {
return a * a;
}
... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import java.awt.Point;
public class CodeForces {
static boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
private final long MOD = 1000000009;
long power(long a, long b)
{
long res ... | logn | 338_A. Quiz | CODEFORCES |
import java.util.Scanner;
public class B {
public static final boolean DEBUG = false;
Scanner sc;
public void debug(Object o) {
if (DEBUG) {
int ln = Thread.currentThread().getStackTrace()[2].getLineNumber();
String fn = Thread.currentThread().getStackTrace()[2].getFileName();
System.out.println("(" +... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String args[]) throws IOException {
BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
String line = stdin.readLine();
String[] prms = line.split(" ");
long a = Long.parseLong(prms[0]);
... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Scanner;
public class Solution {
private static final long MODULUS = 1000000007;
private static final boolean DEBUG = false;
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.Locale;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.RandomAccess;
import java.util.AbstractList;
import java.io.Writer;
import java.util.List;
import java.io.IOException;
import java.math.BigDecimal;
import ... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.DecimalFormat;
public class Main{
final long mod = (int)1e9+7, IINF = (long)1e19;
final int MAX = (int)1e6+1, MX = (int)1e7+1, INF = (int)1e9, root = 3;
DecimalFormat df = new DecimalFormat("0.0000000000000");
double eps = 1e-9;
FastReader in;... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static class FastScanner {
BufferedReader br;
StringTokenizer st;
public FastScanner() {
try {
br = new BufferedReader(new InputStreamReader(System.in));
st = new StringTokenizer(br.readLine... | linear | 996_B. World Cup | CODEFORCES |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class D911 {
public static long total = 0;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
ArrayList<Integer> temp = new ArrayList<>();
int[... | quadratic | 911_D. Inversion Counting | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.