src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | 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;
/**
* Built using CHelper plug-in
* Actual soluti... | logn | 992_C. Nastya and a Wardrobe | 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 java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author ankur
*/
public class Main... | logn | 992_C. Nastya and a Wardrobe | 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;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Jenish
*/
public class Ma... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
/** Built using CHelper plug-in Actual solution is at the top */
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputS... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
new Solver().run(1);
}
}
class Solver {
private BufferedReader reader = null;
private StringTokenizer st = null;
private static final long MOD = (long)1e9 + 7;
private ... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class TaskC {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
BigInteger x = new BigInteger(sc.next());
BigInteger k = new BigInteger(sc.next());
BigInteger mod = new BigInteger(String.valueOf((int) (Math.pow(10, 9)... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @autho... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.DecimalFormat;
public class Main{
final long mod = (int)1e9+7, IINF = (long)1e19;
final int MAX = (int)1e6+1, MX = (int)1e7+1, INF = (int)1e9;
DecimalFormat df = new DecimalFormat("0.0000000000000");
FastReader in;
PrintWriter out;
static ... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.StringTokenizer;
public class Tester
{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
//package pack;
import java.util.*;
public class first
{
public static long power(long x, long y, long p)
{
long res = 1;
x = x % p;
while (y > 0)
{ if((y & 1)==1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return... | logn | 992_C. Nastya and a Wardrobe | 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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.PrintWriter;
public class C992
{
static class Scanner
{
BufferedReader br;
StringTokenizer tk=new StringTokenizer("");
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
//package com.company;
import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
static long TIME_START, TIME_END;
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
// Scanner sc = new Scanner(new FileInputStream("Test.in"));
... | logn | 992_C. Nastya and a Wardrobe | 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.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.*;
public class C {
static long x, k;
static long mod = 1000000007;
public static void main(String[] args) {
JS in = new JS();
x = in.nextLong();
k = in.nextLong();
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class C {
static final int M = 1000000007;
public static void main(String[] args) throws IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public ... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Scanner;
public class Solution {
private static final long MODULUS = 1000000007;
private static final boolean DEBUG = false;
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.math.BigInteger;
import java.util.*;
import java.io.*;
public class Contest {
public static void main(String[] args)throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] s=br.readLine().split(" ");
BigInteger x = new BigInteger(s[0]);
BigInt... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import javax.swing.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.StringTokenizer;
public class A {
public static void main(String[] args) {
FastScanner scanner = new FastScanner();
long x = scanner.next... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.awt.List;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Arrays;
imp... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.Scanner;
public class CF489_C {
static long mod = 1000000007;
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
long x = s.nextLong(), k = s.nextLong();
if (x == 0) {
System.out.println(0);
return;
}
long max = x % mod;
long temp = power(2, k, mod);
t... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class C {
static final int MOD = (int)1e9 + 7;
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
long x = sc.nextLong(), k = sc.ne... | 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... | 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... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
// Solution
public class Main
{
public static void main (String[] argv)
{
new Main();
}
boolean test = false;
int n;
long mod = 1000000007;
public Main() {
FastReader in = new FastReader(new BufferedReader(new InputStreamReader(Syste... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
/*
* Heart beats fast
* Colors and promises
* How to be brave
* How can I love when I am afraid...
*/
public class Main
{
public static void main(String[] args)
{
long x=nl(),k=nl();
if(x==0)
{
pr(0);
exit();
}
x%=mod;
pr((((x*powm(2,k+1,mod))%mod-... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
public class Main {
private static void solve() {
long x = nl();
long k = nl();
long mod = 1000000000 + 7;
if (x == 0) {
System.out.println(0);
} else if (k == 0) {
System.out.println(x * 2 % mod);
} else {
//x > 0, n > 0
x %= mod;
long a;
a ... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class template
{
private InputStream is;
private PrintWriter pw;
static char[][] ch;
static int x1,x2,y1,y2,n,m,h,k;
static long dist[][];
static boolean boo[][];
void soln()
{
is = System.in;
pw = new PrintWriter(System.out);
long s = System... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.BigInteger;
import java.util.Map.Entry;
import static java.lang.Math.*;
public class C extends PrintWriter {
final long mod = 1_000_000_007;
long pow(long n, long p) {
long r = 1;
while (p > 0) {
if (p % 2 == 1) {
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.*;
import java.util.StringTokenizer;
public class Main{
public long power(long x, long y, long p)
{
long res = 1;
while (y > 0)
{
if(... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
public class virtual1{
static InputReader in = new InputReader();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
long x = in.nextLong();
long k = in.nextLong();
long mod = (long)1... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
public class algo93
{
public static void main(String args[])
{
Scanner ex=new Scanner(System.in);
long x=ex.nextLong();
long k=ex.nextLong();
long mod=1000000007;
if(k==0)
System.out.println((2*x)%mod);
else if(x==0)
System.out.... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Test {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in), 1024 * 48);
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
static long MOD=1000000007;
public static long pow(long x,long k){
long base=x%MOD;
long res=1;
while(k>0){
if((k&1)==1){
res=(res*base)%MOD;
}
base=(base*base)%MOD;
k>>=1;
}
return res;
}
public static void m... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Bit... | logn | 713_B. Searching Rectangles | 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.Scanner;
import java.util.InputMismatchException;
import java.util.HashMap;
import java.io.IOException;
import java.util.ArrayList... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;
/**
* Built using CHelper p... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class B {
public static void main(String[] args) throws IOException {
/**/
Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
/*/
Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(new FileInputStream... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
private static StringTokenizer st;
private static BufferedReader br;
public static long MOD = 1000000007;
public static void print(Object x) {
System.out.println... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.*;
import java.util.Locale;
import java.util.StringTokenizer;
public class B implements Runnable {
private static final boolean ONLINE_JUDGE = true;//System.getProperty("ONLINE_JUDGE") != null;
private BufferedReader in;
private PrintWriter out;
private StringTokenizer tok = new String... | logn | 713_B. Searching Rectangles | 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.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.io.*;
import java.util.*;
public class B {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
// int X1, Y1, X2, Y2;
// int X3, Y3, X4, Y4;
// {
// X1 = 1;
// Y1 = 2;
// X2 = 3;
// Y2 = 4;
//
// X3 = 5;
// Y3 = 1;
// X4 = 5;
// Y4 = 5;
// }
int ask(int x1, int y1, int x... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
static int mod = (int) 1e9 + 7;
public static void main(String[] args) throws FileNotFoundException {
FasterScanner s = new FasterScanner();
int test = 1;
testloop: while (test-- > 0) {
int n = s.nextInt();
int left = 1;
in... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.awt.*;
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import java.util.List;
import static java.lang.Math.max;
import static java.lang.Math.min;
public class B implements Runnable{
private final static Random rnd = new Random();
// SOLUTION!!!
... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.*;
import java.util.*;
public class Template implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void init() throws FileNotFoundException {
in = new BufferedReader(new InputStreamReader(System.in));
out = new PrintWri... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.util.*;
public class B {
public static void main(String[] args) {
Scanner qwe = new Scanner(System.in);
int n = qwe.nextInt();
//! x11 y11 x12 y12 x21 y21 x22 y22"
int x11 = bins(true,1,2,n,qwe,true);
int y11 = bins(true,1,2,n,qwe,false);
int x12 = bins(false,0,1,n,qwe,true);... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.function.IntPredicate;
import static java.lang.Math.*;
public class Main {
FastScanner in;
PrintWriter out;
static final String FILE = "";
public static final int TEST = 0;
class Interact {
Rect a, b;
public Interact(int x1... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.io.BufferedWriter;
import java.util.Random;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;
/**
* ... | logn | 713_B. Searching Rectangles | CODEFORCES |
//make sure to make new file!
import java.io.*;
import java.util.*;
public class B713{
public static BufferedReader f;
public static PrintWriter out;
public static void main(String[] args)throws IOException{
f = new BufferedReader(new InputStreamReader(System.in));
out = new PrintWriter(S... | logn | 713_B. Searching Rectangles | CODEFORCES |
//package round371;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class BT {
Scanner in;
PrintWriter out;
String INPUT = "";
int q(int r1, int c1, int r2, int c2)
{
out.printf("? %d %d %d %d\n", r1+1, c1+1, r2+1, c2+1);
out.flush();
return ni();
}
void e(int r... | logn | 713_B. Searching Rectangles | CODEFORCES |
import javax.crypto.AEADBadTagException;
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.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util... | logn | 713_B. Searching Rectangles | 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 | 713_B. Searching Rectangles | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Solution {
static BufferedReader br;
static int[] ans;
public static void main(String[] args) throws Exception{
br = new BufferedReader(new InputStreamReader(System.in));... | logn | 713_B. Searching Rectangles | 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 | 713_B. Searching Rectangles | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
public class DTask {
static Scanner in;
static int[] first = new int[4];
static int[] second = new int[4];
static PrintWriter out;
static int n;
public static void main(String[] args) throws... | logn | 713_B. Searching Rectangles | 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.Arrays;
import java.util.StringTokenizer;
public class B {
static StringTokenizer st;
static BufferedReader br;... | logn | 713_B. Searching Rectangles | 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.util.Scanner;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream... | logn | 713_B. Searching Rectangles | 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 | 713_B. Searching Rectangles | 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 | 713_B. Searching Rectangles | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
InputStream is;
PrintWriter out;
String INPUT = "" ;
boolean local = false;
int inf=0x7FFFFFFF;
int MOD=(int)(1e9+7);
double eps=1e-5;
double PI=Math.acos(-1);
void solve() {
long maxn=nl();
... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.*;
import java.math.*;
import static java.lang.Math.*;
import java.security.SecureRandom;
import static java.util.Arrays.*;
import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import sun.misc.Regexp;
import java.awt.geom.*;
import sun.net.www.content.text.plain;
public c... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
BufferedReader in;
StringTokenizer str = null;
PrintWriter out;
private String next() throws Exception{
if (str == null || !str.hasMoreElements())
str = new StringTokenizer(in.readLine());
return str.nextToken();
}
private int nextInt() throws... | logn | 287_B. Pipeline | 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.util.*;
public class B {
static long sum(long from, long to){
final long d = to - from;
return (d*(d + 1))/2 + (d + 1)*from;
}
static long howMany(long n, long k){
if (n == 1){
return 0;
}
if (n > (k*(k - 1))/2 + 1){
return -1;
}
long hi = k - 1;
long lo = 1;
while (lo < hi){
... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
(new Main()).solve();
}
public Main() {
}
MyReader in = new MyReader();
PrintWriter out = new PrintWriter(System.out);
void solve() throws IOException {
// ... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class Problem2 implements Runnable {
public void run() {
Scanner scanner = new Scanner(System.in);
PrintWriter writer = new PrintWriter(System.out);
long n = scanner.nextLong();
long k = scanner.nextLong();
long ... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.util.*;
public class My {
public static void main(String[] args) {
new My().go();
}
void go() {
Scanner in = new Scanner(System.in);
long n = in.nextLong();
int k = in.nextInt();
int mn = 0, mx = k + 1;
while (mn < mx) {
int mid = (mn + mx) / 2;
... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
public class B {
public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
Scanner sc = new Scanner(System.in);
long N = sc.nextLong();
long K = sc.nextLong();
if (N == 1) {
out.println(0);
} else if (N <= K) {
out.prin... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.Vector;
/**
* Created with IntelliJ IDEA.
* User: horikawa
* Date: 3/23/13
* Time: 1:29 AM
* To change this template use File | Settings | File Templates.
*/
public class B {
public static void main (S... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class B {
public static void main(String[] args) {
doIt();
}
static void doIt() {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
long n = sc.nextLong();
long k = sc.nextLong();
long msum = (k - 1) * k / 2 ... | logn | 287_B. Pipeline | 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
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class P287B{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
long n, k;
void run(){
n=sc.nextLong();... | logn | 287_B. Pipeline | CODEFORCES |
/**
* Created with IntelliJ IDEA.
* User: yuantian
* Date: 3/24/13
* Time: 2:18 AM
* Copyright (c) 2013 All Right Reserved, http://github.com/tyuan73
*/
import java.util.*;
public class Pipeline {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.next... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.Scanner;
public class b {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong() - 1, k = sc.nextLong() - 1;
int a = 0;
if ((k + 1) * k / 2 < n) {
System.out.println(-1);
return;
}
... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.Scanner;
public class Pipeline {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long k = sc.nextLong();
sc.close();
if (k * (k - 1) / 2 + 1 < n) {
System.out.println(-1);
} else {
long l = -1, r = k;
while (r - l > 1) {
... | logn | 287_B. Pipeline | CODEFORCES |
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long k = scan.nextLong();
long total = k * (k - 1) / 2 + 1;
if (total < n) {
System.out.println(-1);
return;
}
l... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;
import java.util.Scanner;
import java.util.ArrayList;
public class Main {
static int d[][];
static int N;
static boolean used[];
static class point
... | logn | 287_B. Pipeline | CODEFORCES |
import java.math.BigInteger;
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 (n == 1) {
System.out.println(0);
} else if (n <= k) {
... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.PrintWriter;
import java.util.Scanner;
public class B176 {
public static void main(String[] args) {
Scanner in = new Scanner(new BufferedInputStream(System.in));
PrintWriter out = new PrintWriter(new BufferedOut... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class Main {
public static void main(String[] args) {
try {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw = new PrintWriter(System.out);
... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author George Marcus
*/
public class Main {
public static void main(String[] args) {
Inpu... | logn | 287_B. Pipeline | CODEFORCES |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.Scanner;
/**
*
* @author 111
*/
public class JavaApplication4 {
/**
* @param args the command line arguments
*/
static long k, n, ans;
static private long binsearch(long l, lo... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
public class B {
/**
* @param args
* @throws IOException
* @throws NumberFormatException
*/
public static void main(String[] args) throws NumberFormatException,
IOException {
Scanner s... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class PipelineRedo {
public static void main(String[] args){
FastScanner sc = new FastScanner();
long n = sc.next... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.util.*;
public class B
{
public static void main(String [] args) throws IOException
{
Scanner in = new Scanner(System.in);
long n = in.nextLong();
long k = in.nextLong();
if(n == 1)
{
System.out.println(0);
return;
}
if(n <= k)
{
System.out.println(1);
retur... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStrea... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;
public class B implements Runnable {
// leave empty to read from stdin/stdout
private static final String TASK_NAME_FOR_IO = "";
// file names
private static final String FILE_IN = TASK_NAME_FOR_IO + ".in";
private s... | logn | 287_B. Pipeline | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class ehsan
{
public static BigInteger f(BigInteger m,BigInteger n){
BigInteger s,l;
s=n.multiply(m.add(BigInteger.valueOf(1)));
l=m.multiply(m.add(BigInteger.valueOf(1)));
l=l.divide(BigInteger.valueOf(2));
s=s.subtract(l);
s=s.subtract(m);
... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.Scanner;
public class B {
/**
* @param args
*/
public static void main(String[] args) {
Pipes pipes = new Pipes();
pipes.solve();
pipes.print();
}
}
class Pipes {
Pipes() {
Scanner scr = new Scanner(System.in);
n = scr.nextLong();
k = scr.nextLong();
}
long bs(long nb, lo... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class B {
static long n, k;
static long sum(long mid) {
long tmpSum = k * (k + 1) / 2;
long nsum = (mid - 1) * (mid) / 2;
return tmpSum - nsum;
}
... | 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;
public class B {
public static BufferedReader in;
public static PrintWriter out;
public static void main(String[] args) throws IOException {
in = new BufferedReader(ne... | logn | 287_B. Pipeline | CODEFORCES |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
//package pipeline;
import java.util.Scanner;
/**
*
* @author admin
*/
public class Main {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO... | logn | 287_B. Pipeline | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
public static void main (String[] args) throws IOException {
boolean online = "true".equals(System.getProperty("ONLINE_JUDGE"));
if (online) {
in = new InputReader(new InputStreamReader(System.in));
out = new Prin... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.*;
import java.math.*;
import java.io.*;
public class Main
{
public static void main(String args[]) throws IOException
{
Scanner c=new Scanner(System.in);
PrintWriter out=new PrintWriter(System.out);
long N=c.nextLong()-1;
long K=c.nextLong()-1;
... | logn | 287_B. Pipeline | 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;
public class Main {
long k;
private void solve() throws IOException {
long n = nl();
k = nl();
... | logn | 287_B. Pipeline | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.