src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.util.*;
import java.io.*;
public class C{
static PrintWriter out;
static InputReader in;
public static void main(String args[]){
out = new PrintWriter(System.out);
in = new InputReader();
new C();
out.flush(); out.close();
}
C(){
int w = solve();... | linear | 1190_B. Tokitsukaze, CSL and Stone Game | CODEFORCES |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.math.*;
import java.util.*;
@SuppressWarnings("unused")
public class A {
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
long n = in... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.util.Arrays.*;
public class A {
private static final int mod = (int)1e9+9;
final IOFast io = new IOFast();
long k;
boolean ok(long n, long m, long x) {
long u = k * x;
long val = u;
... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
public class Paint {
public static void main (String srgs[] ){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
TreeSet<Integer> ts=new TreeSet<>();
for(int i=0;i<n;++i){
ts.add(sc.nextInt());
}
int x=0;
int a[]=... | quadratic | 1209_A. Paint the Numbers | 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)5e5+1, MX = (int)1e7+1, INF = (int)1e9, root = 3;
DecimalFormat df = new DecimalFormat("0.0000000000000");
double eps = 1e-9, PI = 3.14159265358... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.util.*;
public class codea{
public static void main(String args[])
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int arr[] = new int[n];
for(int i =0;i<n;i++)
arr[i]= in.nextInt();
Arrays.sort(arr);
int max =0;
boolean check[]= new boolean [n];
int count=0;
f... | 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.util.Arrays;
import java.util.StringTokenizer;
/*
*/
public class C455 {
static int N;
static final int mod = 1_000_000_007;
static int[][] memo;
static int[] list;
public static... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class test {
public static void main(String[] args) {
Scanner kb = new Scanner(System.in);
int n = kb.nextInt();
int a = kb.nextInt();
int b = kb.nextInt();
int array[] = new int[n];
for (int i = 0; i < n; i+... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public static void main(String[] args){
FastScanner sc = new FastScanner();
int n = sc.nextInt();
String nStr = Integer.toString(n);
String nStr1 = nStr.substring(0, nStr.length() - 1);
String nStr2 = nStr.substring(0, nStr.length() - 2) + n... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.*;
import java.math.*;
public class Main {
public void dfs(ArrayList<Integer>[] graph,int[] visited,int source) {
}
public ... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class B {
public static void main(String[] args) throws IOException {
InputReader in = new InputReader();
int n = in.nextInt();
int k = in.nextInt();
... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* Problem solution template.
* @author Andrew Porokhin, andrew.porokhin@gmail.com
*/
public class Problem01B implements Runnable {
static final long[] x1... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
import static java.lang.Math.abs;
/**
* 35C
*
* @author artyom
*/
public class FireAgain implements Runnable {
private BufferedReader in;
private PrintWriter out;
private StringTokenizer tok;
private void solve() throws IOException {
int... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
long num=in.nextLong();
long lcm=1;
if(num==2){
System.out.println(2);
System.exit(0);
}//End if
else if(num%2==0&&num%3!=... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.Arrays;
import java.util.Comparator;
import java.util.TreeSet;
public class Main {
public static StreamTokenizer tokenizer = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
public static int read... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
public class ASimpleTask {
static StreamTokenizer st;
static int nextInt() {
try {
st.nextToken();
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTra... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.InputMismatchException;
public class Cf2207C {
private static InputReader in = new InputReader(System.in);
private static OutputWriter out = new OutputWriter(System.out);
private static void solve() throws Exception {
int n = in.readInt();
String s = in... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class B{
static long []sum;
static int n;
public static void main(String[] args) throws IOException {
Scanner sc=new Scanner();
PrintWriter out=new PrintWriter(System.out);
n=sc.nextInt();
sum=new long [n+1];
for(int i=1;i<=n;i++)
sum[i]=sc.nextInt()+sum... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import static java.util.Arrays.*;
import static java.lang.Math.*;
import java.util.*;
import java.io.*;
public class A implements Runnable
{
public static void main(String [] args) throws IOException
{
new Thread(null, new A(), "", 1 << 20).start();
}
String file = "input";
BufferedReader input;
PrintWriter... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class A {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
cl... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
/**
* @Author Tran Quang Loc (darkkcyan)
* BEFORE READING CODE:
* Java is really lengthy (at least for Java 8). So I used the advantage of initialization block.
* Basically, every initialization block run before the constructor and they run in the declaration order.
* And as I understand, every properties (or glob... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String args[]) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(br.readLine());
System.out.println("0 0 "+n);}
}
| constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class A {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
long K = Long.valueOf(br.readLine());
long n = ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
StreamTokenizer in;
PrintWriter out;
static public void main(String[] args) throws IOException {
new Main().run();
}
int ni() throws IOException {
in.nextToken(); return (int) in.nval;
}
vo... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class BBi implements Runnable {
public static void main(String[] args) {
new Thread(new BBi()).run();
}
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer in;
PrintWriter out = new PrintWriter(System.out);
public String nextT... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.util.*;
import static java.lang.Math.*;
import java.io.*;
public class SolutionB {
public static void main(String args[])throws IOException{
Scanner sc = new Scanner(System.in);
int a[] = new int[1501];
for(int i = 0; i < 3; i++){
a[sc.ne... | constant | 911_C. Three Garlands | CODEFORCES |
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Math.round;
import static java.lang.Math.sqrt;
import static java.lang.System.exit;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import j... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import static java.util.Arrays.sort;
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.SortedSet;
import java.util.StringTokenizer;
import java.util.TreeSet;
public class SecondOrderStatistics ... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Test {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in), 1024 * 48);
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n, t[], g[], MOD = (int) 1e9 + 7;
static int[][][] memo1, memo2[], memo3[];
static int dp1(int idx, int remCnt, int remSum) {
if (idx == n)
return remSum == 0 && remCnt == 0 ? 1 : 0;
if (remCnt < 0 || remSum < 0)
return 0;
if (memo1[idx... | cubic | 1185_G2. Playlist for Polycarp (hard version) | 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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.TreeMap;
import java.util.Map;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at t... | nlogn | 527_C. Glass Carving | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
public class Round159ProblemA {
public static void main(... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.IOException;
import java.util.Arrays;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Random;
import java.util.NoSuchElementException;
import java.util.TreeSet;
import java.util.Collection;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at ... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.util.*;
public class TestClass
{
public static void main(String args[])
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
int k = in.nextInt();
int arr[] = new int[n+1];
for(int i =0;i<n;i++)
arr[i+1]= in.nextInt();
long sum[] = ne... | quadratic | 1197_D. Yet Another Subarray Problem | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner s=new Scanner(System.in);
double n=s.nextLong();
double k=s.nextLong();
double num=(-3+Math.sqrt(9+8*(n+k)))/2;
System.out.println((long)(n-num));
}
} | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
/*
* Heart beats fast
* Colors and promises
* How to be brave
* How can I love when I am afraid...
*/
//read the question correctly (is y a vowel? what are the exact constraints?)
//look out for SPECIAL CASES (n=1?) and overflow (ll vs int?)
//always declare multidime... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Random;
import java.io.Writer;
import java.util.StringTokenize... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.util.Scanner;
import java.io.*;
import java.util.*;
public class ReallyBigNumbers817c {
static long sd(String s) {
long c = 0;
for (int i = 0; i < s.length(); i++) {
c += s.charAt(i);
}
return c - s.length() * 0x30;
}
public static void main(Str... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
public class C{
static String s;
static long val[];
static int N,size;
static int index(char c){
if(c <= 'Z'){
return c - 'A';
}else{
return c - 'a' + ('Z' - 'A' + 1);
}
}
static int l(int i){
return (i<<1)+1;
}
static int r(int i){
return (i<<1)+2;
}
static void setup(i... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.Map.Entry;
public class StringsProb {
private void solve() throws IOException {
String s = nextToken();
int res = 0;
Map<String , Integer> m = new HashMap<String, Integer>();
for (int i = 0; i < s.length(); i... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class GB17C {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));
String[] dir = sc.readLine().spli... | quadratic | 908_C. New Year and Curling | CODEFORCES |
//package cf196;
import java.util.*;
import java.io.*;
public class A {
FastScanner in;
PrintWriter out;
final long mod = (long) 1e9 + 9 ;
public void solve() throws IOException {
long n = in.nextInt();
long m = in.nextInt();
long k = in.nextInt();
long l = n / k;
long c = n - m;
long mul2 = Math.max... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
import java.io.*;
public class SonyaExhibition {
static BufferedReader br;
static StringTokenizer tokenizer;
public static void main(String[] args) throws Exception {
br = new BufferedReader(new InputStreamReader(System.in));
int n = nextInt();
int[] arr = {0,1};
for(int i = 0; i < n; i... | linear | 1004_B. Sonya and Exhibition | CODEFORCES |
import java.io.*;
public class Alpha_Round {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
String[] in = reader.readLin... | logn | 1195_B. Sport Mafia | CODEFORCES |
//package Round_159;
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class a {
void solve() throws Exception {
int n = in.nextInt();
int m = in.nextInt();
int k = in.nextInt();
int a[] = new int[n];
for (int i = 0; i<n; i++){
a[i] = in.nextInt();
}
Arrays.sort(a);
in... | nlogn | 257_A. Sockets | 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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
public class c {
class IO {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class YoureGivenAString {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
String str = f.readLine();
int max = 0;
for (int i = 0; i < str.length(); i++)
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
public class D999 {
public static void main(String args[])throws IOException
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
int req=n/m;
int arr[]=new int[n+1];
int size[]=new int[m];
Lis... | linear | 999_D. Equalize the Remainders | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class A_135 {
/**
* @param args
*/
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
int[] mas=new int[n];
... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.Scanner;
public class Code1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.valueOf(sc.nextLine());
if (n % 2 == 0)
System.out.println(4 + " " + (n - 4));
else {
System.out.println(9 + " " + (... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.util.Scanner;
public class ToyArmy {
public static void main(String[] args) {
int n = new Scanner(System.in).nextInt();
System.out.println(n + n / 2);
}
}
| constant | 84_A. Toy Army | CODEFORCES |
import java.io.*;
import java.math.*;
import java.security.KeyStore.Entry;
import java.util.*;
public class QA {
static long MOD = 1000000007;
static boolean b[], b1[], check;
static ArrayList<Integer>[] amp, pa;
static ArrayList<Pair>[] amp1;
static ArrayList<Pair>[][] damp;
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution{
void solve()throws Exception
{
int n=nextInt();
int[]a=new int[n];
for(int i=0;i<n;i++)
a[i]=nextInt();
ArrayList<Integer>list=new ArrayList<Integer>();
for(int i=0;i<n;i++)
list.ad... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.util.*;
public class LearnMath {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N = scan.nextInt();
scan.close();
if ((N%2) == 0) {
System.out.println(4 + " " + (N-4));
}
else {
if (N > 18) {
System.out.println(9 + " " + (N-9));
}
else {... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.util.Scanner;
import static java.lang.Integer.bitCount;
import static java.lang.Integer.numberOfTrailingZeros;
import static java.lang.System.out;
/**
* 11D
*
* @author artyom
*/
public class ASimpleTask {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
... | np | 11_D. A Simple Task | CODEFORCES |
import com.sun.org.apache.xpath.internal.operations.Bool;
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
MyScanner scan = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int n = scan.nextIn... | nlogn | 1033_C. Permutation Game | CODEFORCES |
import java.io.*;
import java.text.*;
import java.util.*;
import java.math.*;
public class D {
public static void main(String[] args) throws Exception {
new D().run();
}
int[] BIT;
public void run() throws Exception {
FastScanner f = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int n = ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class Solution {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n=i... | constant | 84_A. Toy Army | CODEFORCES |
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual so... | logn | 338_A. Quiz | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
public class a implements Comparable<a>{
int x, y, id;
//static BufferedReader in;
//static StringTokenizer st;
public a(int x1, int y1,... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] wide = new int[n], sta = new int[n];
HashMap<Integer, Integer> hm = new HashMap<Integer, Integer>();
for (int i = 0; i < n; i++)... | nlogn | 982_B. Bus of Characters | 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) {
... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
public class A {
private void solve() throws IOExcept... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n, t[], g[], MOD = (int) 1e9 + 7;
static int[][][] memo1, memo2[], memo3[];
static int dp1(int idx, int remCnt, int remSum) {
if (idx == n)
return remSum == 0 && remCnt==0 ? 1 : 0;
if(remCnt<0 || remSum<0)
return 0;
if (memo1[idx][remCn... | cubic | 1185_G2. Playlist for Polycarp (hard version) | 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.Collections;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;
import java.util.StringTokeni... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class DD {
public static void main(String[] args)throws Throwable {
MyScanner sc=new MyScanner();
PrintWriter pw=new PrintWriter(System.out);
int n=sc.nextInt();
int [] a=new int [n];
for(int i=0;i<n;i++)
a[i]=sc.nextInt();
... | nlogn | 903_D. Almost Difference | CODEFORCES |
//package CodeforcesJava;
import java.io.*;
import java.util.*;
public class Main {
public void solve(InputProvider input, PrintWriter output) throws IOException {
int n = input.nextInt();
int d = input.nextInt();
int count = 1;
int current = input.nextInt();
for (int i = ... | linear | 1004_A. Sonya and Hotels | 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 Sandip Jana
*/
public clas... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
import java.util.regex.*;
public class Main {
static InputReader in;
public static void main(String[] args) throws IOException{
File file = new File("input.txt");
if(file.exists())in = new InputReader( new ... | nlogn | 257_A. Sockets | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Solution{
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 StringTokeniz... | linear | 1197_B. Pillars | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.FileNotFoundException;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.Buffer... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import static java.lang.Math.*;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class CFC23A implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer t... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
import java.io.*;
public class E {
public static void main(String[] args) {
FastScanner scanner = new FastScanner();
PrintWriter out = new PrintWriter(System.out, false);
int n = scanner.nextInt();
int m = scanner.nextInt();
char[] str = scanner.next().to... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.math.BigDecimal;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
public class Task16e {
/**
* @param args
*/
public static void main(String[] args) {
Scanner sc = new... | np | 16_E. Fish | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
long a=s.nextLong(), b=s.nextLong();
long c=0;
while(true) {
if(a==b ){
System.out.println(c+a);
return ;
... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.util.Random;
import java.util.Comparator;
import java.io.InputStream;
/**
* @author khokharnikunj8... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class a {
public static void main(String[] args) throws IOException
{
//Scanner input = new Scanner(new File("input.txt"));
//PrintWriter out = new PrintWriter(new File("output.txt"));
PrintWriter out = new PrintWriter(System.out);
input.init(System.in);... | 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.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = sc.nextInt();
Integer[] a = new In... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
public class A
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
long n=sc.nextLong();
if(n==0)
System.out.println(0);
else if(n%2==1)
System.out.println((n+1)/2);
else
System.out.println(n+1);
}
... | constant | 979_A. Pizza, Pizza, Pizza!!! | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class SFly {
public static void main(String[] args) throws IOException {
BufferedReader lector = new BufferedReader(new InputStreamReader(System.in));
int planet = Integer.parseInt(lector.readLine());
int ini... | linear | 1010_A. Fly | CODEFORCES |
import java.util.*;
import java.io.*;
public class B{
static int[][] hor;
static int[][] ver;
static int n;
static int m;
static int k;
static long[][][] dp;
static long dist(int row, int col)
{
if(k%2==1)return Integer.MAX_VALUE;
return 2*make(row,col,k/2);
}
static long make(int row, int col, int mo... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
publ... | quadratic | 908_C. New Year and Curling | CODEFORCES |
/*
* Code Author: Akshay Miterani
* DA-IICT
*/
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
public class A {
static double eps=(double)1e-15;
static long mod=(int)1e9+7;
public static void main(String args[]){
InputReader in = new InputReader(System.in);
OutputStream outpu... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1102F {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int m = Integer.... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class YouAreGivenAString {
public static void main(String[] args) throws Exception {
// TODO Auto-generated method stub
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
String s=r.readLine();
int max=0;
for(int ... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Main {
static class Point {
int x;
int y;
Point(int a, int b)... | 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.PrintWriter;
import java.util.StringTokenizer;
public class A {
public static void main(String[] args) throws IOException {
InputReader sc = new InputReader(System.in);
PrintWri... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class ProblemD {
static int n;
static int m;
static boolean[][] fire;
public static void main(String[] args) throws FileNot... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public final class subtractions
{
static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
static FastScanner sc=new FastScanner(br);
static PrintWriter out=new PrintWriter(System.out);
static long solve(long a,long b)
{
if(a<=0 || b<=0)
{
... | constant | 267_A. Subtractions | 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.math.BigInteger;
import java.util.HashMap;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution... | nlogn | 903_D. Almost Difference | CODEFORCES |
import java.util.HashSet;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
HashSet<Integer> set = new HashSet<>();
for(int i = 0; i<n; i++){
int a = sc.nextInt();
... | linear | 992_A. Nastya and an Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class pr1073B {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.... | linear | 1073_B. Vasya and Books | CODEFORCES |
import java.awt.Label;
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class Main implements Runnable {
private boolean _ReadFromFile = false;
private boolean _WriteToFile = false;
... | linear | 1_B. Spreadsheets | CODEFORCES |
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(Syste... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
// discussed with rainboy
import java.io.*;
import java.util.*;
public class CF915D {
static ArrayList[] aa;
static boolean[] visited, instack;
static int[] stack;
static int cnt, h_, i_, j_;
static boolean dfs1(int i) {
if (visited[i]) {
if (instack[i]) {
h_ = i;
return true;
}
return false;
... | quadratic | 915_D. Almost Acyclic Graph | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main{
public static long howMany(long n, long x, long y, long s){
long res = 0;
int cnt = 0;
long[] px = new long[9];
long[] py = new long[9];
if(x - s < 1){
... | 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.