src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
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 static java.lang.Integer.MAX_VALUE;
import static java.lang.Integer.parseInt;
/**
* 8C
*
* @author artyom
*/
public class LookingForOrde... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.util.*;
public class Codechef{
public static void main(String []args){
Scanner in = new Scanner(System.in);
long n=in.nextLong();
long m=in.nextLong();
long k=in.nextLong();
long l=in.nextLong();
long j=((k+l)/m);
if((k+l)%m!=0)j++;
if((k+l>n) || j*m>n) {
... | constant | 1068_A. Birthday | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class codeforces {
public static long cnt = 0;
public static void f(int g1, int g2, int g3, int last) {
if (g1 == 0 && g2 == 0 && g3 == 0) cnt++;
if (g1 > 0 && last != 1) f(g1 - 1, g2, g3, 1);
if (g2 > 0 && ... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
/**
* @param args
*/
static int N, M;
static long[] C;
static int[][] g;
static ... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class CodeForces {
public static void main(String[] args) throws IOException,NumberFormatException{
try {
FastScanner sc=new FastScanner();
int t=sc.nextInt();
while(t-->0) {
int a=sc.nextInt(),b=sc.nextInt();
int count=0;
... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Map;
import java.util.PriorityQueue;
import ja... | nlogn | 1159_C. The Party and Sweets | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
void run() throws IOException {
int n = ni();
int m = ni();
int k = ni();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = ni() - 1;
Arrays.sort(a);
int ans = 0;
if (m > k) {
... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.*;
import java.util.*;
public class B implements Runnable {
FastReader scn;
PrintWriter out;
String INPUT = "";
void solve() {
int n = scn.nextInt();
int[] arr = scn.nextIntArray(n);
int[][] a = new int[n * (n + 1) / 2][];
int[] need = new int[a.length];
int pos = 0;
for (int l = 0; l ... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;
public class CodehorsesT_shirts {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(reader.read... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.io.*;
import java.awt.geom.Point2D;
import java.text.*;
import java.math.*;
import java.util.*;
public class Main implements Runnable {
final String filename = "";
public void solve() throws Exception {
int n = iread();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = iread();
Array... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
public class utkarsh{
BufferedReader br;
void solve(){
br = new BufferedReader(new InputStreamReader(System.in));
int i, j, n, mod = (int)(1e9 + 7);
n = ni();
char c[] = new char[n];
for(i = 0; i < n; i++) c[i] = ns().charAt(0);
long dp[][] = new long[n][n];
dp[0]... | quadratic | 909_C. Python Indentation | 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.*;
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 |
import java.util.*;
import java.io.*;
import java.math.*;
/**
*
* @author Dstoical
*/
public class G {
private static int M = 1000000007, MM = 998244353;
private static int N = 15,n,T;
private static int[] time,gi;
private static int[][][] dp;
public static void process() throws IOException {
n = sc.next... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
import java.util.Arrays ;
import java .lang.String.* ;
import java .lang.StringBuilder ;
public class Test{
static int pos = 0 ;
static int arr[] ;
static LinkedList l1 = new LinkedList() ;
static void find(int p ,char[]x,int put[],String s){
int c... | constant | 964_A. Splits | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class A{
Scanner sc=new Scanner(System.in);
void run(){
String s=sc.nextLine();
int n=s.length();
int ans=0;
for(int len=1; len... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
public class Main {
static int mod = 1000000007;
static int size = 200000;
static long[] fac = new long[size];
static long[] finv = new long[size];
static long[] inv = new long[size];
static int INF = Integer.MAX_VALUE;
public static void main(String[] args){
Scanner scanner = new Scann... | constant | 991_D. Bishwock | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
public class B {
private void solve() throws IOException {
int n = nextInt();
int k = nextInt();
int[] a = new ... | linear | 224_B. Array | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main
{
public static void main(String args[]) throws IOException
{
Scanner sc = new Scanner(System.in/*new File("input.txt")*/);
int n = sc.nextInt(), t = sc.nextInt(), x, a, kol = 2;
ArrayList<Double> al = new ArrayList<Double>();
for(int i=0;i<n;i++)
{
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at ... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.IOException;
import java.util.Scanner;
public class A199 {
static int n[][] = new int[][] { { -1, 0 }, { 1, 0 }, { 0, -1 }, { 0, 1 } };
public static void main(String[] args) throws IOException {
new A199().solve();
}
public void solve() throws IOException {
Scanner scan = new Scanner(System.... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.BigInteger;
public class Main {
// main
public static void main(String [] args) throws IOException {
// makes the reader and writer
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new Buffe... | constant | 483_A. Counterexample | 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... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.Scanner;
public class C {
private static final int MOD = (int) 1e9 + 7;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[][] DP = new int[n][n + 1];
DP[0][0] = 1;
for (int i = 0; i < n - 1; i++) ... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
public class Div... | nlogn | 1084_F. Max Mex | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class A{
void solve(){
int n=ni();
int P[]=new int[n+1];
for(int i=1;i<=n;i++) P[i]=ni();
a=new int[n+1];
BIT=new long[n+1];
long cnt=0;
long p=0;
for(int i=n;i>=1;i--){
p+... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
var sc = new Scanner(System.in);
var pw = new PrintWriter(System.out);
int T = Integer.parseInt(sc.next());
for(int t = 0; t < T; t++){
... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;
/**
* @author Egor Kulikov (egor@egork.net)
* Created on 14.03.2010
*/
public class TaskA implements Runna... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.Scanner;
public class B {
public static String toB(String str){
String row,col;
int i=0;
while(i<str.length() && str.charAt(i)<='Z'&&str.charAt(i)>='A')i++;
col = str.substring(0,i);
row = str.substring(i,str.length());
StringBuffer sb = new StringB... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner s=new Scanner(System.in);
int n=s.nextInt();
int[] arr=new int[n];
for(int i=0;i<n;i++)
{
arr[i]=s.nextInt();
}
Arrays.sort(arr);
int[] visited=new int[n];
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.*;
public class USACO {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(reader.readLine()," ")... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.io.*;
public class A {
public static void main(String[] args) {
Scanner s = new Scanner(new InputStreamReader(System.in));
int n = s.nextInt();
if (n == 1) {
System.out.println("NO");
System.exit(0);
}
int[] nums = new... | nlogn | 22_A. Second Order Statistics | 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 AndrewShmig
*/
public class Main {
public static void main(String[] args) {
InputStream inputStre... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.*;
import java.util.*;
public class A implements Runnable {
private MyScanner in;
private PrintWriter out;
private void solve() {
int n = in.nextInt();
int[] a = new int[n];
int all = 0;
for (int i = 0; i < n; ++i) {
a[i] = in.nextInt();
... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class B {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
... | constant | 1028_B. Unnatural Conditions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class AnnoyingPresent {
//UPSOLVED
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String... | linear | 1009_C. Annoying Present | 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... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.Scanner;
public class main1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a = n / 2;
int b = n - a;
if (n % 2 == 0) {
if (a % 2 == 1) {
a++;
b--;
}
System.out.println(a + " " + b);
} else {
if (a... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
public static void main(String[] args) throws IOException {
FastScanner in = new FastScanner(System.in);
PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
int n = in.nextInt();
double r = in.nextInt();
double[... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
public class Main{
private static final int MAX_SIZE = 100005;
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
if(((m + 1) / ... | linear | 967_A. Mind the Gap | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
StreamTokenizer in;
PrintWriter out;
public static void main(String[] args) throws Exception {
new Main().run();
}
public void run() throws Exception {
in = new StreamTokenizer (new BufferedReader(new InputStreamReader(Sys... | constant | 84_A. Toy Army | CODEFORCES |
import java.util.*;
import java.io.*;
public class EdA {
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... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class B {
static BufferedReader in;
static StringTokenizer st;
... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
import java.util.Locale;
public class E16 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException ... | 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.io.DataInputStream;
import java.io.InputStream;
import java.util.Arrays;
import java.util.TreeSet;
public class Main{
public static void main(String[] args) throws Exception {
Parserdoubt3 s = new Parserdoubt3(System.in);
int n = s.nextInt();
long k = s.nextInt();
Long a[] = new Long[n];
Tree... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Scanner;
public class Loader {
private final static Scanner in = new Scanner(System.in);
public static void main(String[] args) {
int n = in.nextInt();
ArrayList<Integer> l = new ArrayList<>... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
static class Scanner {
StringTokenizer st;
BufferedReader br;
public Scanner(InputStream s) {
br = new BufferedReader(new InputStreamReader(s));
}
public Scanner(FileReader fileReader) {
br = n... | linear | 1004_A. Sonya and Hotels | 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 ProblemA {
public static void main(String[] args) throws IOException {
BufferedReader s = new BufferedReade... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class ProblemA {
InputReader in; PrintWriter out;
long power(long a, long b, long mod) {
long ret = 1;
long mul = a;
while (b > 0) {
if (b % 2 == 1) {
ret = (ret * mul % mod);
}
... | logn | 338_A. Quiz | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
// 1 = H, 0 = T
int n = in.nextInt();
String line = in.next();
int h = 0;
for (int i = 0; i < line.lengt... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class first {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner s=new Scanner(System.in);
int n=s.nextInt();
int[] a=new int[n];
for (int i = 0; i < a.length; i++) {
a[i]=s.nextInt();
}
Arrays.sort(a);
int... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class B_574 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] input = br.readLine().split(" ");
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author codeKNIGHT
*/
public class Main {
public static void main(String[] args) {... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.IOException;
import java.util.Scanner;
public class A {
public static void main(String args[]) throws IOException {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.println((2*n) - (n/2));
}
}
| constant | 84_A. Toy Army | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static BufferedReader reader;
static StringTokenizer tokenizer;
static PrintWriter writer;
static int nextInt() throws NumberFormatException, IOException {
return Integer.parseInt(nextToken());
}
static long nextLong() throws ... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF_35C {
public static void main(String[] args) throws IOException{
BufferedReader f = new BufferedReader(new FileReader("input.txt"));
PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
StringTokenizer st1... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.Stre... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.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)||(n%77... | 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.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 |
import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;
import java.util.Stack;
public class D527A2 {
public static void main(String[] args) {
FastScanner in = new FastScanner(System.in);
int N = in.nextInt();
Stack<Integer> stack = new Stack<>();
for(int i = 0; i < N;... | linear | 1092_D1. Great Vova Wall (Version 1) | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt(), d = s.nextInt();
int[] arr = new int[n];
for(int i = 0; i < n; i++){
arr[i] = s.nextInt();
}
Arrays.sort(arr);
int count = 0;
fo... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int V = in.nextInt();
int E = in.nextInt();
boolean [][] G = new boolean [V][V];
for (int i = 0; i < E; i++) {
int u = in.nextInt()-1;
... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
Task solver = new Task();
solver.solv... | logn | 1019_B. The hat | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
public class Ds {
static long lim;
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader in = new Bu... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Locale;
import java.util.StringTokenizer;
public class Solution implements Runnab... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class TestClass {
public static class FastWriter {
private static final int BUF_SIZE = 1 << 13;
private final byte[] buf = new byte[BUF_SIZE];
private final OutputStream out;
private int ptr = 0;
private FastWriter() {
... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.*;
import java.util.*;
public class Hack{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int[] arr = new int[n];
for(int i=0;i<n;i++)
arr[i]=sc.nextInt();
Arrays.sort(arr);
Set<Integer> set = new TreeSet<Integer>();
for(int i=0;i<n;i++){
boolean flag=fals... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF16E {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
double[][] aa = new double[n][n];
for (int i = 0; i < n; i++) {
StringTok... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.util.*;
public class Codeforces455Div2C {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] sp = br.readLine().split(" ");
int n = Integer.parseInt(sp[0]);
char[] list = new char[n];
fo... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import java.awt.image.BandedSampleModel;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.Scanner;
public class D{
static void sort(int[] A){
int n = A.length;
Random rnd = new Random()... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
if ((n % 4 == 0) || (n % 7 == 0) || (n % 44 == 0) || (n % 47 == 0) || (n % 74 == 0) || (n % 77 == 0)
|| (n % 444 == 0) || (n % 44... | constant | 122_A. Lucky Division | CODEFORCES |
import java.util.Scanner;
public class BDigitSequence {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long k = scan.nextLong();
long digits = 1;
long counter = 9L;
while(k > counter * digits) {
k -= counter * digits;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.nextLong();
long k = in.nextLong();
long disc = (long)(Math.sqrt(9 - 4 * (-2 * n - 2 * k)));
long x = (-3 + disc) / 2;
System.out.println(... | logn | 1195_B. Sport Mafia | CODEFORCES |
// Working program using Reader Class
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
public class Main1
{
static class Reader
{
final private int BUFFER_SIZE = 1 << ... | quadratic | 1209_A. Paint the Numbers | 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
* @author ocelopilli
*/
public class ... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.*;
import java.util.*;
import org.omg.PortableServer.ForwardRequestHelper;
public class A{
private BufferedReader in;
private StringTokenizer st;
void solve() throws IOException{
int n = nextInt();
int i = 0;
... | linear | 25_A. IQ test | 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++) {... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class B {
public static void main(String[] args) throws IOException {
// Scanner scan = new Scanner(System.in);
BufferedReader br= new BufferedReader(new InputStreamReader(System.i... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
// static Scanner in;
static PrintWriter out;
static BufferedReader in;
public static void main(String[] args) throws Exception {
// in = new Scanner(System.in);
out = new PrintWriter(System.out);
in = new BufferedReader(new InputStreamReader(System.in... | linear | 1_B. Spreadsheets | CODEFORCES |
/* Codeforces Template */
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.fill;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.sort;
public class Main {
static long initTime;
static final Random rnd = new Random(7777L);
static boo... | nlogn | 274_A. k-Multiple Free Set | 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 ankur
*/
public class Main... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.File;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Dictionary;
import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Ma... | cubic | 35_C. Fire Again | CODEFORCES |
/**
* Created with IntelliJ IDEA.
* User: yuantian
* Date: 3/24/13
* Time: 2:18 AM
* Copyright (c) 2013 All Right Reserved, http://github.com/tyuan73
*/
import java.util.*;
public class Pipeline {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.next... | logn | 287_B. Pipeline | 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... | np | 16_E. Fish | 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_E2. Rotate Columns (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.fill;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.sort;
public class Main {
public static void main(String[] args) throws IOException {
try {
if (new File("input.txt").exists()) {
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
List<Integer> fibs = new ArrayList<Integer>();
int fib0 = 0;
int fib1 = 1;
int fibN = ... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.*;
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();
int x,y;
boolean graph[][]=new boolean[n][n];
for(int i=0;i<m;i++){
x=sc.nextInt()-1... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.IOException;
/**
* Created by ww on 13.02.2016.
*/
public class rgb {
public static void main(String[] args) throws IOException {
System.out.print(25);
return ;
}
}
| constant | 630_A. Again Twenty Five! | 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.*;
import java.math.*;
import java.util.*;
public class Main {
static final long MOD = 998244353;
//static final long MOD = 1000000007;
static boolean[] visited;
public static void main(String[] args) throws IOException {
FastScanner sc = new FastScanner();
int N = sc.nextInt();... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.ArrayList;
import java.util.Scanner;
public class PaintTheNumber {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
ArrayList<Integer> l=new ArrayList<Integer>();
for(int i=0; i<n; i++) {
l.add(sc.nextInt());
}
boolean c=fals... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
public class C599 {
static ArrayList<Integer> [] adj;
static long [] a; static int [] type;
static Map<Long, Integer> map;
static int [] vis;
static HashSet<Integer> cy;
static boolean [] good;
static int [] dp;
static HashSet<Integer> [] nodes;
... | np | 1242_C. Sum Balance | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
long mod = (long) (1e9 + 7);
void solve() throws Throwable {
long x = readLong(), k = readLong();
if (x == 0) {
System.out.println(0);
return;
}
long r = solveFas... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
long l = s.nextLong();
long r = s.nextLong();
s.close();
if (r-l<2 || (r-l==2 && l%2==1)) {
System.out.print("-1");
return;
}
long beg = l%2==0 ? l : l+1;
if (beg+2>r) S... | constant | 483_A. Counterexample | CODEFORCES |
import java.util.*;
import static java.lang.Math.*;
public final class FollowTrafficRules {
private static double[] acce(double i, double a, double v) {
double[] r = new double[2];
r[0] = (v - i)/a;
r[1] = 1d/2d * a * pow(r[0], 2) + i * r[0];
return r;
}
private static doub... | constant | 5_D. Follow Traffic Rules | 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 | 908_C. New Year and Curling | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class P255D {
@SuppressWarnings("unchecked")
public void run() throws Exception {
long n = nextLong();
long x = nextLong();
long y = nextLong();
long c = nextLong();
if ((n == 1) || (c == 1)) {
println(0);
return;
... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.