src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.util.*;
public class inversions {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] values = new int[N];
for(int i=0;i<N;i++){
values[i] = sc.nextInt();
}
int query = sc.nextInt();
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.Scanner;
public class Main {
/**
* @param args
*/
static long[] dx = new long[]{0, 1, 0, -1};
static long[] dy = new long[]{-1, 0, 1, 0};
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
long N = r.nextLong();
long X = r.nextLong();
long Y = r.nextLong(... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.*;
public class N72A
{
StreamTokenizer in;
PrintWriter out;
int nextInt() throws IOException
{
in.nextToken();
return (int) in.nval;
}
double nextDouble() throws IOException
{
in.nextToken();
return in.nval;
}
public void init() thro... | constant | 84_A. Toy Army | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main (String [] args) throws IOException {
BufferedReader br = new BufferedReader (new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int [] nums = new int[n];
args = br.readLine().s... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class Main {
public static void main(String[] args) throws Exception {
StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
... | np | 16_E. Fish | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;
import java.math.*;
public class Main {
void run() throws IOException {
String s = token();
HashSet <String> h;
int n = s.length();
int r = 0;
loop: for (int i = 1; i... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
import java.text.*;
import java.math.*;
public class Main{
static double EPS=1e-10;
static double PI=Math.acos(-1.0);
static double p[][]=new double[25][25];
static double f[]=new double[1<<20];
static int n;
public static void PR(String s){
Syst... | np | 16_E. Fish | CODEFORCES |
import java.util.Scanner;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author madi
*/
public class Speadsheets {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine())... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.lang.*;
import java.util.*;
import java.io.*;
public class Main {
void solve() {
int n=ni();
int a[]=new int[n+1];
for(int i=1;i<=n;i++) a[i]=ni();
int vis[]=new int[101];
int ans=0;
Arrays.sort(a,1,n+1);
for(int i=1;i<=n;i++){
if(vis[a[i]]==1... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class CFDiv1 {
FastScanner in;
PrintWriter out;
boolean canBe(int from, long curVal, long l, long r) {
if (curVal > r)
return false;
for (int i = 0; i <= from; i++)
curVal += 1L << i;
if (curVal >= l)
return true;
return false;
}
long stupid(long l, ... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.util.Locale;
import java.util.Scanner;
public class E {
public static void main(String[] args) {
Locale.setDefault(Locale.US);
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
double[][]p = new double[n][n];
for (int i = 0; i < n; i++) {
f... | np | 16_E. Fish | CODEFORCES |
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Collections;
import java.util.GregorianCalendar;
import java.util.Scanner;
public class ProblemB {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int a = s.nextInt();
... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.*;
public class First {
StreamTokenizer in;
PrintWriter out;
int nextInt() throws IOException {
in.nextToken();
return (int)in.nval;
}
long nextLong() throws IOException {
in.nextToken();
return (long) in.nval;
}
String nextString() throws ... | linear | 1011_A. Stages | CODEFORCES |
// https://codeforces.com/contest/1185/submission/55800229 (rainboy)
import java.io.*;
import java.util.*;
public class CF1185G2 {
static final int MD = 1000000007;
static int[][] solve1(int[] aa, int t, int n) {
int[][] da = new int[t + 1][n + 1];
da[0][0] = 1;
for (int i = 0; i < n; i++) {
int a = aa[i];
... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
public class ProblemC {
public static void main(String[] args) throws IOException {
BufferedReader s = new BufferedReader(... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class Problem
{
static int mod = (int) (1e9+7);
static InputReader in;
static PrintWriter out;
static int[] rt;
static int[] size;
static void initialize(int n){
rt = new int[n + 1];
size = new int[n + 1... | nlogn | 915_F. Imbalance Value of a Tree | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class round159A {
static BufferedReader br = new BufferedReader(new InputStreamReader(
System.in));
static StringTokenizer st = new StringTokenizer("");
static int... | nlogn | 257_A. Sockets | CODEFORCES |
import java.util.*;
import java.io.*;
public class MotherOfDragons {
public static void main(String[] args) {
FastScanner scanner = new FastScanner();
PrintWriter out = new PrintWriter(System.out, false);
int n = scanner.nextInt();
double k = scanner.nextInt();
long[] graph ... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.io.*;
import java.util.Scanner;
public class abc{
public static int check(StringBuilder s)
{
int countRemove=0;
if(!s.toString().contains("xxx")) return countRemove;
else{
for(int i=1;i<s.length()-1;i++)
{
if(s.charAt(i-1)=='x' && s.charAt(i)=='x' && s.charA... | linear | 978_B. File Name | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws java.lang.Exception {
BufferedReader kek = new BufferedReader(new InputStreamReader(System.in));
//Scanner skek = new Scanner(System.in);
PrintWriter outkek = new PrintWriter(System.out);
String[] inp... | np | 8_C. Looking for Order | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class Solution35C {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE")!=null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok =... | cubic | 35_C. Fire Again | 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.util.ArrayList;
import java.io.InputStream;
/**
* @author khokharnikunj8
*/
public class Main {
public static void mai... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.util.*;
import java.io.*;
public class aaaaaaaaaaaaaaaa {
public void run() throws Exception {
Scanner file = new Scanner(System.in);
int a = file.nextInt(), b= file.nextInt(), c = file.nextInt(), n = file.nextInt();
a -= c;
b -= c;
if (a < 0 || b < 0) System.out.println(-1);
else {
int x =... | constant | 991_A. If at first you don't succeed... | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
String line;
void run()throws IOException{
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
line = bf.readLine();
int i, j, len = line.length(), max=0;
for(i=0; i<len; i++){
for(j=i; j<len; j++){
if(line.indexOf(line.s... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
@SuppressWarnings("Duplicates")
public class solveLOL {
FastScanner in;
PrintWriter out;
boolean systemIO = true, multitests = false;
int INF = Integer.MAX_VALUE / 2;
void solve() {
int n = in.nextInt... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.sql.Time;
import java.util.*;
import java.math.BigInteger;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import static java.util.Arrays.*;
public class Main{
void run(){
Locale.setDefault(... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.RoundingMode;
import java.util.*;
import java.util.Map.Entry;
public class Main {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;... | linear | 1000_A. Codehorses T-shirts | 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
* @author dy
*/
public class Main {
public static void main(String[] args) {
InputStream inputStre... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.Scanner;
public class Division {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int l = sc.nextInt();
String c = String.valueOf(l);
if (String.valueOf(c).contains("0") || String.valueOf(c).contains("1")
|| String.valueOf(c).contains("2")
|| String.value... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;
public class Main {
static final long MOD = 1000000007L;
//static final long MOD2 = 1000000009L;
//static final long MOD = 998244353L;
//static final long INF = 500000000000L;
static final int INF = 1000000005;
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
public class Temppp {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long k = sc.nextLong();
long ans = (long) ((java.lang.Math.sqrt((9+(8*(n+k))))-3)/2);
System.out.println(n-ans... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
public class MinimumDiameterTree{
public static void main(String[] args) {
InputReader in = new InputReader (System.in);
PrintWriter out = new PrintWriter (System.out);
int n = in.nextInt();
int s = in.nextInt();
int deg[] = new int [n];
for (int i = 1; i < n; ++i) {
... | linear | 1086_B. Minimum Diameter Tree | CODEFORCES |
import java.util.Scanner;
public class Sasha1113A {
static int solution(int n, int v){
int count;
if(v>=n)
return n-1;
else{
count = (v-1) + ((n-v)*(n-v+1))/2;
}
return count;
}
public static v... | constant | 1113_A. Sasha and His Trip | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;
/**
* Built using CHelper p... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | quadratic | 911_D. Inversion Counting | CODEFORCES |
/*
* Author Ayub Subhaniya
* Institute DA-IICT
*/
import java.io.*;
import java.math.*;
import java.util.*;
public class A
{
InputStream in;
PrintWriter out;
void solve()
{
int n=ni();
int a[]=na(n);
int INV=0;
for (int i=0;i<n;i++)
for (int j=i+1;j<n;j++)
if (a[i]>a[j])
INV++;
boolea... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
public class Solution {
public static void main(String[] args){
Scanner cin=new Scanner(System.in);
int n=cin.nextInt();
if(n%4==0 || n%7==0 || n%44==0 || n%47==0 || n%74==0 || n%77==0 || n%444==0 || n%447==0 || n%474==0 ||
n%477==0 || n%744==0 || n%747==0... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Queue;
import java.util.StringTokenizer;
public class CF268_TwoSets {
public static void main(String[] args) {
MyScanner in ... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class C {
static BufferedReader br;
static StringTokenizer st;
static PrintWriter pw;
static String nextToken() {
try {
while (st == n... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
/**
p * @author prakhar28
*
*/
import java.io.*;
import java.util.*;
import java.util.Map.Entry;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.io.IOException;
import java.nio.file.Files;
import java.nio.file.Paths;
public class Main{
static class Reader
{
final priva... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
public class FireAgain {
Scanner in;
PrintWriter out;
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
new FireAgain().run();
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class MainD {
static final StdIn in = new StdIn();
static final PrintWriter out = new PrintWriter(System.out);
static final long M=(long)1e9+7;
static long[] fac, faci;
public static void main(String[] args) {
int n=in.nextInt();
fac = new long[n+1];
faci = new... | cubic | 840_C. On the Bench | CODEFORCES |
import java.awt.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import java.util.List;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextLong();
long x = scanner.nextLong(), y = scan... | constant | 1075_A. The King's Race | 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... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
import java.math.*;
import static java.lang.Character.isDigit;
import static java.lang.Character.isLowerCase;
import static java.lang.Character.isUpperCase;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;
impo... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.Scanner;
public class pillar {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int a[]=new int[200005];
for (int i=1;i<=n;i++)
a[i]=sc.nextInt();
for (int i=2;i<n;i++)
if (a[i-1]>a[i]&&a[i]<a[i+1]) {
System.out.println("NO");
retu... | linear | 1197_B. Pillars | CODEFORCES |
import java.util.*;
public class test
{
static boolean isOK(String str, int len)
{
HashSet<String> hs=new HashSet<String>();
for(int i=0;i<=str.length()-len;i++)
{
String s=str.substring(i,len+i);
if(hs.contains(s))
return true;
else
hs.add(s);
}
return false;
}
public ... | cubic | 23_A. You're Given a String... | 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 in = new BufferedReader(new InputStreamReader(System.in));
String s = in.readLine();
for (int i = s.leng... | cubic | 23_A. You're Given a String... | CODEFORCES |
// upsolve with rainboy
import java.io.*;
import java.util.*;
public class CF1187G extends PrintWriter {
CF1187G() { super(System.out); }
static class Scanner {
Scanner(InputStream in) { this.in = in; } InputStream in;
int k, l; byte[] bb = new byte[1 << 15];
byte getc() {
if (k >= l) {
k = 0;
try {... | cubic | 1187_G. Gang Up | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1185G2 {
static final int MD = 1000000007;
static int[][] solve1(int[] aa, int t, int n) {
int[][] da = new int[t + 1][n + 1];
da[0][0] = 1;
for (int i = 0; i < n; i++) {
int a = aa[i];
for (int s = t - 1; s >= 0; s--)
for (int m = 0; m < n; m++) {... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
/**
* ******* Created by bla on 14/9/19 6:17 PM*******
*/
import java.io.*;
import java.util.*;
public class A1209 {
public static void main(String[] args) throws IOException {
try (Input input = new StandardInput(); PrintWriter writer = new PrintWriter(System.out)) {
int n = input.nextInt()... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;
public class ques3 {
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter f... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.math.*;
import java.util.*;
import java.io.*;
public class Test5 {
public static void main(String[] z){
StreamTokenizer st = new StreamTokenizer(new InputStreamReader(System.in));
PrintWriter pw = new PrintWriter(System.out);
Scanner s = new Scanner(System.in);
int a =... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws FileNotFoundException {
Scanner sc = new Scanner(new File("input.txt"));
PrintWriter out = new PrintWriter(... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
public class helloWorld
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
int[] ar = new int[200];
String str = in.next();
for(int i = 0; i < str.length(); i++)
ar[ str.charAt(i) ]++;
int ans = 1... | linear | 1038_A. Equality | CODEFORCES |
import java.math.BigInteger;
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.Stream;
public class Practice {
public static void main(String []args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
sc.nextLine();
String s... | linear | 976_A. Minimum Binary Number | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
new Solver().run(1);
}
}
class Solver {
private BufferedReader reader = null;
private StringTokenizer st = null;
private static final long MOD = (long)1e9 + 7;
private ... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
public class C {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n, r;
n = scan.nextInt();
r = scan.nextInt();
int[] locs = new int[n];
for (int i = 0; i < n; i++) {
locs[i] = scan.nextInt();
... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.io.*;
public class cf1497_Div2_E2 {
static int[] spf;
public static int factor(int n) {
int val = 1;
while (n > 1) {
int cnt = 0;
int p = spf[n];
while (n % p == 0) {
cnt++;
n /= p;
}
if (cnt % 2 == 1)
val *= p;
}
return val;
}
public static vo... | cubic | 1497E2 | CODEFORCES |
// No sorcery shall prevail. //
import java.util.*;
import java.io.*;
public class InVoker {
//Variables
static long mod = 1000000007;
static long mod2 = 998244353;
static FastReader inp= new FastReader();
static PrintWriter out= new PrintWriter(System.out);
public static void main(String args[]) { ... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class cf1141f2_2 {
public static void main(String[] args) throws IOException {
int n = ri(), a[] = ria(n), pre[] = new int[n + 1];
for (int i = 0; i < n; ++i) {
pre[i + 1] = ... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.List;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Random;
import java.io.Reader;
import java.io.Writer;
import jav... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.PI;
import static java.lang.System.in;
import static java.lang.System.out;
import static java.lang.System.err;
/*
11
1
1
1
2
2
1
2
1
2
2
3
*/
public class C {
static public void main(String... args) throws Exception ... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
PrintWriter out=new PrintWriter(System.out);
int n=sc.nextInt();
int a[]=new int[n];
for (int i = 0; i <n ; i++) {
a[i]... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.Random;
import java.util.StringTokenizer;
im... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
new A().run();
}
private void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = sc.nextInt();
Arrays.sort(a);
int... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class A{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
TreeSet<Integer> v = new TreeSet<Integer>();
for(int i=0;i<n;i++) v.add(sc.nextInt());
Iterator<Integer> it = v.iterator();
it.next(... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
public class AMain {
static int n;
static int[] best;
static int[][] dist;
static int[] home;
static LinkedList<Integer> ret;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokeni... | np | 8_C. Looking for Order | 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 t = scanner.nextInt();
while(t-->0) {
int n = scanner.nextInt();
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class SolutionC{
public static void main(String[] args) throws Exception{
Scanner sc = new Scanner(new File("input.txt"));
PrintWriter output = new PrintWriter("output.txt");
int N = sc.nextInt();
int M = sc.nextInt();
int K = sc.nextInt();
int[] x = new int[K]... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
import java.io.*;
public class A0023 {
public static void main(String args[]) throws Exception {
new A0023();
}
A0023() throws Exception {
PandaScanner sc = null;
PrintWriter out = null;
try {
sc = new PandaScanner(System.in);
ou... | 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.HashSet;
import java.util.Set;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in Actual solution is at the ... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Collections;
public class Problem1 {
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
B... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class theyareeverywhere {
public static void main(String[] args) throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
PrintWriter w = new PrintWriter(System.o... | linear | 701_C. They Are Everywhere | CODEFORCES |
/*
* UMANG PANCHAL
* DAIICT
*/
import java.util.*;
import java.io.*;
import java.math.*;
import java.util.Comparator;
public class Main
{
private static final Comparator<? super Integer> Comparator = null;
static LinkedList<Integer> adj[];
static ArrayList<Integer> adj1[];
static int[] color,visited1;
stati... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.util.*;
import java.io.*;
public class C
{
static long time = System.currentTimeMillis();
public static void main(String[] args) throws IOException
{
//FastReader infile = new FastReader("test.txt");
FastReader infile = new FastReader(System.in);
int N = infile.nextInt();
in... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solve{
public static void main(String[] args) throws Exception{
Scanner sc=new Scanner(System.in);
PrintWriter out =new PrintWriter(System.out);
int size=(int)1e7+1;
int[] pr=new int[size];
for(int i=0;i<size;i++){
... | cubic | 1497E2 | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Success {
/**
* @param args
*/
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int a = scan.nextInt();
int b=scan.nextInt();
int[] t=new int[n];
for(int i=0;i<n;i++)
{
t[i]=s... | nlogn | 169_A. Chores | CODEFORCES |
import java.io.*;
import java.text.DecimalFormat;
import java.util.*;
public class Main {
public static final DecimalFormat DF_3 = new DecimalFormat("0.000");
private static final long MOD = 1000000007;
static int[] readArray(int size, InputReader in, boolean subOne) {
int[] a = new int[size];
... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
//package contese_476;
import java.util.*;
public class q1
{
int m=(int)1e9+7;
public class Node
{
int a;
int b;
public void Node(int a,int b)
{
this.a=a;
this.b=b;
}
}
public int mul(int a ,int b)
{
a=a%m;
b=b%m;
return((a*b)%m);
}
public int pow(int a,int b)
{
int x=1;
while(b>0)
{
if(b%2!=0)
x=mul... | linear | 1013_B. And | CODEFORCES |
import java.util.*;
import java.io.*;
public class LCMChallenge {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
if (n < 3) {
System.out.println(n);
} else if (n % 2 == 1) {
System.out.println((long) n * ... | constant | 235_A. LCM Challenge | 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.*;
// Petya and Spiders
// 2012/08/15
public class P111C{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int h, w... | np | 111_C. Petya and Spiders | CODEFORCES |
//package educational.round23;
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 C3 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
long n ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class a {
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
OutputStream out=new BufferedOutputStream(System.out);
String s[]=br.readLine().trim().split("\... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Map;
import java.util.StringTokenizer;
... | constant | 1080_C. Masha and two friends | CODEFORCES |
import java.io.*;
public class n5D
{
public static void main(String[] args)
{
double a = 0, v = 0, l = 0, d = 0, w = 0;
try
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] str = br.readLine().split(" ");
a = Double... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* @author Don Li
*/
public class OlyaAndMagicalSquare {
void solve() {
long[] dp = new long[32];
dp[0] = 0;
for (int i = 1; i < 32... | logn | 1080_D. Olya and magical square | 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... | cubic | 1517_D. Explorer Space | CODEFORCES |
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
If I'm the sun, you're the moon
Because when I go up, you go down
*******************************
I'm working for the day I will surpass you
https://www.a2oj.com/Ladder16.html
*/
impor... | np | 112_E. Petya and Spiders | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class C {
void solve(){
int n = readInt();
int q = readInt();
int max = 0;
int[] a = new int[n];
Deque<Integer> deque = new ArrayDeque<>();
for(int i ... | linear | 1180_C. Valeriy and Deque | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner reader = new Scanner(System.in);
int n = reader.nextInt();
long d = reader.nextLong();
int[] a = new int[n];
for(int i = 0; i < n; i++)
a[i] ... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.OutputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.FileInputStream;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.A... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public final class PythonIndentation
{
public static void main(String[] args)
{
new PythonIndentation(System.in, System.out);
}
static class Solver implements Runnable
{
static final int MOD = (int) 1e9 + 7;
int n;
char[] arr;
long[][] dp;
BufferedReader in;
Pr... | quadratic | 909_C. Python Indentation | CODEFORCES |
//Educational Codeforces Round 34
import java.io.*;
import java.util.*;
import java.math.*;
public class TaskD {
public static void main (String[] args) throws IOException {
FastScanner fs = new FastScanner(System.in);
PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));
... | nlogn | 903_D. Almost Difference | CODEFORCES |
import java.util.*;
import java.math.*;
public class Counterexample {
public static void main(String[] args) {
System.out.println(new Counterexample().solve());
}
String solve() {
Scanner sc = new Scanner(System.in);
final long l = sc.nextLong();
final long r = sc.nextLong... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.IOException;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Comparator;
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 solution is at... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | linear | 1515_B. Phoenix and Puzzle | 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.util.NoSuchElementException;
import java.io.Writer;
import java.math.BigInteger;
import java.io.InputStream;
/**
*... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public static void main(String[] args) throws Exception {
// TODO Auto-generated method stub
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
String s = bf.readLine();
out.println(25)... | constant | 630_A. Again Twenty Five! | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.