src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import java.util.*;
public class Solution implements Runnable {
Scanner input;
PrintWriter output;
private void solve() throws Exception
{
int n = nextInt();
int m = nextInt();
int k = nextInt();
int[] r = new int[k];
int[] c = new int[k];
for (int i = 0; i < k; i++)
{
r[i] = ... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.Scanner;
public class FUck {
public static void main(String args[])
{
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
int k=scan.nextInt();
String t=scan.next();
int mx=0;
for(int i=1;i<n;i++)
{
int gd=1;
for(int j=0;j<i;j++)
{
if(t.charAt(j... | quadratic | 1029_A. Many Equal Substrings | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
Scanner in;
PrintWriter out;
void solve() {
out.print("25");
}
void run() {
in = new Scanner(System.in);
out = new PrintWriter(System.out);
solve();
... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.util.*;
public class TaskF {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n + 1];
for (int i = 1; i <= n; i++) {
a[i] = in.nextInt();
}
int[] prefixSum = new int[n + 1]... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.Arrays;
public class Main {
private static void solve() {
int n = ni();
String[] lines = new String[n];
for(int i = 0; i < n; i ++) {
lines[i] = next();
}
int mod = 1000000000 + 7;
long[][] dp = new long[2][n + 1];
dp[0][0] = 1;
for (int i = 0; i < n; i ++) {
int from = i ... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import java.io.*;
// Solution
public class Main
{
public static void main (String[] argv)
{
new Main();
}
boolean test = false;
public Main() {
FastReader in = new FastReader(new BufferedReader(new InputStreamReader(System.in)));
//FastReader in... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class C {
static StringBuilder st = new StringBuilder();
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
Point [] sq... | constant | 994_C. Two Squares | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.stream.*;
@SuppressWarnings("unchecked")
public class P35C {
final static int [] DX = {-1, 1, 0, 0};
final static int [] DY = { 0, 0, -1, 1};
public void run() throws Exception {
int m = nextInt();
int n = nextInt();
boole... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
/**
* @author Egor Kulikov (egor@egork.net)
* Created on 14.03.2010
*/
public class Rules implements Runnable {
private Scanner in = new Scanner(System.in);
private PrintWriter out = new PrintWriter(System.out);
private double a, v, l, d, w;
private ... | 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.StringTokenizer;
public class Test {
static BufferedReader reader;
static StringTokenizer tokenizer;
static PrintWriter writer;
static int nextInt() th... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.sql.Time;
import java.util.*;
import java.math.BigInteger;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import static java.util.Arrays.*;
public class Main{
void run(){
Locale.setDefault(... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.*;
public class Main{
//SOLUTION BEGIN
//Into the Hardware Mode
void pre() throws Exception{}
void solve(int TC)throws Exception{
int n = ni();
int[] a = new int[n];
for(int i = 0; i< n; i++)a[i] = ni();
Arrays.sort(a... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class q3 {
public static void main(String[] args) throws Exception {
// String[] parts=br.readLine().split(" ");
// int n=Integer.parseInt(parts[0]);
// int k=Integer.parseInt(parts[1]);
BufferedReader br = new BufferedReader(new InputSt... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.*;
import java.util.Map.Entry;
import java.math.*;
import java.io.*;
public class Main {
static int[][] to = { { 1, 0 }, { 0, 1 }, { -1, 0 }, { 0, -1 } };
public static void main(String[] args) throws FileNotFoundException {
InputReader in = new InputReader(System.in);
// Scanner in = new Scan... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class C {
static double ycoord(double xi, double yi, double xj, double r) {
if(Math.abs(xi-xj) > 2*r) return r;
double dist = Math.sqrt((4*r*r)-((xi-xj)*(xi-xj)));
//System.out.println("dist" + dist);
return Math.max(yi+dist,... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
static final double eps = 1e-8;
public static void main(String[] args) throws IOException {
try {
... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
private InputStream is;
private PrintWriter out;
int time = 0, dp[][], DP[][], start[], parent[], end[], val[], black[], MOD = (int)(1e9+7), arr[], arr1[];
int MAX = 10000000, N, K, p;
ArrayList<Integer>[] amp, amp1;
boolean b[], b1[... | logn | 817_C. Really Big Numbers | CODEFORCES |
/*
* PDPM IIITDM Jabalpur
* Asutosh Rana
*/
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
long MOD = 1000000007;
InputReader in;
BufferedReader br;
PrintWriter out;
public static void main(String[] args) throws java.lang.Exception {
Main solver = new Main();
solver.in = ne... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
public class Main {
publi... | nlogn | 169_A. Chores | 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.io.PrintWriter;
import java.util.StringTokenizer;
public class TaskA implements Runnable {
@Override
public void ru... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF817C {
static long count(long x) {
return x < 10 ? x : count(x / 10) + x % 10;
}
static boolean check(long x, long s) {
return x - count(x) >= s;
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new Inpu... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
static int[][]memo;
static int n,m,in[][];
static int dp(int col,int maxRowMask) {
if(col>=Math.min(n, m) || maxRowMask==((1<<n)-1))return 0;
if(memo[col][maxRowMask]!=-1)return memo[col][maxRowMask];
int ans=0;
int availableBits=maxRowMask^((1... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
/**
* Created by Baelish on 8/28/2018.
*/
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class F_DSU {
public static void main(String[] args)throws Exception {
FastReader in = new FastReader(Sys... | quadratic | 1027_F. Session in BSU | CODEFORCES |
//package arbuz;
import java.util.Scanner;
public class Arbuz {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
int i, j, current, longest = 0;
for (i = 0; i < s.length(); i++) {
for (j = 0; j < s.length(); j++) {
... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
public void _main() throws IOException {
String s = next();
for (int len = s.length(); len >= 1; len--) {
for (int i = 0; i + len <= s.length(); i++)
for (int j = i + 1; j + len <= s.length(); j++)
if (s.substring(i, i + le... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class A {
public static void main(String[] args){
FastScanner sc = new FastScanner();
... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.StringTokenizer;
public class Array {
void run() {
try {
BufferedReader bfd = new BufferedReader(new InputStreamReader(
System.in));
StringTokenizer tk = ... | linear | 224_B. Array | 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 | 1_B. Spreadsheets | CODEFORCES |
import java.io.*;
import java.util.*;
public class TaskA {
public static void main(String[] args) {
FastReader in = new FastReader(System.in);
// FastReader in = new FastReader(new FileInputStream("input.txt"));
PrintWriter out = new PrintWriter(System.out);
// PrintWriter out = new ... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
//201920181
public class Polycarp{
public static void main(String args[]){
Scanner s = new Scanner(System.in);
int rem[] = new int[3];
Arrays.fill(rem,-1);
rem[0] = 0;
char ch[] = s.next().toCharArray();
int n = ch.length;
long dp[] = new long[n];
int sum =... | linear | 1005_D. Polycarp and Div 3 | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args)throws Exception {
File _=new File("chores.... | nlogn | 169_A. Chores | 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.util.Arr... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
public class First {
StreamTokenizer in;
PrintWriter out;
int nextInt() throws IOException {
in.nextToken();
return (int)in.nval;
}
long nextLong() throws IOException {
in.nextToken();
return (long) in.nval;
}
String nextString() throws ... | linear | 1011_A. Stages | CODEFORCES |
import java.util.Scanner;
public class N1_CF_199A {
public static void main(String[] args) {
int n = new Scanner(System.in).nextInt();
if( n == 0)
{
System.out.println(0);
System.out.println(0);
System.out.println(0);
return;
}
int i = 0 , j = 1;
while(true)
... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1497E2 extends PrintWriter {
CF1497E2() { super(System.out); }
static class Scanner {
Scanner(InputStream in) { this.in = in; } InputStream in;
byte[] bb = new byte[1 << 15]; int i, n;
byte getc() {
if (i == n) {
i = n = 0;
try { n = in.read(bb); ... | cubic | 1497E2 | CODEFORCES |
/* Shubhang Verma */
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args)
{
InputStream inputstream = System.in;
OutputStream outputstream = System.out;
InputReader in = new InputReader(inputstream);
OutputWriter ... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.io.*;
import java.util.*;
public class CC {
public static void main(String[] args)throws Throwable {
MyScanner sc=new MyScanner();
PrintWriter pw=new PrintWriter(System.out);
int n=sc.nextInt();
int r=sc.nextInt();
int [] x=new int [n];
for(int i=0;i<n;i++)
x[i]=sc.nextInt();
double [] ... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class A {
static int[] UPPER = new in... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
public class Three{
public static void main(String[] args) {
Scanner in = new Scanner (System.in);
PrintWriter out = new PrintWriter(System.out);
pair[] points = new pair [3];
for (int i = 0; i < 3; ++i) {
int x = in.nextInt();
int y = in.nextInt();
points[... | nlogn | 1086_A. Connect Three | CODEFORCES |
//package educational.round23;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class C {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
long n =... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception{
FastReader sc=new FastReader();
... | constant | 987_A. Infinity Gauntlet | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Main {
static double [] res;
static double r;
static double solve (int xMe, int xHim, int idxHim) {
if (Math.abs(xMe - xHim) > 2 * r) return r;
double hisY = res[idxHim];
double lo = hisY, hi = hisY + 2 * r, best = hi;... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public static void main(String args[]) {
FastScanner scn = new FastScanner();
int n = scn.nextInt();
int s = scn.nextInt();
if (s <= n) {
System.out.println(1);
} else if (s > n) {
if(s%n == 0){
... | constant | 1061_A. Coins | CODEFORCES |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
static int n, memo[], dS[], dd[][];
static int dp(int idx, int m... | np | 8_C. Looking for Order | CODEFORCES |
/*
(7 10) 1 2 3
(3, 7)
(1, 3)
(3, 7)
(3, 4)
(3, 1)
(2, 1)
(1, 1)
1
*/
import java.util.*;
public class CodeForcesW8P2 {
public static void main(String [] args){
Scanner sc = new Scanner(System.in);
int tests = Integer.valueOf(sc.nextLine());
while(tests > 0){
int count = 0... | constant | 267_A. Subtractions | CODEFORCES |
//package sept;
import java.io.*;
import java.util.*;
public class TimePass implements Runnable {
InputStream is;
PrintWriter out;
String INPUT = "";
//boolean debug=false;
boolean debug=true;
static long mod=998244353;
static long mod2=1000000007;
void solve() throws IOException... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
import java.io.*;
public class Main {
void solve() {
int R = sc.nextInt();
int C = sc.nextInt();
int K = sc.nextInt();
int[] x = new int[K];
int[] y = new int[K];
for (int i = 0; i < K; i++) {
x[i] = sc.nextInt();
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
class Team implements Comparable<Team>{
int p, t;
public Team(int p, int t) {
this.p = p;
this.t = t;
}
public int compareTo(Team other) {
if (this.p != other.p) return other.p - this.p;
return this.t - other.t;
}
}
public void solve() ... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String args[])
{
FastReader input=new FastReader();
PrintWriter out=new PrintWriter(System.out);
int T=1;
while(T-->0)
{
int n=input.nextInt();
int a[]=new int[n];
... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main
{
long sum ( long n ) { return (n*(n+1))/2; }
public void solve ( ) throws Exception
{
Scanner in = new Scanner ( System.in );
long n = in.nextLong()-1;
long k = in.nextLong()-1;
long lo = 0, hi = k, mi;
while ( lo < hi )
{
mi = ( lo + hi ) ... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.*;
public class Bank{
public static void main(String[] args){
Scanner reader = new Scanner(System.in);
int in = reader.nextInt();
int sign = (int)Math.signum(in);
String str = Math.abs(in)+"";
if(str.length() == 1){
if(in < 0)
System.out.println(0);
else
System.out.println(... | constant | 313_A. Ilya and Bank Account | 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.math.*;
public class B2 {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
BigInteger n = new BigInteger(scan.next());
BigInteger k = new BigInteger(s... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution2 {
private void solve() throws IOException {
int n = in.nextInt();
double r = in.nextDouble();
List<Double> xes = new ArrayList<>(n);
List<Double> yes = new ArrayList<>(n);
for (int i = 0; i < n; i++) {
... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.InputMismatchException;
import java.math.BigInteger;
import java.io.*;
import java.util.*;
/**
* Generated by Contest helper plug-in
* Actual solution is at the bottom
*/
public class Main {
public static void main(String[] args) {
InputReader in = new StreamInputReader(System.in);
PrintWrite... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class Main {
public static void main(Stri... | 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 C {
static int MOD = 1_000_000_007;
public static void main(String[] args) {
MyScanner in = new MyScanner();
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Scanner;
public class Main {
static StreamTokenizer st = new StreamTokenize... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.HashMap;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Rene
*/
public class Main {
public static ... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class InversionCounting {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
br.readLine();
int[] a = Arrays.... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io. *;
import java.util. *;
public class Main {
void solve(Scanner in, PrintWriter out) {
out.println(25);
}
void run() {
Locale.setDefault(Locale.US);
try (
Scanner in = new Scanner(System.in);
PrintWriter out = new Print... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.util.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class test{
// ArrayList<Integer> lis = new ArrayList<Integer>();
// ArrayList<String> lis = new ArrayList<String>();
//
// static long su... | linear | 224_B. Array | CODEFORCES |
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import java.io.*;
public class Test5{
static long mod=1000000007;
public static void main(String[] z) throws Exception{
Scanner s = new Scanner(System.in);
long a = s.nextLong(), b=s.nextLong(), c=(a*2-1)%mod, i=b... | logn | 992_C. Nastya and a Wardrobe | 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 Out... | linear | 1190_B. Tokitsukaze, CSL and Stone Game | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Random;
import java.io.IOException;
import java.io.Reader;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.i... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.io.* ;
import java.util.* ;
import java.text.* ;
import java.math.* ;
import static java.lang.Math.min ;
import static java.lang.Math.max ;
public class Codeshefcode{
public static void main(String[] args) throws IOException{
Solver Machine = new Solver() ;
Machine.Solve() ;
Machine.Finish() ;
// n... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.Scanner;
public class ABC {
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)... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class Probram3 {
public static int get(long n) {
int sum = 0;
while(n != 0) {
sum += n % 10;
n = n / 10;
}
return sum;
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextLong();
long s = scanner.nextLong()... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
public class Main {
private BufferedReader input;
private PrintWriter output;
private StringTokenizer stoken;
String fin = "input";
String fout = "output";
private void solve() {
long a = nextInt();
long res = (a / 2) * 3;
... | constant | 84_A. Toy Army | CODEFORCES |
import java.util.*;
public class mad{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int cura = 0,curb = 0;
int ver;
System.out.println("? 0 0");
System.out.flush();
ver = sc.nextInt();
for(int i=29;i>=0;i--){
Sys... | logn | 1088_D. Ehab and another another xor problem | CODEFORCES |
import static java.util.Arrays.*;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import java.util.*;
import java.math.*;
import java.io.*;
public class A implements Runnable
{
String file = "input";
void init() throws IOException
{
//input = new BufferedReader(new FileReader(file + ".in")... | linear | 25_A. IQ test | CODEFORCES |
import java.util.Scanner;
public class A015 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt(), t = in.nextInt();
int[] centers = new int[n], sides = new int[n];
for (int x = 0; x < n; x++) {
centers[x] = in.nextInt();
sides[x] = in.nextInt();
}
int... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
InputStream fin = System.in;
//fin = new FileInputStream("in.txt");
Scanner cin = new Scanner... | np | 11_D. A Simple Task | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: Taras_Brzezinsky
* Date: 8/14/11
* Time: 9:53 PM
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.FileReader;
import java.util.StringTokenizer;
imp... | np | 16_E. Fish | CODEFORCES |
import java.awt.Point;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintStream;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.HashSet;
public class FireAgain {
Point[] coordinate;
Queue<Point> q = new LinkedLi... | cubic | 35_C. Fire Again | CODEFORCES |
//package info.stochastic;
import java.io.*;
import java.util.*;
public class C {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(o... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import static java.lang.Math.*;
import java.io.*;
import java.util.*;
public class flags1225 implements Runnable {
static int n, k, a, b[], loy[];
static boolean decision[];
static double ans, max;
static void check(int i) {
if (i == n) {
checkAgain();
return;
}
decision[i] = true;
check(i + 1);
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
public class Edu23 {... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* Date: 23.06.13 at 15:29
*
* @author Nickolay Polyarniy aka PolarNick
*/
public class ProblemA {
private static long MOD = 1000000009;
public void... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
import java.io.*;
public class C {
public static void main(String[] args) throws IOException {
BufferedReader in =
new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(in.readLine());
char[] ps = in.readLine().toCharArray();
HashMap<Character, TreeSet<Integer>... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
public class A {
public static void main(String[] args) throws FileNotFoundException {
Scanner s = new Scanner(System.in);
int T = s.nextInt();
System.out.println("0 0 "+T);
/*if(T==0) {
... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Main {
final static int mod = 1_000_000_007;
public static void main(String[] args) throws Exception {
STDIN scan ... | quadratic | 911_D. Inversion Counting | 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.math.BigInteger;
import java.util.StringTokenizer;
public class A {
static StringTokenizer st;
static BufferedReader... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.function.BinaryOperator;
import java.util.stream.IntStream;
public class Main {
private static InputReader reader = new InputReader(System.in);
private static PrintWriter writer = new PrintWriter(System.out);
public static void main(String[] args) {
... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
public class Main {
static void insert(TreeMa... | nlogn | 528_A. Glass Carving | CODEFORCES |
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.FileReader;
import java.io.BufferedWriter;
import java.util.Set;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Fi... | linear | 224_B. Array | CODEFORCES |
import java.util.Scanner;
public class P23A {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.nextLine();
int max = 0;
for(int i = 0; i < s.length(); i++)
for(int k = s.length(); k > max + i; k--)
if(s.substring(i + 1).contains(s.substring(i,k)))
max ... | cubic | 23_A. You're Given a String... | CODEFORCES |
/*package whatever //do not write package name here */
import java.io.*;
import java.util.*;
public class S {
public static void main (String[] args) {
Scanner in=new Scanner(System.in);
int t=in.nextInt();
while(t--!=0)
{
int a=in.nextInt();
int b=in.nextInt();
int min=Math.min(a,b);
... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.Scanner;
public class A_IQTest {
static int n;
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
n = s.nextInt();
int[] nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = s.nextInt();
}
... | linear | 25_A. IQ test | CODEFORCES |
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws FileNotFoundException {
// TODO Auto-generated method stub
Scanner read = new... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringToken... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class A
{
String line;
StringTokenizer inputParser;
BufferedReader is;
FileInputStream fstream;
DataInputStream in;
void openInput(String file)
{
if(file==null)is = new BufferedReader(new InputStreamReader(System.in));//stdin
else
{
try{
fstrea... | cubic | 23_A. You're Given a String... | CODEFORCES |
import javafx.util.Pair;
import java.io.*;
import java.util.*;
public class Beacon8 {
public static void main(String[] args) throws IOException {
// int[] arr = {1, 3, 7, 18};
// int bIndex = Arrays.binarySearch(arr, 4);
// System.out.println(bIndex);
Scanner scan = new Scanner(Syst... | nlogn | 608_C. Chain Reaction | CODEFORCES |
import java.util.Scanner;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author scawn
*/
public class Main {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
Scanner cin = new Scanner (... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
/*Talent is something you make bloom , instinct is something you polish*/
import java.io.*;
import java.math.*;
import java.util.*;
public class Main
{
static long mod=((long)1e9)+7;//toString
public static int gcd(int a,int b){if(b==0)return a;else return gcd(b,a%b);}
public static long pow_mod(long x,long... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[]... | nlogn | 257_A. Sockets | CODEFORCES |
import java.util.*;
public class A {
private static Scanner in;
public void run() {
long a = in.nextLong();
long b = in.nextLong();
long ans = 0;
while (a > 0 && b > 0) {
if (a >= b) {
ans += a / b;
a %= b;
continue;
}
ans += b / a;
b %= a;
}
System.out.println(ans);
}
public ... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import static java.lang.Math.*;
public class Main {
//StreamTokenizer in;
BufferedReader in;
PrintWriter out;
public static void main(String[] args) throws IOException {
n... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class MAIN
{
public static void main(String args[])
{
Scanner sn=new Scanner(System.in);
int n,n1,n2,n3;
int arr[]={0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,17711,28657,46368,75025,121393... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class CodeForce275A {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
St... | constant | 483_A. Counterexample | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.