Submission #3860265


Source Code Expand

#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
long long Calc(long long n, int K) {
	int i;
	K++;
	long long r = 0;
	for (i = 1; i <= K; i++) {
		long long t;
		if(i!=K)t = (long long)( powl(n, 1.0L / (K - i + 1)) + 1 - 1e-8);
		else t = n;
		n = (n+t-1)/t;
		r += t;
	}
	return r;
}
int main() {
	int i;
	long long N, A, res = 1e18;
	scanf("%lld%lld", &N, &A);
	for (i = 0; i <= 50; i++) {
		res = min(res, Calc(N, i) + A*i);
	}
	printf("%lld\n", res);
}

Submission Info

Submission Time
Task E - Cookies
User ainta
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 507 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &N, &A);
                           ^

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 500 / 500 500 / 500
Status
AC × 3
AC × 27
AC × 72
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
dataset1 sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt
dataset2 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt, 02-17.txt, 02-18.txt, 02-19.txt, 02-20.txt, 02-21.txt, 02-22.txt, 02-23.txt, 02-24.txt, 02-25.txt, 02-26.txt, 02-27.txt, 02-28.txt, 02-29.txt, 02-30.txt, 02-31.txt, 02-32.txt, 02-33.txt, 02-34.txt, 02-35.txt, 02-36.txt, 02-37.txt, 02-38.txt, 02-39.txt, 02-40.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 128 KB
01-02.txt AC 1 ms 128 KB
01-03.txt AC 1 ms 128 KB
01-04.txt AC 1 ms 128 KB
01-05.txt AC 1 ms 128 KB
01-06.txt AC 1 ms 128 KB
01-07.txt AC 1 ms 128 KB
01-08.txt AC 1 ms 128 KB
01-09.txt AC 1 ms 128 KB
01-10.txt AC 1 ms 128 KB
01-11.txt AC 1 ms 128 KB
01-12.txt AC 1 ms 128 KB
01-13.txt AC 1 ms 128 KB
01-14.txt AC 1 ms 128 KB
01-15.txt AC 1 ms 128 KB
01-16.txt AC 1 ms 128 KB
01-17.txt AC 1 ms 128 KB
01-18.txt AC 1 ms 128 KB
01-19.txt AC 1 ms 128 KB
01-20.txt AC 1 ms 128 KB
01-21.txt AC 1 ms 128 KB
01-22.txt AC 1 ms 128 KB
01-23.txt AC 1 ms 128 KB
01-24.txt AC 1 ms 128 KB
01-25.txt AC 1 ms 128 KB
01-26.txt AC 1 ms 128 KB
02-01.txt AC 1 ms 128 KB
02-02.txt AC 1 ms 128 KB
02-03.txt AC 1 ms 128 KB
02-04.txt AC 1 ms 128 KB
02-05.txt AC 1 ms 128 KB
02-06.txt AC 1 ms 128 KB
02-07.txt AC 1 ms 128 KB
02-08.txt AC 1 ms 128 KB
02-09.txt AC 1 ms 128 KB
02-10.txt AC 1 ms 128 KB
02-11.txt AC 1 ms 128 KB
02-12.txt AC 1 ms 128 KB
02-13.txt AC 1 ms 128 KB
02-14.txt AC 1 ms 128 KB
02-15.txt AC 1 ms 128 KB
02-16.txt AC 1 ms 128 KB
02-17.txt AC 1 ms 128 KB
02-18.txt AC 1 ms 128 KB
02-19.txt AC 1 ms 128 KB
02-20.txt AC 1 ms 128 KB
02-21.txt AC 1 ms 128 KB
02-22.txt AC 1 ms 128 KB
02-23.txt AC 1 ms 128 KB
02-24.txt AC 1 ms 128 KB
02-25.txt AC 1 ms 128 KB
02-26.txt AC 1 ms 128 KB
02-27.txt AC 1 ms 128 KB
02-28.txt AC 1 ms 128 KB
02-29.txt AC 1 ms 128 KB
02-30.txt AC 1 ms 128 KB
02-31.txt AC 1 ms 128 KB
02-32.txt AC 1 ms 128 KB
02-33.txt AC 1 ms 128 KB
02-34.txt AC 1 ms 128 KB
02-35.txt AC 1 ms 128 KB
02-36.txt AC 1 ms 128 KB
02-37.txt AC 1 ms 128 KB
02-38.txt AC 1 ms 128 KB
02-39.txt AC 1 ms 128 KB
02-40.txt AC 1 ms 128 KB
sample-01.txt AC 1 ms 128 KB
sample-02.txt AC 1 ms 128 KB
sample-03.txt AC 1 ms 128 KB