src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
public class Main {
public static void main(St... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.Scanner;
public class R025A {
int n;
int[] nums;
public R025A() {
Scanner scanner = new Scanner(System.in);
n = scanner.nextInt();
nums = new int[n];
for(int i=0; i<n; i++) {
nums[i] = scanner.nextInt();
}
}
private void process() {
int odd = 0;
int even = 0;
int lastOdd = 0... | linear | 25_A. IQ test | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.StringTokenizer;
public class CF {
public static void main(String[] args) throws IOException {
Scanner sc=new Scanner(System.in);
PrintW... | constant | 84_A. Toy Army | CODEFORCES |
/*
* Code Author: Sanket Udgirkar.
* DA-IICT
*/
import java.util.*;
import java.io.*;
public class Tester
{
public static long mod=(long)1e9+7;
public static void main(String[] args)
{
InputReader s=new InputReader(System.in);
OutputStream outputStream = System.out;
//PrintWriter out=new Prin... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.lang.*;
import java.util.*;
import static java.lang.Integer.*;
import static java.lang.Long.*;
import static java.lang.Math.*;
import static java.lang.System.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class Main {
Main() throws IOException {
... | linear | 608_B. Hamming Distance Sum | 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.util.*;
import java.lang.*;
import java.math.*;
public class A {
Scanner sc = new Scanner(System.in);
void run(){
String s = sc.next();
String subS;
int max = 0;
for (int i=0;i<s.length();i++) {
for (int j=i+1;j<s.length()+1;j... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class C {
public static int mod = 1000000000 + 7;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String n = br.readLine();
... | linear | 914_C. Travelling Salesman and Special Numbers | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner in=new Scanner(System.in);
String str=in.next();
int cnt=0;
for(int i=0;i<str.length();++i) {
if(str.charAt(i)=='1') {
++cnt;
}
}
int i=0;
for(;i<str.length();++i) {
if(str.charAt(i)=='0') {
S... | linear | 1009_B. Minimum Ternary String | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class C {
public static void main(String[] args){
FastScanner scan = new FastScanner();
PrintWriter out = new PrintWriter(Syst... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.Scanner;
import java.util.Vector;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int a[] = new int[n];
int b[] = new int[n];
for (int i = 0; i < n; i++) ... | nlogn | 1010_A. Fly | CODEFORCES |
import java.io.*;
import java.util.*;
public class A implements Runnable {
public static void main(String[] args) {
new A().run();
}
class FastScanner {
BufferedReader br;
StringTokenizer st;
boolean eof;
String buf;
public FastScanner(String fileName) throws FileNotFoundException {
br = new Buffer... | cubic | 23_A. You're Given a String... | 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 | 256_B. Mr. Bender and Square | CODEFORCES |
import java.math.*;
import java.util.*;
import java.io.*;
public class Main {
void solve() {
long x=nl(),k=nl();
if(x==0) {
pw.println(0);
return;
}
long d=modpow(2,k,M);
long ans=mul(2,d,M);
ans=mul(ans,x,M)%M;
ans++;
ans%=M;
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) /*throws FileNotFoundException*/ {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
FastScanner in = new FastScanner(inputStream);
FastPrinter out = new FastPrinter... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[][] x = new int [200010][10];
String a = sc.nextLine();
String b = sc.nextLine();
int n = a.length();
int m = b.length();
for (int i = 1; i <= m; i++) {
... | linear | 608_B. Hamming Distance Sum | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class D {
public static void main(String [] args){
Scanner cin = new Scanner(System.in);
PrintWriter cout = new PrintWriter(System.out);
long l = cin.nextLong(), r = cin.nextLong(), k = 1;
if (l == r)cout.println(0);
else {
while (((r>>k)<<k)... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.util.Scanner;
public class B {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long k = sc.nextLong();
if ((k - 1) * k / 2 + 1 < n) {
System.out.println(-1);
return;
}
long left = 0;
long right = k;
while (left < right) {
long ... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class A {
static MyScanner sc;
static PrintWriter pw;
public static void main(String[] args) throws Throwable {
sc = new MyScanner();
pw = new PrintWriter(System.out);
n = sc.nextInt();
T = sc.nextLo... | nlogn | 1099_F. Cookies | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class _8C {
static int[] x = new int[30], y = new int[30];
st... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.Scanner;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author EndUser
*/
public class R455D2PC {
public static void main(String[] args) {
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class Start {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer t... | nlogn | 169_A. Chores | CODEFORCES |
import java.util.*;
import java.io.*;
public class D {
public static int dir[][]={{-1,0},{1,0},{0,-1},{0,1}};
public static void main(String[] args) {
// Scanner sc=new Scanner(System.in);
FastScanner sc = new FastScanner();
FastOutput out = new FastOutput(System.out);
int n=sc.nextInt();
int m=sc.nextInt()... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import static java.lang.Math.*;
import java.io.*;
import java.util.*;
public class A {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
public String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(in.readLine());
} catch(Exception e) {}
}
return st... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class BNew {
double gAns = 0;
public static void main(String[] args) throws IOException {
new BNew().solve();
}
private void solve() throws IOEx... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
int size= Integer.parseInt(r.readLine());
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
import java.lang.Math;
public class Main{
public static void main(String[] args){
Scanner ak=new Scanner(System.in);
long n,k,x;
n=ak.nextLong();
k=ak.nextLong();
x=(long)((-3+Math.sqrt(9+8*(n+k)))/2);
System.out.println(n-x);
}
} | logn | 1195_B. Sport Mafia | 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 Dzmitry Paulenka
*/
public class Main {
public static void main(String[] args) {
InputSt... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Solver {
StringTokenizer st;
BufferedReader in;
PrintWriter out;
public static void main(String[] args) thro... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class C {
public static int mod = 1000000000 + 7;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String n = br.readLine();
... | linear | 914_C. Travelling Salesman and Special Numbers | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.net.Inet4Address;
import java.util.*;
import java.lang.*;
import java.util.HashMap;
import java.util.PriorityQueue;
public class templ implements Runnable{
static class pair implements Comparable
{
int f;
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main
{
static FastReader sc=new FastReader();
static long dp[][][];
static int mod=1000000007;
public static void main(String[] args) throws IOException
{
//CHECK FOR N=1
//CHECK FOR N=1
//CHECK FOR N=1
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.math.BigDecimal;
import java.util.Scanner;
public class ReallyBigNumbers {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long s = scan.nextLong();
long ans = 0;
long l = 0;
long r = n;
while (l <= r) {
// Ke... | logn | 817_C. Really Big Numbers | 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 | 274_A. k-Multiple Free Set | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class round569d2b {
public static void main(String args[]) {
FastScanner in = new FastScanner(System.in);
int n = in.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = in.nextInt();
}
if (n % 2 == 0) {
for (i... | linear | 1180_B. Nick and Array | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
s.nextLine();
while(s.hasNext()) {
int first = s.nextInt();
int second = s.nextInt();
System.out.println(calculate(f... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n,b = 0;
n=in.nextInt();
if (n%2==0) {
b=n+n/2;
System.out.println(b);
}
}
}
| constant | 84_A. Toy Army | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.Arrays;
import java.util.Scanner;
public class A {
static InputStreamReader in = new InputStreamReader(System.in);
static BufferedReader bf = new BufferedReader(in);
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exception {
InputStream inputStream =... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.util.Scanner;
public class DigitsSequence {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
long k,c,n,d;
c=1;
d=9;
n=1;
k= sc.nextLong();
while(k>(c*d)) {
k-=(c*d);
n*=10;
d*=10;
... | logn | 1177_B. Digits Sequence (Hard Edition) | 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.util.*;
import java.io.*;
public class Solution
{
public static void main(String [] args) throws IOException
{
PrintWriter pw=new PrintWriter(System.out);//use pw.println() not pw.write();
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenize... | linear | 1011_A. Stages | CODEFORCES |
import java.util.*;
public class ehab4 {
public static void main( String[] args ) {
Scanner in = new Scanner( System.in );
int a = 0, b = 0;
System.out.println( "? 0 0 " );
System.out.flush();
int c = in.nextInt();
for ( int i = 29; i >= 0; i-- ) {
System.out.println( "? " + ( a + ( 1 << i ) ) + ... | logn | 1088_D. Ehab and another another xor problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class D{
static int bot;
static int n,m;
static int [][]a;
static int [][]Min;
static int [][]memo;
static int K;
static int dp(int msk,int ones,int last) {
if(ones==n) {
return Min[last][bot]>=K?1:0;
}
if(memo[last][msk]!=-1)
return memo[last][msk];
... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
public class C {
public static... | 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.Scanner;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException{
Scanner sc = new Scanner();
PrintWriter out = new... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class A implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok;
public static void main(String[] args) {
new Thread(null, new A(), "", 64*1024*1024).start();
}
public void run() {
try {
long t1 = 0, t2 ... | nlogn | 274_A. k-Multiple Free Set | 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 {
int n = nint();
char[] s = token().toCharArray();
int h = 0;
for (int i = 0; i < n; i++) {
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
Scanner in;
PrintWriter out;
boolean isPrime(int x) {
for (int i = 2; i * i <= x; ++i) {
if (x % i == 0) {
return false;
}
}
return true;
}
void solve() throws IOException {
in = new Scanner(System.in);
//in = new Scanner(new Fi... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
import static java.lang.System.*;
public class D276 {
Scanner sc = new Scanner(in);
public void run() {
long l=sc.nextLong(),r=sc.nextLong();
long tes=l^r;
int d=0;
while(tes!=0){
tes/=2;
d++;
}
ln((1L<<d)-1);
}... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.util.*;
import java.io.*;
public class X
{
public static void main(String args[])throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String s1 = br.readLine();
String s2 = br.readLine();
int i=0;
char c1,c2;
... | linear | 1037_C. Equalize | 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.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.Writer;
import java.io.OutputStream... | quadratic | 908_C. New Year and Curling | 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.... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Codeforces {
public static void main(String[] args) throws IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
final doubl... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.IOException;
import java.io.UnsupportedEncodingException;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {... | logn | 276_D. Little Girl and Maximum XOR | CODEFORCES |
import java.util.*;
public class substraction {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
while (t>0) {
long a=sc.nextLong();
long b=sc.nextLong();
int op=0;
if (a>b) {
while (a%b!=0) {
op+=a/b;
... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.math.BigDecimal;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.math.MathContext;
import java.io.PrintWriter;
import java.io.Writer;
import java.math.BigInteger;
import java.io.In... | logn | 338_A. Quiz | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter out;
static InputReader ir;
static void solve() {
int n=ir.nextInt();
int r=ir.nextInt();
int[] x=ir.ne... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class R023A {
String str;
int n;
public R023A() {
Scanner scanner = new Scanner(System.in);
str = scanner.next();
n = str.length();
}
private void process() {
int length = -1;
for(int i=1; i<n; i++) {
Set<String> set ... | 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.IOException;
import java.io.BufferedReader;
import java.io.Reader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at th... | logn | 1019_B. The hat | CODEFORCES |
import java.util.Arrays;
/**
* Created by IntelliJ IDEA.
* User: piyushd
* Date: 3/26/11
* Time: 10:53 PM
* To change this template use File | Settings | File Templates.
*/
public class TaskC {
final int INF = 123456;
int[][][] memo;
int N, M;
int solve(int row, int prevFreeMask, int curStayMa... | np | 111_C. Petya and Spiders | CODEFORCES |
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.*;
public class Main {
public static void main(String[] args) {
Scanner cin=new Scanner(new BufferedInputStream(System.in));
int n=cin.nextInt(),
m=cin.nextInt(),
k=cin.nextInt();
int[] a=new int[51];
for (int i=0;i<n;i... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.Collection;
import java.io.FileWriter;
import java.io.IOException;
import java.io.FileInputStream;
import java.io.InputStreamReader;
i... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.Scanner;
public class prob1 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
if(n == 1)
{
// throw new RuntimeException();
int m = input.nextInt();
System.out.println("NO");
// System.out.println(input.next());
return;
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.ArrayList;
import java.util.Scanner;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.nio.*;
public class Main {
public static void... | cubic | 35_C. Fire Again | 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.HashMap;
import java.util.Iterator;
import java.util.List;
impo... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class Sol122A {
BufferedReader in;
StringTokenizer st;
PrintWriter out;
String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(in.readLine());
return st.nextToken();
}
int nextInt() throws Exception {
return I... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | quadratic | 961_C. Chessboard | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
// long start = System.currentTimeMillis();
// long end = System.currentTimeMillis();
// System.out.println(" Execution time was "+(end-start)+" ms.");
Scanner kb = new Scanner(System.in);
int n = kb.nextInt();
int a[] = n... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
/**
*
* @author saurabh
*/
public class myTemplate {
/**
* @param args the command line arguments
*/
public static void main(String[] args) throws Exception{
// TODO code application logic here
java.io.BufferedReader br = new java.io.BufferedReader(new
java.io.Inp... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc =new Scanner(System.in);
long a=sc.nextLong();
if(a%4==0){System.out.println(a/2 + " " + a/2);}
... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
//package Round584;
import java.util.Arrays;
import java.util.Scanner;
public class Problem1 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int n = sc.nextInt();
int a []=new int[n];
for(int i=0;i<n;i++) {
a[i]=sc.nextInt();
}
Arrays... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class CottageVillage
{
Scanner in;
PrintWriter out;
CottageVillage()
{
in = new Scanner(System.in);
out = new PrintWriter(System.out);
}
public void finalize()
{
out.flush();
in.close();
out.close();
}
int ans(House a, House b, int t)
{
int diff... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
public class IQTest
{
public static void main(String[] args)
{
try
{
BufferedReader in = new BufferedReader(
new InputStreamReader(System.in));
String str = in.readLine();
int n = Integer.parseInt(str);
int odd = ... | linear | 25_A. IQ test | CODEFORCES |
// Author : RegalBeast
import java.io.*;
import java.util.*;
public class Main {
static final FastReader FR = new FastReader();
static final BufferedWriter BW = new BufferedWriter(new OutputStreamWriter(System.out));
public static void main(String[] args) throws IOException {
StringBuilder solution = new S... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.Scanner;
public class A023 {
public static void main(String[] args) {
System.out.println(f());
}
static int f() {
Scanner in = new Scanner(System.in);
String line = in.next();
for (int length = line.length(); length > 0; length--) {
for (int start = 0; start + length <= line.length(); s... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
public class Main
{
long mod = 1000000007;
long pow(long x,long y)
{
if(y==0)
return 1;
else if(y==1)
return x%mod;
else if(y... | logn | 992_C. Nastya and a Wardrobe | 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... | constant | 267_A. Subtractions | CODEFORCES |
import java.lang.*;
import java.util.*;
import java.io.*;
public class Main {
static void deal(int n,int[] arr) {
int[] a = new int[n];
a[0] = 1;
int l = 1;
out.println(toString(a,l));
for(int i=1;i<n;i++) {
if(arr[i] == 1) {
a[l] = 1;
... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class ProblemD_05 {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE")!=null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenize... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class Round111A {
public static void main(String[] args) throws IOException {
new Round111A().run... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class P19 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
Map<Integer, Integer> mapa = new HashMap<Int... | cubic | 23_A. You're Given a String... | 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 A {
/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
Scanner sc... | nlogn | 257_A. Sockets | CODEFORCES |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
//package CodeForces3;
import java.util.ArrayList;
import java.util.Scanner;
/**
*
* @author DELL
*/
public class HexadecimalsTheorem {
public void solve() {
Scanner sc = new Scanner(System.in);
... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.util.*;
import java.io.*;
public class C {
public static void main(String[] args) throws Exception {
final int fuck = 2001;
Scanner in = new Scanner(new File("input.txt"));
PrintWriter out = new PrintWriter(new File("output.txt"));
int n = in.nextInt(), m = in.nextInt();
int[] D = new int[ fuc... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
/**
*
* @author rohan
*/
public class Main {
static int mod = (int) (1e9+7);
static int MAX = (int)2e5+5;
static void solve()
{
int n = i();
String[] s = new String[n];
for(int... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.math.BigInteger;
import java.util.*;
public class C {
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long s = sc.nextLong();
BigInteger k = findFirst(BigInteger.valueOf(s));
if (BigInteger.va... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
public class A {
public static void main(String[]args) {
Scanner in = new Scanner(System.in);
long l = in.nextLong();
long r = in.nextLong();
if(r - l < 2) System.out.println(-1);
else {
if(l % 2 == 0)
System.out.println(l + " "... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
import java.util.logging.Level;
import java.util.logging.Logger;
public class ProblemA {
private final B... | nlogn | 166_A. Rank List | 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... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.stream.*;
@SuppressWarnings("unchecked")
public class P35C {
final static int SHIFT = 11;
final static int MASK = (1 << SHIFT) - 1;
final static int [] DX = {-1, 1, 0, 0};
final static int [] DY = { 0, 0, -1, 1};
public void run() ... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.List;
import java.util.StringTokenizer;
public class D {
int[][] fast(int n, int m){
int[][] ans = new int[2][n * m];
int c = 0;
for (int left = 1, ri... | quadratic | 1179_B. Tolik and His Uncle | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long k = in.nextLong();
long t = 1;
long l = 1;
if(k <= 9) {
System.out.print(k);
System.exit(0);
}
long x = 9;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Iterator;
import java.util.Set;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
//package com.krakn.CF.B1159;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n;
n = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
... | linear | 1159_B. Expansion coefficient of the array | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.util.List;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
/**
... | linear | 1067_B. Multihedgehog | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextLong();
long s = scanner.nextLong();
long myLong = s;
long count =0;
while(true){
if(myLong>n)... | logn | 817_C. Really Big Numbers | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.