src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
import java.util.*;
public class global{
public static void main(String s[]){
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
String st = String.valueOf(n);
if(st.length()==1){
System.out.println(n);
}else{
long val = 1;
long prev=9;
long total=9;
long late=9;
for(int... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.FileNotFoundException;
import java.util.Scanner;
public class P1177A {
public static void main(String[] args) throws FileNotFoundException {
Scanner in = new Scanner(System.in);
// Scanner in = new Scanner(new File("input.txt"));
System.out.println(solve(in.nextLong()));
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
long b=0;long p=1;
Scanner s=new Scanner(System.in);
long m=s.nextLong();
long x=1;
do{
p=(m+b)/x;
b=10*b+10;
x++;
}while(p/(long)Math.pow(10... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class Main
{
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
long n=sc.nextLong();
long x=1;
long ar=0;
tag:for(long i=1;;i++)
{
ar+=9*i*x;
if(ar>=n)
{
long d = n - (ar-9*i*x);
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
// Change Of Plans BABY.... Change Of Plans //
import java.io.*;
import java.util.*;
import java.util.Queue;
import static java.lang.Math.*;
public class digitSequence {
static void MainSolution() {
long k = nl() - 1;
for (int i = 1; ; i++) {
long temp=9L*i*fastPow(10,i-1);
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
/**
* @(#)DigitSequence.java
*
*
* @author
* @version 1.00 2019/6/1
*/
import java.io.*;
import java.util.*;
public class DigitSequence {
/**
* Creates a new instance of <code>DigitSequence</code>.
*/
public DigitSequence() {
}
/**
* @param args the command line arguments
*/
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class A1177 {
public static long exponential(long a, long b){
long result = 1;
for(int i=0;i<b;i++){
result *= a;
}
return result;
}
public static void main(String args[]){
Scanner scanner = new Scanner(System.in);
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class P1177A {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
long k = sc.nextLong();
int pow = 1;
while ((long) ((Math.pow(10, pow) - Math.pow(10, pow - 1)) * pow) < k) {
k -= (long) ((Math.pow(10, pow) - Math.pow(10,... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
FastScanner sc=new FastScanner();
long K = sc.nextLong();
long nums = 9;
int digits = 1;
while (K > nums*digits) {
K... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
imp... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class Main {
static class LeftOver {
int a;
long b;
long c;
LeftOver(int a, long b, long c) {
this.a = a;
this.b = b;
this.c = c;
}
}
private static long pow(long base, long coe) {
if (coe ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class BDigitSequence {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long k = scan.nextLong();
long digits = 1;
long counter = 9L;
while(k > counter * digits) {
k -= counter * digits;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
public class digits {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
long k = Long.parseLong(br.readLine());
long temp = 9 * (int)Math.pow(10,0);
int count = ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long k = in.nextLong();
long t = 1;
long l = 1;
if(k <= 9) {
System.out.print(k);
System.exit(0);
}
long x = 9;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.MathContext;
import java.util.*;
public class Main {
static int len(long n) {
int res = 0;
while (n > 0) {
n /= 10;
res++;
}
return res;
}
static long big(int len) {
long p = 1;
while (len-- > 0) p *= 10;
retu... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class DigitsSequence2 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long index = scanner.nextLong();
solution1(index);
}
static void solution1(Long index){
int i = 1; // group number
long len ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
public class _v14 {
public static void main(String args[]){
PrintWriter out = new PrintWriter(System.out);
Reader in = new Reader();
long k = in.nextLong();
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.Queue;
import java.util.LinkedList;
import java.util.Stack;
public class Main
{
@SuppressWarnings("unchecked")
public static void main(String args[])throws IOException
{
Reader ob=new Reader();
Writer out=new Writer(System.out);
... | logn | 1177_B. Digits Sequence (Hard Edition) | 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.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
i... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class DigitsSequence {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
long k,c,n,d;
c=1;
d=9;
n=1;
k= sc.nextLong();
while(k>(c*d)) {
k-=(c*d);
n*=10;
d*=10;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
//package codeforces;
import java.util.*;
import java.math.BigInteger;
public class test_round_B {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
BigInteger k=sc.nextBigInteger();
BigInteger i=new BigInteger("0");
int d=0;
BigInteger... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class ABC {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
long k,c,n,d;
c=1;
d=9;
n=1;
k= sc.nextLong();
while(k>(c*d)) {
k-=(c*d)... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.util.stream.Collectors;
public class P1177A {
public static void main(String[] args) throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
long n = Long.parseLong(r.readLine());
if (n < 10) {
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class DigitSeq {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class DD {
public static void main(String args[]) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
long k=Long.parseLong(br.readLine());
long ans=... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.io.*;
public class DigitSequence
{
public static PrintWriter out;
/**
* @param args the command line arguments
*/
public static void main(String[] args) throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
public class digits {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
long k = Long.parseLong(br.readLine());
long temp = 9 * (int)Math.pow(10,0);
int count =... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.stream.*;
import java.lang.management.*;
import static java.lang.Math.abs;
import static java.lang.Math.min;
import static java.lang.Math.max;
import static java.lang.Math.sqrt;
import static java.lang.Integer.signum;
@SuppressWarnings("uncheck... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class Cses {
public static void main(String[] args) {
FastReader sc = new FastReader();
// int t = sc.nextInt();
// while (t-- > 0) {
long n = sc.nextLong();
if (n < 10) {
System.out.println(n);
return;
} else {
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
public class CodeForces {
class Pair<K, V> {
K first;
V second;
public Pair(K k, V v) {
first = k;
second = v;
}
}
pr... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.InputStreamReader;
public class B1177 {
public static void main(String[] args) throws Exception {
// BufferedReader br = new BufferedReader(new FileReader("F:/books/input.txt"));
BufferedReader br = new ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
static final int MAX_N = 1000010;
static final ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main{
final int mod = 1000000007;
final int maxn = -1;
final double eps = 1e-9;
long digits(long n){
if(n == 0) return 0;
int p = (int)Math.log10(n);
return (p + 1) * (n - (long)Math.pow(10, p) + 1) + digits((long)Math.pow(10, ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class prob1177b {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
long k,c,n,d;
c=1;
d=9;
n=1;
k= sc.nextLong();
while(k>(c*d)) {
k-=(c*d);
n*=10;
d*=10;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class Digits_Sequence_Hard_Edition_Kamel {
public static void main(String [] args) {
Scanner sc = new Scanner(System.in);
long k = sc.nextLong();
getResult(k);
sc.close();
}
static void getResult(long k) {
long val = 0;;
long ten = 1;
int i = 1;
while(true) {
va... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class prob1177b {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
long k,c,n,d;
c=1;
d=9;
n=1;
k= sc.nextLong();
while(k>(c*d)) {
k-=(c*d);
n*=10;
d*=10;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class A {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
long K = Long.valueOf(br.readLine());
long n = ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.DataInputStream;
import java.io.IOException;
import java.io.FileInputStream;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class M... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long itrIdx = 0;
long itr = 0;
long num = 0;
while(itrIdx < n){
itrIdx += (itr+1)*(Math.pow(10,itr+1) - Math.pow(10,... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String args[]) {new Main().run();}
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
void run(){
work();
out.flush();
}
void work() {
long r=in.nextLong();
long b=0;
for... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long itrIdx = 0;
long itr = 0;
long num = 0;
while(itrIdx < n){
itrIdx += (itr+1)*(Math.pow(10,itr+1) - Math.pow(10... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
public class Berland{
public static void main(String[] args) throws NumberFormatExc... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
// package name;
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
Scanner s = new Scanner(System.in);
long k = s.nextLong();
long dp[] = new long[13];
long x = 9; int i = 1;
long ansx = 0; int ansi = 0;
for(; i < 13; i++) {
dp[... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class digits
{
public static void main(String[] args)
{
long k = (new Scanner(System.in)).nextLong();
//k = 56
//League 1: 0 - 9
//League 2: 10 - 99
//League 3: 100 - 999..
//System.out.println("k = "+k);
long league = 1;
long irrelevancy = 0;
while(true)
{
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
static final int MAX_N = 1000010;
static final ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
public static void main(String ar[]) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
long k=Long.parseLong(br.readLine());
long l=1,h=1000000000000l;
long p[]=new... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Queue;
import java.util.Scanner;
public class Tests {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long inputNum = 0;
String finalResult = "";
inputNum = scanner.nextLong();
long upperLimitRes... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String args[])
{
FastReader input=new FastReader();
PrintWriter out=new PrintWriter(System.out);
int T=1;
while(T-->0)
{
long k=input.nextLong();
long v=9;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class cf1177b {
public static void main(String[] args) throws IOException {
long k = rl(), n = -1;
for (long l = 0, r = k; l <= r; ) {
long m = l + (r - l) / 2;
i... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class P_1177B {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long k = scan.nextLong();
long k2 = k - 10;
int cont = 1, pos;
String out; //System.out.println(getString((int)k));
if(k <= 9)
System.out.println(k);
else {
cont++;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.StringTokenizer;
im... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.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 | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class Training {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long index = in.nextLong();
if (index < 10) {
//one digit
System.out.println(index);
} else if (index < 190) {
//two ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.io.*;
public class DigitSequenceA {
public static void main(String[] args) throws IOException{
FastReader in = new FastReader();
double digit = in.nextDouble();
double temp = digit;
long[] seq = new long[13];
for(int i = 1; i<13; i++){
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class DigitQueries {
public static void main(String[] args) throws IOException {
FastReader in = new FastRea... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.*;
public class Main {
//SOLUTION BEGIN
//Into the Hardware Mode
void pre() throws Exception{}
void solve(int TC) throws Exception {
long K = nl();
K--;
int sz = 1;long pw = 1;
while(K >= pw){
long npw = ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.*;
import java.util.Scanner;
public class Test {
public static int digit(long number){
int i = 1;
long exp = 1;
while(number > i * 9 * exp){
number -= i * 9 * exp;
i++;
exp *= 10;
}
return i;
}
public static int result(long number){
int digit = digit(number);
long exp = 1;
fo... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Codechef
{
static class FastScanner {
BufferedReader br;
StringTokenizer stok;
FastScanner(InputStream is) {
br = new BufferedReader(new InputStreamReader(is));
}
String next() throws IOExc... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class cf_contest_1177_problem_B {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
long k = s.nextLong();
if (k<=9)
System.out.println(k);
else
{
int c = 1;
while(k>c*((Math.po... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class DigitalSequence {
public static void print(String s) {
System.out.println(s);
}
public static void main(String[] args) {
long k = new Scanner(System.in).nextLong();
long i = 1,t=0, c = 9,digits = 0,l=0,k2=k;
while(t<k){
l ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class DigitSeq {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = ... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
public class A {
void solve(){
long k = readLong();
long x = 9;
long y = 1;
while(k > x * y){
k... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
// Don't place your source in a package
import java.math.BigInteger;
import java.util.*;
import java.lang.*;
import java.io.*;
// Please name your class Main
public class Main {
static FastScanner fs=new FastScanner();
static class FastScanner {
BufferedReader br=new BufferedReader(new InputStreamRe... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
//package test_1177a;
import java.util.Scanner;
import java.util.Scanner;
public class test1177b{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
long k = sc.nextLong();
long k1 =0,k2 = 0;
long p = 1;
String str=... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class CodeForces1177B {
public static char custBinSearch(long lower, long upper, long lowIndex, int ten, long position) {
long half = Math.round((lower + upper) / 2.0);
long lowBound = lowIndex + (half - lower... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class Main {
public static Character solve(long a, long b, long c) {
long min = a;
long max;
long xth = 0;
long index;
for (index = String.valueOf(a).length() - 1;; index++) {
long numOfDigits = 0;
max = (long) Math.pow(10, index + 1) - 1;
long count = (max - m... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class B1177 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long N = in.nextLong();
long answer = solve(N, 0, 1, 1);
System.out.println(answer);
}
static long solve(long N, long offset, long start, int digits... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
long b=0;long p=1;
Scanner s=new Scanner(System.in);
long m=s.nextLong();
long x=1;
do{
p=(m+b)/x;
b=10*b+10;
x++;
}while(p/(long)Math.pow(10... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String args[]) {new Main().run();}
FastReader in = new FastReader();
PrintWriter out = new PrintWriter(System.out);
void run(){
int q=in.nextInt();
for(int i=0;i<q;i++) {
work();
}
out.flush();
}
long mod=1000000007;
l... | logn | 1080_D. Olya and magical square | 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 | 1080_D. Olya and magical square | CODEFORCES |
public class D {
public Object solve() {
long N = sc.nextLong(), K = sc.nextLong() - 1;
if (N >= 32)
return print("YES", N-1);
long A = 1L << (N-1), C = 4, T = (A*A - 1) / 3;
while (A > 1 && K > T) {
A /= 2;
K -= (C-1);
C *= 2;
T += (C-3) * (A*A - 1) / 3;
}
if (K >= 0 && K <= T)
retur... | logn | 1080_D. Olya and magical square | 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 | 1080_D. Olya and magical square | CODEFORCES |
import javafx.util.*;
import java.util.*;
import java.io.*;
import java.math.*;
public class Test4 {
PrintWriter pw = new PrintWriter(System.out); InputStream is = System.in;
Random rnd = new Random();
int a;
void run(){
a = ni();
for(int q=0; q<a; q++){
long nj = ni(), k... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
static ArrayList<BigInteger> bs = new ArrayList<>();
static void getBs(int n, BigInteger k) {
BigInteger four = BigInteger.valueOf(4);
BigInteger tmp4 = BigInteger.valueOf(1);
BigInt... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;
/**
* Created by timur on ... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.math.*;
import java.text.*;
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sca = new Scanner(System.in);
long k,n;
long ans;
long[] pw = new long[33];
pw[1]=4;
pw[0]=1;
for(int i=2;i<=31;i++)
p... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
import static java.lang.Math.max;
import static java.lang.Math.min;
public class Main {
FastScanner in;
PrintWriter out;
void run() {
in = new FastScanner();
out = new PrintWriter(System.out);
solve();
out.close();
}
... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.awt.List;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Random;
import java.ut... | logn | 1080_D. Olya and magical square | CODEFORCES |
//package round524;
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 D {
InputStream is;
PrintWriter out;
String INPUT = "";
long I = 4000000000000000007L;
voi... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;
import java.util.function.Function;
public class D {
public static void main(String[] args) throws IOException {
try (Input input = new StandardInput(); PrintWriter writer = new PrintWriter(System.out)) {
long[] s ... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.*;
import java.util.*;
import java.util.LinkedList;
import java.math.*;
import java.lang.*;
import java.util.PriorityQueue;
import static java.lang.Math.*;
@SuppressWarnings("unchecked")
public class Solution implements R... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Map;
import java.util.StringTokenizer;
... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class OlyaAndMagicalSquare {
public static void solveCase(FastIO io) {
int N = io.nextInt();
long K = io.nextLong();
CountMap cm = new CountMap();
cm.increment(N, BigInteger.ONE);
long rem = K;
int moves = 1;
int sqSize = N;
while (sqSi... | logn | 1080_D. Olya and magical square | 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 | 1080_D. Olya and magical square | 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.util.ArrayList;
import java.io.InputStream;
/**
* Built using CHel... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
public class D {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
// System.err.println(f(1... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class OlyaAndMagicalSquare {
public static void solveCase(FastIO io) {
int N = io.nextInt();
long K = io.nextLong();
CountMap cm = new CountMap();
cm.increment(N, BigInteger.ONE);
long rem = K;
int moves = 1;
int sqSize = N;
while (sqSi... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Solution solution = new Solution();
solution.solve();
}
private void solve() {
Scanner in = new Scanner(System.in);
int t = in.nextInt();
while (t -- > 0) {
long ... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.util.*;
import java.io.*;
// Solution
public class Main
{
public static void main (String[] argv)
{
new Main();
}
boolean test = false;
final int MOD = 998244353;
public Main() {
FastReader in = new FastReader(new BufferedReader(new InputStreamReade... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* @author Don Li
*/
public class OlyaAndMagicalSquare {
void solve() {
long[] dp = new long[32];
dp[0] = 0;
for (int i = 1; i < 32... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.*;
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));
// String fileName = "C-large-practice";
// ConsoleIO io = new ConsoleI... | logn | 1080_D. Olya and magical square | CODEFORCES |
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
What do you think? What do you think?
1st on Billboard, what do you think of it
Next is a Grammy, what do you think of it
However you think, I’m sorry, but shit, I have no fcking inter... | logn | 1080_D. Olya and magical square | 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), inf = (long)(3e18);
void solve() {
//SZ = sieve(); //SZ = 1000001;
int q = ni();
while(q-- > 0) {
... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.*;
import java.util.*;
public class E implements Runnable {
public static void main (String[] args) {new Thread(null, new E(), "_cf", 1 << 28).start();}
long oo = (long)2e18;
public void run() {
FastScanner fs = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
System.err.pr... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.util.*;
import java.io.*;
public class code {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int q = sc.nextInt();
long[] d = new long[30];
d[0] = 1;
for(int i=1;i<30;i++) d[i] = d[i-1]*4;
for(int z=0;z<q;z++){
long r = 0;
long n = sc... | logn | 1080_D. Olya and magical square | CODEFORCES |
//package round503;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;
public class B2 {
Scanner in;
PrintWriter out;
String INPUT = "";
// 12123432
// 12343212
int qc = 0;
int n;
int[] table;
int val(int x)
{
if(table[x] != Integer.MIN_VALUE)ret... | logn | 1019_B. The hat | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class B {
public static PrintWriter out;
public static BufferedReader bf;
public static int n;
public static int[] a;
public static void main(String[] args) throws Exception {
bf = new BufferedReader(new Inp... | logn | 1019_B. The hat | CODEFORCES |
import java.util.*;
import java.io.*;
public class CFB {
static int n;
static FastScanner in;
public static void main(String[] args) throws Exception {
in = new FastScanner(System.in);
n = in.nextInt();
int a = query(1);
if(((a % 2)+2) % 2== 1){
System.out.printl... | 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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.Reader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at th... | logn | 1019_B. The hat | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.