src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
public class CFFF {
static PrintWriter out;
static final int oo = 987654321;
static final long mod = (long)(1e9)+9;
public static void main(String[] args) {
MScanner sc = new MScanner();
... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.Scanner;
/**
* @author pvasilyev
* @since 8/16/13
*/
public class ProblemC {
public static final String FILE_IN = "std.in";
public static final String FILE_OUT = "std.out";
private static boolean debugMode = true;
private static final long MOD = 1000 * 1000 * 1000... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
public class Quiz {
public static int mod = 1000000009;
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(f.readLine());
long... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.util.Arrays.*;
public class A {
private static final int mod = (int)1e9+9;
final IOFast io = new IOFast();
long k;
boolean ok(long n, long m, long x) {
long u = k * x;
long val = u;
... | logn | 338_A. Quiz | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class A {
BufferedReader reader;
StringTokenizer tokenizer;
PrintWriter out;
long MOD = 1000000009;
public long mod_add(long n1, long n2){
ret... | logn | 338_A. Quiz | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class A {
public static void main(String[] args) throws Exception {
int n=nextInt();
int m=nextInt();
int k=nextInt();
int wa=n-m;
if(n/k<=wa){
System.out.println(m);
}else{
int notFull=wa;
... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class A implements Runnable {
static BufferedReader in;
static PrintWriter out;
static StringTokenizer st;
static Random rnd;
final long MODULO = 1000000009;
private void solve() throws IOException {
int moves = nextInt(), rightMoves = nextInt(... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
import java.io.*;
public class Quiz
{
public static final int MOD = 1000000009;
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
long n = in.nextInt();
long m = in.nextInt();
long k = in.nextInt();
long low = Math.min(n - (k * (n - m)), m);
if(l... | logn | 338_A. Quiz | 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 | 338_A. Quiz | CODEFORCES |
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual so... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import java.awt.Point;
public class CodeForces {
static boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
private final long MOD = 1000000009;
long power(long a, long b)
{
long res ... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
InputReader in = new InputReader(System.in);
int n = in.readInt();
int m = in.readInt();
int k = in.readInt();
long wrong = n - m... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.util.Arrays.*;
public class A {
private static final int mod = (int)1e9+9;
final IOFast io = new IOFast();
long k;
long rec(long n, long m, long cur) {
long pow = 1;
long margin = 10;
... | logn | 338_A. Quiz | CODEFORCES |
//package cf196;
import java.util.*;
import java.io.*;
public class A {
FastScanner in;
PrintWriter out;
final long mod = (long) 1e9 + 9 ;
public void solve() throws IOException {
long n = in.nextInt();
long m = in.nextInt();
long k = in.nextInt();
long l = n / k;
long c = n - m;
long mul2 = Math.max... | logn | 338_A. Quiz | CODEFORCES |
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(S... | logn | 338_A. Quiz | CODEFORCES |
// practice with rainboy
import java.io.*;
import java.util.*;
public class CF338A extends PrintWriter {
CF338A() { super(System.out, true); }
Scanner sc = new Scanner(System.in);
public static void main(String[] $) {
CF338A o = new CF338A(); o.main(); o.flush();
}
static final int MD = 1000000009;
long power... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
import java.io.*;
public class Template {
public static void main(String[] args) throws IOException {
st = new StringTokenizer(rd.readLine());
n = Long.parseLong(st.nextToken());
m = Long.parseLong(st.nextToken());
k = Long.parseLong(st.nextToken());
long s = n - m;
s = Math.min(s, m /... | logn | 338_A. Quiz | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.StringTokenizer;
public class Quiz {
public static long pow(long base, long power) {
if (power == 0)
... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
import java.io.*;
public class a {
static long mod = 1000000009;
static ArrayList<Integer>[] g;
public static void main(String[] args) throws IOException
{
//Scanner input = new Scanner(new File("input.txt"));
//PrintWriter out = new PrintWriter(new File("output.txt"));
input.init(... | logn | 338_A. Quiz | CODEFORCES |
import java.util.List;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.ArrayList;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokeniz... | logn | 338_A. Quiz | 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.io.*;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.TreeMap;
public class A
{
private static final long MOD = 1000000009L;
public static void main(String [] args) throws IOException
{
Scanner in = new Scanner(System.in);
long n = in.nextInt(... | logn | 338_A. Quiz | CODEFORCES |
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokenizer;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper ... | logn | 338_A. Quiz | CODEFORCES |
import java.util.Scanner;
public class A338 {
public static void main (String args[]){
Scanner in= new Scanner(System.in);
long n = in.nextInt();
long m=in.nextInt();
long k=in.nextInt();
long x = n-m;
long y=n/k;
if(x>=y)
System.out.println(m);
else
{
long t= y-x;
long ans=0;
a... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
void solve() throws IOException {
int tot = nextInt();
int ok = nextInt();
int k = nextInt();
int maxBad = tot / k;
if (tot - maxBad >= ok) {
out.println(ok);
return;... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
long mod = (long)(1e+9+9);
long pow(long a,long b) {
long mul = a;
long res = 1;
while (b > 0) {
if (b %2 == 1) {
res = (res*mul)%mod;
}
mul = (mul*mul)%mod;
b/=2;
}
return res;
}
void solve() throws IOException {
long n = nextLong... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
public class ProblemA {
InputReader in; PrintWriter out;
long power(long a, long b, long mod) {
long ret = 1;
long mul = a;
while (b > 0) {
if (b % 2 == 1) {
ret = (ret * mul % mod);
}
... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
import java.io.*;
public class A2 {
/*
*/
public static void main(String[] args) throws Exception {
uu.s1();
uu.out.close();
}
public static class uu {
public static BR in = new BR();
public static PrintWriter out = new PrintWriter(new BufferedWriter... | logn | 338_A. Quiz | CODEFORCES |
import java.awt.Rectangle;
import java.awt.geom.Rectangle2D;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class C
{
String line;
StringTokenizer inputParser;
BufferedReader is;
FileInputStream fstream;
DataInputStream in;
String FInput="";
void openInput(String file)
{
if(fi... | logn | 338_A. Quiz | 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.*;
import java.util.*;
public class Main implements Runnable {
public void _main() throws IOException {
long n = nextLong();
long m = nextLong();
long k = nextLong();
long numBlocks = Math.min(Math.min(n / k, n - m), m / (k - 1));
n -= numBlocks * k;
m -= numBlocks * (k - 1);
long numFul... | logn | 338_A. Quiz | CODEFORCES |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
StreamTokenizer in;
PrintWriter out;
//deb/////////////... | logn | 338_A. Quiz | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author BSRK Aditya
*/
public class Main {
public static void main(String[] ar... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class A {
private long pow(long num, long pow, long mod) {
if (pow <= 0) {
return 1;
}
if ((pow & 1) != 0) {
return (num * pow(num, pow-1, mod)) % mod;
}
else {
long tmp = pow(num, pow>>1, mod) % mod;
return ... | logn | 338_A. Quiz | CODEFORCES |
import java.util.*;
public class Quiz{
static int MOD = (int)1e9 + 9;
public static void main(String[] args){
Scanner reader = new Scanner(System.in);
long n = reader.nextInt();
long m = reader.nextInt();
long k = reader.nextInt();
long r = (n + k - 1)/k;
long longDrops = n%k;
if(longDrops == ... | logn | 338_A. Quiz | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class cf337c {
static long mod,n,m,k;
public static void ... | logn | 338_A. Quiz | CODEFORCES |
import java.math.BigInteger;
import java.util.*;
public class A {
private static Scanner in;
final int M = 1000000009;
public void run() {
int n = in.nextInt();
int m = in.nextInt();
int k = in.nextInt();
int z = n - m;
if (z >= n / k) {
System.out.println(m);
return;
}
int f = n - k * z;
i... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF {
long mod = (long) 1e9 + 9;
class Pair {
long a, b;
public Pair(long a, long b) {
super();
this.a = a % mod;
this.b = b % mod;
}
}
int k;
long pow(long n, long k) {
if (k == 0)
return 1;
long m1 = pow(n, k / 2);
m1 = (m1 * m1) % ... | logn | 338_A. Quiz | 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 A{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int mod=(int)1e9+9;
long n, m, k;
void run(... | logn | 338_A. Quiz | CODEFORCES |
//package round196;
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 A {
InputStream is;
PrintWriter out;
String INPUT = "";
public static long pow(long a, long n... | logn | 338_A. Quiz | 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 C {
private static BufferedReader in;
private st... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.*;
public class History {
static final int INF = (int)1E9;
static final double EPS = 1E-9;
static final long MOD = INF + 9;
static long powmod(long p) {
long res = 1;
long d = 2;
while (p > 0) {
if (p % 2 == 1) {
res = (res * d) % MOD;
p--;
}
else {
d... | logn | 338_A. Quiz | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
/**
* Created by hama_du on 15/09/10.
*/
public class A {
private static final long MOD = 1000000009;
public static void main(String[] args) {
InputRe... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class A {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void solve() throws IOException {
final int mod = 1000*1000*1000+9;
... | logn | 338_A. Quiz | 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.util.*;
import java.io.*;
import java.awt.Point;
import java.math.BigDecimal;
import java.math.BigInteger;
import static java.lang.Math.*;
// Solution is at the bottom of code
public class _____A implements Runnable{
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
Buffere... | logn | 338_A. Quiz | CODEFORCES |
import java.math.BigInteger;
import java.util.*;
public class A {
private static Scanner in;
final int M = 1000000009;
public void run() {
int n = in.nextInt();
int m = in.nextInt();
int k = in.nextInt();
int z = n - m;
if (z >= n / k) {
System.out.println(m);
return;
}
int f = n - k * z;
i... | logn | 338_A. Quiz | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class CFC {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
private static final long MOD = 1000L * 1000L * 1000L + 7;
private... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.Scanner;
public class R489C {
static long MOD=(long)1e9+7;
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
long n=scan.nextLong(), k=scan.nextLong();
if(n==0) {
System.out.println(0);
return;
}
long x=2*n-1;
long e=exp(2,k);
System.out.println((x%MOD... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
FastReader scn;
PrintWriter out;
String INPUT = "";
void solve() {
long n = scn.nextLong(), k = scn.nextLong(), mod = (int)1e9 + 7;
if(n == 0) {
out.println(0);
return;
}
n %= mod;
long x = (pow(2, k + 1, mod) * n) % mod;
long y = (pow(2,... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
/**
* Created by aditya on 5/3/17.
*/
public class Main3 {
static long x, k;
static long MOD = (long)1e9 + 7;
public static void main(String args[]) throws Exception{
FastInput fi = new FastInput(new InputStreamReader(System.in)... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;
public class C {
public static void main(String[] args) throws IOException {
init(System.in);
BigInteger x = new BigInteger(next());
if (x.compareTo(BigInteger.ZERO) == 0) {
System.out.println(0);
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.Locale;
import java.util.StringTokenizer;
public class C {
String fileName = "<name>";
public static final int MOD = (int) (1e9 + 7);
public void solve() throws IOException {
long x = nextLong();
if (x == 0) {
out... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class test {
static boolean DEBUG_FLAG = false;
int INF = (int)1e9;
long MOD = 1000000007;
static void debug(String s) {
if(DEBUG_FLAG) {
System.out.print(s);
}
}
long pow(long a, long n, long mod) {
if ... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Dummy {
private static long mod = 1000000007;
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
String[] strs = r... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class A992{
long mod = 1000000007L;
private void solve() throws Exception {
long x = nextLong();
long k = nextLong();
if(x == 0) {
out.println(0);
return;
}
x = x%mod;
long res = (((x*pow(2,k+1))%mod + (mod-pow(2,k))%mod)%mod+1)%mod;
out.printl... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
//package CF489; //comment this line
import java.io.*;
import java.util.*;
import java.math.*;
public class B
{
private static long MOD=1000000007;
private static BigInteger m=new BigInteger(1000000007+"");
private static long pow(long x, long a)
{
if(a==0)
return 1;
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
public class C {
FastScanner in;
PrintWriter out;
boolean systemIO = true;
public static void quickSort(int[] a, int from, int to) {
if (to - from <= 1) {
return;
}
int i = from;
int j = to - 1;
int x = a[from + (new Random()).nextInt(to - from)];
while (i <= j... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
/*
* Author : joney_000[jaswantsinghyada007@gmail.com]
* Algorithm : N/A
* Platform : Codeforces
* Ref :
*/
public class A{
private InputStream inputStream ;
private OutputStream outputStream ;
private FastReader i... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class C
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
BigInteger x = sc.nextBigInteger();
BigInteger k = sc.nextBi... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
//package que_a;
import java.io.*;
import java.util.*;
import java.math.*;
public class utkarsh {
InputStream is;
PrintWriter out;
long mod = (long) (1e9 + 7);
boolean SHOW_TIME;
void solve() {
//Enter code here utkarsh
//SHOW_TIME = true;
long X = nl();
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class C implements Runnable{
public static void main (String[] args) {new Thread(null, new C(), "_cf", 1 << 28).start();}
long MOD = (long)1e9+7;
public void run() {
FastScanner fs = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
System.err.pr... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
public class C {
private static Solver solver = new Solver();
private static long m = 1000000000L + 7L;
public static void main(String[] args) throws IOException {
solver.withProcedure(() -> {
String[] input = solver.readString().split("... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
public class R489C {
static long m = (long)(1e9+7);
/*
1000000000000000000
*/
public static void main(String[] args) {
JS scan = new JS();
long n = scan.nextLong();
long k = scan.nextLong();
if(n == 0) {
System.out.println(0);
return;
}
if(k == 0) {
l... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution1 {
private void solve() throws IOException {
long MOD = 1_000_000_007;
long x = in.nextLong();
long k = in.nextLong();
if (x == 0) {
System.out.println(0);
return;
}
long val = binp... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
/**
* Created by Baelish on 6/18/2018.
*/
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.InputMismatchException;
public class C_3 {
public static void main(String[] args) throws Exception {
FastRe... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
public class A{
static long mod = 1000000000+7;
static int arr[];
static HashMap<Long,Long> map = new HashMap<>();
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long x = scan.nextLong();
long k = scan.nextLong();
if(x == 0)
{
Syste... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
/* spar5h */
public class cf3 implements Runnable{
final static long mod = (long)1e9 + 7;
static long modExp(long x, long pow) {
x = x % mod;
long res = 1;
while (pow > 0) {
if (pow % 2 =... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.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.*;
import java.util.*;
public class C
{
static long mod=(long)(1e9+7);
public static long powMod(long e,long b)
{
/*e=e%mod;*/
long res=1;
while(e>0)
{
if(e%2==1)
res=res*b%mod;
e/=2;
b=b*b%mod;
}
return res;
}
public static void main(String[] args) throws IOException... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class C{
public static void main (String[] args) throws java.lang.Exception{
Scanner scan=new Scanner(System.in);
long x=scan.nextLong(), k=scan.nextLong();
long MOD = 1000000007;
if(x==0){
System.out.println("0");
return;
}
x %= MOD;
... | logn | 992_C. Nastya and a Wardrobe | 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.StringTokenizer;
public class Div2_489C {
static final long MOD = 1_000_000_007;
public static void main(String... | 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
*/
public c... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
//package baobab;
import java.io.*;
import java.util.*;
public class C {
public static void main(String[] args) {
Solver solver = new Solver();
}
static class Solver {
IO io;
public Solver() {
this.io = new IO();
try {
solve();
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class Main implements Runnable {
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numCha... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class main {
InputStream is;
PrintWriter out;
static long mod=pow(10,9)+7;
int dx[]= {0,0,1,-1},dy[]={+1,-1,0,0};
void solve()
{
long x=nl();
long k=nl();
if(x==0)
{
out.println(0);
return;
}
long term=(pow(2,k,mod))%mod;
long la... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
/*
*
* @Author Ajudiya_13(Bhargav Girdharbhai Ajudiya)
* Dhirubhai Ambani Institute of Information And Communication Technology
*
*/
import java.util.*;
import java.io.*;
import java.lang.*;
public class Code3
{
public static void main(String[] args)
{
InputReader in = new InputReader(System.in);
Pr... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
long mod = (long) (1e9 + 7);
void solve() throws Throwable {
long x = readLong(), k = readLong();
if (x == 0) {
System.out.println(0);
return;
}
long r = solveFas... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.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 kanak893
*/
public class M... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import sun.rmi.transport.DGCImpl_Stub;
import java.io.*;
import java.nio.file.ClosedWatchServiceException;
import java.util.*;
public class Main {
public static void main(String[] args) throws FileNotFoundException {
ConsoleIO io = new ConsoleIO(new InputStreamReader(System.in), new PrintWriter(System.out... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner scan=new Scanner(System.in);
long ... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
static BigInteger tow=new BigInteger("2"),mod=new BigInteger("1000000007");
static BigInteger pow(BigInteger a,BigInteger b) {
if(b.equals(BigInteger.ZERO))return BigInteger.ONE;
BigInteger x=pow(a,b.divide(tow));
if(b.mod(t... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Scanner;
import java.util.StringTokenizer;
public class Main {
static BufferedReader in=new BufferedReader(new InputStreamReader(System.in));... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;
public class Main {
static long MOD = (long) 1e9 + 7;
static long[][] identity = {{1, 0}, {0, 1}};
public static void main(String[] args) {
FastScanner input = new FastScanner(System.in);
long x = input.nextL... | logn | 992_C. Nastya and a Wardrobe | 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.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.util.*;
public class prob
{
public static long ans(long x, long y, long p)
{
long r = 1;
x = x % p;
while (y > 0)
{
if((y & 1)==1)
r = (r * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return r;
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;
/**
* Created by artur on 18/06/18
*/
public class A
{
private BufferedReader br = new BufferedReader(new ... | 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.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Random;
import java.util.Stack;
import java.util.StringTokenizer;
public class Main {
static boo... | 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.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class C {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
// Scanner scan = new Scanner(System.in);
PrintWriter out = new P... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class ModifyLongest {
InputStream is;
PrintWriter out;
String INPUT = "";
//boolean codechef=true;
boolean codechef=true;
void solve()
{
/*
long l=ni(),r=ni(),x=ni(),y=ni();
long prod=x;
prod*=y;
i... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
private void solve() throws IOException {
out.println(solve(nl()));
out.close();
}
private long solve(long n) throws IOException {
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.HashMap;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Iterat... | 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.util.*;
import java.io.*;
import java.math.BigInteger;
public class C
{
static int mod = (int) (1e9+7);
static InputReader in;
static PrintWriter out;
public static void main(String[] args)
{
in = new InputReader(System.in);
out = new PrintWriter(System.out);
... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
//package round489;
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()
{
int[][] M = {
{... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.util.Scanner;
public class Main {
public static long power(long a, long b, long c){
if(b == 0){
return 1;
}
a %= c;
if(b % 2 == 0){
return power((a % c * a % c) % c, b / 2, c);
}else{
return (a % c * power((a % c * a % c) % c, b / 2, c) % c) % c;
}
}
public static void main(Stri... | 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 |
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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.