src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.util.*;
import java.math.*;
public class Main {
static final long MOD = 1000000007L;
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int k = scan.nextInt();
int res = -1;
int[] arr ... | linear | 224_B. Array | CODEFORCES |
import java.util.Optional;
import java.util.Scanner;
import java.util.StringJoiner;
public class Main {
public static void main(String[] args) {
Main main = new Main();
main.solveC();
}
private void solveA() {
Scanner sc = new Scanner(System.in);
String str = sc.next();
long answer = str.chars().filter(
... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int res = n;
String str = Integer.toString(n);
res = Math.max(res, Integer.parseInt(str.substring(0, str.length()... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
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);
String s = sc.next();
sc.close();
int res = 0;
for (int i = 0; i < s.length(); i++)
for (int j = i + 1; j <= s.length(); j++) {
Stri... | cubic | 23_A. You're Given a String... | CODEFORCES |
//package code;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;
import java.util.TreeMap;
/... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int[][][] dp;
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
int n = r.nextInt();
int m = r.nextInt();
if(n > m){int t = n; n = m; m = t;}
... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.util.Scanner;
public class ProblemA {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long[] answer = new long[3];
if (n == 1) {
answer[0] = 0;
answer[1] = 0;
answer[2] = 1;
... | constant | 199_A. Hexadecimal's theorem | 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.PrintWriter;
import java.util.*;
/**
* Created by trung.pham on 28/12/17.
*/
public class C_Round_455_Div2 {
static long[][]dp;
static long MOD =(long) 1e9 + 7;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Solution implements Runnable {
public static void main(String[] args) {
(new Thread(null, new Solution(), "1", 1l << 28)).s... | nlogn | 160_A. Twins | 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(), m = iread();
int INF = -1;
if (m > n) {
int t = m;
m = n;
n = t;
... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.util.*;
public class EMatrix{
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
Ta... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.io.*;
public class Main {
private static Reader in;
private static PrintWriter out;
public static void main(String args[]) throws IOException {
in = new Reader();
out = new PrintWriter(System.out);
long n = in.nextLong();
long s = in.nextLong();
long low ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.BufferedWriter;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.TreeMap;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(new Buffe... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.*;
public class Main {
static public void main(String args[]) throws Exception {
Scanner s = new Scanner(System.in);
int n = s.nextInt(), m = s.nextInt... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
public static void main(String ar[]) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String s1[]=br.readLine().split(" ");
String s2[]=br.readLine().split(" ");
i... | linear | 1000_B. Light It Up | CODEFORCES |
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IO... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
public class PlayingPiano {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
List<Integer> as = new LinkedList<>();
int[] as2 =... | linear | 1032_C. Playing Piano | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String args[]) {new Main().run();}
FastReader in = new FastReader();
PrintWriter out = new PrintWriter(System.out);
void run(){
int t=in.nextInt();
for(int i=0;i<t;i++) {
out.println(work());
}
out.flush();
}
long mod=1... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class C {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
int T = sc.nextInt();
StringBuilder sb = new StringBuilder();
while(T-->0) {
int n = sc.nextInt();
int[] arr = new int[n];
for(int i = 0; i < n; i++) {
arr[i] = sc.n... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.HashSet;
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.IOExcep... | linear | 1004_A. Sonya and Hotels | 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.util.*;
import java.io.*;
public class C1523 {
public static void print(Stack<Integer> st, PrintWriter pw) {
for (int i = 0; i < st.size(); i++) {
pw.print(st.get(i));
if (i != st.size() - 1) {
pw.print(".");
}
}
pw.println();
}
public static void main(String[] args) throws IOExcepti... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.util.Random;
import java.io.InputStream;
/**
* @author khokharnikunj8
*/
public class Main {
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.PrintWriter;
import java.util.*;
public class E1180D {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));
int n = sc.nextInt();
in... | quadratic | 1179_B. Tolik and His Uncle | CODEFORCES |
import java.util.*;
import java.io.*;
/* spar5h */
public class codeforces implements Runnable {
final static long mod = (long)1e9 + 7;
public void run() {
InputReader s = new InputReader(System.in);
PrintWriter w = new PrintWriter(System.out);
int n = s.nextInt();
char[] c = new char[n];
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class E {
static double[] dp;
static int[] oneCount;
static int end;
static int n;
static double[][] prob;
public static double solve(int mask) {
if(mask==end) return 1;
int oneC=0,zeroC=0;
for(int i=0;i<n;i++) {
... | np | 16_E. Fish | CODEFORCES |
import java.lang.*;
import java.io.*;
import java.util.*;
public class Main {
public void solve() throws IOException {
int n = nextInt(), r = nextInt();
int x[] = new int[n];
for (int i = 0; i < n; i++) {
x[i] = nextInt();
}
double res[] = new double[n];
... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.Stack;
import java.util.stream.Collectors;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
for (int tc = 0; tc < t; ++tc) {
int n = ... | cubic | 1523_C. Compression and Expansion | 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.io.OutputStream;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.File;
impor... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.StringTokenizer;
public class D {
static int n, KA, A;
static int[] b;
static int[] l;
static double ans = 0;
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map.Entry;
import java.util.Random;
import j... | np | 1242_C. Sum Balance | CODEFORCES |
import java.util.Scanner;
public class Main3 {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
long l = s.nextLong();
long r = s.nextLong();
String a = Long.toBinaryString(l);
String b = Long.toBinaryString(r);
wh... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Stack;
public class ProblemD {
public static void main(String[] args) throws IOException {
BufferedReader s = new BufferedReader(new InputStreamReader(Sy... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
while(sc.hasNext()) {
int n=sc.nextInt();
String s=sc.next();
int sum=0;
for(int i=0;i<s.length();i++) {
if(s.charAt(i)=='+') {
sum++;
}
if(s.charAt(i)=='-'&&sum!=0... | linear | 1159_A. A pile of stones | CODEFORCES |
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class A {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int a = scan.nextInt();
Queue<Integer> q = new LinkedList<Integer>();
... | constant | 122_A. Lucky Division | CODEFORCES |
import java.util.*;
import java.io.*;
public class A {
public static void main(String[] args) {
FastScanner scanner = new FastScanner();
PrintWriter out = new PrintWriter(System.out, false);
int n = scanner.nextInt();
int[] arr = new int[n];
for(int i = 0; i < n; i++) {
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.StringTokenizer;
import java.util.HashMap;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
imp... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
public class CF125D2A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.prin... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.StringTokenizer;
public class solver {
FastScanner in = new FastScanner(System.in);
PrintW... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class C {
public static void main(String[] args) throws Exception {
BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
int t... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
// package com.company.codeforces;
import java.util.*;
public class Solution {
static int n,m,h[][],v[][];
public static void main(String[] args) {
Scanner input=new Scanner(System.in);
n=input.nextInt();
m=input.nextInt();
int k=input.nextInt();
h=new... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Stack;
public class C {
private static PrintWriter out = new PrintWriter(System.out);
public static void solve(... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
// Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail
public class Ideone {
public static void main(String args[] ) throws Exception{
BufferedReader br = new BufferedReader(... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
import java.util.concurrent.ArrayBlockingQueue;
import org.omg.CORBA.UNKNOWN;
public class HelloWorld {
InputReader input;
PrintWriter output;
BufferedReader inp;
void run... | constant | 343_A. Rational Resistance | CODEFORCES |
//app.は全部けす
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
//流す前にfinalにする
public final class EcRound35DApplication {
public static void main(String[] args) {
Input input = new Input();
input = SystemInput();
List<String> resultList = run(input);
for(... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;
public class A {
static int[] parent;
public static int find(int x) {
if (x == parent[x])
return x;
return parent[x] = find(parent[... | 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.io.OutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.io.BufferedOutputStream;
import java.util.StringTokenizer;
import java.io.Buff... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
public class C {
public static final long MAX = 1000000000L;
public static void main(String[] args) throws IOException{
BufferedRead... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
/* spar5h */
public class cf3 implements Runnable{
final static long mod = (long)1e9 + 7;
static long modExp(long x, long pow) {
x = x % mod;
long res = 1;
while (pow > 0) {
if (pow % 2 =... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.*;
import java.math.*;
import static java.lang.Integer.*;
import static java.lang.Double.*;
import java.lang.Math.*;
public class two_squares {
public static void main(String[] args) throws Exception {
new two_squares().run();
}
public void run() throws Exc... | constant | 994_C. Two Squares | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class CF495A {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
long d = s.nextLong();
long[] arr = new long[n];
for (int i = 0; i < n; i++) {
arr[i] = s.ne... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.util.concurrent.*;
public final class py_indent
{
static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
static FastScanner sc=new FastScanner(br);
static PrintWriter out=new PrintWriter(System.out);
static Random r... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.Locale;
import java.io.OutputStream;
import java.util.RandomAccess;
import java.io.PrintWriter;
import java.util.AbstractList;
import java.io.Writer;
import java.util.List;
import java.util.Map;
import java.io.IOException;
import java.ma... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.util.*;
import java.util.Scanner;
public class Def {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner s = new Scanner(System.in);
int t = s.nextInt();
while (t-->0) {
int n = s.nextInt();
int[] arr = new int[n];
for (int i=0; i<n; i++) {
arr[i... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
/**
* Created by hama_du on 15/09/10.
*/
public class A {
private static final long MOD = 1000000009;
public static void main(String[] args) {
InputRe... | logn | 338_A. Quiz | 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.util.*;
public class B
{
public static void main(String[] args)
{
new B(new FastScanner());
}
int hash(int i, int[] cc)
{
int res = i;
for (int ii : cc)
{
res *= 8;
res += ii;
}
return res;
}
int N, K, A;
int[] lvl;
int[]... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/**
*
* @author Antonio "Teo" Alurralde
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReade... | constant | 1033_A. King Escape | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args){
InputStream inputStream = Syste... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.*;
import java.util.*;
public class Quiz {
public static int mod = 1000000009;
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(f.readLine());
long... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count = sc.nextInt();
HashSet<Integer> set = new HashSet<>();
for (int i = 0; i < count; i++) {
set.add(sc.nextInt());
}
ArrayList<Int... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
public static void main(String[] args) throws IOException{
BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));
String a=buffer.readLine();
int b=Integer.parseInt(a);
if(b%4==0 || b%7==0 || b%44==0 || b%47==0 || b%74==0 || b%77==0 || b%4... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
public class Main {
public static void main(String[] args) throws IOException {
n... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;import java.io.*;import java.math.*;
public class Main
{
public static void process()throws IOException
{
long n=nl();
if(n%2==0)
{
long a1=(long)Math.sqrt(n);
long a2=(long)Math.sqrt(n/2);
if(a1*a1==n || a2*a2*2==n)
... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
//package round156;
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 B {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni(), x = n... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.PrintStream;
import java.util.Scanner;
/**
* @author Roman Elizarov
*/
public class Round_146_A {
public static void main(String[] args) {
new Round_146_A().go();
}
void go() {
// read input
Scanner in = new Scanner(System.in);
int n = in.nextInt();
// solve
long result = solve(n);
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class B {
static PrintWriter out = new PrintWriter(System.out);
static FS in;
static int N;
static final boolean debug = false;
static int inp[] = new int[] {1,2,3,2,1,0};
publi... | logn | 1019_B. The hat | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;
public class GeorgeAndInterestingGraph {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
int N = sc.nextInt();
int M = sc.nextInt(... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import javax.print.Doc;
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 taskB {
public static void main(String[] args) throws IOException {
new taskB().run();
}
Bu... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.BufferedWriter;
import java.io.PrintWriter;
import java.io.Writer;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
/**
* Built using CHelper plug-in
* Actual solution is at ... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
static double max = 0.0;
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
int n = r.nextInt();
int k = r.nextInt();
int A = r.nextInt();
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class LightItUp {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new ... | linear | 1000_B. Light It Up | CODEFORCES |
import java.io.*;
import java.util.*;
public class G{
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
TaskE so... | cubic | 1187_G. Gang Up | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static int inf = (int) 1e9 + 7;
static int n, m, a[][];
static ArrayList<Integer> used;
static int num[];
static int ans;
static void rec(int id) {
if (id == used.size()) {
check();
return;
}
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
public class C15A {
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int t=sc.nextInt();
double nm[][]=new double[n][2];
int a=0;
int b=0;
for(int i=0;i<n;i++){
a=sc.nextInt();
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static boolean used[][];
static int n;
static int m;
public static void main(String[] args) throws IOException {
br = new BufferedReader(new FileReader("input.txt"));
PrintWriter out = new PrintWriter("output.txt");
n ... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Solution {
BufferedReader in;
StringTokenizer st;
PrintWriter out;
int n, m, k;
int[] x, y;
char[] qx = new char[4000000], qy = new char[4000000];
int b, e;
char[][] d;
int[] dx = { -1, 0, 1, 0 }... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.StringTokenizer;
public class CTask {
public static void main(String[] args) throws IOException {
MyInputReader in = new MyInputReader(System... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main
{
public static void main(String[] args)
{
FastReader fr =new FastReader();
PrintWriter op =new PrintWriter(System.out);
long n =fr.next... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class ModifyLongest {
InputStream is;
PrintWriter out;
String INPUT = "";
//boolean codechef=true;
boolean codechef=true;
void solve()
{
/*
long l=ni(),r=ni(),x=ni(),y=ni();
long prod=x;
prod*=y;
i... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
public class C {
public static void main(String[] args) throws IOException {
File in... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.Scanner;
public class LuckyDivison
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int inp = in.nextInt();
if(inp%4==0||inp%7==0||inp%47==0||inp%74==0||inp%447==0||inp%474==0||inp%477==0||inp%747==0||inp%774==0||inp%777==0)
{
... | 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.List;
import java.util.StringTokenizer;
import java.util.Map;
import java.... | nlogn | 903_D. Almost Difference | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
InputStream inputStream = System.in;
// InputStream inputStream = new FileInputStream("dijkstra.in");
OutputStream outputStream = System.out;
// OutputStream outputStr... | logn | 817_C. Really Big Numbers | CODEFORCES |
// @author Sanzhar
import java.io.*;
import java.util.*;
import java.awt.Point;
public class Template {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(in.readLine()... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class A
{
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = null;
private void solve() throws IOException
{
int n =... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class CE35D {
public static void main(String[] args) throws NumberFormatException, IOException {
//Scanner sc = new Scanner(System.in);
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
/**
* Created by Darren on 14-10-21.
*/
public class D {
Reader in = new Reader(System.in);
PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
new D().run();
}
int n, m;
bool... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
public class CF {
BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st=null;
private void solution() th... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;
/**
* @author khokharnikunj8
*/
public class Main {
public static void main(String[] args) {
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
public class PlayingPiano {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
List<Integer> as = new LinkedList<>();
int[] as2 =... | linear | 1032_C. Playing Piano | CODEFORCES |
import java.util.*;
import java.io.*;
public class B {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextInt(), k = sc.nextInt();
long start = 1, end = n;
while(start <= end) {
long mid = (start + end) >> 1;
if(calc(mid) - (n - mid) == k) {
S... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.Locale;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Locale.setDefault(Locale.US);
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String[] number = new String[n];
sc.nextLine();
String l = sc.nextLine();
number = l.split(" ");
int oe ... | linear | 25_A. IQ test | CODEFORCES |
import java.io.*;
import java.util.*;
public class A{
public static BufferedReader k;
public static BufferedWriter z;
public static void main(String [] args)throws IOException{
k = new BufferedReader(new InputStreamReader(System.in));
z = new BufferedWriter(new OutputStreamWriter(System.out));
... | constant | 483_A. Counterexample | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
/**
*
* @author oleksiys
*/
public class A {
public static void main(String [] args){
try(Scanner s = new Scanner(System.in)){
final int n = s.nextInt();
final int m = s.nextInt();
final int k = s.nextInt();
... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHel... | quadratic | 911_D. Inversion Counting | 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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.StringTokenizer;
public class A {
static int[] parent;
public static int find(int x) {
if (x == parent[x])
return x;
return parent[x] = find(parent[x]);
}
public sta... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.