Submission #855487


Source Code Expand

Copy
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include<list>
#include<bitset>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#include<sstream>
#include<cmath>
#include<stack>
#include<assert.h>
using namespace std;

#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ( (X) > 0 ? (X) : ( -(X) ) )
#define S(X) ( (X) * (X) )
#define SZ(V) (int )V.size()
#define FORN(i, n) for(i = 0; i < n; i++)
#define FORAB(i, a, b) for(i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C)  ((B) <= (A) && (A) <= (C))

typedef pair<int,int> PII;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<PII > VP;

#define AIN(A, B, C) assert(IN(A, B, C))

//typedef int LL;
typedef long long int LL;
//typedef __int64 LL;

LL n, s;

vector<LL> find(LL x) {
	vector<LL> ret;
	for (LL i = 1; i * i <= x; i++) {
		if (x % i) continue;
		if (x % i == 0) {
			ret.push_back(i + 1);
			if (i == x / i) continue;
			ret.push_back(x / i + 1);
		}
	}
	sort(ret.begin(), ret.end());
	return ret;
}

LL calc(LL b, LL n)  {
	LL ret = 0;
	while (n) {
		ret += n % b;
		n /= b;
	}
	return ret;
}
int main()
{
	scanf("%lld %lld", &n, &s);
	if (n == s) {
		printf("%lld\n", n + 1);
		return 0;
	}
	vector<LL> Bs = find(ABS(n - s));
	for (LL b : Bs) {
		LL now = calc(b, n);
		if (now == s) {
			printf("%lld\n", b);
			return 0;
		}
	}
	printf("-1\n");
	return 0;
}

Submission Info

Submission Time
Task D - Digit Sum
User dragoon
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1784 Byte
Status AC
Exec Time 155 ms
Memory 256 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 5
AC × 47
Set Name Test Cases
Sample subtask1_87654_30.txt, subtask1_87654_138.txt, subtask1_87654_45678.txt, subtask1_31415926535_1.txt, subtask1_1_31415926535.txt
All subtask1_100000000000_1.txt, subtask1_100000000000_100000000000.txt, subtask1_100000000000_2.txt, subtask1_100000000000_3.txt, subtask1_100000000000_50000000000.txt, subtask1_100000000000_50000000001.txt, subtask1_100000000000_99999999999.txt, subtask1_16983563041_1.txt, subtask1_1_1.txt, subtask1_1_2.txt, subtask1_1_31415926535.txt, subtask1_239484768_194586924.txt, subtask1_2_1.txt, subtask1_2_2.txt, subtask1_31415926535_1.txt, subtask1_49234683534_2461734011.txt, subtask1_4_1.txt, subtask1_58640129658_232122496.txt, subtask1_68719476735_35.txt, subtask1_68719476735_36.txt, subtask1_68719476735_37.txt, subtask1_68719476736_1.txt, subtask1_68719476736_2.txt, subtask1_72850192441_16865701.txt, subtask1_79285169301_27.txt, subtask1_82914867733_1676425945.txt, subtask1_8594813796_75700.txt, subtask1_87654_12345.txt, subtask1_87654_138.txt, subtask1_87654_30.txt, subtask1_87654_4294967308.txt, subtask1_87654_45678.txt, subtask1_97822032312_49157112.txt, subtask1_98750604051_977728851.txt, subtask1_99999515529_1.txt, subtask1_99999515529_316226.txt, subtask1_99999515529_316227.txt, subtask1_99999515529_316228.txt, subtask1_99999515529_49999757765.txt, subtask1_99999515529_49999757766.txt, subtask1_99999515530_2.txt, subtask1_99999999977_1.txt, subtask1_99999999977_2.txt, subtask1_99999999977_49999999989.txt, subtask1_99999999977_49999999990.txt, subtask1_99999999999_1.txt, subtask1_99999999999_100000000000.txt
Case Name Status Exec Time Memory
subtask1_100000000000_1.txt AC 9 ms 256 KB
subtask1_100000000000_100000000000.txt AC 155 ms 256 KB
subtask1_100000000000_2.txt AC 9 ms 256 KB
subtask1_100000000000_3.txt AC 9 ms 256 KB
subtask1_100000000000_50000000000.txt AC 7 ms 256 KB
subtask1_100000000000_50000000001.txt AC 7 ms 256 KB
subtask1_100000000000_99999999999.txt AC 4 ms 256 KB
subtask1_16983563041_1.txt AC 6 ms 256 KB
subtask1_1_1.txt AC 4 ms 256 KB
subtask1_1_2.txt AC 4 ms 256 KB
subtask1_1_31415926535.txt AC 7 ms 256 KB
subtask1_239484768_194586924.txt AC 4 ms 256 KB
subtask1_2_1.txt AC 4 ms 256 KB
subtask1_2_2.txt AC 4 ms 256 KB
subtask1_31415926535_1.txt AC 7 ms 256 KB
subtask1_49234683534_2461734011.txt AC 7 ms 256 KB
subtask1_4_1.txt AC 4 ms 256 KB
subtask1_58640129658_232122496.txt AC 8 ms 256 KB
subtask1_68719476735_35.txt AC 8 ms 256 KB
subtask1_68719476735_36.txt AC 8 ms 256 KB
subtask1_68719476735_37.txt AC 8 ms 256 KB
subtask1_68719476736_1.txt AC 8 ms 256 KB
subtask1_68719476736_2.txt AC 8 ms 256 KB
subtask1_72850192441_16865701.txt AC 8 ms 256 KB
subtask1_79285169301_27.txt AC 8 ms 256 KB
subtask1_82914867733_1676425945.txt AC 8 ms 256 KB
subtask1_8594813796_75700.txt AC 5 ms 256 KB
subtask1_87654_12345.txt AC 4 ms 256 KB
subtask1_87654_138.txt AC 4 ms 256 KB
subtask1_87654_30.txt AC 4 ms 256 KB
subtask1_87654_4294967308.txt AC 5 ms 256 KB
subtask1_87654_45678.txt AC 4 ms 256 KB
subtask1_97822032312_49157112.txt AC 10 ms 256 KB
subtask1_98750604051_977728851.txt AC 10 ms 256 KB
subtask1_99999515529_1.txt AC 9 ms 256 KB
subtask1_99999515529_316226.txt AC 9 ms 256 KB
subtask1_99999515529_316227.txt AC 9 ms 256 KB
subtask1_99999515529_316228.txt AC 9 ms 256 KB
subtask1_99999515529_49999757765.txt AC 8 ms 256 KB
subtask1_99999515529_49999757766.txt AC 7 ms 256 KB
subtask1_99999515530_2.txt AC 9 ms 256 KB
subtask1_99999999977_1.txt AC 9 ms 256 KB
subtask1_99999999977_2.txt AC 9 ms 256 KB
subtask1_99999999977_49999999989.txt AC 7 ms 256 KB
subtask1_99999999977_49999999990.txt AC 8 ms 256 KB
subtask1_99999999999_1.txt AC 9 ms 256 KB
subtask1_99999999999_100000000000.txt AC 4 ms 256 KB