src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class Main implements Runnable
{
static class InputReader
{
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFi... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOExcept... | np | 11_D. A Simple Task | 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.*;
import java.math.*;
public class A {
public static void main(String[] args) throws IOException {
/**/
Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
/*/
Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(new FileInputStream... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import static java.lang.Math.*;
import static java.lang.System.currentTimeMillis;
import static java.lang.System.exit;
import static java.lang.System.arraycopy;
import static java.util.Arrays.sort;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.fill;
import java.util.*;
import java.io.*;
p... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.IOException;
import java.util.Arrays;
import java.util.TreeMap;
import java.util.InputMismatchException;
import java.util.ArrayList;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author George ... | 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 B {
int mod=1000_000_007;
public static void main(String[] args) throws Exception {
PrintWriter out=new PrintWriter(System.out);
FastScanner fs=new Fas... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.BufferedWriter;
import java.io.ByteArrayInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Lin... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.Scanner;
public class CF125D2A {
/**
* @param args
*/
public static void main(String[] args) {
Scanner sc = new Scanner (System.in);
System.out.println("0 0 "+ sc.nextInt());
}
}
| constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt(),m=sc.nextInt();int g[]=new int[1<<m];
StringBuffer s=new StringBuffer(sc.next());
s=s.insert(0, 'A');
int D=(1<<m)-1;
for(int i=1;i<n;i++... | np | 1238_E. Keyboard Purchase | CODEFORCES |
/*
* code together
* code better
*/
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.HashMap;
import java.util.Scanner;
public class Main {
static int x[]... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Bag implements Runnable {
private void solve() throws IOException {
int xs = nextInt();
int ys = nextInt();
int n = nextInt... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
import java.io.*;
public class EdC {
static long[] mods = {1000000007, 998244353, 1000000009};
static long mod = mods[0];
public static MyScanner sc;
public static PrintWriter out;
static char[][] grid;
static int n;
static int t;
static int[][] dp;
static int[] times;
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class E
{
PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tok;
public void go() throws IOException
{
StringToken... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.Scanner;
public class Main {
public static Character solve(long a, long b, long c) {
long min = a;
long max;
long xth = 0;
long index;
for (index = String.valueOf(a).length() - 1;; index++) {
long numOfDigits = 0;
max = (long) Math.pow(10, index + 1) - 1;
long count = (max - m... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
//package math_codet;
import java.io.*;
import java.util.*;
/******************************************
* AUTHOR: AMAN KUMAR SINGH *
* INSTITUITION: KALYANI GOVERNMENT ENGINEERING COLLEGE *
******************************************/
public class lets_do {
InputReader in;
PrintWriter o... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
// Don't place your source in a package
import javax.swing.*;
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
import java.util.stream.Stream;
// Please name your class Main
public class Main {
static FastScanner fs=new F... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main
{
public static void main(String args[]) throws IOException
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String s;
int i,j;
for(i=0;i<n;i++)
{
s = sc.next();
j = 0;
boolean ok;
while((s.charAt(j)>='A')... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import static java.lang.Math.*;
public class Main {
private FastScanner scanner = new FastScanner();
public static void main(String[] args) {
new Main().solve();
}
private void ... | linear | 990_C. Bracket Sequences Concatenation Problem | CODEFORCES |
//package round495;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;
public class A {
InputStream is;
PrintWriter out;
String INPU... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class LookingForOrder {
static int[] dp = new int[(int) (1 << 24)];
static int[][] points;
static int[] sol = new int[1<<24];
static int sx = 0, sy = 0;
... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int[] ar = new int[n];
for (int i = 0; i < n; i++) {
... | nlogn | 169_A. Chores | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class C111A{
static BufferedReader br;
public static void main(String args[])throws Exception{
br=new BufferedReader(new InputStreamReader(System.in));
int n = toInt();
int nm[] = toIntArray();
double a=0.0... | 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 m = sc.nextInt();
long totalBlocks = 0;
long a[] = new long[n];
for(int i = 0; i < n; ++i) {
a[i] = sc.nextLo... | nlogn | 1061_B. Views Matter | CODEFORCES |
/**
* @author derrick20
*/
import java.io.*;
import java.util.*;
public class SameSumBlocks {
public static void main(String[] args) throws Exception {
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int N = sc.nextInt();
int[] pre = new int[N +... | quadratic | 1141_F2. Same Sum Blocks (Hard) | 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.Scanner;
public class first {
static int max = 1000000000;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] tab = new int[n];
for(int i=0;i<n;i++) {
tab[i] = sc.nextInt();
}
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
i... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.Scanner;
public class codef8 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int beacon[] = new int[1000001];
int pos[] = new int[num];
for (int i = 0; i < num; i++) {
int position = sc.nextInt... | linear | 608_C. Chain Reaction | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
long totalBlocks = 0;
long a[] = new long[n];
for(int i = 0; i < n; ++i) {
a[i] = sc.nextLo... | nlogn | 1061_B. Views Matter | CODEFORCES |
import java.io.*;
import static java.lang.Integer.*;
import static java.lang.Math.*;
public class A {
public static void main(String[] args) throws Throwable{
BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
String ln=in.readLine().trim();
System.out.println(max(parseInt(ln),max(parseInt(... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
public class B {
public static void main(String[] args) {
Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(
System.in)));
int nc = sc.nextInt();
while (nc-- > 0) {
... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static InputReader in = new InputReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
static long oo = 1000000000000L;
public static void main(String[] args) throws IOException {
int n = in.nextInt();
int q = in.nextInt()... | linear | 1180_C. Valeriy and Deque | CODEFORCES |
// Don't place your source in a package
import javax.swing.*;
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
import java.util.stream.Stream;
// Please name your class Main
public class Main {
static FastScanner fs=new F... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
public class Task483A {
public static void main(String... args) throws NumberFormatException,
IOException {
Solution.main(System.in, System.out);
}
static class Scanner {
privat... | constant | 483_A. Counterexample | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class ProblemE
{
static int mod = (int) (1e9+7);
static InputReader in;
static PrintWriter out;
static class SegmentTree {
long st[];
SegmentTree(int n) {
st = new long[4*n];
build... | nlogn | 903_D. Almost Difference | CODEFORCES |
import java.math.*;
import java.util.*;
import java.io.*;
public class Main{
void solve() {
int n=ni();
long d=nl();
long x[]=new long[n+1];
for(int i=1;i<=n;i++) x[i]=nl();
Arrays.sort(x,1,n+1);
int ans=2;
for(int i=2;i<=n;i++){
long x1=x[i-1]+d,... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class A {
BufferedReader br;
StringTokenizer st;
PrintWriter out;
void solve() throws IOException {
int n = nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
int[] b = a.clone();
Arrays.sor... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
public class A {
static int countColors(List<Integer> colors) {
Collections.sort(colors);
int k = 0;
while (!colors.isEmpty()) {
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
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
* @author Sun... | linear | 224_B. Array | 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.*;
// Pipeline
// 2013/03/23
public class P287B{
Scanner sc=new Scanner(System.in);
long n, k;
void run(){
n=sc.nextLong();
k=sc.n... | logn | 287_B. Pipeline | 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.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class Main implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void init() throws FileNotFoundException {
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
BigInteger l = new BigInteger(scanner.next());
BigInteger r = new BigInteger(scanner.next());
if(r.subtract(l).intValue() < 2) {
System.out.println(-... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Iterator;
import java.util.ListIterator;
import java.util.Collection;
import java.util.AbstractList;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Deq... | nlogn | 961_D. Pair Of Lines | CODEFORCES |
import java.util.*;
import java.io.*;
public class test {
public static void main(String[] args) throws IOException {
Scanner s = new Scanner(System.in);
StringTokenizer st = new StringTokenizer(s.nextLine());
int n = Integer.parseInt(st.nextToken());
int r = Integer.parseInt(st.nextToken());
st = new Strin... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF387D {
static class A {
ArrayList<Integer> list = new ArrayList<>();
int u, v, d;
}
static final int INF = Integer.MAX_VALUE;
static boolean bfs(A[] aa, int n) {
ArrayDeque<Integer> q = new ArrayDeque<>();
for (int u = 1; u <= n; u++)
if (aa[u].v > 0)... | cubic | 387_D. George and Interesting Graph | 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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
public class Round313A {
private static final int LOCAL_ENV = 0;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
try {
if (LOCAL_ENV == 1) {
in = new Scanner(new File("input.txt"));
}
}... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
//package round371;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class BT {
Scanner in;
PrintWriter out;
String INPUT = "";
int q(int r1, int c1, int r2, int c2)
{
out.printf("? %d %d %d %d\n", r1+1, c1+1, r2+1, c2+1);
out.flush();
return ni();
}
void e(int r... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class CodehorsesTShirt {
public static void main(String args[]) throws IOException {
FastReader in = new FastReader();
OutputStream outputStream = System.out;
PrintWriter out = new PrintWriter(outputStream);
Task.solv... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.*;
import java.util.*;
public class Q3 {
static class Pair {
int a;
int b;
Pair(int p, int q) {
a = p;
b = q;
}
}
public static void main(String[] args) {
InputReader in = new InputReader();
int N = in.nextInt();
... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.Map;
import java.util.HashMap;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.*;
import java.util.*;
public class TaskA {
public void run() {
InputReader reader = new InputReader(System.in);
PrintWriter writer = new PrintWriter(System.out, true);
reader.nextLine();
String statement = reader.next();
if (!statement.startsWith("-")) {
... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.util.*;
import java.io.*;
public class NewYearsCurling {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
StringTokenizer st = new StringTokenizer(sc.nextLine());
int n = Integer.parseInt(st.nextToken());
int r = Integer... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.io.*;
/*
6
2 2
5 2
1 5
1 1
3
1 2
1 1
1 2
1 1
1 2
2 3
2 1
1
1
*/
public class e2 {
static int n;
static int m;
static int[][] mat;
public static void main(String[] args){
JS scan = new JS();
PrintWriter out = new PrintWriter(System.out);
int t = scan.nextInt();
long start... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.util.*;
public class C23A {
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
String str=sc.next();
for(int k=str.length()-1;k>=1;k--){
for(int i=0;i<=str.length()-k;i++){
for(int j=i+1;j<=str.length()-k;j++){
... | 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.io.OutputStream;
import java.util.SortedSet;
import java.util.Set;
import java.util.NavigableSet;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.InputStreamRe... | linear | 1190_C. Tokitsukaze and Duel | 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... | logn | 338_A. Quiz | CODEFORCES |
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.StringTokenizer;
public class ChainReaction im... | nlogn | 608_C. Chain Reaction | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String args[]) throws Exception
{
BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
int num=Integer.parseInt(in.readLine());
System.out.println((num/2)*(3));
}
}
| constant | 84_A. Toy Army | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* Author -
* User: kansal
* Date: 9/3/11
* Time: 5:28 PM
*/
public class CF85C {
public static void main(String[] args) {
reader = new BufferedRea... | np | 112_E. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.util.*;
public class digits {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
long k = Long.parseLong(br.readLine());
long temp = 9 * (int)Math.pow(10,0);
int count =... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
public class E
{
public static void main(String[] args)
{
new E(new Scanner(System.in));
}
public E(Scanner in)
{
int N = in.nextInt();
double[][] g = new double[N][N];
for (int j=0; j<N; j++)
for (int i=0; i<N; i++)
g[i][j] = in.next... | np | 16_E. Fish | CODEFORCES |
import java.awt.Point;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt() - 1;
Point[] A = new Point[n];
fo... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
public class algo121
{
public static void main(String args[])
{
Scanner ex=new Scanner(System.in);
int n=ex.nextInt();
String a[]=new String[n];
String b[]=new String[n];
for(int i=0;i<n;i++)
a[i]=ex.next();
for(int i=0;i<n;i++)
... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
new Main().run();
}
boolean[][] graph;
public void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
graph = new boolean[n][n];
for (int i = 0; i < m; i++) {
int a = sc.n... | np | 11_D. A Simple Task | CODEFORCES |
// Don't place your source in a package
import javax.swing.*;
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
import java.util.stream.Stream;
// Please name your class Main
public class Main {
static FastScanner fs=new F... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Excepti... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class B {
static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
static MyScanner sc;
static {
try {
sc = new MyScanner();
... | logn | 1195_B. Sport Mafia | CODEFORCES |
//package Codeforces.Round718Div1_2;
import java.io.*;
import java.util.*;
public class D {
static boolean isValid(int n, int m, int i, int j){
return 0<=i && i<n && 0<=j && j<m;
}
public static void main(String[] args) throws IOException {
Soumit sc = new Soumit();
int n = sc.nex... | cubic | 1517_D. Explorer Space | CODEFORCES |
//package round35;
import java.io.File;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class C {
Scanner in;
PrintWriter out;
// String INPUT = "3 3 1 1 1";
String INPUT = "";
void solve()
{
int n = ni();
int m = ni();
int k = ni();
int[] x = new int[k];
int[] y... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
public class algo93
{
public static void main(String args[])
{
Scanner ex=new Scanner(System.in);
long x=ex.nextLong();
long k=ex.nextLong();
long mod=1000000007;
if(k==0)
System.out.println((2*x)%mod);
else if(x==0)
System.out.... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class Codeforces
{
public static void main(String args[])throws Exception
{
BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb=new StringBuilder();
int t=Integer.parseInt(bu.readLine());
while(t--... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
public class Main {
public static long GCF(long a, long b) {
if(b == 0) return a;
else return GCF(b, a%b);
}
public static long LCM(long a, long b){
return a... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.*;
import java.io.*;
public class A2 {
/*
*/
public static void main(String[] args) throws Exception {
uu.s1();
uu.out.close();
}
public static class uu {
public static BR in = new BR();
public static PrintWriter out = new PrintWriter(new BufferedWriter... | logn | 338_A. Quiz | CODEFORCES |
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Solution solution = new Solution();
System.out.println(solution.solve());
}
private int solve() {
Scanner in = new Scan... | nlogn | 1011_B. Planning The Expedition | CODEFORCES |
import java.util.Scanner;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author madi
*/
public class GivenString {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String line = sc.nextLine();
S... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.Scanner;
public class digits
{
public static void main(String[] args)
{
long k = (new Scanner(System.in)).nextLong();
//k = 56
//League 1: 0 - 9
//League 2: 10 - 99
//League 3: 100 - 999..
//System.out.println("k = "+k);
long league = 1;
long irrelevancy = 0;
while(true)
{
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.StringTokenizer;
public class LittleGirlAndXor {
static long L, R;
static Long[][][][][] dp = new Long[64][2][2][2][2];
public static long... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.util.Scanner;
/**
* Write a description of class lukno here.
*
* @author (your name)
* @version (a version number or a date)
*/
public class lukno
{
public static void main (String args[])
{
Scanner i= new Scanner(System.in);
int n,p;
n=i.nextInt(); int t=n;
... | constant | 122_A. Lucky Division | CODEFORCES |
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.StringTokenizer;
import java.io.BufferedReader;
import java.util.Comparato... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.Scanner;
public class B {
static int n;
static double A;
static int[] L;
static int[] B;
static double max = 0;
public static void rec(int index, int k) {
if (k < 0)
return;
if (index == n) {
double prob = 0;
for (int i = 0... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.util.TreeMap;
public class AA {
public static void main(String[] args) t... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.*;
import java.util.*;
public class TaskA
{
public static void main(String[] args)
{
new TaskA(System.in, System.out);
}
static class Solver implements Runnable
{
int n;
String[] last, curr;
BufferedReader in;
PrintWriter out;
void solve() throws IOException
{
n = Integer.parseIn... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
/* package codechef; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
public static int n;
public static int m;
public static int k;
public static int[][] right;
publi... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main implements Runnable {
final static int mod = 1000000007;
static FastReader sc;
static PrintWriter out;
static boolean test_case_input = true;
static final int MAX = 1000000000;
static final int MIN = -1000000000;
... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
private BufferedReader in;
private PrintWriter out;
private StringTokenizer st;
static class House implements Comparable<House> {
int x, a;
@Override
public int compareTo(House o) {
return x - o.x;
}
public House(int x, int a) {
thi... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.*;
import java.io.*;
public class DigitSequence
{
public static PrintWriter out;
/**
* @param args the command line arguments
*/
public static void main(String[] args) throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Round1B {
public static void main(String[] args) throws Exception {
new Round1B().run();
}
private void run() throws Exception {
BufferedReade... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = in.nextInt();
}
Arrays.sort(arr);
int cnt = 0... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class PythonIndentiation {
PrintWriter pw = new PrintWriter(System.out);
final static boolean debugmode = true;
public static int k = 7; // for 10^9 + k mo... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
import static java.util.Arrays.fill;
import static java.lang.Math.*;
import static java.util.Arrays.sort;
import static java.util.Collections.sort;
public class C35
{
public static int mod = 1000000007;
public static long INF = (1L << 60);
static int n... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Main11D {
private FastScanner in;
private PrintWriter out;
public void solve() throws IOException {
int N = in.nextInt();
int M = in.nextInt();
int[][] edges = new int[N][N];
for(int i = 0; i < M; i++){
... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
import static java.lang.Math.*;
import static java.lang.Integer.*;
import static java.lang.Long.*;
import static java.util.Arrays.*;
public class A {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
while (s.hasNext()) {
int n = s.n... | linear | 25_A. IQ test | CODEFORCES |
import java.io.*;
import java.security.SecureRandom;
import java.util.*;
import java.math.*;
import java.awt.geom.*;
import static java.lang.Math.*;
public class Solution implements Runnable {
public void solve() throws Exception {
int n = sc.nextInt();
int a[] = new int[n];
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Solution {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
int[] x;
int[] y;
int n;
int X, Y;
int[] d;
int[][] dist;
int sqr(int a) {
return a * a;
}
int dist(int X, i... | np | 8_C. Looking for Order | CODEFORCES |
//q4
import java.io.*;
import java.util.*;
import java.math.*;
public class q4 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int query = in.nextInt();
while (query -- > 0) {
int n = in.nextInt();
int k = in.nextIn... | quadratic | 1196_D2. RGB Substring (hard version) | 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.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;
... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
public class init {
static class p{
int i;
int c;
public p(int i,int c) {
this.i=i;this.c=c;
// TODO Auto-generated constructor stub
}
}
static int mod=1000000007;
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner s=new Scanner(System.in);
int n=s.next... | 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.