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 | 1019_B. The hat | 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 Pradyumn
*/
public class M... | logn | 1019_B. The hat | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class B {
static PrintWriter out = new PrintWriter(System.out);
static FS in;
static int N;
static final boolean debug = false;
static int inp[] = new int[] {1,2,3,2,1,0};
publi... | logn | 1019_B. The hat | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class B {
public static void main(String[] args) throws IOException {
MyScanner sc = new MyScanner();
PrintWriter out = new PrintWriter(System.out);
... | logn | 1019_B. The hat | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
Task solver = new Task();
solver.solv... | logn | 1019_B. The hat | 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 | 1019_B. The hat | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
final static int MAXN = 100005;
static int n;
static Scanner cin;
static int[] a;
static boolean[] used;
public static int Query(int x) {
System.out.print("? ");
System.out.println(x);
System.out.flush();
int a = cin.nextInt();
return a;
}
publ... | logn | 1019_B. The hat | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main
{
static class Reader
{
private InputStream mIs;private byte[] buf = new byte[1024];private int curChar,numChars;public Reader() { this(System.in); }public Reader(InputStream is) { mIs = is;}
public int read() {if (nu... | logn | 1019_B. The hat | 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 Pradyumn
*/
public class M... | logn | 1019_B. The hat | 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;
public class Div1_503B {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(... | logn | 1019_B. The hat | CODEFORCES |
//package contests.CF1019;
import java.io.*;
import java.util.StringTokenizer;
public class B {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
int half = n/2;
... | logn | 1019_B. The hat | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Random;
import java.util.StringTokenizer;
public class Solution{
... | logn | 1019_B. The hat | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
import java.util.stream.IntStream;
public class B {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in ... | logn | 1019_B. The hat | 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 | 1019_B. The hat | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
private static final long MOD = 998244353;
static int[] readArray(int size, InputReader in, boolean subOne) {
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = in.nextInt() + (subOne ? -1 : 0);
}
... | logn | 1019_B. The hat | 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 Pradyumn
*/
public class M... | logn | 1019_B. The hat | 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 | 1088_D. Ehab and another another xor problem | 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 java.util.*;
import java.io.*;
public class code{
public static void main(String[] args) throws IOException{
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int ok,ok2;
int va,vb;
va = 0;
vb = 0;
out.println("? "+va+"... | logn | 1088_D. Ehab and another another xor problem | CODEFORCES |
import java.util.*;
public class ehab4 {
public static void main( String[] args ) {
Scanner in = new Scanner( System.in );
int a = 0, b = 0;
System.out.println( "? 0 0 " );
System.out.flush();
int c = in.nextInt();
for ( int i = 29; i >= 0; i-- ) {
System.out.println( "? " + ( a + ( 1 << i ) ) + ... | logn | 1088_D. Ehab and another another xor problem | CODEFORCES |
import java.util.*;
public class ehab4 {
public static void main( String[] args ) {
Scanner in = new Scanner( System.in );
int a = 0, b = 0;
System.out.println( "? 0 0 " );
System.out.flush();
int c = in.nextInt();
for ( int i = 29; i >= 0; i-- ) {
System.out.println( "? " + ( a + ( 1 << i ) ) + ... | logn | 1088_D. Ehab and another another xor problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class EhabAndAnotherAnotherXorProblem implements Closeable {
private InputReader in = new InputRead... | logn | 1088_D. Ehab and another another xor problem | CODEFORCES |
import java.util.Scanner;
import java.io.*;
import java.util.*;
public class ReallyBigNumbers817c {
static long sd(String s) {
long c = 0;
for (int i = 0; i < s.length(); i++) {
c += s.charAt(i);
}
return c - s.length() * 0x30;
}
public static void main(Str... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.StringTokenizer;
public class ReallyBigNumbers1
{
public static void main(String[] args) throws IOException
{
BufferedReader br = ... | logn | 817_C. Really Big Numbers | 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.util.Scanner;
/**
*
* 作者：张宇翔 创建日期：2017年6月16日 上午9:00:48 描述：写字楼里写字间，写字间里程序员； 程序人员写程序，又拿程序换酒钱。
* 酒醒只在网上坐，酒醉还来网下眠； 酒醉酒醒日复日，网上网下年复年。 但愿老死电脑间，不愿鞠躬老板前； 奔驰宝马贵者趣，公交自行程序员。
* 别人笑我忒疯癫，我笑自己命太贱； 不见满街漂亮妹，哪个归得程序员？
*/
public class Main {
private final static int Max = (int) (1e5 + 10);
private static long n,s;
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class C {
public static void main(String[] args) {
new C();
}
C() {
Scanner in = new Scanner(System.in);
long n = in.nextLong(), s = in.nextLong();
long lo = 1, hi = 1000000000000000000L;
while(lo<hi){
//System.out.println(lo+" "+hi);
//STUPID STUPID DUMB... | logn | 817_C. Really Big Numbers | 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 | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
/**
* Road to 1600 raiting
*/
public class Main {
static class Task {
PrintWriter out;
int[] num = new int[3];
public void solve(MyScanner in, PrintWriter out) {
this.out = out;
long n = in.nextLong();
long s = i... | logn | 817_C. Really Big Numbers | 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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class C {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter out ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.math.BigInteger;
import java.util.*;
public class C {
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long s = sc.nextLong();
BigInteger k = findFirst(BigInteger.valueOf(s));
if (BigInteger.va... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class ReallyBigNumbers {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long s = sc.nextLong();
long m = s;
while(m-digitAdd(m)<s && m<=n){
m++;
}
System.out.println(Math.max(n-m+1, 0));
}
private s... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class Test {
private static long sum(long value) {
long ans = 0;
while (value > 0) {
ans += value % 10;
value /= 10;
}
return ans;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n , s , ans = 0;
n = scan.nextLong();
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
public static void main(String[] args)throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
long n = Long.parseLong(st.nextToken());
long s = Long.parseLon... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class ReallyBigNumbers817c {
static long sd(String s) {
long c = 0;
for (int i = 0; i < s.length(); i++) {
c += s.charAt(i);
}
return c - s.length() * 0x30;
}
public static void main(String[] args) throws IOException... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.math.BigDecimal;
import java.util.Scanner;
public class ReallyBigNumbers {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long s = scan.nextLong();
long ans = 0;
long l = 0;
long r = n;
while (l <= r) {
// Ke... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.math.*;
import java.security.KeyStore.Entry;
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<In... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class ER23C {
static long s;
public static void main (String[] args) throws java.lang.Exception {
InputReader in = new InputReader(System.in);
PrintWriter w = new PrintWriter(System.out);
long n = in.nextLong();
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
import java.io.*;
public class Main {
boolean[] b;
int[] r;
ArrayList<ArrayList<Integer>> q;
public void dfs(int u, int p) {
for (int i = 0; i < q.get(u).size(); i++) {
int v = q.get(u).get(i);
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
public class C817{
void solve()
{
long n = nl(), s = nl();
long l = 0, r = n;
while(l < r)
{
long mid = (l + r)/2;
if(mid - digSum(mid) < s)
l = mid + 1;
else
r = mid... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
public class Ds {
static long lim;
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader in = new Bu... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
/**
*
* @author Jishnu_T
*/
public class ReallyBigNums {
private static long[] factorArray(long s)
{
int d=0;
long n=s;
long f=1;
while(n>0)
{
n=n/10;
d++;
f = f*10;
}
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class a {
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
OutputStream out=new BufferedOutputStream(System.out);
String s[]=br.readLine().trim().split("\... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main (String[] args) throws java.lang.Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
long n = Long.parseLong(st.nextT... | logn | 817_C. Really Big Numbers | 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 C3 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
long n ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] in = br.readLine().split(" ");
long n = Long.parseLong... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class A {
public static boolean realbig (long num, long s) {
String str = num + "";
String[] digs = str.split("");
int sum = 0;
for(String dig : digs) {
sum+= Integer.parseInt(dig);
}
if(num-sum < s) {
return false;
} else {
return true;
}
}
public sta... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;
public class ques3 {
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter f... | logn | 817_C. Really Big Numbers | 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.Scanner;
public class b817 {
public static Scanner scn = new Scanner(System.in);
public static void main(String[] args) {
// TODO Auto-generated method stub
long n = scn.nextLong();
long s = scn.nextLong();
long lo = 0;
long hi = n ;
while(lo<=hi)
{
long mid=(lo+hi)/2;
if(c... | logn | 817_C. Really Big Numbers | 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 | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class P817C
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long s = scan.nextLong();
long ans = 0;
if (s > n)
{
System.out.println(0);
return;
}
if (n > s+200)
{
ans += n-... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.Math.*;
public class Main{
static long s;
static boolean check(long n){
int sum = 0;
long storen=n;
while(n>0){
int k = (int)(n%10);
n /=10;
sum+=k;
}
return storen-(long)sum >= s;
}
public static void main(String args[]){
PrintWriter pw=n... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextLong();
long s = scanner.nextLong();
long l = 0, r = n + 1;
while(r - l > 1) {
long mid = (l + r) / 2;
long k = mid, sum = 0... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
public class CFEdu23C
{
static long sum(long n)
{
long ans=0;
while(n>0)
{
ans+=(n%10);
n/=10;
}
return ans;
}
static long BS(long l,long h,long s)
{
if(l<=h)
{
long m=(l+h)/2l;
if(m-sum(m)>=s && (m==1 || (m-1)-sum(m-1)<s))
return m;
else if(... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
public class Main {
private static Reader in;
private static PrintWriter out;
public static void main(String args[]) throws IOException {
in = new Reader();
out = new PrintWriter(System.out);
long n = in.nextLong();
long s = in.nextLong();
long low ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class main implements Runnable{
static ArrayList <Integer> adj[];
static int co=0,f=0;
static void Check2(int n){
adj=new ArrayList[n+1];
for(int ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main{
public static boolean check(BigInteger a, BigInteger b){
long n = 0;
String aStr = a.toString();
for (int i=0; i < aStr.length() ;i++ ) {
n += Long.valueOf(aStr.charAt(i)-'0');
}
return a.subtract(BigInteger.valu... | logn | 817_C. Really Big Numbers | CODEFORCES |
/**
* DA-IICT
* Author : Savaliya Sagar
*/
import java.io.*;
import java.math.*;
import java.util.*;
public class C817 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve() {
long n = nl();
long s = nl();
long l = 1;
long r = n;
long ans = 0;
while(l<=r){
long mid = (l+r)/2;
long... | logn | 817_C. Really Big Numbers | 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.Random;
import java.util.StringTokenizer;
import java.util.TreeM... | logn | 817_C. Really Big Numbers | CODEFORCES |
/*
* DA-IICT
* Author: Jugal Kalal
*/
import java.util.*;
import java.io.*;
import java.math.*;
import java.text.DecimalFormat;
public class Practice{
static long MOD=(long)Math.pow(10,9)+7;
public static void main(String args[]) {
new Thread(null, new Runnable() {
public void run() {
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class CodeforcesC {
public static void main(String[] args) {
Scanner ob = new Scanner(System.in);
long n = ob.nextLong();
long s = ob.nextLong();
long l = 1;
long r = n;
while(l<=r){
long mid = (l + r)/2;
if(reallybignumber(mid,s)){
r = mid-1;
}else{
l = ... | logn | 817_C. Really Big Numbers | 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 | 817_C. Really Big Numbers | 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 | 817_C. Really Big Numbers | 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 |
import java.util.Scanner;
public class C {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long s = scan.nextLong();
long low = 0;
long high = n + 1;
while (high-low>1) {
long sum = 0;
long mid = (high + low) / 2;
long value = findSum(mi... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.*;
public class ed817Q3 {
public static void main(String[] args){
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
int t = 1;
... | logn | 817_C. Really Big Numbers | 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.util.*;
import java.io.*;
@SuppressWarnings("Duplicates")
public class C817 {
private FastScanner in;
private PrintWriter out;
private long calcSum(long x) {
int ans = 0;
while (x > 0) {
ans += x % 10;
x /= 10;
}
return ans;
}
pr... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
setup();
xuly();
}
private static long dp[][] = new long[20][170];
private static void setup() {
dp[0][0] = 1;
for (int i = 1; i < 20; i ++)
for (int j = 0; j < 170;... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
public class _817C {
static long sum = 0;
static long BSearch2(long st, long end, long lim) {
if (st > end) return 0;
long mid = (st + end) >> 1;
if (mid - sumDigit(mid) >= lim) {
sum = mid;
return BSearch2(st, mid - 1, li... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class C {
public static void main(String[] args) throws InterruptedException{
FastScanner scan = new FastScanner();
PrintWriter out = new PrintWriter(S... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import javax.swing.Painter;
import java.io.*;
public class C {
FastScanner in;
PrintWriter out;
boolean systemIO = true;
public static class Pair implements Comparable<Pair> {
int x;
int y;
public Pair(int x, int y) {
super();
this.x = x;
this.y = y;
}
@Override
public ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
/**
*
* @author Fuad
*/
public class Codeforces {
private static boolean greater(long... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
import java.util.StringTokenizer;
public class Solution {
l... | logn | 817_C. Really Big Numbers | 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.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.*;
public class ed817Q3 {
public static void main(String[] args){
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
int t = 1;
... | logn | 817_C. Really Big Numbers | 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... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
class IOManager {
BufferedReader reader;
PrintWriter writer;
StringTokenizer tokenizer;
IOManager() {
reader = new BufferedReader(new InputStreamReader(System.in));
writer = new PrintWriter(new Buffe... | logn | 817_C. Really Big Numbers | 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 C {
static StringTokenizer st;
static BufferedReader br;
static PrintWriter pw;
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class TestClass implements Runnable
{
/*int x,y;
public TestClass(int x,int y)
{
this.x=x;
this.y=y;
}*/
public static void main(String args[])
{
new Thread(null, ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Q1 {
static ArrayList<Integer> adj[],adj2[];
static int color[],cc;
static long mod=1000000007;
static TreeSet<Integer> ts[];
static boolean b[],visited[],possible,ans1,ans2;
static Stack<Integer> s;
static int totalnodes,colored,min,minc;
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
InputStream inputStream = System.in;
// InputStream inputStream = new FileInputStream("dijkstra.in");
OutputStream outputStream = System.out;
// OutputStream outputStr... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.Arrays;
import java.util.ArrayList;
public class C{
static long s;
public static void main(String[] args)throws IOException {
Reader.init(Sys... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class TestClass {
static PrintWriter out = new PrintWriter(System.out);
public static void main(String args[] ) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String s[] = in.readLine().split(" ");
long ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class C
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
long n = Long.parseLong(in.next());
long s = Long.parseLong(in.next());
if(!check(n, s)){
System.out.println(0);
}
else
{
long min = 1;
long max = n;
while(mi... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class ReallyBigNumbers1
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long s = sc.nextLong();
int r = 0 ;
long l = 0L ;
long u = n ;
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
class IO {
BufferedReader reader;
PrintWriter writer;
StringTokenizer tokenizer;
IO() {
reader = new BufferedReader(new InputStreamReader(System.in));
writer = new PrintWriter(new BufferedOutputStream(System.out));
tokenizer = new StringTok... | logn | 817_C. Really Big Numbers | CODEFORCES |
/*
* Author- Priyam Vora
* BTech 2nd Year DAIICT
*/
import java.awt.Checkbox;
import java.awt.Point;
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.Map.Entry;
import j... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static InputReader in = new InputReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
long n = in.nextLong();
long s = in.nextLong();
if(diff(n) < s) {
System.out.println(0);
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class c {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long s = scan.nextLong();
scan.close();
long start = s - s % 10;
while (start <= n && !isBig(start, s)) {
start += 10;
}
if (start > n) {
System.o... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHel... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextLong();
long s = scanner.nextLong();
long myLong = s;
long count =0;
while(true){
if(myLong>n)... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class ReallyBigNumbers {
public static void main(String[] args) {
@SuppressWarnings("resource")
Scanner sc = new Scanner(System.in);
long n = sc.nextLong(); // max
long s = sc.nextLong(); // differential
long bigNums = 0;
long inARow = 0;
for (long i = s; i <= n; i++) {
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class P817C
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long s = scan.nextLong();
long ans = 0;
if (s > n)
{
System.out.println(0);
return;
}
if (n > s+200)
{
ans += n-... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.Scanner;
public class C {
private static final String REGEX = " ";
private static final Boolean DEBUG = false;
private static final String FILE_NAME = "input.txt";
public static void main(String[] args) ... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
public class Main {
final static long Mod = 1000000009;
static long n, m, k, t, l, u, ans;
static Scanner cin = new Scanner(System.in);
static long multi_mod(long base, long cur) {
long res = 1;
while(cur > 0) {
if(cur % 2 == 1) res = (re... | logn | 338_A. Quiz | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class C {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
long s=0,mod=1000000009;
int n=sc.nextInt(),m=sc.nextInt(),k=sc.nextInt(),c=n/k;
if(m<=c*(k-1)+(n%k))System.out.println(m);
else {
int a=m-c*(k-1)-(n%k);
... | logn | 338_A. Quiz | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = ne... | logn | 338_A. Quiz | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.