src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.util.Map;
import java.... | np | 1242_C. Sum Balance | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.InputMismatchException;
public class R113_D2_A {
public static void main(String[] args) throws NumberFormatException,
IOException {
// BufferedReader in = new BufferedReader(new
// InputSt... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class p2 {
final static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
private static String ss() throws IOE... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
int[] level;
int[] loyal;
double ans;
int n, k, plLev, needVotes;
double check() {
//System.err.println(Arrays.toString(loyal));
... | np | 105_B. Dark Assembly | 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.io.*;
import java.util.*;
public class Codechef{
static int max=Integer.MIN_VALUE;
static int res=0;
static int[] checkMax(int arr[],int j){
int sum=0;
int x=arr[j];
while(x!=0){
if(j+1==15){
j=0;
}else{
... | constant | 975_B. Mancala | CODEFORCES |
import java.util.Scanner;
public class Contest25_A {
static int[] parity;
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int numberEntries = scan.nextInt();
scan.nextLine();
String[] numbers = scan.nextLine().split(" ");
... | linear | 25_A. IQ test | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class ProblemE_16 {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE")!=null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenize... | np | 16_E. Fish | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
public class lc1 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();
in... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public class D implements Runnable {
public static void main(String[] args) {
new D().run();
}
class FastScanner {
BufferedReader br;
StringTokenizer st;
boolean eof;
String buf;
public FastScanner(String fileName) throws FileNotFoundException {
br = new Buffer... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.BigInteger;
import java.util.Map.Entry;
import static java.lang.Math.*;
public class A extends PrintWriter {
void run() {
int n = nextInt();
int m = 101;
boolean[] c = new boolean[m];
for (int i = 0; i < n; i++) {
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class Sockets {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = in.nextInt(), m = in.nextInt(), socket = in.nextInt();
... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.Comparator;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.io.IOException;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.math.BigInteger;
import java.io.InputSt... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.util.*;
public class Main {
private static void solve() throws IOExcept... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.IOException;
import java.util.Arrays;
import java.io.FilterInputStream;
import java.util.HashMap;
import java.util.Iterator;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.TreeSet;
import java.io.BufferedInputStream;
import java.io.InputStream;
/**
* Built using CHelper plug-... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
int n;
void run()throws IOException{
Scanner sc = new Scanner(new InputStreamReader(System.in));
n = sc.nextInt();
int i,tmp,even,odd,e,o;
even=odd=e=o=0;
for(i=1;i<=n;i++){
tmp = sc.nextInt();
if(tmp%2==0){
e++;
if(even==0) even=i;... | linear | 25_A. IQ test | CODEFORCES |
import java.util.Scanner;
public class code0 {
public static void main(String[] args){
Scanner scr= new Scanner(System.in);
int c=0,e=0,d=0;
int a=scr.nextInt();
d=a/2;
if(a>=11 && a%2==1){
c=9;
e=a-9;
}
else{
c=a-4;e=4;
}
System.out.print(c+" "+e);
}
}
| constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Collections;
import java.util.ArrayList;
import java.io.InputStream;
/**
* Built using CHelper... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.util.*;
public class D {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long L = sc.nextLong();
long R = sc.nextLong();
long res = Math.max(2 * Long.highestOneBit(L ^ R) - 1, 0);
System.out.println(res);
}
}
| logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class AAA {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTok... | constant | 1028_B. Unnatural Conditions | CODEFORCES |
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may ... | nlogn | 527_C. Glass Carving | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class HexTheorem {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
int x = Integer.pars... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.UnsupportedEncodingException;
import java.net.URISyntaxException;
import java.util.LinkedList;
import... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class StrangeAddition {
public static void main(String[] args) throws IOException {
PrintWriter out = new PrintWriter(System.out);
sc = new StringToken... | constant | 267_A. Subtractions | 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.FileReader;
import java.io.InputStreamReader;
import java.io.File;
import java.io.FileNotFoundExcep... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class Main{
// ArrayList<Integer> lis = new ArrayList<Integer>();
// ArrayList<String> lis = new ArrayList<String>();
// PriorityQueue<P> que ... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.*;
import java.io.*;
public class paint {
static PriorityQueue<Integer> sequence;
public static void main (String [] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out, true);
int numSeq = ... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class BetaRound72_Div2_A implements Runnable {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void init() throws IOException ... | constant | 84_A. Toy Army | 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.util.*;
import java.io.*;
import java.math.*;
public class C{
static long mod=1000000007;
static int n;
static long w[][];
static void MainMethod()throws Exception{
n=reader.nextInt();
w=new long[n+2][n+2];
for (int i=0;i<=(n+1);i++)
Arrays.fill(w[i], 0);
w[1][0]=1;
String prev,next;
p... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.util.*;
public class tank {
static final FastScanner fs = new FastScanner();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
int t = fs.nextInt();
while(t-->0) {
run_case();
}
out.cl... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.Scanner;
public class C {
public static void main (String args[]) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int r = in.nextInt();
double pos[][] = new double[n][2];
for(int i = 0; i < n; i++) {
pos[i][0] = in.nextInt();
doub... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
public class A
{
public static void main(String[] args)
{
new A(new Scanner(System.in));
}
public A(Scanner in)
{
int n = in.nextInt();
int t = in.nextInt();
int tt = 2*t;
rect[] rs = new rect[n];
for (int i=0; i<n; i++)
rs[i] = new re... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import java.util.StringTokenizer;
public class q1 {
public static MyScanner in = new MyScanner();
public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out), true);
public static MyViewe... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.*;
import java.util.*;
public class a implements Runnable {
private void solve() throws IOException {
int n = nextInt();
int oddcnt = 0, evencnt = 0;
int odd = 0, even = 0;
for (int i = 0; i < n; i++) {
int a = nextInt();
if (a % 2 == 0) {
even = i + 1;
evencnt++;
} else {
... | linear | 25_A. IQ test | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Dummy {
private static long mod = 1000000007;
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
String[] strs = r... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
// Don't place your source in a package
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
// Please name your class Main
public class Main {
static FastScanner fs=new FastScanner();
static class FastScanner {//sc... | cubic | 1497E2 | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////// SOLUTION ///////////////////////////////... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;
public class A {
public static void main(String[] args) throws IOException{
BufferedReader br = new Buffere... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Scanner;
import java.util.StringTokenizer;
import static java.lang.... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import com.sun.org.apache.xpath.internal.axes.SubContextList;
import java.util.Scanner;
/**
*
* @author Madi
*/
public class Round42CC {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine());
String s = sc.nextLine();
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.Scanner;
/**
* @author pvasilyev
* @since 8/16/13
*/
public class ProblemC {
public static final String FILE_IN = "std.in";
public static final String FILE_OUT = "std.out";
private static boolean debugMode = true;
private static final long MOD = 1000 * 1000 * 1000... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
import java.io.*;
public class Longest {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String str=sc.nextLine();
int max=0;
for(int i=0;i<str.length();i++)
{
for(int x=0;x+i<=str.length();x++)
{
if(contains(str,str.substring(x,x+i),x))
{
/... | cubic | 23_A. You're Given a String... | CODEFORCES |
//package round169;
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 D2 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
long L = nl(), R =... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.util.Scanner;
public class C {
public static void main(String[] args) {
new C();
}
C() {
Scanner in = new Scanner(System.in);
long n = in.nextLong(), s = in.nextLong();
long lo = 1, hi = 1000000000000000000L;
while(lo<hi){
//System.out.println(lo+" "+hi);
//STUPID STUPID DUMB... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
import java.awt.Point;
import static java.lang.Math.*;
public class P166A {
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
Point[] P = new Point[n];
... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
public class A
{
public static void main(String[] args) throws IOException
{
Scanner sc=new Scanner(System.in);
PrintWriter pw=new PrintWriter(System.out);
int n=sc.nextInt();
String []a=new String[n];
String []b=new String[n];
TreeMap<S... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class LittleElephant {
public static void main(String[] args){
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int temp;
ArrayList<Integer> a2 = new ArrayList<Integer>();
ArrayList<Integer> a1 = new... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main
{
public static void main(String[] args)
{
FastReader reader = new FastReader();
PrintWriter writer = new PrintWriter(System.out);
long n = reader.nextLong();
long k = reader.nextLong();
long s=0;
long e=n;
long ans = -1;
while (s<=e) {
lo... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class D {
BufferedReader reader;
StringTokenizer tokenizer;
PrintWriter out;
public void solve() throws IOException {
int N = nextInt();
int M = n... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
boolean[][] graph = new boolean[n][n];
for(int i = 0; i < m; i++) {
... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.regex.*;
//import java.math.*;
//import static java.lang.Math.*;
//import static java.util.Arrays.*;
public class Main{
public static void main(String[] args) throws IOException { //1-checker 2-console
//if (args.length... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Comparator;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution i... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Solution {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
int n, k;
boolean[] prime;
int[] primes;
void sieve() {
prime = new boolean[n + 1];
Arrays.fill(prime, true);
pri... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int one, two;
if(n%2 == 0)
{
one = two = n/2;
if(one%2 != 0 && two%2 != 0)
... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.Reader;
import java.util.*;
public class C {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
int n = sc.nextInt();
long r = sc.nextInt();
double d = 2 * r;
lon... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
public class C
{
public static void main(String[] args)
{
new C(new Scanner(System.in));
}
vect[] vs;
int N;
int oo = 987654321;
ArrayList<choice> cs;
choice[][] cg;
int MF;
int[] memo;
int[] next;
int go(int m)
{
if (m == MF)
retur... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;
public class A {
/**
* @param args
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
HashSet<Integer> set = new ... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
// by agus.mw
import java.util.*;
import java.io.*;
public class Main{
public static void main(String[] args) throws Exception {
new Main().doWork();
}
void doWork() throws Exception{
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter writer = new BufferedWri... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.text.*;
import java.math.*;
import java.util.*;
public class Main {
private BufferedReader in;
private BufferedWriter out;
double time(double a, double l, double v0, double v) {
double t = (v - v0) / a;
double s = a * t * t / 2 + v0 * t;
if (s <= l) {
return t + (l - s) / v;... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.*;
import java.util.*;
public class E2 {
static ArrayList<Integer> primes;
static int[] mind;
final static int MAXA = (int) 1e7;
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
StringTok... | cubic | 1497E2 | 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.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.util.TreeMap;
import... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.Scanner;
public class origami {
public static void main(String args[]){
Scanner input = new Scanner(System.in);
double n = input.nextInt();
double k = input.nextInt();
double red = 0;
double green = 0;
double blue = 0;
double ans = 0;
red = (2 * n) / k;
green = (5 * n) / k;
blue ... | constant | 1080_A. Petya and Origami | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Solution
{
public static void main(String[] args) throws IOException
{
new Solution().run();
}
StreamTokenizer in;
Scanner ins;
PrintWriter out;
int nextInt() throws IOException
{
in.nextToken(... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class cf1102f {
public static void main(String[] args) throws IOException {
int n = rni(), m = ni(), a[][] = new int[n][];
for (int i = 0; i < n; ++i) {
a[i] = ria(m);
... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.util.*;
import java.io.*;
public class EdD {
static long[] mods = {1000000007, 998244353, 1000000009};
static long mod = mods[0];
public static MyScanner sc;
public static PrintWriter out;
public static void main(String[] havish) throws Exception{
// TODO Auto-generated method stub
sc = new MyS... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.*;
import java.lang.*;
import java.util.*;
public class alex
{
public static void main(String[] args)throws IOException
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();int sum=1;
for(int i=1;i<=n;i++)
{
sum=sum+(4*(i-1));
}
Syste... | linear | 1180_A. Alex and a Rhombus | CODEFORCES |
//package round584;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
// imp:12m
public class E5 {
InputStream is;
PrintWriter out;
String INPUT = "";... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.*;
import java.awt.*;
import java.awt.geom.*;
import java.math.*;
import java.text.*;
import java.math.BigInteger.*;
import java.util.Arrays;
public class CF111111
{
BufferedReader in;
StringTokenizer as;
int nums[],nums2[];
int[] nums1[];
boolean co... | linear | 1197_A. DIY Wooden Ladder | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.lang.*;
import java.util.*;
import java.io.*;
public class Main {
void solve() {
int m=ni();
long a[][]=new long[m][];
HashMap<Long,Integer> mp=new HashMap<>();
long TS=0;
long sm[]=new long[m];
for(int i=0;i<m;i++){
int sz=ni();
a... | np | 1242_C. Sum Balance | CODEFORCES |
import java.io.BufferedReader;
import java.io.PrintWriter;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.Arrays;
public class Main {
static Scanner in = new Scanner();
static PrintWriter out = new PrintWriter(System.out);
publ... | constant | 1036_A. Function Height | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.Reader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
import static java.lang.Math.*;
public ... | quadratic | 908_C. New Year and Curling | 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.math.BigInteger;
import java.util.StringTokenizer;
public class A {
static StringTokenizer st;
static BufferedReader... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.util.Scanner;
import java.util.Vector;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int a[] = new int[n];
int b[] = new int[n];
for (int i = 0; i < n; i++) ... | nlogn | 1010_A. Fly | CODEFORCES |
import jdk.nashorn.internal.objects.NativeArray;
import javax.swing.JOptionPane ;
import javax.swing.plaf.basic.BasicInternalFrameTitlePane;
import java.sql.SQLSyntaxErrorException;
import java.util.Arrays;
import java.util.Scanner;
import java.util.Vector;
import static jdk.nashorn.i... | linear | 1159_A. A pile of stones | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
static Scanner sc;
static PrintWriter out;
public static void main(String[] args) {
sc = new Scanner(System.in);
out = new PrintWriter(System.out);
int t = 1;
if (true) {
t = sc.nextInt()... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tokenizer=null;
public static void main(String[] args) throws IOException
{
new Main().execute();
}
void debug(Object...os)
{
System.out... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.HashMap;
import java.util.Locale;
import java.util.Map;
import java.util.StringTokenizer;
public class Array implements Runnable {
void solve() throws IOException {
int n = readInt();
int k = readInt();
int a[] = new int[n];
int startIdx = 0;
... | linear | 224_B. Array | CODEFORCES |
import java.util.Scanner;
public class SportMafia {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
int next = 1;
int current = 0;
int result = 0;
for(int i = 0; i < n; i++) {
if(current < k) {
current += next++;
... | logn | 1195_B. Sport Mafia | CODEFORCES |
/**
* author: derrick20
* created: 3/20/21 7:13 PM
*/
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class E2_SquareFreeFast {
static FastScanner sc = new FastScanner();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
// ... | cubic | 1497E2 | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
Reader.init(System.in);
int n = Reader.nextInt();
int[] arr = new int[n];
int initial = 0;
for (int i = 0; i < n; i++) arr[i] = Reader.nextInt();
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
public class b {
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
int n = input.nextInt(), k = input.nextInt();
int[] data = new int[n];
for(int i = 0; i<n; i++)
data[i] = input.nextInt();
int[] freq = new int[100001];
int count = 0;
... | linear | 224_B. Array | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String args[]) {new Main().run();}
FastReader in = new FastReader();
PrintWriter out = new PrintWriter(System.out);
void run(){
work();
out.flush();
}
long mod=998244353;
long gcd(long a,long b) {
return b==0?a:gcd(b,a%b);
... | quadratic | 1141_F2. Same Sum Blocks (Hard) | 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.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static ... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class con169_D {
private static final boolean DEBUG = false;
public static void main( final String[] args ) throws Exception {
final BufferedReader br = new BufferedReader( new Input... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.lang.*;
import java.math.BigInteger;
import java.io.*;
import java.util.*;
public class Solution implements Runnable{
public static BufferedReader br;
public static PrintWriter out;
public static StringTokenizer stk;
public static boolean isStream = true;
public static void main(String... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;
/**
* @author Ran Bi (ran.bi@addepar.com)
*/
public class C {
public static void main(String[] arg) throws IOException {
BufferedReader in = new BufferedReader(new Input... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class C {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
List<String> commands = IntStream.range(0, n).boxed().map(x -> s.next()).collect(Col... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import javax.lang.model.util.ElementScanner6;
import java.io.*;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader inp = new InputReader(inputStream);
Prin... | quadratic | 1197_D. Yet Another Subarray Problem | CODEFORCES |
import java.util.*;
import java.math.*;
import java.io.*;
public class Main
{
public static void main(String args[]) throws IOException
{
Scanner c = new Scanner(new FileReader("input.txt"));
PrintWriter out = new PrintWriter(new File("output.txt"));
int N=c.nextInt();
int M=c.nextInt();
int A[][]=new i... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
public class D5 {
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
int a = input.nextInt(), v = input.nextInt();
int l = input.nextInt(), d = input.nextInt(), w = input.nextInt();
double lo = 0, hi = v;
for(int iter = 0; iter < 1000; iter++)
{
... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class A {
static BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer st = new StringTokenizer("");
static String readString() throws Exception {
while(!st.has... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.util.*;
import java.io.*;
// Solution
public class Main
{
public static void main (String[] argv)
{
new Main();
}
boolean test = false;
int n;
long mod = 1000000007;
public Main() {
FastReader in = new FastReader(new BufferedReader(new InputStreamReader(Syste... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.Random;
import java.util.StringTokenizer;
public final class C {
static class Node {
int val;
String path;
... | cubic | 1523_C. Compression and Expansion | 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 P111C{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int h, w;
void run(){
h=sc.nextInt();
... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class A
{
String line;
StringTokenizer inputParser;
BufferedReader is;
FileInputStream fstream;
DataInputStream in;
String FInput="";
void openInput(String file)
{
if(file==null)is = new BufferedReader(new InputStreamReader(System.i... | nlogn | 257_A. Sockets | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
BufferedReader in;
StringTokenizer str = null;
PrintWriter out;
private String next() throws Exception{
if (str == null || !str.hasMoreElements())
str = new StringTokenizer(in.readLine());
return str.nextToken();
}
private int nextInt() throws... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args){
long MOD = 1000000007;
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[][]dp = new long[n][5010];
char[] program = new char[n];
for(int i = 0; i < n; i++){
program[i] = sc.next().charAt(0);
}
... | quadratic | 909_C. Python Indentation | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.