solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
bool flag = false;
vector<int> lh, rh;
int minsc = 0;
int x;
int lhs[5], rhs[5];
string time;
cin >> time;
for (int i = 0; i < time.length(); i++) {
if (time[i] == ':') {
flag = true;
continue;
}
if (flag) {
if (time[i] >= 48 && time[i] <= 57)
rh.push_back(time[i] - 48);
else
rh.push_back(time[i] - 55);
} else {
if (time[i] >= 48 && time[i] <= 57)
lh.push_back(time[i] - 48);
else
lh.push_back(time[i] - 55);
}
}
for (int i = 0; i < 5; i++) {
lhs[i] = rhs[i] = 0;
}
for (int i = lh.size() - 1, j = 0; i >= 0; i--, j++) {
lhs[j] = lh[i];
}
for (int i = rh.size() - 1, j = 0; i >= 0; i--, j++) {
rhs[j] = rh[i];
}
for (int i = 0; i < 5; i++) {
if (minsc < lhs[i] && lhs[i] != 0) minsc = lhs[i];
if (minsc < rhs[i] && rhs[i] != 0) minsc = rhs[i];
}
flag = false;
for (int i = 1; i < 5; i++) {
if (lhs[i] != 0 || rhs[i] != 0) {
flag = true;
break;
}
}
if (!flag) {
if (lhs[0] >= 0 && lhs[0] <= 23) {
cout << "-1";
return 0;
}
}
flag = true;
x = minsc + 1;
while (flag) {
int s1, s2;
s1 = lhs[4] * x * x * x * x + lhs[3] * x * x * x + lhs[2] * x * x +
lhs[1] * x + lhs[0];
s2 = rhs[4] * x * x * x * x + rhs[3] * x * x * x + rhs[2] * x * x +
rhs[1] * x + rhs[0];
if (s1 >= 24 || s2 >= 60)
flag = false;
else {
cout << x << " ";
x++;
}
}
if (x == minsc + 1) cout << "0";
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, a[3][15];
vector<int> sol;
int main() {
char sir[15];
scanf("%s", sir + 1);
n = strlen(sir + 1);
int val, p = 1, i, max_val = 1;
for (i = 1; i <= n; ++i) {
if (sir[i] == ':') {
++p;
continue;
}
if (sir[i] >= '0' && sir[i] <= '9') val = sir[i] - '0';
if (sir[i] >= 'A' && sir[i] <= 'Z') val = sir[i] - 'A' + 10;
if (val > max_val) max_val = val;
a[p][++a[p][0]] = val;
}
val = 0;
int inf = 0, ora1 = -1, ora2 = -1;
for (int b = max_val + 1;; ++b) {
int ora = 0;
int min = 0;
val = 1;
for (int i = a[1][0]; i >= 1; --i) {
ora += a[1][i] * val;
val *= b;
}
val = 1;
for (int i = a[2][0]; i >= 1; --i) {
min += a[2][i] * val;
val *= b;
}
if (ora1 == ora && ora2 == min) {
inf = 1;
break;
}
if (ora >= 0 && ora <= 23 && min >= 0 && min <= 59) {
sol.push_back(b);
} else {
if (ora > 23 || min > 59) break;
}
ora1 = ora;
ora2 = min;
}
if (inf) {
printf("-1\n");
return 0;
}
if (sol.size() == 0)
printf("0\n");
else {
for (i = 0; i < sol.size(); ++i) {
printf("%d ", sol[i]);
}
}
return 0;
}
| 8 | CPP |
def s():
a = [[ord(i)-48 if ord(i) < 60 else ord(i)-55 for i in i]for i in input().split(':')]
r = [i for i in range(max(max(a[0]),max(a[1]))+1,61) if sum(list(i**l[0]*l[1] for l in enumerate(reversed(a[0]))))<24 and sum(list(i**l[0]*l[1] for l in enumerate(reversed(a[1]))))<60]
if len(r) == 0:
print(0)
elif r[-1] == 60:
print(-1)
else:
print(*r)
s() | 8 | PYTHON3 |
'''input
27:0070
'''
def conv(s, base):
ans = 0
for index, i in enumerate(reversed(s)):
val = int(i, 36)
ans += (base**index)*val
return ans
def valid(base, h, m):
hours = conv(h, base)
mint = conv(m, base)
if(0 <= hours < 24 and 0 <= mint < 60):
return True
else:
return False
h, m = input().split(":")
hl = sorted(list(h))
ml = sorted(list(m))
hm = hl[-1]
mm = ml[-1]
if(ord(hm) < ord('A')):
minbaseh = ord(hm) - ord('0') + 1
else:
minbaseh = 11 + ord(hm) - ord('A')
if(ord(mm) < ord('A')):
minbasem = ord(mm) - ord('0') + 1
else:
minbasem = 11 + ord(mm) - ord('A')
minbase = max(minbasem, minbaseh)
# print(minbaseh, minbasem, minbase, hm, mm)
firstInval = 0
found = False
lo = minbase
hi = 60
while(lo <= hi):
mid = lo + (hi - lo)//2
# print(mid, lo, hi, valid(mid, h, m))
if(not valid(mid, h, m)):
firstInval = mid
hi = mid-1
found = True
else:
lo = mid+1
if(not found):
print(-1)
elif(firstInval == minbase):
print(0)
else:
for i in range(minbase, firstInval):
print(i, end = " ")
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int sym(char c) {
if (c >= '0' && c <= '9')
return c - '0';
else if (c >= 'A' && c <= 'Z')
return (c - 'A') + 10;
return 0;
}
int binpow(int a, int n) {
int res = 1;
while (n)
if (n & 1) {
res *= a;
--n;
} else {
a *= a;
n >>= 1;
}
return res;
}
int main() {
string s;
int m = 0, i = 0, n = 0;
cin >> s;
while (s[0] == '0') s.erase(0, 1);
for (i = 0; s[i] != ':'; i++)
;
i++;
while (s[i] == '0') s.erase(i, 1);
if (s[0] == ':') s = '0' + s;
if (s[s.length() - 1] == ':') s += '0';
for (i = 0; i < s.length(); i++) m = max(m, sym(s[i]));
m++;
int c, l;
for (l = 0; s[l] != ':'; l++)
;
for (n = m;; n++) {
c = 0;
for (i = 0; i < l; i++) {
c += sym(s[i]) * binpow(n, l - (i + 1));
if (c > 23) goto _;
}
c = 0;
i++;
for (int ii = 0; i < s.length(); i++, ii++) {
c += sym(s[i]) * binpow(n, (s.length() - (l + 1)) - (ii + 1));
if (c > 59) goto _;
}
if (l <= 1 && (s.length() - (l + 1)) <= 1) {
cout << -1 << '\n';
return 0;
}
cout << n << '\n';
}
_:;
if (n == m) cout << 0 << '\n';
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
char s[111];
char a[11], b[11];
int to[200];
int ret[N], ct;
int main() {
int i, j;
int x = 0, y = 0;
for (i = 0; i <= 9; i++) to[i + '0'] = i;
for (i = 'A'; i <= 'Z'; i++) to[i] = i - 'A' + 10;
scanf("%s", s);
int len = strlen(s);
x = y = 0;
for (i = 0; s[i] == '0'; i++)
;
if (s[i] == ':')
a[x++] = '0';
else {
for (; s[i] != ':'; i++) a[x++] = s[i];
}
for (i++; s[i] == '0'; i++)
;
if (i == len)
b[y++] = '0';
else {
for (; i < len; i++) b[y++] = s[i];
}
a[x] = 0;
b[y] = 0;
if (x == 1 && y == 1) {
if (to[a[0]] > 23)
puts("0");
else
puts("-1");
} else {
int mx = 0;
for (i = 0; i < x; i++) mx = max(mx, to[a[i]]);
for (i = 0; i < y; i++) mx = max(mx, to[b[i]]);
ct = 0;
for (int bs = mx + 1;; bs++) {
int tmp = 0;
for (i = 0; i < x; i++) {
if (tmp > 23) break;
tmp = tmp * bs + (to[a[i]]);
}
if (tmp > 23) break;
tmp = 0;
for (i = 0; i < y; i++) {
if (tmp > 59) break;
tmp = tmp * bs + (to[b[i]]);
}
if (tmp > 59) break;
ret[++ct] = bs;
}
if (ct == 0)
puts("0");
else {
for (i = 1; i < ct; i++) printf("%d ", ret[i]);
printf("%d\n", ret[i]);
}
}
return 0;
}
| 8 | CPP |
def toi(t, b):
res = 0
for i in t:
if i >= b:
return -1
res = b * res + i
return res
def valid(h, m, b):
return toi(h, b) in range(24) and toi(m, b) in range(60)
h, m = input().split(':')
h = [int(ch, 36) for ch in h]
m = [int(ch, 36) for ch in m]
if valid(h, m, 61):
print('-1')
exit()
res = [str(i) for i in range(2, 61) if valid(h, m, i)]
if res: print(*res)
else: print(0)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
int diru[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dirv[] = {-1, 0, 1, -1, 1, -1, 0, 1};
using namespace std;
template <class T>
T sq(T n) {
return n * n;
}
template <class T>
T gcd(T a, T b) {
return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
return (a / gcd<T>(a, b) * b);
}
template <class T>
bool inside(T a, T b, T c) {
return a <= b && b <= c;
}
template <class T>
void setmax(T &a, T b) {
if (a < b) a = b;
}
template <class T>
void setmin(T &a, T b) {
if (b < a) a = b;
}
template <class T>
T power(T N, T P) {
return (P == 0) ? 1 : N * power(N, P - 1);
}
vector<int> p;
char in[100000], *ch;
string A, B;
int main() {
int n, T, t = 1, m, i, j, k;
scanf("%s", in);
ch = strtok(in, ":");
A = ch;
ch = strtok(NULL, ":");
B = ch;
int f = 0;
for (i = 0; i < ((int)A.size()); i++) {
if (A[i] != '0') break;
}
if (i == ((int)A.size()))
f++;
else if (i == ((int)A.size()) - 1) {
if (A[i] - 'A' + 10 > 23) {
puts("0");
return 0;
}
f++;
}
for (i = 0; i < ((int)B.size()); i++) {
if (B[i] != '0') break;
}
if (i == ((int)B.size()) || i == ((int)B.size()) - 1) f++;
if (f == 2) {
puts("-1");
return 0;
}
int ans = 0;
for (k = 2;; k++) {
long long unsigned tot = 0;
long long unsigned cur = 1;
for (i = ((int)A.size()) - 1; i > -1; i--) {
if (isalpha(A[i])) {
tot += cur * (long long unsigned)(A[i] - 'A' + 10);
j = A[i] - 'A' + 10;
} else {
tot += cur * (long long unsigned)(A[i] - '0');
j = A[i] - '0';
}
if (j >= k) goto second;
cur *= (long long unsigned)k;
}
if (tot > 23) break;
tot = 0;
cur = 1;
for (i = ((int)B.size()) - 1; i > -1; i--) {
if (isalpha(B[i])) {
j = B[i] - 'A' + 10;
tot += cur * (long long unsigned)(j);
} else {
j = B[i] - '0';
tot += cur * (long long unsigned)(j);
}
if (j >= k) goto second;
cur *= (long long unsigned)k;
}
if (tot > 59) break;
ans++;
p.push_back(k);
second:;
}
if (ans == 0)
puts("0");
else {
for (i = 0; i < ((int)p.size()); i++) {
if (i) printf(" ");
printf("%d", p[i]);
}
puts("");
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool zero(double x) { return x > -1e-6 && x < 1e-6; }
char s1[10], s2[10];
int val[256], len1, len2;
void init() {
int i;
for (i = 0; i <= 9; ++i) val[i + '0'] = i;
for (i = 'A'; i <= 'Z'; ++i) val[i] = i - 'A' + 10;
}
bool flag;
bool check(int k) {
int i, ex, v1 = 0, v2 = 0;
for (i = len1 - 1; i >= 0; --i) {
if (val[s1[i]] >= k) return false;
}
for (i = len2 - 1; i >= 0; --i) {
if (val[s2[i]] >= k) return false;
}
ex = 1;
for (i = len1 - 1; i >= 0; --i) {
v1 += ex * val[s1[i]];
ex *= k;
}
ex = 1;
for (i = len2 - 1; i >= 0; --i) {
v2 += ex * val[s2[i]];
ex *= k;
}
if (v1 < 0 || v1 > 23) return false;
if (v2 < 0 || v2 > 59) return false;
if (v1 == val[s1[len1 - 1]] && v2 == val[s2[len2 - 1]]) flag = 1;
return true;
}
int stat[100], top;
char ss[100];
int main() {
int i, j, ans = 0;
scanf("%s", ss);
for (i = j = 0; ss[i] != ':'; ++i) s1[j++] = ss[i];
s1[j] = '\0';
j = 0;
for (++i; ss[i]; ++i) s2[j++] = ss[i];
s2[j] = '\0';
len1 = strlen(s1);
len2 = strlen(s2);
init();
top = 0;
flag = 0;
for (i = 2; i < 70; ++i) {
if (check(i)) {
stat[top++] = i;
}
}
if (flag)
printf("-1\n");
else if (top == 0)
printf("0\n");
else {
for (i = 0; i < top; ++i) {
if (i) printf(" ");
printf("%d", stat[i]);
}
printf("\n");
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string hour, minit;
vector<int> ans;
int mypow(int n, int a) {
if (!a) return 1;
int x = n;
for (int i = 1; i < a; i++) x *= n;
return x;
}
bool valid(int base) {
int h = 0, m = 0;
for (int i = hour.size() - 1, j = 0; i >= 0; i--, j++) {
int t;
if (hour[i] < 'A')
t = hour[i] - '0';
else
t = hour[i] - 'A' + 10;
if (t >= base) return false;
h += (mypow(base, j) * t);
}
if (h >= 24) return false;
for (int i = minit.size() - 1, j = 0; i >= 0; i--, j++) {
int t;
if (minit[i] < 'A') {
t = minit[i] - '0';
} else
t = minit[i] - 'A' + 10;
if (t >= base) return false;
m += (mypow(base, j) * t);
}
if (m >= 60) return false;
return true;
}
int main() {
string str;
int i;
cin >> str;
for (i = 0; str[i] != ':'; i++) hour += str[i];
i++;
for (; str[i]; i++) minit += str[i];
for (i = 2; i < 60; i++) {
if (valid(i)) {
ans.push_back(i);
}
}
if (valid(60))
printf("-1");
else if (ans.size() == 0)
printf("0");
else {
for (i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x7f7f7f7f;
const int MAXN = 21;
string ss, s, s2;
int parse(int base, string &s) {
int ret = 0;
for (int i = 0; i < s.length(); ++i) {
ret *= base;
if (isdigit(s[i]))
ret += s[i] - '0';
else
ret += s[i] - 'A' + 10;
}
return ret;
}
int main() {
cin >> ss;
int len = ss.find(':');
s = ss.substr(0, len);
s2 = ss.substr(len + 1, ss.size() - len);
int mx = 0;
for (int i = 0; i < ss.length(); ++i) {
if (isalpha(ss[i])) {
mx = max(mx, ss[i] - 'A' + 10);
} else if (isdigit(ss[i])) {
mx = max(mx, ss[i] - '0');
}
}
bool flag = 0;
int i;
vector<int> ans;
for (i = mx + 1; i <= 100; ++i) {
int l = parse(i, s), r = parse(i, s2);
if (l < 24 && r < 60) {
ans.push_back(i);
flag = 1;
} else
break;
}
if (!flag) {
cout << 0 << '\n';
} else {
if (i == 101) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < ans.size(); ++i) {
cout << ans[i] << ' ';
}
}
return 0;
}
| 8 | CPP |
chns='0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ';
nums=[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
mp={}
for ind, i in enumerate(chns):
mp[i]=nums[ind]
ans=[]
h, m = input().split(':')
minsys=max([mp[i] for i in (h+m)])+1
for sys in range(minsys,101):
h10=0
for pw, i in enumerate(reversed(h)):
h10+=sys**pw*mp[i]
m10=0
for pw, i in enumerate(reversed(m)):
m10+=sys**pw*mp[i]
if(h10<=23 and h10>=0 and m10<=59 and m10>=0):
ans.append(sys)
if 100 in ans:
print(-1)
quit()
if len(ans) == 0:
print(0)
quit()
for i in ans:
print(i, end=' ') | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, t;
char str1[9], str2[9], str[20], c;
int main() {
int i, j, k;
scanf("%s", str);
bool tmp = true;
for (i = n = t = 0; str[i]; i++) {
if (str[i] == ':') {
j = i + 1;
break;
}
if (str[i] > 'N') {
puts("0");
return 0;
}
str1[n++] = str[i];
if (str[i] <= '9')
t = max(t, str[i] - '0');
else
t = max(t, str[i] - 'A' + 10);
}
for (i = 0; i < n / 2; i++)
c = str1[i], str1[i] = str1[n - i - 1], str1[n - i - 1] = c;
for (i = j, m = 0; str[i]; i++) {
str2[m++] = str[i];
if (str[i] <= '9')
t = max(t, str[i] - '0');
else
t = max(t, str[i] - 'A' + 10);
}
for (i = 0; i < m / 2; i++)
c = str2[i], str2[i] = str2[m - i - 1], str2[m - i - 1] = c;
for (i = n - 1; i >= 0; i--) {
if (str1[i] == '0')
n--;
else
break;
}
for (i = m - 1; i >= 0; i--) {
if (str2[i] == '0')
m--;
else
break;
}
if (n == 1 && m == 1 || (n == 1 && m == 0) || (n == 0 && m == 1) ||
(n == 0 && m == 0))
puts("-1");
else {
for (i = t + 1; i <= 59; i++) {
int l, r, lx, rx;
for (j = 0, lx = 1, l = 0; j < n; j++) {
if (str1[j] <= '9')
k = str1[j] - '0';
else
k = str1[j] - 'A' + 10;
l += lx * k;
lx *= i;
}
if (l > 23) break;
for (j = 0, rx = 1, r = 0; j < m; j++) {
if (str2[j] <= '9')
k = str2[j] - '0';
else
k = str2[j] - 'A' + 10;
r += rx * k;
rx *= i;
}
if (r > 59) break;
printf("%d\n", i);
tmp = false;
}
if (tmp) puts("0");
}
return 0;
}
| 8 | CPP |
def toi(t, b):
v = 0
for ti in t:
if ti >= b:
return -1
v = b * v + ti
return v
def t(h, m, b):
return toi(h, b) in range(24) and toi(m, b) in range(60)
h, m = ([int(ch, 36) for ch in x] for x in input().split(':'))
if t(h, m, 61):
print('-1')
else:
v = [str(i) for i in range(2, 61) if t(h, m, i)]
print(' '.join(v) if v else '0') | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int convert(string a, int base) {
int val, j, sum = 0, mul = 1;
for (j = a.size() - 1; j >= 0; j--) {
if (a[j] >= '0' && a[j] <= '9')
val = a[j] - '0';
else
val = a[j] - 'A' + 10;
sum += val * mul;
mul *= base;
}
return sum;
}
int main() {
vector<long long> ret;
int i, intmin, inthr;
string a, min, hr;
cin >> a;
int pos = a.find(":");
hr = a.substr(0, pos);
min = a.substr(pos + 1);
for (i = 0; i < hr.size(); i++) {
if (hr[i] == '0') {
hr.erase(i, 1);
--i;
} else
break;
}
for (i = 0; i < min.size(); i++) {
if (min[i] == '0') {
min.erase(i, 1);
--i;
} else
break;
}
if (hr.empty()) hr = "0";
if (min.empty()) min = "0";
if (hr.size() == 1 && min.size() == 1)
if ((hr[0] >= '0' && hr[0] <= '9') || (hr[0] >= 'A' && hr[0] <= 'O')) {
cout << "-1\n";
return 0;
}
a = hr + min;
int max2 = -1, val;
for (long long j = 0; j < a.size(); j++) {
if (a[j] >= '0' && a[j] <= '9')
val = a[j] - '0';
else
val = a[j] - 'A' + 10;
max2 = max(val, max2);
}
int minBase = max2 + 1;
for (i = minBase; i <= 60; i++) {
inthr = convert(hr, i);
intmin = convert(min, i);
if (inthr >= 0 && inthr <= 23 && intmin >= 0 && intmin <= 59)
ret.push_back(i);
else
break;
}
if (ret.empty())
cout << "0\n";
else {
for (long long j = 0; j < ret.size(); j++) cout << ret[j] << " ";
cout << "\n";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char str[50];
int p, j, k;
int a[11];
int b[11];
bool check(int x) {
int suma = 0, sumb = 0;
for (int i = 0; i < j; i++) {
if (a[i] >= x) {
return false;
}
}
for (int i = 0; i < k; i++) {
if (b[i] >= x) {
return false;
}
}
for (int i = 0; i < j; i++) {
int tmp = 1;
for (int n = i + 1; n < j; n++) {
tmp *= x;
}
suma += a[i] * tmp;
if (suma >= 24) return false;
}
for (int i = 0; i < k; i++) {
int tmp = 1;
for (int n = i + 1; n < k; n++) {
tmp *= x;
}
sumb += b[i] * tmp;
if (sumb >= 60) return false;
}
return true;
}
int main() {
int ok = 0, flag = 0;
cin >> str;
int len = strlen(str);
for (int i = 0; i < len; i++) {
if (str[i] == ':') {
p = i;
}
}
for (int i = 0; i < p; i++) {
while (str[i] == '0' && !flag) i++;
if (i == p) break;
flag = 1;
if (str[i] >= 'A' && str[i] <= 'Z')
a[j] = str[i] - 'A' + 10;
else
a[j] = str[i] - '0';
j++;
}
flag = 0;
for (int i = p + 1; i < len; i++) {
while (str[i] == '0' && !flag) i++;
if (i == p) break;
flag = 1;
if (str[i] >= 'A' && str[i] <= 'Z')
b[k] = str[i] - 'A' + 10;
else
b[k] = str[i] - '0';
k++;
}
if ((j == 0 || (j == 1 && a[0] < 24)) && (k == 0 || k == 1)) {
cout << -1 << endl;
ok = 1;
} else {
for (int i = 2; i <= 60; i++) {
if (check(i)) {
ok = 1;
cout << i << ' ';
}
}
if (ok) cout << endl;
}
if (!ok) cout << 0 << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize "03"
using namespace std;
const long long int inf = INT_MAX;
const long double eps = 0.0000001;
const long double PI = acos(-1.0);
const long long int MOD = 1e9 + 7;
const long long int N = 1e5 + 5;
long long int func(char c) {
if (c >= '0' && c <= '9') return (long long int)(c - '0');
if (c >= 'A' && c <= 'Z') return (long long int)(c - 'A' + 10);
return 0;
}
long long int solve(string s, long long int c) {
long long int l = s.length(), ans = 0, p = 1;
for (long long int i = l - 1; i >= 0; i--) {
ans += func(s[i]) * p;
p *= c;
}
return ans;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
string a = s.substr(0, s.find(":"));
string b = s.substr(s.find(":") + 1);
long long int f1 = 0, f2 = 0, l1 = a.length(), l2 = b.length();
for (long long int i = 0; i < l1 - 1; i++) {
if (a[i] != '0') {
f1 = 1;
break;
}
}
for (long long int i = 0; i < l2 - 1; i++) {
if (b[i] != '0') {
f2 = 1;
break;
}
}
if (!f1 && !f2) {
if (s[l1 - 1] <= 'N') return cout << -1, 0;
}
long long int mx = 0;
for (long long int i = 0; i < l1; i++) {
mx = max(mx, func(a[i]));
}
for (long long int i = 0; i < l2; i++) {
mx = max(mx, func(b[i]));
}
if (solve(a, mx + 1) > 23 || solve(b, mx + 1) > 59) return cout << 0, 0;
for (long long int i = mx + 1;; i++) {
if (solve(a, i) <= 23 && solve(b, i) <= 59)
cout << i << " ";
else
break;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[60], b[60];
int tota, totb;
int ans[10000];
int tot = 0;
int convert(int base, int *arr, int size) {
int ans = 0, k = 1;
for (int i = size - 1; i >= 0; i--) {
ans += k * arr[i];
k = k * base;
}
return ans;
}
int main() {
char tmp;
int Max = 0;
while (scanf("%c", &tmp), tmp != ':') {
if (tmp >= 'A')
tmp = tmp - 'A' + 10;
else
tmp = tmp - '0';
a[tota++] = tmp;
Max = Max > tmp ? Max : tmp;
}
while (scanf("%c", &tmp) != EOF) {
if (tmp == '\n') break;
if (tmp >= 'A')
tmp = tmp - 'A' + 10;
else
tmp = tmp - '0';
b[totb++] = tmp;
Max = Max > tmp ? Max : tmp;
}
int beforeA = 0, beforeB = 0;
for (int i = Max + 1;; i++) {
int A, B;
A = convert(i, a, tota);
B = convert(i, b, totb);
if (A == beforeA && B == beforeB) {
printf("-1\n");
return 0;
}
beforeA = A, beforeB = B;
if (A < 24 && B < 60)
ans[tot++] = i;
else
break;
}
for (int i = 0; i < tot; i++)
printf("%d%c", ans[i], i == tot - 1 ? '\n' : ' ');
if (tot == 0) printf("0\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long do_it(char ch) {
if (ch >= '0' && ch <= '9') return ch - '0';
return 10 + ch - 'A';
}
bool check_it(string s, int num, int total) {
long long val = 0;
for (int i = 0; i < ((int)s.size()); ++i) {
long long x = do_it(s[i]);
if (x >= num) return false;
val = val * num + x;
}
if (val <= total) return true;
return false;
}
int main() {
string s;
cin >> s;
int pos = s.find(":");
string s1 = s.substr(0, pos);
string s2 = s.substr(pos + 1);
if (check_it(s1, 100, 23) && check_it(s2, 100, 59)) {
cout << "-1" << endl;
return 0;
}
vector<int> a;
for (int i = 2; i < 100; ++i)
if (check_it(s1, i, 23) && check_it(s2, i, 59)) a.push_back(i);
if (a.empty()) {
cout << "0" << endl;
return 0;
}
for (int i = 0; i < ((int)a.size()); ++i) cout << a[i] << " ";
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
string tostr(const T& t) {
ostringstream os;
os << t;
return os.str();
}
const int MAXN = 60;
int tonum(char ch) {
if (isdigit(ch)) return ch - '0';
return ch - 'A' + 10;
}
int todecimal(string s, int base) {
int res = 0;
for (int i = 0; i < int((s).size()); ++i) res = res * base + tonum(s[i]);
return res;
}
int main(int argc, char* argv[]) {
string s, h, m;
cin >> s;
istringstream in(s);
getline(in, h, ':');
getline(in, m, ':');
int base = 0;
for (int i = 0; i < int((h).size()); ++i) base = max(base, tonum(h[i]));
for (int i = 0; i < int((m).size()); ++i) base = max(base, tonum(m[i]));
int i, ph = -1, pm = -1;
bool inf = false;
for (i = base + 1; i <= 60; ++i) {
int hh = todecimal(h, i);
int mm = todecimal(m, i);
if (hh == ph && mm == pm) inf = true;
if (hh > 23 || mm > 59) break;
ph = hh;
pm = mm;
}
if (inf) {
puts("-1");
} else if (i == base + 1) {
puts("0");
} else {
for (int j = base + 1; j < i; ++j) {
if (j > base + 1) putchar(' ');
printf("%d", j);
}
putchar('\n');
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int f(char a) {
if (a >= 'A' && a <= 'Z') {
return a - 'A' + 10;
}
return a - '0';
}
int main() {
char a[7];
char b[7];
char c;
int i;
int la, lb;
scanf("%[^:]%c%s", a, &b[0], b);
getchar();
la = strlen(a);
lb = strlen(b);
int aa, bb;
for (aa = 0; aa < la - 1; aa++) {
if (a[aa] != '0') break;
}
for (bb = 0; bb < lb - 1; bb++) {
if (b[bb] != '0') break;
}
if (la - aa < 2 && lb - bb < 2 && a[la - 1] < 'O') {
printf("-1\n");
} else {
int begin, end;
int max = 0;
int j;
for (i = aa; i < la; i++) {
if (f(a[i]) > max) {
max = f(a[i]);
}
}
for (i = bb; i < lb; i++) {
if (f(b[i]) > max) {
max = f(b[i]);
}
}
begin = max + 1;
int sa, sb;
for (j = begin;; j++) {
sa = sb = 0;
int temp = 1;
for (i = la - 1; i >= aa; i--) {
sa += f(a[i]) * temp;
temp *= j;
if (sa > 23) break;
}
temp = 1;
for (i = lb - 1; i >= bb; i--) {
sb += f(b[i]) * temp;
temp *= j;
if (sb > 59) break;
}
if (sa > 23 || sb > 59) {
end = j - 1;
break;
}
}
if (begin > end) {
printf("0\n");
} else {
for (i = begin; i < end; i++) {
printf("%d ", i);
}
printf("%d\n", end);
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string time;
cin >> time;
vector<int> hour, minute;
bool flag(0);
int minBase(2);
for (int p = 0; p < time.size(); p++) {
int c;
if (time[p] == ':') {
flag = 1;
continue;
} else if ('0' <= time[p] && time[p] <= '9') {
c = time[p] - '0';
} else if ('A' <= time[p] && time[p] <= 'Z') {
c = 10 + time[p] - 'A';
}
if (!flag && (c > 0 || hour.size() > 0)) {
hour.push_back(c);
} else if (flag && (c > 0 || minute.size() > 0)) {
minute.push_back(c);
}
if (c + 1 > minBase) {
minBase = c + 1;
}
}
std::vector<int> ans;
if ((hour.size() == 0 || (hour.size() == 1 && hour[0] < 24)) &&
(minute.size() == 0 || (minute.size() == 1 && minute[0] < 60))) {
puts("-1");
} else {
for (int b = minBase; b <= 60; b++) {
bool possible = 1;
int m = 0;
for (int q = 0; q < minute.size(); q++) {
m = b * m + minute[q];
if (m >= 60) {
possible = 0;
break;
}
}
int h = 0;
for (int q = 0; q < hour.size(); q++) {
h = b * h + hour[q];
if (h >= 24) {
possible = 0;
break;
}
}
if (possible) {
ans.push_back(b);
}
}
if (ans.size() == 0) {
puts("0");
} else {
for (int p = 0; p < ans.size(); p++) {
printf("%d ", ans[p]);
};
puts("");
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
char s[1000111];
string a, b;
int value(char c) {
if (c >= '0' && c <= '9') return c - '0';
return c - 'A' + 10;
}
int get(int base, string s) {
int res = 0;
for (int i = 0, _a = (s.length()); i < _a; i++) {
res = (res * base) + value(s[i]);
if (res > 59) return res;
}
return res;
}
bool check(int base) {
if (get(base, a) <= 23 && get(base, b) <= 59)
return true;
else
return false;
}
int main() {
gets(s);
for (int i = 0, _a = (strlen(s)); i < _a; i++)
if (s[i] == ':') s[i] = ' ';
int nn = 0;
for (int i = 0, _a = (strlen(s)); i < _a; i++) {
nn = max(nn, value(s[i]) + 1);
}
istringstream sin(s);
sin >> a >> b;
if (check(66))
puts("-1");
else {
int cnt = 0;
for (int base = (nn), _b = (66); base <= _b; base++)
if (check(base)) {
printf("%d ", base);
cnt++;
}
if (!cnt) puts("0");
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char a[10], b[10];
long long parse(char *s, long long base) {
long long v = 0;
for (long long i = 0; s[i]; i++) {
long long t = s[i];
if (s[i] <= '9') t -= '0';
if (s[i] >= 'A') t = t - 'A' + 10;
if (base <= t) return -1;
v = v * base + t;
}
return v;
}
clock_t time_p = clock();
void timer() {
time_p = clock() - time_p;
cerr << "Execution Time: " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
int32_t main() {
scanf("%[^:]:%s", a, b);
vector<long long> r;
for (long long i = 2; i <= 120; i++) {
long long h = parse(a, i);
long long m = parse(b, i);
if (h < 0 || m < 0) continue;
if (h < 24 && m < 60) r.push_back(i);
}
if (r.empty())
puts("0");
else if (r.back() >= 60)
puts("-1");
else {
for (long long i = 0; i < (long long)r.size(); i++) printf("%lld ", r[i]);
}
timer();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int power(int x, int y) {
int prod = 1;
while (y--) {
prod *= x;
}
return prod;
}
int valueOf(char c) {
if (c > 47 && c < 58)
return c - 48;
else
return c - 55;
}
int valueUnderRadix(char a[], int len, int r) {
if (len == 0) return 0;
if (len == 1) return valueOf(a[0]);
return valueOf(a[0]) * power(r, len - 1) + valueUnderRadix(a + 1, len - 1, r);
}
int main() {
char in[16], a[6], b[6];
int i = 0, a1 = 0, b1 = 0, maxa = 0, maxb = 0, temp, ctr = 0;
cin >> in;
while (in[i] == '0') ++i;
while (in[i] != ':') {
a[a1] = in[i];
temp = valueOf(in[i]);
if (temp > maxa) maxa = temp;
++a1;
++i;
}
a[a1] = '\0';
++i;
while (in[i] == '0') ++i;
while ((in[i] > 64 && in[i] < 91) || (in[i] > 47 && in[i] < 58)) {
b[b1] = in[i];
temp = valueOf(in[i]);
if (temp > maxb) maxb = temp;
++b1;
++i;
}
b[b1] = '\0';
if ((a1 == 0 && valueUnderRadix(b, b1, 60) < 60) ||
(b1 == 0 && valueUnderRadix(a, a1, 24) < 24) ||
(a1 == 1 && valueOf(a[a1 - 1]) < 24 && valueUnderRadix(b, b1, 60) < 60))
cout << "-1\n";
else {
for (i = max(maxa, maxb) + 1; i < 60; ++i) {
if (valueUnderRadix(a, a1, i) < 24 && valueUnderRadix(b, b1, i) < 60)
cout << i << " ", ++ctr;
}
if (ctr == 0) cout << "0\n";
}
cin >> i;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool check(string hr, string min, int base) {
int hh = 0, mm = 0;
int k = 0;
for (int i = hr.length() - 1; i >= 0; --i) {
if (hr[i] <= '9' and hr[i] >= '0') {
if (hr[i] - '0' >= base) return false;
hh = hh + ceil(pow(base, k)) * (hr[i] - '0');
} else if (hr[i] <= 'Z' and hr[i] >= 'A') {
if (hr[i] - 'A' + 10 >= base) return false;
hh += ceil(pow(base, k)) * (hr[i] - 'A' + 10);
}
k++;
}
if (hh > 23) return false;
k = 0;
for (int i = min.length() - 1; i >= 0; --i) {
if (min[i] <= '9' and min[i] >= '0') {
if (min[i] - '0' >= base) return false;
mm += ceil(pow(base, k)) * (min[i] - '0');
} else if (min[i] <= 'Z' and min[i] >= 'A') {
if (min[i] - 'A' + 10 >= base) return false;
mm += pow(base, k) * (min[i] - 'A' + 10);
}
k++;
}
if (mm > 59) return false;
return true;
}
int main() {
string s;
cin >> s;
string hr = "", min = "";
int k;
for (k = 0; k < s.length(); ++k) {
if (s[k] == ':') {
k++;
break;
}
hr += s[k];
}
for (; k < s.length(); ++k) {
min += s[k];
}
bool flag = 0;
int ret;
std::vector<int> v;
for (int i = 2; i < 70; ++i) {
ret = check(hr, min, i);
if (ret == 1) {
flag = 1;
v.push_back(i);
}
}
if (flag == 0) {
cout << "0";
return 0;
}
if (v.back() == 69)
cout << "-1";
else {
for (int i = 0; i < v.size(); ++i) {
cout << v[i] << " ";
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s;
int anw[10010];
char a[110], b[110];
int get(char c) {
if (c >= '0' && c <= '9') return c - '0';
return c - 'A' + 10;
}
int main() {
cin >> s;
int la = 0, lb = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ':') break;
a[la++] = s[i];
}
for (int i = la + 1; i < s.size(); i++) {
b[lb++] = s[i];
}
int cnt = 0;
for (int i = 2; i <= 200; i++) {
int fen = 0, miao = 0, flag = 0;
for (int j = 0; j < la; j++) {
int x = get(a[j]);
if (x >= i) {
flag = 1;
break;
}
fen = fen * i + x;
}
for (int j = 0; j < lb; j++) {
int x = get(b[j]);
if (x >= i) {
flag = 1;
break;
}
miao = miao * i + x;
}
if (flag) continue;
if (fen >= 0 && fen <= 23 && miao >= 0 && miao <= 59) anw[cnt++] = i;
}
if (cnt == 0)
cout << 0 << endl;
else if (cnt > 100) {
cout << -1 << endl;
} else {
for (int i = 0; i < cnt; i++) cout << anw[i] << " ";
cout << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int xx[] = {1, 1, 1, 0, -1, -1, -1, 0};
int yy[] = {-1, 0, 1, 1, 1, 0, -1, -1};
long long int gcd(long long int a, long long int b) {
return ((a % b == 0) ? b : gcd(b, a % b));
}
int cal(int mal, int times) {
int h = 1, i;
for (i = 0; i < times; i++) h = h * mal;
return h;
}
int main() {
int i, j, len, tmp;
map<char, int> my;
vector<int> res;
for (i = 0; i < 10; i++) {
my[(char)(i + 48)] = i;
}
for (i = 0; i < 26; i++) {
my[(char)(i + 65)] = i + 10;
}
bool f = true;
string str, s1, s2;
cin >> str;
len = str.size();
for (i = 0; i < len; i++) {
if (str[i] == ':') {
f = false;
continue;
}
if (f)
s1 += str[i];
else
s2 += str[i];
}
len = s1.size();
for (i = 0; i < len; i++) {
if (s1[i] == '0') {
s1.erase(s1.begin());
i--;
} else
break;
}
len = s2.size();
for (i = 0; i < len; i++) {
if (s2[i] == '0') {
s2.erase(s2.begin());
i--;
} else
break;
}
tmp = 0;
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
for (i = 0; i < s1.size(); i++) {
tmp = max(my[s1[i]], tmp);
}
for (i = 0; i < s2.size(); i++) {
tmp = max(my[s2[i]], tmp);
}
int m, n, l1, l2;
l1 = s1.size();
l2 = s2.size();
for (i = tmp + 1; i <= 60; i++) {
m = n = 0;
for (j = 0; j < l1; j++) {
m += (cal(i, j) * my[s1[j]]);
}
for (j = 0; j < l2; j++) {
n += (cal(i, j) * my[s2[j]]);
}
if (m < 24 && n < 60) {
res.push_back(i);
}
}
if (res.size() == 0) {
printf("0\n");
return 0;
}
if (res[res.size() - 1] == 60) {
printf("-1\n");
return 0;
}
l1 = res.size();
for (i = 0; i < l1; i++) {
cout << res[i] << " ";
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
stringstream ss;
int val(char x) {
if (x <= '9') return x - '0';
return x - 'A' + 10;
}
int f(string a, string b, int r) {
int h = 0, m = 0;
for (int i = 0; i < a.size(); i++) {
h = h * r + val(a[i]);
if (val(a[i]) >= r || h > 23) return 0;
}
for (int i = 0; i < b.size(); i++) {
m = m * r + val(b[i]);
if (val(b[i]) >= r || m > 59) return 0;
}
return 0 <= h && h <= 23 && 0 <= m && m <= 59;
}
int main() {
string a, b, s;
vector<int> res;
cin >> s;
a = s.substr(0, s.find(':'));
b = s.substr(s.find(':') + 1);
for (int i = 2; i < 10000; i++)
if (f(a, b, i)) res.push_back(i);
if (f(a, b, 10000))
cout << -1 << endl;
else if (res.size() == 0)
cout << 0 << endl;
else {
for (int i = 0; i < res.size(); i++) cout << res[i] << " ";
cout << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string rem(string s) {
long long i;
for (i = 0; i < s.size(); i++)
if (s[i] != '0') break;
string res;
while (i < s.size()) {
res += s[i];
i++;
}
if (res == "") return "0";
return res;
}
long long value(char ch) {
if (isdigit(ch)) return ch - '0';
return ch - 'A' + 10;
}
bool poss(string s, long long ra) {
for (long long i = 0; i < s.size(); i++) {
if (value(s[i]) >= ra) return false;
}
return true;
}
long long getVal(string s, long long ra) {
reverse(s.begin(), s.end());
long long res = 0;
long long tav = 1;
for (long long i = 0; i < s.size(); i++) {
res += tav * value(s[i]);
tav *= ra;
}
return res;
}
int main() {
string a, b, s;
cin >> s;
for (long long i = 0; i < s.size(); i++)
if (s[i] == ':') s[i] = ' ';
stringstream ssin(s);
ssin >> a >> b;
a = rem(a);
b = rem(b);
if (a.size() == 1 && b.size() == 1) {
if (value(a[0]) <= 23 && value(b[0]) <= 59)
cout << -1 << endl;
else
cout << 0 << endl;
return 0;
}
vector<long long> out;
for (long long rad = 2; rad <= 100; rad++) {
if (poss(a, rad) && poss(b, rad)) {
long long x = getVal(a, rad);
long long y = getVal(b, rad);
if (x <= 23 && y <= 59) {
out.push_back(rad);
}
}
}
if (out.size() == 0) {
cout << 0 << endl;
return 0;
}
for (long long i = 0; i < out.size(); i++)
cout << (i == 0 ? "" : " ") << out[i];
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string h, m, s;
bool a[100];
long long va(string s, int sys) {
long long k = 1;
long long r = 0;
for (int i = s.size() - 1; i >= 0; --i) {
r += (s[i] < 'A' ? s[i] - 48 : s[i] - 'A' + 10) * k;
k *= sys;
}
return r;
}
int main() {
cin >> s;
int w = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == ':')
w = 1;
else if (w)
m += s[i];
else
h += s[i];
}
int inf = 1;
if (h[h.size() - 1] > 'A' + 13) inf = 0;
for (int i = 0; i < h.size() - 1; ++i) {
if (h[i] != '0') inf = 0;
}
for (int i = 0; i < m.size() - 1; ++i) {
if (m[i] != '0') inf = 0;
}
if (inf) {
printf("-1");
return 0;
}
for (int i = 1; i <= 9; ++i) {
int g = 1;
for (int j = 0; j < h.size(); ++j)
if (i + 48 <= h[j]) g = 0;
for (int j = 0; j < m.size(); ++j)
if (i + 48 <= m[j]) g = 0;
if (g && va(h, i) < 24 && va(m, i) < 60) a[i] = 1;
}
for (int i = 'A'; i <= 'A' + 89; ++i) {
int g = 1;
for (int j = 0; j < h.size(); ++j)
if (i <= h[j]) g = 0;
for (int j = 0; j < m.size(); ++j)
if (i <= m[j]) g = 0;
if (g && va(h, i - 'A' + 10) < 24LL && va(m, i - 'A' + 10) < 60LL)
a[i - 'A' + 10] = 1;
}
int cnt = 0;
for (int i = 1; i < 100; ++i)
if (a[i]) {
printf("%d ", i);
++cnt;
}
if (cnt == 0) cout << cnt;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int h[100];
int m[100];
char s[100];
int a[100];
int main() {
memset(h, 0, sizeof(h));
memset(m, 0, sizeof(m));
scanf("%s", s);
int i, j;
int temp;
int id = 0;
int l = strlen(s);
for (i = 0; i < l; i++) {
if (s[i] == ':') {
temp = i;
break;
}
}
int cnt = 0;
int ans = 0;
for (i = temp - 1; i >= 0; i--) {
if (s[i] >= '0' && s[i] <= '9')
h[++cnt] = s[i] - '0';
else
h[++cnt] = s[i] - 'A' + 10;
}
for (i = l - 1; i >= temp + 1; i--) {
if (s[i] >= '0' && s[i] <= '9')
m[++ans] = s[i] - '0';
else
m[++ans] = s[i] - 'A' + 10;
}
int maxn = 0;
for (i = 0; i < l; i++) {
if (s[i] == ':') continue;
if (s[i] >= '0' && s[i] <= '9') {
if (maxn < s[i] - '0') {
maxn = s[i] - '0';
}
} else if (s[i] >= 'A' && s[i] <= 'Z') {
if (maxn < s[i] - 'A' + 10) {
maxn = s[i] - 'A' + 10;
}
}
}
maxn = maxn + 1;
for (i = maxn; i <= 59; i++) {
int k = 1;
int flag1 = 0;
int flag2 = 0;
for (j = 1; j <= cnt; j++) {
flag1 += k * h[j];
k *= i;
}
k = 1;
for (j = 1; j <= ans; j++) {
flag2 += k * m[j];
k *= i;
}
if (flag1 < 24 && flag2 <= 59) {
a[++id] = i;
}
}
int flag = 0;
for (i = 60; i <= 60; i++) {
int k = 1;
int flag1 = 0;
int flag2 = 0;
for (j = 1; j <= cnt; j++) {
flag1 += k * h[j];
k *= i;
}
k = 1;
for (j = 1; j <= ans; j++) {
flag2 += k * m[j];
k *= i;
}
if (flag1 < 24 && flag2 <= 59) {
a[++id] = i;
}
if (flag1 < 24 && flag2 <= 59) {
flag = 1;
}
}
if (flag == 1)
printf("-1\n");
else if (id == 0)
printf("%d\n", 0);
else
for (i = 1; i <= id; i++) {
printf("%d ", a[i]);
}
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int main() {
char a[10] = {0};
char b[10] = {0};
char bb = 1;
int hj = 0;
scanf("%c", &bb);
do {
a[hj] = bb;
hj++;
scanf("%c", &bb);
} while (bb != ':');
a[hj] = 0;
scanf("%s", &b);
int begA = -1;
int begB = -1;
for (int i = 0; a[i] && a[i] == '0'; i++) begA++;
for (int i = 0; b[i] && b[i] == '0'; i++) begB++;
int la = strlen(a);
int lb = strlen(b);
char v[36] = "0123456789ABCDEFGHIJKLMNOPQRSTVWXYZ";
int ma = -1;
int mb = -1;
if ((begA >= (la - 2)) && (begB >= (lb - 2))) {
if (a[la - 1] <= 'O') {
printf("-1");
return 0;
}
}
for (int i = 0; a[i]; i++) {
for (int j = 0; v[j]; j++) {
if (v[j] == a[i]) ma = max(ma, j);
}
}
for (int i = 0; b[i]; i++) {
for (int j = 0; v[j]; j++) {
if (v[j] == b[i]) mb = max(mb, j);
}
}
int beg = max(ma, mb) + 1;
bool f = false;
for (int i = beg; true; i++) {
int ca = 0;
int cb = 0;
int p = 0;
for (int j = la - 1; j > begA; j--) {
int mest = 0;
for (int k = 0; v[k]; k++) {
if (v[k] == a[j]) {
mest = k;
break;
}
}
int buf = (int)pow((double)i, (double)p) * mest;
ca += buf;
p++;
}
p = 0;
for (int j = lb - 1; j > begB; j--) {
int mest = 0;
for (int k = 0; v[k]; k++) {
if (v[k] == b[j]) {
mest = k;
break;
}
}
int buf = (int)pow((double)i, (double)p) * mest;
cb += buf;
p++;
}
if ((ca > 23) || (cb > 59)) break;
f = true;
printf("%d ", i);
}
if (!f) printf("0");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string kol;
string h, m;
vector<int> ans;
int tod(char ch) {
if (ch < '9' + 1 && ch >= '0') return ch - '0';
return ch - 'A' + 10;
}
int num(string s, int base) {
int sss = 0;
int dti;
for (int i = 0; i < (int)s.size(); ++i) {
dti = tod(s[i]);
if (dti >= base) return 60;
sss *= base;
sss += dti;
if (sss > 60) return 60;
}
return sss;
}
int main() {
cin >> kol;
int ind = kol.find_first_of(":");
h = kol.substr(0, ind);
m = kol.substr(ind + 1);
for (int i = 1; i < 62; ++i)
if (num(h, i) < 24 && num(m, i) < 60) ans.push_back(i);
if (ans.empty()) {
cout << 0 << endl;
return 0;
}
if (ans.back() > 60) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < (int)ans.size(); ++i) cout << ans[i] << " ";
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long POWER(long long a, long long p) {
if (p == 0) return 1;
long long b = a;
for (int i = 1; i < p; i++) {
b *= a;
}
return b;
}
int main() {
string s;
cin >> s;
long long a[27];
vector<long long> ans;
for (int i = 0; i < 27; i++) {
a[i] = 10 + i;
}
long long base = 2;
while (true) {
bool d = 1;
long long q = 0, c = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == ':') {
if (!(c >= 0 && c <= 59)) {
d = 0;
break;
}
q = 0;
c = 0;
for (int j = i - 1; j >= 0; j--) {
if ((isdigit(s[j]) && s[j] - '0' > base - 1) ||
(isalpha(s[j]) && a[s[j] - 'A'] > base - 1)) {
d = 0;
break;
}
if (isdigit(s[j]))
c += (s[j] - '0') * POWER(base, q);
else {
c += a[s[j] - 'A'] * POWER(base, q);
}
q++;
}
if (!(c >= 0 && c <= 23)) {
d = 0;
}
break;
}
if ((isdigit(s[i]) && s[i] - '0' > base - 1) ||
(isalpha(s[i]) && a[s[i] - 'A'] > base - 1)) {
d = 0;
break;
}
if (isdigit(s[i]))
c += (s[i] - '0') * POWER(base, q);
else {
c += a[s[i] - 'A'] * POWER(base, q);
}
q++;
}
if (d) ans.push_back(base);
base++;
if (base > 1000) break;
}
if (!(ans.size())) {
cout << 0;
return 0;
}
if (ans.size() > 800) {
cout << -1;
return 0;
}
for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
return 0;
}
| 8 | CPP |
def f(x, k):
if 1 < k < 37: return int(x, k)
s = 0
for i in x:
s = s * k
s += int(i, 36)
return s
hours, minutes = input().split(':')
i = j = k = max(int(max(hours), 36), int(max(minutes), 36)) + 1
x, y = (f(hours, k) == f(hours, k + 1)), (f(minutes, k) == f(minutes, k + 1))
if x and y: print(-1 if hours[-1] < 'O' else 0)
else:
if x: i = 61
else:
while f(hours, i) < 24: i += 1
if y: j = i
else:
while j < i and f(minutes, j) < 60: j += 1
print(' '.join(map(str, range(k, j))) if k < j else 0) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
const long double eps = 1e-07;
string s1, s2;
vector<int> a1, a2;
vector<int> ans;
bool check(int x) {
for (int i = 0; i < a1.size(); ++i)
if (a1[i] >= x) return false;
for (int i = 0; i < a2.size(); ++i)
if (a2[i] >= x) return false;
int t = 0;
for (int i = 0; i < a1.size(); ++i) t = t * x + a1[i];
if ((t >= 24) || (t < 0)) return false;
t = 0;
for (int i = 0; i < a2.size(); ++i) t = t * x + a2[i];
if ((t >= 60) || (t < 0)) return false;
return true;
}
void parse() {
for (int i = 0; i < s1.size(); ++i) {
if ((s1[i] >= '0') && (s1[i] <= '9'))
a1.push_back(s1[i] - '0');
else
a1.push_back(s1[i] - 'A' + 10);
}
for (int i = 0; i < s2.size(); ++i) {
if ((s2[i] >= '0') && (s2[i] <= '9'))
a2.push_back(s2[i] - '0');
else
a2.push_back(s2[i] - 'A' + 10);
}
reverse(a1.begin(), a1.end());
reverse(a2.begin(), a2.end());
while ((a1.size() > 1) && (a1[a1.size() - 1] == 0)) a1.pop_back();
while ((a2.size() > 1) && (a2[a2.size() - 1] == 0)) a2.pop_back();
reverse(a1.begin(), a1.end());
reverse(a2.begin(), a2.end());
}
int main() {
string s;
cin >> s;
int i = 0;
while (s[i] != ':') {
s1.push_back(s[i]);
++i;
}
++i;
while (i < s.size()) {
s2.push_back(s[i]);
++i;
}
parse();
for (int i = 2; i < 200; ++i)
if (check(i)) ans.push_back(i);
if (ans.size() > 100)
cout << -1 << endl;
else {
for (int i = 0; i < ans.size(); ++i) printf("%d ", ans[i]);
}
if (ans.size() == 0) cout << 0 << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int pw(int x, int y) {
int q, res = 1;
for (q = 0; q < y; q++) res *= x;
return res;
}
int a[12], k, cnt, i, l1, l2, m, p, j, r[100];
char s1[5], s2[5], s[11];
int main() {
gets(s);
for (i = 0; i < strlen(s); i++) {
if (s[i] == ':') break;
s1[j++] = s[i];
}
l1 = j;
j = 0;
i++;
for (; i < strlen(s); i++) {
s2[j++] = s[i];
}
l2 = j;
for (i = 0; i < l1 - 1; i++) {
if (s1[i] < 'A')
m = (((m) > (s1[i] - 48)) ? m : s1[i] - 48);
else
m = (((m) > (s1[i] - 55)) ? m : s1[i] - 55);
}
if (m == 0) {
for (i = 0; i < l2 - 1; i++) {
if (s2[i] < 'A')
m = (((m) > (s2[i] - 48)) ? m : s2[i] - 48);
else
m = (((m) > (s2[i] - 55)) ? m : s2[i] - 55);
}
if (m == 0 && s1[l1 - 1] - 55 < 24) {
printf("-1\n");
return 0;
} else {
if (s2[l2 - 1] < 'A')
m = (((m) > (s2[l2 - 1] - 48)) ? m : s2[l2 - 1] - 48);
else
m = (((m) > (s2[l2 - 1] - 55)) ? m : s2[l2 - 1] - 55);
}
}
for (i = 0; i < l2; i++) {
if (s2[i] < 'A')
m = (((m) > (s2[i] - 48)) ? m : s2[i] - 48);
else
m = (((m) > (s2[i] - 55)) ? m : s2[i] - 55);
}
if (s1[l1 - 1] < 'A')
m = (((m) > (s1[l1 - 1] - 48)) ? m : s1[l1 - 1] - 48);
else
m = (((m) > (s1[l1 - 1] - 55)) ? m : s1[l1 - 1] - 55);
for (i = m + 1;; i++) {
p = 0;
for (j = 0; j < l1; j++) {
if (s1[j] < 'A')
p += (s1[j] - 48) * pw(i, l1 - 1 - j);
else
p += (s1[j] - 55) * pw(i, l1 - 1 - j);
}
if (p > 23) break;
p = 0;
for (j = 0; j < l2; j++) {
if (s2[j] < 'A') {
p = p + (s2[j] - 48) * pw(i, (l2 - 1 - j));
} else
p += (s2[j] - 55) * pw(i, (l2 - 1 - j));
}
if (p > 59) break;
r[k++] = i;
}
if (k == 0) {
printf("0\n");
return 0;
}
for (i = 0; i < k - 1; i++) printf("%d ", r[i]);
printf("%d\n", r[k - 1]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 9, MOD = 1e9 + 7, OO = 2e9, MOD2 = 998244353;
const long long INF = 1e15;
int val(char c) {
if (c >= 'A' && c <= 'Z') return c - 'A' + 10;
return c - '0';
}
void runtestcase() {
string str;
cin >> str;
string h, m;
for (int i = 0; i < str.find(':'); ++i) h.push_back(str[i]);
for (int i = str.find(':') + 1; i < ((int)str.size()); ++i)
m.push_back(str[i]);
vector<int> vec;
for (int b = 2; b < 100; ++b) {
long long hh = 00, mm = 0;
bool valid = 1;
for (auto it : h) {
if (val(it) >= b) valid = 0;
hh = hh * b + val(it);
}
for (auto it : m) {
if (val(it) >= b) valid = 0;
mm = mm * b + val(it);
}
valid &= hh < 24 && mm < 60;
if (valid) {
if (b == 99) {
cout << -1;
return;
}
vec.push_back(b);
}
}
for (auto it : vec) cout << it << ' ';
if (vec.empty()) cout << 0;
}
int main() {
cout << fixed << setprecision(9), ios::sync_with_stdio(false),
cin.tie(nullptr), cout.tie(nullptr);
int t = 1, tt = 1;
while (t--) {
runtestcase();
++tt;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool isBase(string s1, string s2, int base) {
int ans1 = 0, ans2 = 0;
for (int i = s1.length() - 1; i >= 0; i--) {
if ('A' <= s1[i] && s1[i] <= 'Z')
ans1 = ans1 + ((s1[i] - 'A' + 10) * (pow(base, s1.length() - i - 1)));
else
ans1 = ans1 + ((s1[i] - '0') * (pow(base, s1.length() - i - 1)));
}
for (int i = s2.length() - 1; i >= 0; i--) {
if ('A' <= s2[i] && s2[i] <= 'Z')
ans2 = ans2 + ((s2[i] - 'A' + 10) * (pow(base, s2.length() - i - 1)));
else
ans2 = ans2 + ((s2[i] - '0') * (pow(base, s2.length() - i - 1)));
}
if ((0 <= ans1 && ans1 <= 23) && (0 <= ans2 && ans2 <= 59))
return true;
else
return false;
}
bool zeroExcept(string s1, string s2) {
for (int i = 0; i < s1.length() - 1; i++) {
if (s1[i] == '0')
continue;
else
return 0;
}
for (int i = 0; i < s2.length() - 1; i++) {
if (s2[i] == '0')
continue;
else
return 0;
}
if (('0' <= s1[s1.length() - 1] && s1[s1.length() - 1] <= '9') ||
('A' <= s1[s1.length() - 1] && s1[s1.length() - 1] <= 'N'))
return 1;
else
return 0;
}
int main() {
string s;
cin >> s;
int i = 0;
while (s[i] != ':') i++;
string s1, s2;
s1 = s.substr(0, i);
s2 = s.substr(i + 1, s.length());
if (zeroExcept(s1, s2)) {
cout << "-1" << endl;
return 0;
}
int max_ = -1;
for (int i = 0; i < s.length(); i++) {
if ('0' <= s[i] && s[i] <= '9') max_ = max(max_, s[i] - '0');
if ('A' <= s[i] && s[i] <= 'Z') max_ = max(max_, s[i] - 'A' + 10);
}
for (int i = max_ + 1; i <= 60; i++) {
if (isBase(s1, s2, i))
cout << i << " ";
else if (i == max_ + 1) {
cout << "0" << endl;
return 0;
} else
return 0;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 1, 0, 0, 0, 0, 0, 0};
int dy[] = {0, 0, 1, -1, 0, 0, 0, 0};
const long long inf = 100000007;
const double eps = 0.000000009;
long long mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int p = 0;
string s1, s2;
while (s[p] == '0') p++;
while (s[p] != ':') {
s1.push_back(s[p]);
p++;
}
p++;
while (s[p] == '0') p++;
while (p < s.length()) {
s2.push_back(s[p]);
p++;
}
if (s1.length() == 0) s1.push_back('0');
if (s2.length() == 0) s2.push_back('0');
map<char, int> m;
for (int i = 0; i < 10; i++) m[char('0' + i)] = i;
for (int i = 0; i < 26; i++) m[char('A' + i)] = 10 + i;
int minb = 0;
for (int i = 0; i < s1.length(); i++) minb = max(minb, m[s1[i]]);
for (int i = 0; i < s2.length(); i++) minb = max(minb, m[s2[i]]);
if (s1.length() == 1 && s2.length() == 1 && m[s1[0]] <= 23) {
cout << -1 << endl;
return 0;
}
vector<int> sol;
for (int i = minb + 1; i < 70; i++) {
int x1 = 0, y1 = 0;
for (int j = 0; j < s1.length(); j++) {
x1 = x1 * i + m[s1[j]];
}
for (int j = 0; j < s2.length(); j++) {
y1 = y1 * i + m[s2[j]];
}
if (x1 <= 23 && y1 <= 59) {
sol.push_back(i);
}
}
if (sol.size()) {
for (int i = 0; i < sol.size(); i++) cout << sol[i] << " ";
} else
cout << 0 << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-6;
template <typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& p) {
return os << p.first << ',' << p.second;
}
template <typename T>
struct point {
T x, y;
point(T xx = 0, T yy = 0) : x(xx), y(yy) {}
T len2() const { return x * x + y * y; }
double len() const { return sqrt(double(len2())); }
bool operator==(const point<T>& p) const { return x == p.x && y == p.y; }
};
template <typename T>
point<T> operator+(const point<T>& a, const point<T>& b) {
return point<T>(a.x + b.x, a.y + b.y);
}
template <typename T>
point<T> operator-(const point<T>& a, const point<T>& b) {
return point<T>(a.x - b.x, a.y - b.y);
}
template <typename T>
T scal(const point<T>& a, const point<T>& b) {
return a.x * b.x + a.y * b.y;
}
template <typename T>
T vect(const point<T>& a, const point<T>& b) {
return a.x * b.y - a.y * b.x;
}
template <typename T>
ostream& operator<<(ostream& os, const point<T>& p) {
return os << '(' << p.x << ',' << p.y << ')';
}
int todigit(char x) {
if (isdigit(x)) return x - '0';
return x - 'A' + 10;
}
int toint(const string& s, int k) {
int q = 0;
for (int i = 0; i < s.size(); i++) {
if (todigit(s[i]) >= k) {
return -1;
}
q = q * k + todigit(s[i]);
if (q > 60) return q;
}
return q;
}
int main() {
string s;
cin >> s;
int p = s.find(':');
string a(s.substr(0, p));
string b(s.substr(p + 1));
int res = 0;
for (int i = 2; i < 1000; i++) {
int h = toint(a, i);
int m = toint(b, i);
if (h < 0 || m < 0) continue;
if (h >= 24 || m >= 60) continue;
res++;
}
if (res > 900) {
puts("-1");
} else if (!res) {
puts("0");
} else {
for (int i = 2; i < 1000; i++) {
int h = toint(a, i);
int m = toint(b, i);
if (h < 0 || m < 0) continue;
if (h >= 24 || m >= 60) continue;
printf("%d ", i);
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
map<char, int> mp;
int k = 0;
for (char j = '0'; j <= '9'; j++) {
mp[j] = k;
k++;
}
for (char j = 'A'; j <= 'Z'; j++) {
mp[j] = k;
k++;
}
string s;
cin >> s;
string s1 = "", s2 = "";
int flag = 0;
int i = 0;
int mx = 0;
while (s[i] != ':' && flag == 0) {
s1 += s[i];
if (mp[s[i]] > mx) mx = mp[s[i]];
i++;
}
i++;
while (i < s.size()) {
s2 += s[i];
if (mp[s[i]] > mx) mx = mp[s[i]];
i++;
}
int sz1 = s1.size();
int sz2 = s2.size();
for (int i = mx + 1; i < 60; i++) {
int h = 0, m = 0;
for (int j = 0; j < sz1; j++) {
int k = mp[s1[sz1 - j - 1]] * pow(i, j);
h += k;
}
for (int j = 0; j < sz2; j++) {
m += mp[s2[sz2 - j - 1]] * pow(i, j);
}
if (i == mx + 1 && (h > 23 || m > 59)) {
cout << 0;
break;
}
if (i == mx + 1 &&
(h == mp[s1[s1.size() - 1]] && m == mp[s2[s2.size() - 1]])) {
cout << -1;
break;
}
if (i > mx + 1 && (h > 23 || m > 59)) {
break;
}
cout << i << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> resp;
string h, m;
bool sirve(int a) {
int hh = 0, mm = 0;
int n = 0;
int pot = 1;
for (int i = h.size() - 1; i >= 0; i--) {
if (h[i] <= '9')
n = h[i] - '0';
else
n = h[i] - 'A' + 10;
if (n >= a) return false;
hh += n * pot;
pot *= a;
}
pot = 1;
for (int i = m.size() - 1; i >= 0; i--) {
if (m[i] <= '9')
n = m[i] - '0';
else
n = m[i] - 'A' + 10;
if (n >= a) return false;
mm += n * pot;
pot *= a;
}
if (hh > 23 || mm > 59) return false;
return true;
}
int main() {
string cad;
cin >> cad;
int i = 0;
while (cad[i] != ':') {
h += cad[i];
i++;
}
i++;
while (i < cad.size()) {
m += cad[i];
i++;
}
int base = 2;
bool flag = false;
while (1) {
if (sirve(base)) {
resp.push_back(base);
flag = true;
} else {
if (flag) break;
}
base++;
if (base > 60) break;
}
if (!flag) {
cout << "0" << endl;
return 0;
}
if (base > 60) {
cout << "-1" << endl;
return 0;
}
for (int i = 0; i < resp.size(); i++) {
cout << resp[i] << " ";
}
cout << endl;
}
| 8 | CPP |
def f(x, k):
if 1 < k < 37: return int(x, k)
s = 0
for i in x:
s = s * k
s += int(i, 36)
return s
a, b = input().split(':')
i = j = k = max(int(max(a), 36), int(max(b), 36)) + 1
x, y = (f(a, k) == f(a, k + 1)), (f(b, k) == f(b, k + 1))
if x and y: print(-1 if a[-1] < 'O' else 0)
else:
if x: i = 61
else:
while f(a, i) < 24: i += 1
if y: j = i
else:
while j < i and f(b, j) < 60: j += 1
print(' '.join(map(str, range(k, j))) if k < j else 0)
# Made By Mostafa_Khaled | 8 | PYTHON3 |
#include <bits/stdc++.h>
int a[5], b[5];
int mu(int a, int n) {
int i, kq = 1;
for (i = 0; i < n; i++) {
kq *= a;
}
return kq;
}
int tinh(int p[], int n, int base) {
int i, sum = 0;
for (i = n - 1; i >= 0; i--) {
sum += p[i] * mu(base, n - i - 1);
}
return sum;
}
int main() {
int i, na, nb, ma = 0, mb = 0, max, check = 0;
char c;
i = 0;
while ((c = getchar()) != EOF) {
if (c >= '0' && c < '9') a[i++] = c - '0';
if (c >= 'A' && c <= 'Z') a[i++] = c - 'A' + 10;
if (a[i - 1] > ma) ma = a[i - 1];
if (c == ':') break;
}
na = i;
i = 0;
while ((c = getchar()) != EOF) {
if (c >= '0' && c < '9') b[i++] = c - '0';
if (c >= 'A' && c <= 'Z') b[i++] = c - 'A' + 10;
if (b[i - 1] > mb) mb = b[i - 1];
if (c == '\n') break;
}
nb = i;
if (ma > mb)
max = ma + 1;
else
max = mb + 1;
if (tinh(a, na, max) > 23 || tinh(b, nb, max) > 59) {
printf("0\n");
return 0;
}
for (i = 0; i < na - 1; i++)
if (a[i] != 0) check = 1;
for (i = 0; i < nb - 1; i++)
if (b[i] != 0) check = 1;
if (check == 0) {
printf("-1\n");
return 0;
}
i = max;
while (tinh(a, na, i) < 24 && tinh(b, nb, i) < 60) {
printf("%d ", i);
i++;
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
namespace patch {
template <typename T>
std::string to_string(const T& n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
} // namespace patch
using namespace std;
int main() {
map<char, long long int> mp;
for (char i = '0'; i <= '9'; i++) {
mp[i] = (i - '0');
}
for (int i = 'A', j = 10; i <= 'Z'; i++, j++) {
mp[i] = j;
}
string S, a, b;
long long int mx = 0;
cin >> S;
bool flag = false, c = false;
for (int i = 0; i < S.size(); i++) {
if (S[i] == ':') {
c = true;
flag = false;
continue;
}
if (S[i] != '0') {
flag = true;
}
if (flag) {
if (!c) {
a += S[i];
} else {
b += S[i];
}
}
mx = max(mx, mp[S[i]]);
}
if (a.size() == 0) {
a = "0";
}
if (b.size() == 0) {
b = "0";
}
mx++;
if (a.size() == 1 && b.size() == 1) {
if (mp[a[0]] >= 24) {
cout << 0;
} else {
cout << -1;
}
return 0;
}
bool chk = false;
while (1) {
long long int HH, MM, w8 = 1;
HH = MM = 0;
for (int i = a.size() - 1; i >= 0; i--) {
HH += mp[a[i]] * w8;
w8 *= mx;
}
w8 = 1;
for (int i = b.size() - 1; i >= 0; i--) {
MM += mp[b[i]] * w8;
w8 *= mx;
}
if (HH < 24 && MM < 60) {
cout << mx << " ";
chk = true;
} else {
break;
}
mx++;
}
if (!chk) {
cout << 0;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int num(char s) {
if (s >= '0' && s <= '9')
return s - '0';
else
return s - 'A' + 10;
}
int main() {
string input, h, m;
vector<int> result;
int i, hrs, mts, j;
cin >> input;
int max = -1;
for (i = 0; i < input.size(); i++)
if (input[i] == ':') {
h = input.substr(0, i);
m = input.substr(i + 1);
} else if (num(input[i]) > max)
max = num(input[i]);
int k = 0;
for (i = max + 1; i < 60; i++) {
hrs = 0;
mts = 0;
for (j = 0; j < h.length(); j++) hrs = hrs * i + num(h[j]);
for (j = 0; j < m.length(); j++) mts = mts * i + num(m[j]);
if (hrs < 24 && hrs >= 0 && mts < 60 && mts >= 0) result.push_back(i);
}
hrs = 0;
mts = 0;
for (j = 0; j < h.length(); j++) hrs = hrs * 100 + num(h[j]);
for (j = 0; j < m.length(); j++) mts = mts * 100 + num(m[j]);
if (hrs < 24 && hrs >= 0 && mts < 60 && mts >= 0)
cout << -1;
else if (result.empty())
cout << 0;
else
for (i = 0; i < result.size(); i++) cout << result[i] << " ";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void init();
void processIn(string s);
bool ck_inf();
int calc(string s, int base);
int max_base(string s);
int power(int a, int b);
string hr, mn;
map<char, int> mp;
int main() {
string s;
cin >> s;
processIn(s);
init();
if (ck_inf()) {
cout << "-1\n";
return 0;
}
int mx1 = max(2, max_base(hr));
int mx2 = max(2, max_base(mn));
int maxx = max(mx1, mx2);
bool ans = 0;
for (int i = maxx; i < 60; i++) {
int vh, vm;
vh = calc(hr, i);
vm = calc(mn, i);
if (vh < 24 && vm < 60) {
ans = 1;
cout << i << " ";
}
}
if (!ans) cout << "0" << endl;
}
void init() {
string s = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for (int i = 0; i < 36; i++) mp[s[i]] = i;
}
void processIn(string s) {
int n = s.size();
int i = 0;
while (s[i] != ':') {
hr += s[i];
i++;
}
i++;
while (i < n) {
mn += s[i];
i++;
}
}
bool ck_inf() {
int n = hr.size();
for (int i = 0; i < n - 1; i++) {
if (hr[i] != '0') return 0;
}
if (mp[hr[n - 1]] > 23) return 0;
int m = mn.size();
for (int i = 0; i < m - 1; i++) {
if (mn[i] != '0') return 0;
}
return 1;
}
int max_base(string s) {
int n = s.size();
int mx = -1;
for (int i = 0; i < n; i++) mx = max(mx, mp[s[i]]);
return mx + 1;
}
int calc(string s, int base) {
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) ans += (mp[s[i]] * power(base, n - i - 1));
return ans;
}
int power(int a, int b) {
int ans = 1;
for (int i = 1; i <= b; i++) ans *= a;
return ans;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
map<char, int> ma;
for (int i = '0'; i <= '9'; i++) ma[i] = i - '0';
for (int i = 'A'; i <= 'Z'; i++) ma[i] = i - 'A' + 10;
char s1[10], s2[10];
scanf("%[^:]", s1);
getchar();
scanf("%s", s2);
int len1 = strlen(s1);
int len2 = strlen(s2);
int maxx = 0;
for (int i = 0; i < len1; i++) maxx = max(maxx, ma[s1[i]]);
for (int i = 0; i < len2; i++) maxx = max(maxx, ma[s2[i]]);
int ok1 = 0, ok2 = 0;
for (int i = maxx + 1; i < 65; i++) {
long long t1 = 0;
for (int j = len1 - 1, k = 0; j >= 0; j--, k++) {
t1 += (long long)(pow(i, k) + 0.00000001) * ma[s1[j]];
if (t1 >= 24) {
ok1 = i;
break;
}
}
long long t2 = 0;
for (int j = len2 - 1, k = 0; j >= 0; j--, k++) {
t2 += (long long)(pow(i, k) + 0.00000001) * ma[s2[j]];
if (t2 >= 60) {
ok2 = i;
break;
}
}
if (ok1 || ok2) break;
}
if (ok1 == 0) ok1 = 0x7fffffff;
if (ok2 == 0) ok2 = 0x7fffffff;
int temp = min(ok1, ok2);
if (temp == 0x7fffffff)
puts("-1");
else if (temp <= maxx + 1)
puts("0");
else {
for (int i = maxx + 1; i < temp; i++) {
printf("%d", i);
if (i != temp - 1) printf(" ");
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int a[5], b[5];
while (getline(cin, str)) {
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
int mid[60];
memset(mid, 0, sizeof(mid));
int len = str.length();
int m = 0, n = 0;
int i;
int flag = 0;
for (i = 0; str[i] != ':'; i++) {
if (str[i] == '0' && !flag)
continue;
else {
flag = 1;
if (str[i] >= '0' && str[i] <= '9')
a[m++] = str[i] - '0';
else
a[m++] = str[i] - 'A' + 10;
}
}
flag = 0;
i++;
for (; i < len; i++) {
if (str[i] == '0' && !flag)
continue;
else {
flag = 1;
if (str[i] >= '0' && str[i] <= '9')
b[n++] = str[i] - '0';
else
b[n++] = str[i] - 'A' + 10;
}
}
int ans;
ans = a[0];
for (i = 0; i < m; i++) {
if (a[i] > ans) ans = a[i];
}
for (i = 0; i < n; i++) {
if (b[i] > ans) ans = b[i];
}
ans += 1;
if (n == 0 && m == 0) {
cout << -1 << endl;
continue;
}
if (n == 1 && m == 0) {
cout << -1 << endl;
continue;
}
if (n == 0 && m == 1) {
if (a[0] < 24)
cout << -1 << endl;
else
cout << 0 << endl;
continue;
}
if (n == 1 && m == 1) {
if (a[0] < 24)
cout << -1 << endl;
else
cout << 0 << endl;
continue;
}
int k = 0;
int temp1, temp2, f1, f2;
f1 = f2 = 0;
temp1 = temp2 = 0;
for (int j = 0; j < m; j++) temp1 = temp1 * ans + a[j];
if (temp1 > 23) f1 = 1;
for (int j = 0; j < n; j++) temp2 = temp2 * ans + b[j];
if (temp2 > 59) f2 = 1;
if (!f1 && !f2) mid[k++] = ans;
for (i = ans + 1;; i++) {
f1 = f2 = 0;
temp1 = temp2 = 0;
for (int j = 0; j < m; j++) {
temp1 = temp1 * i + a[j];
}
if (temp1 > 23) f1 = 1;
for (int j = 0; j < n; j++) temp2 = temp2 * i + b[j];
if (temp2 > 59) f2 = 1;
if (f1 || f2) break;
mid[k++] = i;
}
cout << mid[0];
for (i = 1; i < k; i++) cout << ' ' << mid[i];
cout << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, hours, mins;
cin >> s;
int a = 1, b = 1, colon, i, radix = 0;
for (i = 0; i < s.length(); i++) {
if (s[i] == ':') {
colon = i;
break;
}
}
for (i = 0; i < colon; i++) {
if (s[i] != '0') {
break;
}
}
hours = s.substr(i, colon - i);
for (i = colon + 1; i < s.length(); i++) {
if (s[i] != '0') {
break;
}
}
mins = s.substr(i);
if (hours.length() <= 1 and mins.length() <= 1) {
hours.length() == 1 and hours[0] - 'A' + 10 >= 24 ? cout << 0 : cout << -1;
return 0;
}
for (i = 0; i < s.length(); i++) {
if (i != colon) {
int cur = s[i] >= '0' and s[i] <= '9' ? s[i] - '0' : s[i] - 'A' + 10;
radix = max(radix, cur);
}
}
radix++;
if (radix == 1) {
radix = 2;
}
for (i = radix;; i++) {
int HOURS = 0, MINS = 0;
for (int j = 0; j < hours.length(); j++) {
HOURS *= i;
HOURS += hours[j] >= '0' and hours[j] <= '9' ? hours[j] - '0'
: hours[j] - 'A' + 10;
}
for (int j = 0; j < mins.length(); j++) {
MINS *= i;
MINS += mins[j] >= '0' and mins[j] <= '9' ? mins[j] - '0'
: mins[j] - 'A' + 10;
}
if (HOURS <= 23 and MINS <= 59) {
cout << i << " ";
} else {
if (i == radix) {
cout << 0;
}
return 0;
}
}
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
long long pow(int a, int b) {
if (b == 0 || a == 1) return 1;
if (b % 2 == 0) {
long long k = pow(a, b / 2);
return (k * k);
} else {
long long k = pow(a, b / 2);
return k * k * a;
}
}
long long powmod(long long a, long long b, long long mod) {
if (b == 0 || a == 1) {
if (mod == 1)
return 0;
else
return 1;
}
if (b % 2 == 0) {
long long k = powmod(a, b / 2, mod);
return (k * k) % mod;
} else {
long long k = powmod(a, b / 2, mod);
return ((k * k) % mod * a) % mod;
}
}
long long gcd(long long a, long long b) {
if (a == 0) return b;
if (b == 0) return a;
if (a > b)
return gcd(a % b, b);
else
return gcd(b % a, a);
}
int prime(int p) {
for (int i = 2; i * i <= p; i++) {
if (p % i == 0 && i < p) return 0;
}
return 1;
}
long long sqr(long long i) { return i * i; }
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s1, s2, s;
cin >> s;
s1 = "";
s2 = "";
int qq = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] != ':' && qq == 0) s1 += s[i];
if (s[i] != ':' && qq == 1) s2 += s[i];
if (s[i] == ':') qq = 1;
}
int q = 0;
while (s1.size() != 0 && s1[0] == '0') s1.erase(0, 1);
while (s2.size() != 0 && s2[0] == '0') s2.erase(0, 1);
int max1 = 0;
for (int i = 0; i < s1.size(); i++) {
if (s1[i] >= '0' && s1[i] <= '9')
max1 = max(int(max1), s1[i] - '0');
else
max1 = max(max1, s1[i] - 'A' + 10);
}
if (max1 >= 24) {
cout << "0";
return 0;
}
for (int i = 0; i < s2.size(); i++) {
if (s2[i] >= '0' && s2[i] <= '9')
max1 = max(int(max1), s2[i] - '0');
else
max1 = max(max1, s2[i] - 'A' + 10);
}
if (s1.size() <= 1 && s2.size() <= 1) {
cout << -1;
return 0;
}
max1++;
for (int i = max1; i <= 59; i++) {
int a = 0;
int cur = 1;
for (int j = s1.size() - 1; j >= 0; j--) {
if (s1[j] >= '0' && s1[j] <= '9')
a += cur * (s1[j] - '0');
else
a += cur * (s1[j] - 'A' + 10);
cur *= i;
}
int b = 0;
cur = 1;
for (int j = s2.size() - 1; j >= 0; j--) {
if (s2[j] >= '0' && s2[j] <= '9')
b += cur * (s2[j] - '0');
else
b += cur * (s2[j] - 'A' + 10);
cur *= i;
}
if (a <= 23 && b <= 59) {
cout << i << " ";
q++;
}
}
if (q == 0) cout << "0";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
char hour[10], minu[10];
int lenh, lenm;
int ok(int h, int m, int base) {
int i;
for (i = h; i < lenh; i++) {
if ('0' <= hour[i] && hour[i] <= '9') {
if (hour[i] - '0' >= base) return 0;
} else {
if (hour[i] - 'A' + 10 >= base) return 0;
}
}
for (i = m; i < lenm; i++) {
if ('0' <= minu[i] && minu[i] <= '9') {
if (minu[i] - '0' >= base) return 0;
} else {
if (minu[i] - 'A' + 10 >= base) return 0;
}
}
return 1;
}
int to_num(int p, char* str, int base) {
int count = 0, tmp = 1, i, t, len;
len = strlen(str);
for (i = len - 1; i >= p; i--) {
if ('0' <= str[i] && str[i] <= '9')
t = str[i] - '0';
else
t = str[i] - 'A' + 10;
count += t * tmp;
tmp *= base;
}
return count;
}
void input() {
char tmp;
lenh = 0, lenm = 0;
while (1) {
scanf("%c", &tmp);
if (('0' <= tmp && tmp <= '9') || ('A' <= tmp && tmp <= 'Z'))
hour[lenh++] = tmp;
if (tmp == ':') break;
}
while (scanf("%c", &tmp) != EOF) {
if (('0' <= tmp && tmp <= '9') || ('A' <= tmp && tmp <= 'Z'))
minu[lenm++] = tmp;
if (tmp == ':') break;
}
}
int main() {
int ph, pm, base, flag;
int nh, nm, i;
input();
ph = 0;
flag = 0;
lenh = strlen(hour);
for (i = 0; i < lenh; i++)
if (hour[i] != '0') break;
ph = i;
lenm = strlen(minu);
for (i = 0; i < lenm; i++)
if (minu[i] != '0') break;
pm = i;
if (lenh - ph <= 1 && lenm - pm <= 1) {
if (hour[ph] >= 'O' && hour[ph] <= 'Z') {
printf("0\n");
return 0;
}
printf("-1\n");
return 0;
}
for (base = 2;; base++) {
if (ok(ph, pm, base)) {
nh = to_num(ph, hour, base);
nm = to_num(pm, minu, base);
if (nh < 24 && nm < 60) {
if (flag)
printf(" %d", base);
else
printf("%d", base);
flag = 1;
} else
break;
}
}
if (!flag) printf("0\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i, st = 0;
for (i = 0; i < s.length(); i++) {
if (s[i] == ':') continue;
if (s[i] >= 'A' && s[i] <= 'Z') {
st = max(st, s[i] - 'A' + 10);
} else
st = max(st, s[i] - '0');
}
for (i = 0; i < s.length(); i++)
if (s[i] == ':') break;
string h, m;
h = s.substr(0, i);
m = s.substr(i + 1, s.length() - i);
for (i = 0; i < h.length(); i++)
if (h[i] != '0') break;
h = h.substr(i, h.length() - i);
for (i = 0; i < m.length(); i++)
if (m[i] != '0') break;
m = m.substr(i, m.length() - i);
if (h.length() <= 1 && m.length() <= 1) {
if (h.length() == 1 && h[0] >= 'O')
cout << 0;
else
cout << -1;
} else {
vector<int> ans, ans1;
for (int i = st + 1; i <= 59; i++) {
int t = 0;
for (int j = 0; j < h.length(); j++) {
if (h[j] >= 'A' && h[j] <= 'Z')
t += (h[j] - 'A' + 10) * pow(i, h.length() - j - 1);
else
t += (h[j] - '0') * pow(i, h.length() - j - 1);
}
if (t <= 23) ans.push_back(i);
}
for (int i = 0; i < ans.size(); i++) {
int t = 0;
for (int j = 0; j < m.length(); j++) {
if (m[j] >= 'A' && m[j] <= 'Z')
t += (m[j] - 'A' + 10) * pow(ans[i], m.length() - j - 1);
else
t += (m[j] - '0') * pow(ans[i], m.length() - j - 1);
}
if (t <= 59) ans1.push_back(ans[i]);
}
if (ans1.size() == 0) {
cout << 0;
return 0;
}
for (i = 0; i < ans1.size(); i++) cout << ans1[i] << " ";
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char num[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int conv[128];
bool ret(char *a, int b, int lim) {
int ret = 0;
for (int i = 0; a[i]; i++) {
if (conv[a[i]] >= b) return false;
ret = ret * b + conv[a[i]];
}
return ret < lim;
}
int main() {
for (int i = 0; num[i]; i++) conv[num[i]] = i;
char a[10], b[10];
cin.getline(a, 10, ':');
cin.getline(b, 10);
if (ret(a, 60, 24) && ret(b, 60, 60)) {
printf("-1\n");
return 0;
}
int cnt = 0;
for (int i = 2; i < 60; i++) {
if (ret(a, i, 24) && ret(b, i, 60)) {
printf("%d ", i);
cnt++;
}
}
if (cnt == 0) printf("0");
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int convertStringToNumberBase(string number, int base) {
int r = 1;
int val = 0;
for (int i = number.size() - 1; i >= 0; i--) {
int charVal = number[i] - '0';
if (number[i] >= 'A') {
charVal = number[i] - 'A' + 10;
}
if (charVal >= base) return 61;
val += r * (charVal);
r *= base;
}
return val;
}
int main() {
string time;
string a, b;
cin >> time;
int delimiterPos = time.find(':');
a = time.substr(0, delimiterPos);
b = time.substr(delimiterPos + 1);
cerr << a << " " << b << endl;
bool checked = false;
vector<int> validBases;
for (int i = 2; i < 61; i++) {
int ab10 = convertStringToNumberBase(a, i);
int bB10 = convertStringToNumberBase(b, i);
if (ab10 < 24 && bB10 < 60) {
validBases.push_back(i);
}
}
int ab10 = convertStringToNumberBase(a, 61);
int bB10 = convertStringToNumberBase(b, 61);
if (ab10 < 24 && bB10 < 60) {
cout << -1 << endl;
return 0;
}
if (validBases.size() == 0) {
cout << 0 << endl;
return 0;
}
for (int j = 0; j < validBases.size(); ++j) {
cout << validBases[j] << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
char s[105];
int d[99][99], p[99], h[99], m[99];
int main() {
scanf("%s", s);
int col = 0, sl = strlen(s);
for (int i = 0; i <= sl - 1; ++i)
if (s[i] == ':') {
col = i;
break;
}
for (int i = 2; i <= 60; ++i) {
d[i][0] = 1;
for (int j = 1; j <= 5; ++j) d[i][j] = d[i][j - 1] * i;
}
int ans = 0;
for (int i = 2; i <= 60; ++i) {
int hour = 0, minute = 0;
bool foul = 0;
for (int j = 0; j <= col - 1; ++j) {
if ('0' <= s[j] && s[j] <= '9') {
if (s[j] - '0' > i - 1) {
foul = 1;
break;
} else
hour += d[i][col - 1 - j] * (s[j] - '0');
} else {
if (s[j] - 'A' + 10 > i - 1) {
foul = 1;
break;
} else
hour += d[i][col - 1 - j] * (s[j] - 'A' + 10);
}
}
if (foul) continue;
for (int j = col + 1; j <= sl - 1; ++j) {
if ('0' <= s[j] && s[j] <= '9') {
if (s[j] - '0' > i - 1) {
foul = 1;
break;
} else
minute += d[i][sl - j - 1] * (s[j] - '0');
} else {
if (s[j] - 'A' + 10 > i - 1) {
foul = 1;
break;
} else
minute += d[i][sl - j - 1] * (s[j] - 'A' + 10);
}
}
if (foul)
continue;
else if (0 <= hour && hour <= 23 && 0 <= minute && minute <= 59) {
p[++ans] = i;
h[ans] = hour;
m[ans] = minute;
if (ans > 1 && h[ans - 1] == h[ans] && m[ans - 1] == m[ans]) {
printf("-1\n");
return 0;
}
}
}
if (ans == 0)
printf("0\n");
else {
for (int i = 1; i <= ans; ++i)
if (i < ans)
printf("%d ", p[i]);
else
printf("%d\n", p[i]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const string dig = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string a, b;
bool was;
int minSys(const string &s) {
int mx = 2;
for (int i = 0; i < s.length(); i++) mx = max(mx, int(dig.find(s[i])) + 1);
return mx;
}
bool Pos(int rad) {
int sum = 0;
for (int i = 0; i < a.length() && sum < 24; i++)
sum = sum * rad + dig.find(a[i]);
if (sum >= 24) return false;
sum = 0;
for (int i = 0; i < b.length() && sum < 60; i++)
sum = sum * rad + dig.find(b[i]);
return sum < 60;
}
int main() {
getline(cin, a, ':');
getline(cin, b);
if (Pos(60))
cout << "-1\n";
else {
for (int i = max(minSys(a), minSys(b)); i < 60; i++)
if (Pos(i)) {
if (was) cout << " ";
was = true;
cout << i;
}
if (!was) cout << "0";
cout << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string a, b;
pair<int, int> converter(int k) {
int pow = 1, let;
pair<int, int> sum = {0, 0};
for (int i = a.size() - 1; i >= 0; i--) {
if (a[i] >= 'A' && a[i] <= 'Z')
let = a[i] - 'A' + 10;
else
let = a[i] - '0';
sum.first += pow * let;
pow *= k;
}
pow = 1;
for (int i = b.size() - 1; i >= 0; i--) {
if (b[i] >= 'A' && b[i] <= 'Z')
let = b[i] - 'A' + 10;
else
let = b[i] - '0';
sum.second += pow * let;
pow *= k;
}
return sum;
}
int main() {
string s;
cin >> s;
char c = '0';
bool check = false;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ':') {
check = true;
continue;
}
if (!check)
a += s[i];
else
b += s[i];
c = max(c, s[i]);
}
int k;
if (c >= 'A' && c <= 'Z')
k = c - 'A' + 11;
else
k = c - '0' + 1;
pair<int, int> test1 = converter(k), test2 = converter(k + 1);
if (test1 == test2 && test1.first < 24 && test1.second < 60) {
cout << -1;
return 0;
}
vector<int> ans;
while (test1.first < 24 && test1.second < 60) {
ans.push_back(k++);
test1 = converter(k);
}
if (!ans.size())
cout << 0;
else {
for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int64_t power(int64_t a, int64_t b) {
int64_t r = 1;
while (b--) r = r * a;
return r;
}
int main() {
ios_base::sync_with_stdio(false);
string stra, strb, str;
getline(cin, str);
int64_t i;
for (i = 0; i < str.length(); i++)
if (str[i] == ':') break;
stra = str.substr(0, i);
strb = str.substr(i + 1, str.length() - i - 1);
int64_t flag1 = 1, flag2 = 1;
for (i = 0; i < stra.length() - 1; i++)
if (stra[i] != '0') flag1 = 0;
for (i = 0; i < strb.length() - 1; i++)
if (strb[i] != '0') flag2 = 0;
if (flag1 && flag2 && stra[stra.length() - 1] <= 'N') {
cout << "-1";
return 0;
}
vector<int> vec;
int64_t min = 0;
for (i = 0; i < stra.length(); i++)
if (stra[i] > min) min = stra[i];
for (i = 0; i < strb.length(); i++)
if (strb[i] > min) min = strb[i];
if (min >= 65)
min -= 54;
else
min -= 47;
int64_t sum1, sum2, j, k;
for (i = min;; i++) {
sum1 = 0;
sum2 = 0;
for (j = stra.length() - 1, k = 0; j >= 0; j--, k++) {
if (stra[j] >= 65)
sum1 += power(i, k) * (stra[j] - 55);
else
sum1 += power(i, k) * (stra[j] - 48);
}
for (j = strb.length() - 1, k = 0; j >= 0; j--, k++) {
if (strb[j] >= 65)
sum2 += power(i, k) * (strb[j] - 55);
else
sum2 += power(i, k) * (strb[j] - 48);
}
if (sum1 <= 23 && sum2 <= 59)
cout << i << ' ';
else
break;
}
if (i == min) {
cout << '0';
return 0;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char a[22];
char b[22];
set<int> ans;
int upper[26];
int transtlate(char tar[], int i) {
int len = strlen(tar);
int temp = 1;
int res = 0;
for (int j = len - 1; j >= 0; j--) {
if (isdigit(tar[j])) {
if (tar[j] - '0' >= i) return -1;
res += (tar[j] - '0') * temp;
} else {
int x = upper[tar[j] - 'A'];
if (x >= i) return -1;
res += x * temp;
}
temp *= i;
}
return res;
}
bool check(char x[], int flag) {
int len = strlen(x);
bool zero = true;
if (len > 1)
for (int i = len - 2; i >= 0; i--)
if (x[i] != '0') {
zero = false;
break;
}
if (len == 1) {
if (isdigit(x[len - 1]))
return true;
else if (flag == 0) {
if (upper[x[len - 1] - 'A'] < 24)
return true;
else
return false;
} else
return true;
}
if (zero) {
if (isdigit(x[len - 1]))
return true;
else if (flag == 0 && upper[x[len - 1] - 'A'] < 24)
return true;
else if (flag == 1)
return true;
else
return false;
} else
return false;
}
int main() {
for (char i = 'A'; i <= 'Z'; i++) upper[i - 'A'] = i - 'A' + 10;
scanf("%s", a);
int cut;
for (int i = 0; i < strlen(a); i++)
if (a[i] == ':') {
cut = i + 1;
a[i] = '\0';
}
strcpy(b, a + cut);
if (check(a, 0) && check(b, 1)) {
cout << -1 << endl;
return 0;
}
for (int i = 2; i <= 80; i++) {
int a_10 = transtlate(a, i);
int b_10 = transtlate(b, i);
if (a_10 != -1 && b_10 != -1 && a_10 < 24 && b_10 < 60) ans.insert(i);
}
if (ans.size() == 0)
cout << 0 << endl;
else {
set<int>::iterator it = ans.begin();
for (it = ans.begin(); it != ans.end();) {
cout << *it;
it++;
if (it != ans.end())
cout << " ";
else
cout << endl;
}
}
ans.clear();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int calc(string t, int n) {
int ans;
if (t[t.length() - 1] >= 'A' && t[t.length() - 1] <= 'Z')
ans = t[t.length() - 1] - 'A' + 10;
else
ans = t[t.length() - 1] - '0';
int mul = n;
for (int i = t.length() - 2; i >= 0; i--) {
if (t[i] >= 'A' && t[i] <= 'Z')
ans += (t[i] - 'A' + 10) * mul;
else
ans += (t[i] - '0') * mul;
mul *= n;
}
return ans;
}
int main() {
string h, m, s;
cin >> s;
h = s.substr(0, s.find(":"));
m = s.substr(s.find(":") + 1, s.length() - s.find(":") - 1);
for (int i = 0; i < h.length() - 1; i++) {
if (h[i] == '0') {
h = h.substr(1, h.length() - 1);
i--;
} else
break;
}
for (int i = 0; i < m.length() - 1; i++) {
if (m[i] == '0') {
m = m.substr(1, m.length() - 1);
i--;
} else
break;
}
bool flag = true;
vector<int> v;
if (h.length() <= 1 && m.length() <= 1) {
if ((h.length() == 1 &&
((h[0] >= '0' && h[0] <= '9') || (h[0] - 'A' + 10) < 24)) &&
(m.length() == 1 &&
((m[0] >= '0' && m[0] <= '9') || (m[0] - 'A' + 10) < 60)))
flag = false;
} else {
int st = 0;
for (int i = 0; i < h.length(); i++)
if (h[i] >= 'A' && h[i] <= 'Z')
st = st > (h[i] - 'A' + 10) ? st : (h[i] - 'A' + 10);
else
st = st > (h[i] - '0') ? st : (h[i] - '0');
for (int i = 0; i < m.length(); i++)
if (m[i] >= 'A' && m[i] <= 'Z')
st = st > (m[i] - 'A' + 10) ? st : (m[i] - 'A' + 10);
else
st = st > (m[i] - '0') ? st : (m[i] - '0');
st += 1;
for (int i = st;; i++) {
if (calc(h, i) < 24 && calc(m, i) < 60)
v.push_back(i);
else
break;
}
}
if (!flag)
cout << "-1" << endl;
else {
if (v.size() == 0)
cout << "0" << endl;
else
for (int i = 0; i < v.size(); i++) printf("%d ", v[i]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int convert(string s, int b) {
int l = s.size();
int val = 0;
int mul = 1;
for (int i = l - 1; i >= 0; i--) {
if (s[i] >= 'A' && s[i] <= 'Z') {
val = val + ((int)(s[i]) - 'A' + 10) * mul;
} else
val = val + ((int)(s[i]) - '0') * mul;
mul = mul * b;
}
return val;
}
int main() {
string s;
cin >> s;
string s1 = "";
string s2 = "";
int l = s.size();
int i = 0;
int mx = -1;
while (s[i] != ':') {
if (s[i] >= 'A' && s[i] <= 'Z')
mx = max(mx, (int)(s[i]) - 'A' + 10);
else {
mx = max(mx, (int)(s[i]) - '0');
}
s1 = s1 + s[i];
i++;
}
i++;
while (i < l) {
if (s[i] >= 'A' && s[i] <= 'Z')
mx = max(mx, (int)(s[i]) - 'A' + 10);
else {
mx = max(mx, (int)(s[i]) - '0');
}
s2 = s2 + s[i];
i++;
}
vector<int> ans;
for (i = mx + 1; i <= 100000; i++) {
int val1 = convert(s1, i);
int val2 = convert(s2, i);
if (val1 >= 24 || val2 >= 60) {
int ll = ans.size();
if (ll == 0) {
cout << 0 << endl;
return 0;
} else {
for (int i = 0; i < ll; i++) cout << ans[i] << " ";
cout << endl;
return 0;
}
} else
ans.push_back(i);
}
cout << "-1" << endl;
return 0;
}
| 8 | CPP |
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
#-------------------game starts now----------------------------------------------------
a, b = input().split(':')
a = list(a)
b = list(b)
c = 10
for i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':
for j in range(len(a)):
if a[j] == i:
a[j] = c
for j in range(len(b)):
if b[j] == i:
b[j] = c
c += 1
a = list(map(int, a))
b = list(map(int, b))
ans = []
for c in range(2, 200):
x1 = 0
x2 = 0
for p in range(len(a)):
x1 += a[p] * c ** (len(a) - p - 1)
for p in range(len(b)):
x2 += b[p] * c ** (len(b) - p - 1)
if 0 <= x1 <= 23 and 0 <= x2 <= 59 and max(a) < c and max(b) < c:
ans.append(c)
if len(ans) > 100:
print(-1)
elif ans:
print(*ans)
else:
print(0) | 8 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long MAX = 1e3 + 5;
const long long MAX2 = 11;
const int MOD = 1000000000 + 7;
const long long INF = 20000;
const int nr[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int nc[] = {0, 1, 0, -1, 1, -1, 1, -1};
long long sz, ans, id[65], tmp, pos, rel[128], dg;
string s, a, b;
char c;
bool st;
int main() {
cout << fixed << setprecision(10);
for (int i = 0; i <= 9; i++) {
c = '0' + i;
rel[c] = i;
}
for (int i = 0; i <= 25; i++) {
c = 'A' + i;
rel[c] = i + 10;
}
cin >> s;
sz = s.size() - 1;
for (int i = 0; i <= sz; i++) {
if (s[i] == ':') {
pos = i + 1;
break;
}
a += s[i];
}
for (int i = pos; i <= sz; i++) b += s[i];
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
for (int i = 2; i <= 60; i++) {
st = 1;
tmp = 0;
dg = 1;
for (auto j : a) {
if (rel[j] >= i) {
st = 0;
break;
}
dg *= i;
tmp += rel[j] * dg;
}
tmp /= i;
if (tmp > 23) st = 0;
tmp = 0;
dg = 1;
for (auto j : b) {
if (rel[j] >= i) {
st = 0;
break;
}
dg *= i;
tmp += rel[j] * dg;
}
tmp /= i;
if (tmp > 59) st = 0;
id[i] = st;
}
if (id[60]) return cout << -1, 0;
for (int i = 2; i <= 60; i++) ans += id[i];
if (!ans)
cout << 0;
else {
for (int i = 2; i <= 60; i++)
if (id[i]) cout << i << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
char s[50000];
char s1[50000], s2[50000];
int d(char c) {
if (c >= '0' && c <= '9') return c - '0';
if (c >= 'a' && c <= 'z') c = c - 'a' + 'A';
return c - 'A' + 10;
}
bool judge(int base) {
int a = 0, b = 0;
for (int i = 0; i < strlen(s1); i++) {
int temp = d(s1[i]);
if (temp >= base) return false;
a = a * base + temp;
}
for (int i = 0; i < strlen(s2); i++) {
int temp = d(s2[i]);
if (temp >= base) return false;
b = b * base + temp;
}
if (a >= 0 && a < 24 && b >= 0 && b < 60) return true;
return false;
}
void creat() {
int n = strlen(s);
int top = 0;
int i;
for (i = 0; i < n; i++) {
if (s[i] == ':') break;
if (s[i] == '0' && top == 0) continue;
s1[top++] = s[i];
}
i++;
if (top == 0) s1[top++] = '0';
s1[top] = '\0';
top = 0;
for (; i < n; i++) {
if (s[i] == '0' && top == 0) continue;
s2[top++] = s[i];
}
if (top == 0) s2[top++] = '0';
s2[top] = '\0';
}
void solve() {
creat();
if (strlen(s1) == 1 && strlen(s2) == 1) {
if (d(s1[0]) < 24 && d(s1[0]) >= 0 && d(s2[0]) >= 0 && d(s2[0]) < 60)
printf("-1\n");
else
printf("0\n");
return;
}
bool first = false;
for (int i = 1; i < 60; i++) {
if (judge(i)) {
if (!first) {
first = true;
printf("%d", i);
} else
printf(" %d", i);
}
}
if (!first) printf("0");
printf("\n");
}
int main() {
while (gets(s)) {
solve();
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int ans, sum, tmp;
int MAX, MIN;
char a[20];
int b[20], nb = 0, c[20], nc = 0, d[100], nd = 0;
int main() {
scanf("%s", a);
int l = strlen(a), now = 0;
MAX = 0;
while (a[now] != ':') {
if ('0' <= a[now] && a[now] <= '9')
b[nb++] = a[now] - '0';
else
b[nb++] = a[now] - 'A' + 10;
MAX = max(MAX, b[nb - 1]);
now++;
}
now++;
while (a[now] != '\0') {
if ('0' <= a[now] && a[now] <= '9')
c[nc++] = a[now] - '0';
else
c[nc++] = a[now] - 'A' + 10;
MAX = max(MAX, c[nc - 1]);
now++;
}
MAX++;
int SUM1, SUM2, chk = 0;
for (int k = MAX; k <= 60; k++) {
SUM1 = SUM2 = 0;
for (int i = nb - 1, j = 1; i >= 0; i--, j *= k) SUM1 += (b[i] * j);
for (int i = nc - 1, j = 1; i >= 0; i--, j *= k) SUM2 += (c[i] * j);
if (SUM1 <= 23 && SUM2 <= 59) d[nd++] = k;
}
if (nd == 0)
printf("0");
else if (d[nd - 1] == 60)
printf("-1");
else
for (int i = 0; i < nd; i++) printf("%d ", d[i]);
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void checkmin(T &a, T b) {
if (a > b) a = b;
}
int to(char c) {
int res = 0;
if (c >= '0' && c <= '9')
res = c - '0';
else
res = c - 'A' + 10;
return res;
}
int convert(string s, int base) {
int res = 0;
int len = s.length();
for (int i = 0; i < len; i++) {
if (to(s[i]) >= base) return -1;
res = res * base + to(s[i]);
}
return res;
}
void solve() {
string s, a, b;
cin >> s;
int len = s.length();
for (int i = 0; i < len; i++) {
if (s[i] == ':') {
a = s.substr(0, i);
b = s.substr(i + 1);
}
}
vector<int> vb;
for (int i = 2; i <= 60; i++) {
int x = convert(a, i);
int y = convert(b, i);
if (x != -1 && y != -1) {
if (x >= 0 && x <= 23 && y >= 0 && y <= 59) vb.push_back(i);
}
}
int sz = vb.size();
if (sz == 0)
cout << sz << endl;
else if (vb[sz - 1] == 60)
cout << -1 << endl;
else {
for (int i = 0; i < sz; i++) {
cout << vb[i];
if (i < sz - 1) cout << " ";
}
cout << endl;
}
}
int main() {
solve();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string a, b, st;
int cx, dx, c[500], d[500], maxd, tmp, i;
bool f[1000];
void read_data() {
cin >> st;
for (i = 0; st[i] != ':'; i++) a = a + st[i];
for (i = i + 1; i < st.size(); i++) b = b + st[i];
}
bool can(int i) {
cx = 0;
for (int k = 0; k < a.size(); k++) {
cx = cx * i + c[k];
if (cx > 23) return false;
}
dx = 0;
for (int k = 0; k < b.size(); k++) {
dx = dx * i + d[k];
if (dx > 59) return false;
}
return true;
}
void work() {
maxd = 0;
for (i = a.size() - 1; i >= 0; i--) {
if (isalpha(a[i]))
tmp = a[i] - 'A' + 10;
else
tmp = a[i] - '0';
c[i] = tmp;
maxd = max(maxd, tmp);
}
for (i = b.size() - 1; i >= 0; i--) {
if (isalpha(b[i]))
tmp = b[i] - 'A' + 10;
else
tmp = b[i] - '0';
d[i] = tmp;
maxd = max(maxd, tmp);
}
int cnter = 0;
for (i = maxd + 1; i <= 500; i++)
if (can(i)) {
f[i] = true;
cnter++;
};
if (cnter == 0)
cout << "0" << endl;
else if (f[500] == true)
cout << "-1" << endl;
else {
for (i = 2; i <= 500; i++)
if (f[i]) cout << i << endl;
};
}
int main() {
read_data();
work();
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 8;
const int MAX_H = 24;
const int MAX_M = 60;
char s[16];
int hds[MAX_N], mds[MAX_N], bs[MAX_M];
int parse(char *(&cpt), int ds[]) {
int n = 0;
while (*cpt == ':') cpt++;
while (*cpt == '0') cpt++;
for (; *cpt && *cpt != ':'; cpt++)
ds[n++] = (*cpt >= '0' && *cpt <= '9') ? *cpt - '0' : *cpt - 'A' + 10;
return n;
}
int calc(int ds[], int n, int b) {
int sum = 0;
for (int i = 0; i < n; i++) {
if (ds[i] >= b) return -1;
sum = sum * b + ds[i];
}
return sum;
}
void printds(int ds[], int n) {
for (int i = 0; i < n; i++) {
if (i) putchar(' ');
printf("%d", ds[i]);
}
putchar('\n');
}
int main() {
scanf("%s", s);
char *cpt = s;
int hn = parse(cpt, hds);
int mn = parse(cpt, mds);
if (hn <= 1 && mn <= 1 && calc(hds, hn, MAX_M) < MAX_H &&
calc(mds, mn, MAX_M) < MAX_M) {
puts("-1");
return 0;
}
int bn = 0;
for (int b = 2; b <= MAX_M; b++) {
int h = calc(hds, hn, b);
int m = calc(mds, mn, b);
if (h < 0 || m < 0) continue;
if (h >= MAX_H || m >= MAX_M) break;
bs[bn++] = b;
}
if (bn > 0)
printds(bs, bn);
else
puts("0");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int modN = 1e9 + 7;
const double PI = 3.1415926535897932384626433832795028841;
int base[100];
void init() {
memset(base, -1, sizeof(base));
int i;
for (i = 48; i < 58; i++) base[i] = i - 47;
for (i = 65; i < 100; i++) base[i] = i - 54;
}
bool verifica(int bas, string nro) {
int i, j, hora, minu, x, pos;
string a, b;
for (i = 0; i < nro.size(); i++) {
if (nro[i] == ':') break;
}
a = nro.substr(0, i);
b = nro.substr(i + 1, nro.size() - i - 1);
pos = 0, j = 0;
for (i = a.size() - 1; i >= 0; i--) {
pos += (pow(bas, j) * (base[a[i]] - 1));
j++;
}
hora = pos;
pos = 0, j = 0;
for (i = b.size() - 1; i >= 0; i--) {
pos += (pow(bas, j) * (base[b[i]] - 1));
j++;
}
minu = pos;
return ((0 <= hora && hora <= 23) && (0 <= minu && minu <= 59));
}
int main() {
string x;
init();
while (cin >> x) {
int i;
char may = '0';
for (i = 0; i < x.size(); i++) {
if (x[i] == ':') continue;
may = max(may, x[i]);
}
vector<int> vec;
vec.clear();
bool sw = 1;
for (i = base[may]; i < 100; i++) {
if (verifica(i, x))
vec.push_back(i);
else
break;
}
if (vec.size() == 0) {
printf("0\n");
continue;
} else if (vec.back() == 99) {
printf("-1\n");
continue;
} else
for (i = 0; i < vec.size() - 1; i++) printf("%d ", vec[i]);
printf("%d\n", vec[i]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int get(char c) {
if (c <= '9' && c >= '0') return c - '0';
return c - 'A' + 10;
}
int c1 = 0, c2 = 0, M = 0;
int a[10], b[10];
bool check(int m) {
long long t = 0;
for (int i = 1; i <= c1; i++) {
t = t * m + a[i];
if (t >= 24) return false;
}
t = 0;
for (int i = 1; i <= c2; i++) {
t = t * m + b[i];
if (t >= 60) return false;
}
return true;
}
bool solve() {
int t1 = c1, t2 = c2;
for (int i = 1; i <= c1 && a[i] == 0; i++) t1--;
for (int i = 1; i <= c2 && b[i] == 0; i++) t2--;
if (t1 <= 1 && t2 <= 1) return true;
return false;
}
int main() {
string s;
int i = 0;
cin >> s;
for (i = 0; s[i] != ':'; i++) {
a[++c1] = get(s[i]);
M = max(a[c1], M);
}
for (i++; s[i] != '\0'; i++) {
b[++c2] = get(s[i]);
M = max(b[c2], M);
}
if (M == 0 || check(M + 1) && solve())
cout << -1;
else {
if (check(M + 1) == false)
cout << 0;
else {
cout << M + 1 << " ";
for (int i = M + 2;; i++)
if (check(i))
cout << i << " ";
else
break;
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int d[70], e[70];
int valid(string a, int base, int lim) {
int p = 1, x = 0;
for (int i = int(a.size()) - 1; i >= 0; i--) {
int digit = (a[i] <= '9' ? a[i] - '0' : a[i] - 'A' + 10);
if (digit >= base) return 0;
x += digit * p;
p *= base;
if (x >= lim) return 0;
}
return 1;
}
int infinity(string a, int d[], int lim) {
if (int(a.size()) == 1) {
for (int i = 1; i <= 60; i++) d[i] = valid(a, i, lim);
return valid(a, lim, lim);
} else {
for (int i = 1; i <= lim; i++) d[i] = valid(a, i, lim);
return 0;
}
}
int main() {
string a, b;
cin >> a;
for (int i = 0; i < int(a.size()); i++)
if (a[i] == ':') {
b = a.substr(i + 1, int(a.size()) - i);
a.erase(i, int(a.size()) - i + 1);
}
while (int(a.size()) > 1 && a[0] == '0') a.erase(0, 1);
while (int(b.size()) > 1 && b[0] == '0') b.erase(0, 1);
if (infinity(a, d, 24) + infinity(b, e, 60) == 2) {
puts("-1");
return 0;
}
int haveAns = 0;
for (int i = 1; i <= 60; i++)
if (d[i] && e[i]) cout << i << ' ', haveAns = 1;
if (!haveAns) puts("0");
}
| 8 | CPP |
#include <bits/stdc++.h>
char arr[12], arr1[6], arr2[6];
void getstring() {
int i = 0, j = 0, l1, l2, l, s;
l = strlen(arr);
while (arr[i] != ':') i++;
s = i;
i = 0;
while (arr[i] == '0') {
i++;
}
if (arr[i] == ':') {
strcpy(arr1, "0");
} else {
while (arr[i] != ':') {
arr1[j] = arr[i];
i++;
j++;
}
arr1[j] = '\0';
}
i = s + 1;
while (arr[i] == '0' && i < l) {
i++;
}
if (i == l) {
strcpy(arr2, "0");
} else {
j = 0;
while (i < l) {
arr2[j] = arr[i];
i++;
j++;
}
arr2[j] = '\0';
}
}
int getsum(char *arr, int Radix) {
int l = strlen(arr);
int j;
double sum;
j = 0;
sum = 0;
for (j = l - 1; j > -1; j--) {
if (isdigit(arr[j])) {
sum += (arr[j] - 48) * pow(Radix, l - 1 - j);
} else if (isalpha(arr[j])) {
sum += (arr[j] - 55) * pow(Radix, l - 1 - j);
}
}
return sum;
}
int main() {
int i, k, count, flag1, flag2, flag;
gets(arr);
i = 0;
int Radix = 0;
while (arr[i] != '\0') {
if (isdigit(arr[i])) {
if ((arr[i] - 48) > Radix) Radix = arr[i] - 48;
} else if (isalpha(arr[i])) {
if ((arr[i] - 55) > Radix) Radix = arr[i] - 55;
}
i++;
}
Radix++;
getstring();
flag = 0;
if (strlen(arr1) == 1 && strlen(arr2) == 1) {
if (isalpha(arr1[0])) {
if (((arr1[0] - 55) > 24) || (((arr1[0] - 55) == 24) && arr2[0] != '0'))
printf("0");
else
printf("-1");
} else
printf("-1");
} else {
while (1) {
flag1 = getsum(arr1, Radix);
flag2 = getsum(arr2, Radix);
if (((flag1 <= 23) && (flag2 < 60))) {
flag = 1;
printf("%d ", Radix);
Radix++;
} else
break;
}
if (flag == 0) printf("0");
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T a) {
return (a) * (a);
}
template <class T>
T abs(T a) {
return (a < 0) ? -(a) : (a);
}
const double Pi = acos(-1.0);
const double eps = 1e-20;
const int INF = 101e7;
const double phi = 0.5 + sqrt(5.0) / 2;
int digit(char a) {
return (a - 48) * (a >= '0' && a <= '9') +
(a - 65 + 10) * (a >= 'A' && a <= 'Z');
}
int power(int a, int n) {
int ret = 1;
for (int i = 0, _n = (n)-1; i <= _n; ++i) ret *= a;
return ret;
}
int num(string s, int p) {
int ret = 0;
for (int i = 0, _n = (s.size()) - 1; i <= _n; ++i)
ret += power(p, s.size() - i - 1) * digit(s[i]);
return ret;
}
int nd(string s) {
int i = -1;
for (int j = (s.size()) - 1; j >= 0; --j)
if (s[j] != '0') i = j;
return i;
}
int main() {
char ftp[210];
scanf("%s", &ftp);
string str = string(ftp);
string s = str.substr(0, str.find(':'));
string g = str.substr(str.find(':') + 1, str.size() - str.find(':'));
int p = 0;
for (int i = 0, _n = (s.size()) - 1; i <= _n; ++i) p = max(digit(s[i]), p);
for (int i = 0, _n = (g.size()) - 1; i <= _n; ++i) p = max(digit(g[i]), p);
if (p == 0) {
printf("-1");
return 0;
}
p += 1;
if (num(s, p) >= 24 || num(g, p) >= 60) {
printf("0");
return 0;
}
if (nd(s) == s.size() - 1 && nd(g) == g.size() - 1 ||
(nd(s) == -1 && nd(g) == g.size() - 1) ||
(nd(s) == s.size() - 1 && nd(g) == -1)) {
printf("-1");
return 0;
}
int ans = 0;
while (num(s, p) < 24 && num(g, p) < 60) {
if (ans) printf(" ");
printf("%d", p);
ans++;
p++;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int x[256];
char a[10], b[10], tem[20];
int flag = 0;
bool check(int k) {
for (int i = 0; i < strlen(tem); i++)
if (tem[i] != ':' && k <= x[tem[i]]) return false;
int ia = 0, ib = 0, ab = 1, bb = 1;
int j = 0;
while (x[a[j]] == 0 && j < strlen(a)) j++;
for (int i = strlen(a) - 1; i >= j; i--) {
ia += ab * x[a[i]];
ab *= k;
}
if (ia > 23) return false;
j = 0;
while (x[b[j]] == 0 && j < strlen(b)) j++;
for (int i = strlen(b) - 1; i >= j; i--) {
ib += bb * x[b[i]];
bb *= k;
}
if (ib > 59) return false;
return true;
}
bool check2() {
int j = 0;
while (x[a[j]] == 0 && j < strlen(a)) j++;
int i = 0;
while (x[b[i]] == 0 && i < strlen(b)) i++;
if (j >= strlen(a) - 1 && i >= strlen(b) - 1 && x[a[j]] < 24)
return true;
else
return false;
}
int main() {
for (int i = 0; i < 10; i++) x['0' + i] = i;
for (int i = 10; i < 36; i++) x['A' + i - 10] = i;
scanf("%s", tem);
int ii;
for (ii = 0; ii < strlen(tem); ii++) {
if (tem[ii] != ':')
a[ii] = tem[ii];
else
break;
}
for (int i = ii + 1; i < strlen(tem); i++) b[i - ii - 1] = tem[i];
if (check2()) flag = 2;
for (int i = 2; i < 70 && flag != 2; i++) {
if (check(i)) {
if (flag == 0)
printf("%d", i);
else
printf(" %d", i);
flag = 1;
}
}
switch (flag) {
case 1:
printf("\n");
break;
case 2:
printf("-1\n");
break;
case 0:
printf("0\n");
break;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 50;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
string s;
int a[10], b[10];
int maxa, maxb;
bool check(int id) {
int num1 = 0, num2 = 0;
for (int i = 0; i < maxa; i++) {
if (a[i] >= id) return 0;
num1 = num1 * id + a[i];
}
for (int i = 0; i < maxb; i++) {
if (b[i] >= id) return 0;
num2 = num2 * id + b[i];
}
return num1 <= 23 && num2 <= 59;
}
int main() {
cin >> s;
int i = 0;
i = 0;
int flag = 0;
for (int j = 0; s[j]; j++) {
if (s[j] == ':') {
flag = 1;
maxa = i;
i = 0;
continue;
}
if (isdigit(s[j])) {
if (flag)
b[i++] = s[j] - '0';
else
a[i++] = s[j] - '0';
} else {
if (flag)
b[i++] = s[j] - 'A' + 10;
else
a[i++] = s[j] - 'A' + 10;
}
}
maxb = i;
flag = 0;
if (check(61)) {
cout << "-1\n";
return 0;
}
for (int i = 2; i <= 60; i++) {
if (check(i)) {
if (flag) printf(" ");
printf("%d", i);
flag = 1;
}
}
if (!flag) cout << 0;
puts("");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
map<char, int> mp;
vector<int> ans;
int power(int n, int i) {
if (i == 0) return 1;
if (i % 2 == 0) return power(n, i / 2) * power(n, i / 2);
return n * power(n, i / 2) * power(n, i / 2);
}
void solve(string x, string y, int n) {
int sumx = 0;
int sumy = 0;
reverse(x.begin(), x.end());
reverse(y.begin(), y.end());
for (int i = 0; i < x.length(); i++) {
sumx = sumx + (mp[x[i]]) * (power(n, i));
}
for (int i = 0; i < y.length(); i++) {
sumy = sumy + (mp[y[i]]) * (power(n, i));
}
if (sumx >= 0 && sumx <= 23 && sumy >= 0 && sumy <= 59) ans.push_back(n);
}
int main() {
string s, x, y;
cin >> s;
x = s.substr(0, s.find(':'));
y = s.substr(s.find(':') + 1, s.length() - 1);
char a = 'A';
int maxx = 0;
for (int i = 10; i <= 35; i++) {
mp[a] = i;
a++;
}
a = '0';
for (int i = 0; i < 10; i++) {
mp[a] = i;
a++;
}
for (int i = 0; i < x.length(); i++) {
if (mp[x[i]] > maxx) maxx = mp[x[i]];
}
for (int i = 0; i < y.length(); i++) {
if (mp[y[i]] > maxx) maxx = mp[y[i]];
}
for (int i = maxx + 1; i < 150; i++) {
solve(x, y, i);
}
if (ans.size() > 60) return cout << -1, 0;
if (ans.size() == 0) return cout << 0, 0;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char buf[1024];
vector<int> viHour, viMin;
void parse() {
vector<int>* viTarget = &viHour;
char* pc = buf;
while (*pc) {
char c = *pc;
if (c == ':') {
viTarget = &viMin;
} else if (c == '0' && (viTarget->empty())) {
} else if (c >= '0' && c <= '9') {
viTarget->push_back(c - '0');
} else if (c >= 'A' && c <= 'Z') {
viTarget->push_back(c - 'A' + 10);
} else {
assert(false);
}
++pc;
}
if (viHour.empty()) viHour.push_back(0);
if (viMin.empty()) viMin.push_back(0);
}
void calc(vector<int>& vi, int& mini, int& maxi, int limit) {
mini = 0;
for (int i = int(0); i < int(vi.size()); ++i) {
int v = vi[i];
mini = max(mini, v + 1);
}
if (vi.size() <= 1) {
maxi = 0x7fffff;
return;
}
for (maxi = mini;; ++maxi) {
int val = 0;
for (int i = int(0); i < int(vi.size()); ++i) {
val *= maxi;
val += vi[i];
}
if (val >= limit) break;
}
--maxi;
}
int main() {
cin >> buf;
parse();
if (0) {
for (int i = int(0); i < int(viHour.size()); ++i) printf("%2d", viHour[i]);
printf("\n##\n");
for (int i = int(0); i < int(viMin.size()); ++i) printf("%2d", viMin[i]);
printf("\n");
}
if (viHour.size() <= 1 && viMin.size() <= 1) {
if (viHour[0] >= 24) {
cout << "0" << endl;
} else {
cout << "-1" << endl;
}
return 0;
}
int hMini, hMaxi, mMini, mMaxi;
calc(viHour, hMini, hMaxi, 24);
calc(viMin, mMini, mMaxi, 60);
vector<int> answers;
for (int i = max(hMini, mMini); i <= min(hMaxi, mMaxi); ++i) {
answers.push_back(i);
}
if (answers.empty()) {
cout << "0\n";
} else {
for (int i = int(0); i < int(answers.size()); ++i) {
cout << answers[i] << endl;
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int main() {
char a[10] = {0};
char b[10] = {0};
char bb = 1;
int hj = 0;
scanf("%c", &bb);
do {
a[hj] = bb;
hj++;
scanf("%c", &bb);
} while (bb != ':');
a[hj] = 0;
scanf("%s", &b);
int begA = -1;
int begB = -1;
for (int i = 0; a[i] && a[i] == '0'; i++) begA++;
for (int i = 0; b[i] && b[i] == '0'; i++) begB++;
int la = strlen(a);
int lb = strlen(b);
char v[37] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int ma = -1;
int mb = -1;
if ((begA >= (la - 2)) && (begB >= (lb - 2))) {
if (a[la - 1] <= 'O') {
printf("-1");
return 0;
}
}
for (int i = 0; a[i]; i++) {
for (int j = 0; v[j]; j++) {
if (v[j] == a[i]) ma = max(ma, j);
}
}
for (int i = 0; b[i]; i++) {
for (int j = 0; v[j]; j++) {
if (v[j] == b[i]) mb = max(mb, j);
}
}
int beg = max(ma, mb) + 1;
bool f = false;
for (int i = beg; true; i++) {
int ca = 0;
int cb = 0;
int p = 0;
for (int j = la - 1; j > begA; j--) {
int mest = 0;
for (int k = 0; v[k]; k++) {
if (v[k] == a[j]) {
mest = k;
break;
}
}
int buf = (int)pow((double)i, (double)p) * mest;
ca += buf;
p++;
}
p = 0;
for (int j = lb - 1; j > begB; j--) {
int mest = 0;
for (int k = 0; v[k]; k++) {
if (v[k] == b[j]) {
mest = k;
break;
}
}
int buf = (int)pow((double)i, (double)p) * mest;
cb += buf;
p++;
}
if ((ca > 23) || (cb > 59)) break;
f = true;
printf("%d ", i);
}
if (!f) printf("0");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int deg[160];
vector<int> vec;
string s1, s2;
int mn = 0;
bool isNum(char t) { return (t - '0' >= 0 && t - '0' <= 9); }
bool isAlpha(char t) { return (t >= 'A' && t <= 'Z'); }
int cevir(int a) {
int k = 0;
while (a) {
k = (10 * k) + a % 10;
a /= 10;
}
return k;
}
void read() {
for (int i = '0'; i <= '9'; i++) deg[i] = i - '0';
for (int i = 'A'; i <= 'Z'; i++) deg[i] = i - 55;
string s3;
cin >> s3;
bool k = 0;
for (int i = 0; i < s3.size(); i++) {
mn = max(mn, deg[s3[i]]);
if (!k) {
if (s3[i] == ':')
k = 1;
else
s1 += s3[i];
} else if (k) {
s2 += s3[i];
}
}
mn++;
}
bool knt() {
int k = 1;
int tp1 = 0, tp2 = 0;
for (int i = s1.size() - 1; i >= 0; i--) {
tp1 += k * deg[s1[i]];
k *= mn;
}
k = 1;
for (int i = s2.size() - 1; i >= 0; i--) {
tp2 += k * deg[s2[i]];
k *= mn;
}
if (tp1 >= 24 || tp2 >= 60) return 0;
return 1;
}
int main() {
read();
while (knt()) {
vec.push_back(mn);
mn++;
if (mn > 100) {
cout << -1 << endl;
return 0;
}
}
if (vec.size() == 0) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < vec.size(); i++) cout << vec[i] << " ";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
int main() {
char s[20];
bool jizz = false;
int value1[61] = {0}, value2[61] = {0}, k, max = 0;
int m, n, a, b;
scanf("%s", &s);
for (m = 0; m < strlen(s); m++) {
if (s[m] == ':') break;
for (a = 2; a < 61; a++) {
if (s[m] <= 'Z' && s[m] >= 'A')
k = s[m] - 'A' + 10;
else
k = s[m] - '0';
if (k > max) max = k;
value1[a] = value1[a] * a + k;
}
}
for (n = m + 1; n < strlen(s); n++) {
for (a = 2; a < 61; a++) {
if (s[n] <= 'Z' && s[n] >= 'A')
k = s[n] - 'A' + 10;
else
k = s[n] - '0';
if (k > max) max = k;
value2[a] = value2[a] * a + k;
}
}
if (value1[60] <= 23 && value2[60] <= 59)
printf("-1\n");
else {
for (a = max + 1; a < 60; a++) {
if (value1[a] <= 23 && value2[a] <= 59) {
jizz = true;
break;
}
}
if (jizz == false) printf("0\n");
for (a = max + 1; a < 60; a++) {
if (value1[a] <= 23 && value2[a] <= 59) {
printf("%d ", a);
}
}
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
getline(cin, a, ':');
getline(cin, b);
int max1 = -1;
for (int i = 0; i < a.length(); i++)
if (a[i] >= 'A') {
if (a[i] - 'A' + 10 > max1) max1 = a[i] - 'A' + 10;
} else if (a[i] - '0' > max1)
max1 = a[i] - '0';
int r1 = 0;
while (r1 < a.length() && a[r1] == '0') r1++;
int r2 = 0;
while (r2 < b.length() && b[r2] == '0') r2++;
if (((r1 == a.length() - 1 && a[r1] <= 'N') || r1 > a.length() - 1) &&
r2 >= b.length() - 1) {
cout << "-1";
return 0;
} else if (r1 >= a.length() - 1 && r2 >= b.length() - 1) {
cout << '0';
return 0;
}
for (int i = 0; i < b.length(); i++)
if (b[i] >= 'A') {
if (b[i] - 'A' + 10 > max1) max1 = b[i] - 'A' + 10;
} else if (b[i] - '0' > max1)
max1 = b[i] - '0';
vector<int> c;
for (int i = max1 + 1; i <= 1000; i++) {
int p = 1;
int s = 0;
for (int j = a.length() - 1; j >= 0; j--) {
if (a[j] >= 'A')
s += (a[j] - 'A' + 10) * p;
else
s += (a[j] - '0') * p;
p *= i;
}
p = 1;
int s1 = 0;
for (int j = b.length() - 1; j >= 0; j--) {
if (b[j] >= 'A')
s1 += (b[j] - 'A' + 10) * p;
else
s1 += (b[j] - '0') * p;
p *= i;
}
if (s < 24 && s >= 0 && s1 < 60 && s1 >= 0)
c.push_back(i);
else
break;
}
if (c.size() == 0)
cout << '0';
else
for (int i = 0; i < c.size(); i++) cout << c[i] << ' ';
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long pw(long long a, long long b) {
long long r = 1;
while (b > 0) {
if (b & 1) {
r = (r * a) % MOD;
}
b = b >> 1;
a = (a * a) % MOD;
}
return r;
}
int main() {
string in, h = "", m = "";
int mx = 0;
cin >> in;
int f = 0;
for (int i = 0; i < in.length(); i++) {
if (in[i] == ':') {
f = 1;
continue;
}
if (in[i] >= '0' && in[i] <= '9')
in[i] -= '0';
else
in[i] = in[i] - 'A' + 10;
if (!f)
h += in[i];
else
m += in[i];
mx = max(mx, (int)in[i]);
}
f = 0;
int ph, ch, pm, cm;
vector<int> ans;
int i = mx;
while (1) {
i++;
ch = 0;
cm = 0;
int base = 1;
for (int j = h.length() - 1; j > -1; j--) {
ch += (base * h[j]);
base *= i;
}
base = 1;
for (int j = m.length() - 1; j > -1; j--) {
cm += (base * m[j]);
base *= i;
}
if (ch < 24 && cm < 60) {
if (i == mx + 1)
ph = ch, pm = cm;
else if (ph == ch && pm == cm) {
f = -1;
break;
}
ans.push_back(i);
} else
break;
}
if (f == -1)
printf("%d", f), printf("\n");
else if (!ans.size())
printf("%d", 0), printf("\n");
else {
for (int j = 0; j < ans.size(); j++) {
printf("%d ", ans[j]);
}
printf("\n");
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char str[20];
int la, lb, a[8], b[8], v[100], c[200], z;
int minr = 1;
int main() {
for (int i = '0'; i <= '9'; i++) c[i] = i - '0';
for (int i = 'A'; i <= 'Z'; i++) c[i] = i - 'A' + 10;
scanf("%s", str + 1);
for (int i = 1; str[i]; i++) {
if (str[i] != ':') {
a[++la] = c[str[i]];
minr = max(a[la], minr);
} else if (str[i] == ':') {
int j = 0;
for (int j = i + 1; str[j]; j++)
b[++lb] = c[str[j]], minr = max(minr, b[lb]);
break;
}
}
for (int i = minr + 1; i <= 70; i++) {
int t1 = 0, t2 = 0;
for (int j = la, k = 1; j; j--, k *= i) t1 += a[j] * k;
for (int j = lb, k = 1; j; j--, k *= i) t2 += b[j] * k;
if (0 <= t1 && t1 <= 23 && 0 <= t2 && t2 <= 59) v[i] = 1;
}
for (int i = 1; i <= 70; i++)
if (v[i]) z++;
if (z == 70 - minr)
cout << -1;
else if (!z)
cout << 0;
else
for (int i = 1; i <= 59; i++)
if (v[i]) cout << i << ' ';
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
int toint(char c) {
if (c <= '9') return c - '0';
return c - 'A' + 10;
}
long long conv(string s, int b) {
long long ret = 0;
for (int i = 0; i < (int)s.length(); ++i) {
if (toint(s[i]) >= b) return INF;
ret = ret * b + toint(s[i]);
}
return ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s, m = "", h = "";
cin >> s;
for (int i = 0; i < (int)s.length(); ++i) {
if (s[i] == ':') {
for (int j = 0; j < i; ++j) h += s[j];
for (int k = i + 1; k < (int)s.length(); ++k) m += s[k];
}
}
vector<int> v;
for (int i = 2; i <= 100; ++i) {
if (conv(h, i) < 24 and conv(m, i) < 60) v.push_back(i);
}
if (!v.size())
cout << "0";
else if (v.back() == 100)
cout << "-1";
else
for (auto it : v) cout << it << " ";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string h, m;
int tem, i, w;
bool check(int oo) {
int i;
long long temm = 0;
long long temh = 0;
for (i = 0; i < h.size(); ++i) {
if (h[i] >= 'A' && h[i] <= 'Z') {
temh = temh * oo + h[i] - 'A' + 10;
} else {
temh = temh * oo + h[i] - '0';
}
}
for (i = 0; i < m.size(); ++i) {
if (m[i] >= 'A') {
temm = temm * oo + m[i] - 'A' + 10;
} else {
temm = temm * oo + m[i] - '0';
}
}
return (temh < 24 && temm < 60);
}
int main() {
cin >> h;
tem = h.find(':');
m = h.substr(tem + 1);
h = h.substr(0, tem);
if (check(10000)) {
printf("-1");
return 0;
}
w = 0;
for (i = 0; i < h.size(); ++i) {
if (h[i] >= 'A') {
w = max(w, h[i] - 'A' + 11);
} else {
w = max(w, h[i] - '0' + 1);
}
}
for (i = 0; i < m.size(); ++i) {
if (m[i] >= 'A') {
w = max(w, m[i] - 'A' + 11);
} else {
w = max(w, m[i] - '0' + 1);
}
}
if (check(w)) {
printf("%d", w);
} else {
printf("0");
return 0;
}
while (1) {
if (check(++w)) {
printf(" %d", w);
} else {
return 0;
}
}
return 0;
}
| 8 | CPP |
def f(x, k):
if 1 < k < 37: return int(x, k)
s = 0
for i in x:
s = s * k
s += int(i, 36)
return s
a, b = input().split(':')
i = j = k = max(int(max(a), 36), int(max(b), 36)) + 1
x, y = (f(a, k) == f(a, k + 1)), (f(b, k) == f(b, k + 1))
if x and y: print(-1 if a[-1] < 'O' else 0)
else:
if x: i = 61
else:
while f(a, i) < 24: i += 1
if y: j = i
else:
while j < i and f(b, j) < 60: j += 1
print(' '.join(map(str, range(k, j))) if k < j else 0)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string s, a, b;
int n, m, A[9], B[9];
bool check(int v) {
int s = 0, second = 0, t = 1;
for (int i = n - 1; i >= 0; i--) {
s += A[i] * t;
t *= v;
if (A[i] >= v) return 0;
}
t = 1;
for (int i = m - 1; i >= 0; i--) {
second += B[i] * t;
t *= v;
if (B[i] >= v) return 0;
}
if (s < 24 && second < 60) return 1;
return 0;
}
bool ok;
int main() {
ios::sync_with_stdio(0);
cin >> s;
for (int i = 0; i < s.size();) {
while (s[i] != ':') a += s[i++];
i++;
for (int j = i; j < s.size(); j++) b += s[j];
break;
}
n = a.size();
m = b.size();
for (int i = 0; i < n; i++) {
if (a[i] >= '0' && a[i] <= '9')
A[i] = a[i] - '0';
else
A[i] = a[i] - 'A' + 10;
if (i < n - 1 && A[i]) ok = 1;
}
for (int i = 0; i < m; i++) {
if (b[i] >= '0' && b[i] <= '9')
B[i] = b[i] - '0';
else
B[i] = b[i] - 'A' + 10;
if (i < m - 1 && B[i]) ok = 1;
}
if (!ok && A[n - 1] < 24) {
cout << "-1";
return 0;
}
ok = 0;
for (int i = 2; i < 60; i++)
if (check(i)) cout << i << " ", ok = 1;
if (!ok) cout << "0";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int value(char x) {
if (isdigit(x)) return x - '0';
return (x - 'A') + 10;
}
long long shifting(string x, int b) {
long long sum = 0, temp = 1;
for (int i = x.size() - 1; i >= 0; i--) {
sum += temp * value(x[i]);
temp *= b;
}
return sum;
}
int main() {
ios_base::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
;
string h, m;
cin >> h;
m = h.substr(h.find(":") + 1);
h = h.substr(0, h.find(":"));
while (h.size() > 1 and h[0] == '0') h.erase(0, 1);
while (m.size() > 1 and m[0] == '0') m.erase(0, 1);
if (h.size() == 1 and m.size() == 1 and value(h[0]) < 24 and value(m[0]) < 60)
return cout << -1, 0;
int maxb = 0;
for (int i = h.size() - 1; i >= 0; i--) maxb = max(maxb, value(h[i]));
for (int i = m.size() - 1; i >= 0; i--) maxb = max(maxb, value(m[i]));
bool is = 0;
for (int i = maxb + 1; i < 61; i++) {
long long hh, mm;
hh = shifting(h, i);
mm = shifting(m, i);
if (hh < 24 and mm < 60) is = 1, cout << i << " ";
}
if (!is) cout << 0;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
std::vector<std::vector<std::vector<T>>> make_3d_vector(long long z,
long long y,
long long x,
T value = T{}) {
return std::vector<std::vector<std::vector<T>>>(
z, std::vector<std::vector<T>>(y, std::vector<T>(x, value)));
}
template <typename T>
std::vector<std::vector<T>> make_2d_vector(long long z, long long y,
T value = T{}) {
return std::vector<std::vector<T>>(z, std::vector<T>(y, value));
}
template <typename T>
std::vector<T> make_1d_vector(long long z, T value = T{}) {
return std::vector<T>(z, value);
}
long long value(char last_char) {
if (last_char >= '0' && last_char <= '9')
return last_char - '0';
else
return last_char - 'A' + 10;
}
long long power(long long a, long long b) {
if (b == 0) return 1;
if (b == 1) return a;
if (b % 2 == 1) return (power(a, b - 1) * a);
long long q = power(a, b / 2);
return (q * q);
}
bool convert(long long n, string s1, string s2) {
long long sum = 0;
for (long long i = 0; i < s1.size(); i++) {
long long x = value(s1[i]);
sum += (power(n, i) * x);
}
if (sum >= 24) {
return false;
}
sum = 0;
for (long long i = 0; i < s2.size(); i++) {
long long x = value(s2[i]);
sum += pow(n, i) * x;
}
return sum <= 59;
}
void solve() {
string s;
cin >> s;
string s1 = "", s2 = "";
bool found = false;
long long mx = 1;
for (long long i = 0; i < s.size(); i++) {
if (s[i] != ':') {
mx = max(value(s[i]), mx);
}
}
for (auto i : s) {
if (i == ':') {
found = true;
} else if (found) {
s2.push_back(i);
} else {
s1.push_back(i);
}
}
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
long long ct = 0;
while (s1.size() != 1 && s1[s1.size() - 1] == '0') {
s1.pop_back();
}
while (s2.size() != 1 && s2[s2.size() - 1] == '0') {
s2.pop_back();
}
if (s1.size() == 1 && s2.size() == 1) {
if (s1[0] < 'P') {
cout << -1;
return;
}
}
for (long long i = mx + 1; i <= 59; i++) {
if (convert(i, s1, s2)) {
cout << i << " ";
ct++;
}
}
if (!ct) {
cout << 0;
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 1, -1, 0};
int dy[] = {1, 0, 0, -1};
long double PI = 3.14159265358979323846264338327950;
long long pw(long long b, long long p) {
if (!p) return 1;
long long sq = pw(b, p / 2);
sq *= sq;
if (p % 2) sq *= b;
return sq;
}
const int N = 1e5, M = (N << 1);
int convert(char c) {
if (isdigit(c)) return c - '0';
return c - 'A' + 10;
}
int solve(string s, int x) {
int res = 0;
for (int i = 0; i < (int)s.size(); i++) {
res += convert(s[i]) * pw(x, i);
}
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string s, h, m;
cin >> s;
h = s.substr(0, s.find(":"));
m = s.substr(s.find(":") + 1);
reverse(h.begin(), h.end()), reverse(m.begin(), m.end());
int mx = 0;
bool sd1 = 1, sd2 = 1, found = 0;
for (int i = 0; i < (int)h.size(); i++) {
mx = max(mx, convert(h[i]) + 1);
if (i && h[i] != '0') sd1 = 0;
}
for (int i = 0; i < (int)m.size(); i++) {
mx = max(mx, convert(m[i]) + 1);
if (i && m[i] != '0') sd2 = 0;
}
if (sd1 && sd2 && solve(h, mx) < 24 && solve(m, mx) < 60) {
cout << -1;
return 0;
}
for (int i = mx; i <= 60; i++) {
if (solve(h, i) < 24 && solve(m, i) < 60) {
cout << i << " ";
found = 1;
}
}
if (!found) cout << 0;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int conv(deque<int> seq, int base) {
int prod = 1;
int ans = 0;
while (!seq.empty()) {
ans += seq.back() * prod;
prod *= base;
seq.pop_back();
}
return ans;
}
int main() {
ios ::sync_with_stdio(false);
string str;
cin >> str;
bool flag = 0;
deque<int> hr, min;
int digit = 0, st = 1;
for (int i = 0; i < str.length(); i++) {
char d = str[i];
if (d == ':') {
flag = true;
continue;
}
if ('0' <= d && d <= '9')
digit = d - '0';
else if ('A' <= d && d <= 'Z')
digit = d - 'A' + 10;
if (!flag)
hr.push_back(digit);
else
min.push_back(digit);
st = max(st, digit);
}
int a = 0, b = 0;
for (int i = st + 1; i <= 60; i++) {
if (conv(hr, i) < 24 && conv(min, i) < 60) b = i;
if (a == 0 && b != 0) a = b;
}
if (a == 0)
cout << "0";
else if (conv(hr, st) == conv(hr, st + 1) &&
conv(min, st) == conv(min, st + 1))
cout << "-1";
else
for (int i = a; i <= b; i++) cout << i << " ";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
int k, l;
int A[10], B[10];
char c[30];
bool C[1111], D[1111];
int calc(int a[], int t) {
int ret = 0;
for (int i = 0; i < k; i++) {
ret *= t;
ret += a[i];
}
return ret;
}
int calc1(int a[], int t) {
int ret = 0;
for (int i = 0; i < l - k - 1; i++) {
ret *= t;
ret += a[i];
}
return ret;
}
int main(int argc, char *argv[]) {
scanf("%s", c);
l = strlen(c);
int t = 0;
for (int i = 0; i < l; i++) {
if (c[i] >= 'A' && c[i] <= 'Z') {
t = max(t, c[i] - 'A' + 11);
}
if (c[i] >= '0' && c[i] <= '9') {
t = max(t, 1 + c[i] - '0');
}
}
for (int i = 0; i < l; i++) {
if (c[i] >= 'A' && c[i] <= 'Z') {
A[i] = 10 + c[i] - 'A';
}
if (c[i] >= '0' && c[i] <= '9') {
A[i] = c[i] - '0';
}
if (c[i] == ':') {
k = i;
break;
}
}
for (int i = k + 1; i < l; i++) {
if (c[i] >= 'A' && c[i] <= 'Z') {
B[i - k - 1] = 10 + c[i] - 'A';
}
if (c[i] >= '0' && c[i] <= '9') {
B[i - k - 1] = c[i] - '0';
}
}
for (int i = t; i <= 1000; i++) {
int x = calc(A, i);
if (x > 23) {
break;
}
C[i] = 1;
}
for (int i = t; i <= 1000; i++) {
int x = calc1(B, i);
if (x > 59) {
break;
}
D[i] = 1;
}
int x = -1, y = -1;
if (C[t] && D[t]) {
x = t;
}
if (x == -1) {
printf("0\n");
} else {
for (int i = t; C[i] && D[i]; i++) {
y = i;
}
if (y == 1000) {
printf("-1\n");
return 0;
}
for (int i = x; i <= y; i++) {
printf("%d", i);
if (i == y) {
printf("\n");
} else {
printf(" ");
}
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int oo = (int)1e9;
char r1[6], r2[6];
int pwr(int n, int b) {
long long res = 1;
for (int i = 1; i <= b; ++i) res *= n;
return res;
}
int main() {
string a, b;
scanf(" %[^:]:%s", r1, r2);
a = r1, b = r2;
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
vector<int> res;
for (int i = 60; i >= 2; --i) {
long long h = 0, m = 0;
for (int j = 0; j < (int)a.size(); ++j) {
int f = 0;
if (a[j] >= 'A' && a[j] <= 'Z')
f = (a[j] - 'A') + 10;
else
f = (a[j] - '0');
if (f >= i) {
h = 100, m = 100;
goto next;
}
h += 1ll * pwr(i, j) * f;
}
for (int j = 0; j < (int)b.size(); ++j) {
int f = 0;
if (b[j] >= 'A' && b[j] <= 'Z')
f = (b[j] - 'A') + 10;
else
f = (b[j] - '0');
if (f >= i) {
h = 100, m = 100;
goto next;
}
m += 1ll * pwr(i, j) * f;
}
next:
if (h > 23 || m > 59) continue;
if (i == 60) {
puts("-1");
return 0;
}
res.push_back(i);
}
if (!res.size())
puts("0");
else {
for (int i = res.size() - 1; i >= 0; --i) printf("%d ", res[i]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int f(string s, int b) {
int res = 0, x, p = 1;
reverse(s.begin(), s.end());
for (int i = 0; i < s.size(); i++) {
x = s[i] - '0';
if (s[i] >= 'A') x = s[i] - 'A' + 10;
if (x) res += p * x;
if (res > 60) return 61;
p *= b;
}
return res;
}
bool ok(string s, int b) {
int x;
for (int i = 0; i < s.size(); i++) {
x = s[i] - '0';
if (s[i] >= 'A') x = s[i] - 'A' + 10;
if (x >= b) return 0;
}
return 1;
}
int x, y, a, b, q = 0, base;
string s, t;
char c;
int main() {
for (;;) {
c = getchar();
if (c == ':') break;
s += c;
}
cin >> t;
a = b = -1;
for (base = 2;; base++) {
if (!ok(s, base) || !ok(t, base)) continue;
if (!q) q = base;
x = f(s, base);
y = f(t, base);
if (x == a && y == b) {
cout << -1;
return 0;
}
a = x;
b = y;
if (x > 23 || y > 59) break;
}
cerr << endl << q << " " << base;
for (int i = q; i < base; i++) printf("%d ", i);
if (q == base) cout << 0;
return 0;
}
| 8 | CPP |
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log, pi, sin
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
# sys.setrecursionlimit(pow(10, 6))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
s = data()
a, b = s.split(':')
start = 1
for i in a:
if i.isalpha():
temp = (ord(i) - 65) + 10
else:
temp = int(i)
start = max(temp, start)
for i in b:
if i.isalpha():
temp = (ord(i) - 65) + 10
else:
temp = int(i)
start = max(temp, start)
time = set()
answer = []
for base in range(start + 1, 1001):
hour = 0
for i in range(len(a)-1, -1, -1):
if a[i].isalpha():
temp = (ord(a[i])-65) + 10
else:
temp = int(a[i])
hour += temp * pow(base, len(a)-i-1)
if hour > 23:
continue
minute = 0
for i in range(len(b)-1, -1, -1):
if b[i].isalpha():
temp = (ord(b[i])-65) + 10
else:
temp = int(b[i])
minute += temp * pow(base, len(b)-i-1)
if minute > 59:
continue
temp = str(hour) + ":" + str(minute)
if temp in time:
out(-1)
exit()
answer.append(base)
time.add(temp)
if not answer:
out(0)
exit()
out(*answer)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int power(int a, int b) {
int ans = 1, i;
for (i = 0; i < b; i++) ans *= a;
return ans;
}
int main() {
int b, i, j, k, z, max, f, ff, s, c, ans[1000];
char a[1000];
i = 0;
scanf("%c", &a[i]);
max = 0;
if (a[i] - 55 > max) {
max = a[i] - 55;
} else if (a[i] <= '9' && a[i] - '0' > max) {
max = a[i] - '0';
}
f = 0;
while (a[i] != '\n') {
i++;
scanf("%c", &a[i]);
if (a[i] == ':')
c = i;
else if (a[i] - '0' > max) {
if (a[i] - 55 > max) {
max = a[i] - 55;
} else if (a[i] <= '9' && a[i] - '0' > max) {
max = a[i] - '0';
}
}
}
for (j = 0; j < c - 1; j++)
if (a[j] != '0') f = 1;
if (a[j] > 'N') {
f = 1;
}
for (j = c + 1; j < i - 1; j++)
if (a[j] != '0') f = 1;
ff = z = 0;
if (f == 0)
printf("-1\n");
else {
for (j = max + 1; j < 60; j++) {
s = 0;
for (k = 0; k < c; k++) {
if (a[k] <= '9')
s += power(j, c - 1 - k) * (a[k] - '0');
else
s += power(j, c - 1 - k) * (a[k] - 55);
if (s > 23) {
ff = 1;
break;
}
}
s = 0;
for (k = c + 1; k < i; k++) {
if (a[k] <= '9')
s += power(j, i - 1 - k) * (a[k] - '0');
else
s += power(j, i - 1 - k) * (a[k] - 55);
if (s > 59) {
ff = 1;
break;
}
}
if (ff == 1) {
break;
} else
ans[z++] = j;
}
for (j = 0; j < z - 1; j++) printf("%d ", ans[j]);
printf("%d\n", ans[j]);
}
return 0;
}
| 8 | CPP |
import sys
s1,s2 = input().split(":")
def convert(n,base):
ans = 0
for i in range(len(n)):
x = 0
if n[i].isalpha():
x = int(ord(n[i]) - ord('A')+10)
else:
x = int(n[i])
ans += x*pow(base,len(n)-i-1)
return ans
work = []
minm = 0
for c in s1+s2:
if c.isalpha():
minm = max(minm, ord(c) - ord('A')+10)
else:
minm = max(minm,int(c))
for base in range(max(minm+1,2),60):
if convert(s1,base) < 24 and convert(s2,base) < 60:
work.append(base)
else:
break
if len(work) == 0:
print(0)
elif (len(s1) == 1 or s1[:len(s1)-1] == '0'*(len(s1) -1)) and (len(s2) == 1 or s2[:len(s2)-1] == '0'*(len(s2) -1)):
print(-1)
else:
print(" ".join(map(str,work))) | 8 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.