Submission #857050


Source Code Expand

Copy
import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			/*
//			for(long n = 1; n <= 1000; n++) {
			for(long n = 50; n <= 100000; n++) {
				int cnt = 0;
				for(long i = n; i > 2; i--) {
					if(f(i, n) > f(i-1, n)) {
						long d = f(i, n) - f(i+1, n);
//						System.err.println(n + " " + i + " " + d + " " + f(i, n));
						if(cnt != 0 && i != (n+cnt+1)/(cnt+1)) {
							throw new RuntimeException();
						}
						if(++cnt >= 3) break;
					}
				}
			}
			*/
//			for(long n = 1; n <= 500; n++) {
//				for(long s = 1; s <= 500; s++) {
//					if(func(n, s) != naive(n, s)) {
//						System.err.println(n + " " + s + " " + func(n, s) + " " + naive(n, s));
//						return;
//					}
//				}
//			}
			long n = io.nextLong();
			long s = io.nextLong();
			
			io.out.println(func(n, s));
//			io.out.println(naive(n, s));
		}
	}
	
	long func(long n, long s) {
//		if(n <= 50) {
//			for(int i = 2; i <= n; i++) {
//				if(f(i, n) == s) {
//					return i;
//				}
//			}
//			return -1;
//		}
//		for(long i = 2; i*i <= n; i++) {
//			if(f(i, n) == s) {
//				return i;
//			}
//		}
		long ans = Long.MAX_VALUE;
		long sqrt = (long)Math.sqrt(n);
		for(long i = 2, cur = n + 1; cur > 2 && cur > sqrt - 100; i++) {
//			System.err.println(i + " " + cur);
			long next = (n+i)/i;
			long len = cur - next;
			long a = f(cur - 1, n);
			// a, a + (i-1), a + 2*(i-1)
//			System.err.println("ck: " + s + " " + (i - 1) + " " + a + " " + len);
//			if(s % (i - 1) == a % (i - 1)) {
			if((s - a) % (i - 1) == 0) {
				if(s >= a && s <= a + (len-1)*(i-1)) {
					ans = Math.min(ans, cur - ((s - a) / (i - 1) + 1));
//					System.err.println("ans: " + ans);
				}
			}
			cur = next;
		}
		for(long i = 2; (i-1)*(i-1) <= n + 100 && i < ans; i++) {
			if(f(i, n) == s) {
				return i;
			}
		}
		if(ans == Long.MAX_VALUE) {
			if(n == s) {
				return n + 1;
			}
			ans = -1;
		}
		return ans;
	}
	
	long naive(long n, long s) {
		for(long i = 2; i <= Math.max(2, n); i++) {
//			System.err.println(i + " " + f(i, n));
			if(f(i, n) == s) {
				return i;
			}
		}
		return -1;
	}
	
	long f(long b, long n) {
		if(b <= 1) throw new RuntimeException();
		return n < b ? n : (f(b, n/b) + n % b);
	}

	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }

	void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}

Submission Info

Submission Time
Task C - Tak and Cards
User tanzaku
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 7756 Byte
Status WA
Exec Time 174 ms
Memory 8276 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
WA × 4
WA × 12
WA × 24
Set Name Test Cases
Sample example_01.txt, example_02.txt, example_03.txt, example_04.txt
Subtask1 example_01.txt, example_02.txt, example_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt
All example_01.txt, example_02.txt, example_03.txt, example_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt
Case Name Status Exec Time Memory
example_01.txt WA 170 ms 8276 KB
example_02.txt WA 162 ms 8148 KB
example_03.txt WA 162 ms 8276 KB
example_04.txt WA 166 ms 8276 KB
subtask1_01.txt WA 158 ms 8272 KB
subtask1_02.txt WA 162 ms 8276 KB
subtask1_03.txt WA 162 ms 8276 KB
subtask1_04.txt WA 162 ms 8272 KB
subtask1_05.txt WA 162 ms 8272 KB
subtask1_06.txt WA 162 ms 8268 KB
subtask1_07.txt WA 162 ms 8144 KB
subtask1_08.txt WA 160 ms 8148 KB
subtask1_09.txt WA 166 ms 8272 KB
subtask2_01.txt WA 171 ms 8144 KB
subtask2_02.txt WA 166 ms 8276 KB
subtask2_03.txt WA 170 ms 8148 KB
subtask2_04.txt WA 166 ms 8148 KB
subtask2_05.txt WA 166 ms 8148 KB
subtask2_06.txt WA 162 ms 8148 KB
subtask2_07.txt WA 165 ms 8276 KB
subtask2_08.txt WA 166 ms 8276 KB
subtask2_09.txt WA 170 ms 8148 KB
subtask2_10.txt WA 174 ms 8148 KB
subtask2_11.txt WA 166 ms 8276 KB