text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, a3, a4;
cin >> a1 >> a2 >> a3 >> a4;
int n = a1 + a2;
int a[n + 1];
if (a3 == a4) {
if (a1 + a2 < a3 + a4 + 1) {
cout << -1;
return 0;
}
} else {
if (a1 + a2 < 2 * max(a3, a4)) {
cout << -1;
return 0;
}
}
if (a3 > min(a1, a2) || a4 > min(a1, a2) || a4 < a3 - 1 || a3 < a4 - 1) {
cout << -1;
return 0;
}
if (a4 > a3) {
int count4 = a1;
int index = n;
int extra7 = a2 - a4;
a[index--] = 4;
count4--;
for (int i = 1; i <= extra7; i++) a[index--] = 7;
for (int i = 1; i <= a4 - 1; i++) {
a[index--] = 7;
a[index--] = 4;
count4--;
}
if (a4 > 1) {
index++;
count4++;
}
for (int i = 1; i <= count4; i++) a[index--] = 4;
a[index--] = 7;
} else if (a4 < a3) {
int count4 = a1;
int index = n;
int extra7 = a2 - a4;
for (int i = 1; i <= extra7; i++) a[index--] = 7;
for (int i = 1; i <= a4; i++) {
a[index--] = 4;
a[index--] = 7;
count4--;
}
for (int i = 1; i <= count4; i++) a[index--] = 4;
} else {
if (a1 > a3) {
int count4 = a1;
int index = n;
int extra7 = a2 - a4;
a[index--] = 4;
count4--;
for (int i = 1; i <= extra7; i++) a[index--] = 7;
for (int i = 1; i <= a4; i++) {
a[index--] = 7;
a[index--] = 4;
count4--;
}
index++;
count4++;
for (int i = 1; i <= count4; i++) a[index--] = 4;
} else {
int count4 = a1;
int index = n;
int extra7 = a2 - a4 - 1;
for (int i = 1; i <= extra7; i++) a[index--] = 7;
for (int i = 1; i <= a4; i++) {
a[index--] = 7;
a[index--] = 4;
count4--;
}
if (a4 > 1) {
index++;
count4++;
}
for (int i = 1; i <= count4; i++) a[index--] = 4;
a[index--] = 7;
}
}
for (int i = 1; i <= n; i++) cout << a[i];
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a1, a2, a3, a4, flag = 1;
string str;
cin >> a1 >> a2 >> a3 >> a4;
if (a3 <= a1 && a3 <= a2 && a4 <= a1 && a4 <= a2 && abs(a3 - a4) < 2) {
if (a3 == a4) {
if (a1 > a3) {
for (int i = 0; i < a3; i++) str += "47";
str += "4";
a1 -= (a3 + 1);
a2 -= a3;
} else if (a2 > a3) {
for (int i = 0; i < a3; i++) str += "74";
str += "7";
a1 -= a3;
a2 -= (a3 + 1);
} else
flag = 0;
} else if (a3 > a4) {
for (int i = 0; i < a3; i++) str += "47";
a1 -= a3;
a2 -= a3;
} else if (a4 > a3) {
for (int i = 0; i < a4; i++) str += "74";
a1 -= a4;
a2 -= a4;
}
} else
flag = 0;
if (flag == 0)
cout << "-1";
else {
if (str[0] == '7') {
cout << str[0];
if (a1 != 0)
for (int i = 0; i < a1; i++) cout << "4";
for (int i = 1; i < str.size() - 1; i++) cout << str[i];
if (a2 != 0)
for (int i = 0; i < a2; i++) cout << "7";
cout << str[str.size() - 1];
} else if (str[0] == '4') {
cout << str[0];
if (a1 != 0)
for (int i = 0; i < a1; i++) cout << "4";
for (int i = 1; i < str.size() - 1; i++) cout << str[i];
if (a2 != 0)
for (int i = 0; i < a2; i++) cout << "7";
cout << str[str.size() - 1];
}
}
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
int IntMaxVal = (int)1e20;
int IntMinVal = (int)-1e20;
long long LongMaxVal = (long long)1e20;
long long LongMinVal = (long long)-1e20;
using namespace std;
template <typename T>
struct argument_type;
template <typename T, typename U>
struct argument_type<T(U)> {};
template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& s) {
is >> s.first >> s.second;
return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for (int i = 0; i < v.size(); i++) os << v[i] << ' ';
os << endl;
return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& s, pair<T1, T2>& t) {
s << t.first << ' ' << t.second;
return s;
}
deque<string> strs;
void solve(char d1, char d2, int c1, int c2, int c12, int c21) {
if (c21 > c12 || c12 > c21 + 1) return;
if (c1 < 1 + c21) return;
if (c2 < c12) return;
if (c12 == 0 && c2 != 0) return;
int extra1 = c1 - 1 - c21;
int extra2 = c2 - c12;
vector<char> s;
for (int i = 0; i < 1 + c12 + c21; ++i) s.push_back(i % 2 ? d2 : d1);
int i1 = -1;
int i2 = -1;
if (d1 == '4') {
for (int i = 0; i < s.size(); ++i)
if (s[i] == d1) {
i1 = i;
break;
}
for (int i = s.size() - 1; i >= 0; --i)
if (s[i] == d2) {
i2 = i;
break;
}
} else {
for (int i = 0; i < s.size(); ++i)
if (s[i] == d2) {
i2 = i;
break;
}
for (int i = s.size() - 1; i >= 0; --i)
if (s[i] == d1) {
i1 = i;
break;
}
}
string res = "";
for (int i = 0; i < s.size(); ++i) {
res.push_back(s[i]);
if (i == i1)
for (int j = 0; j < extra1; ++j) res.push_back(d1);
if (i == i2)
for (int j = 0; j < extra2; ++j) res.push_back(d2);
}
strs.push_back(res);
}
int main() {
srand(time(NULL));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int cnt4;
cin >> cnt4;
;
int cnt7;
cin >> cnt7;
;
int cnt47;
cin >> cnt47;
;
int cnt74;
cin >> cnt74;
;
solve('4', '7', cnt4, cnt7, cnt47, cnt74);
solve('7', '4', cnt7, cnt4, cnt74, cnt47);
if (!strs.size())
cout << -1;
else {
if (strs.size() > 1) {
if (strs[0].length() < strs[1].length())
strs.pop_back();
else if (strs[0].length() > strs[1].length())
strs.pop_front();
else if (strs[0] < strs[1])
strs.pop_back();
else
strs.pop_front();
}
cout << strs[0];
}
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:64000000")
using namespace std;
template <typename X>
inline X abs(const X& a) {
return a < 0 ? -a : a;
}
template <typename X>
inline X sqr(const X& a) {
return a * a;
}
const int INF = INT_MAX / 2;
const long double EPS = 1e-9;
const long double PI = 3.1415926535897932384626433832795;
const int N = 5000 * 1000 + 13;
int a[4];
int sz = 0;
char ans[N];
int cnt[4];
inline void error() {
puts("-1");
exit(0);
}
inline void print() {
assert(cnt[2] == a[2] && cnt[3] == a[3]);
assert(cnt[0] <= a[0] && cnt[1] <= a[1]);
int last = -1;
for (int i = 0; i < int(sz); i++)
if (ans[i] == '7') last = i;
for (int i = 0; i < int(sz); i++) {
if (ans[i] == '4') {
while (cnt[0] < a[0]) {
putchar('4');
cnt[0]++;
}
}
if (i == last) {
assert(ans[i] == '7');
while (cnt[1] < a[1]) {
putchar('7');
cnt[1]++;
}
}
putchar(ans[i]);
}
puts("");
exit(0);
}
int main() {
for (int i = 0; i < int(4); i++) cin >> a[i];
if (abs(a[3] - a[2]) > 1) error();
if (a[2] >= a[3]) {
sz = 0;
memset(cnt, 0, sizeof(cnt));
for (int i = 0; i < int(a[2]); i++) ans[sz++] = '4', ans[sz++] = '7';
cnt[0] = a[2];
cnt[1] = a[2];
cnt[2] = a[2];
cnt[3] = a[2] - 1;
if (a[2] == a[3]) ans[sz++] = '4', cnt[0]++, cnt[3]++;
bool ok = true;
for (int i = 0; i < int(4); i++)
if (cnt[i] > a[i]) ok = false;
if (ok) print();
}
if (a[2] == a[3]) {
sz = 0;
memset(cnt, 0, sizeof(cnt));
for (int i = 0; i < int(a[2]); i++) {
ans[sz++] = '4', ans[sz++] = '7';
ans[sz++] = '7', ans[sz++] = '4';
}
cnt[0] = 2 * a[2];
cnt[1] = 2 * a[2];
cnt[2] = a[2];
cnt[3] = a[3];
bool ok = true;
for (int i = 0; i < int(4); i++)
if (cnt[i] > a[i]) ok = false;
if (ok) print();
}
if (a[3] >= a[2]) {
sz = 0;
memset(cnt, 0, sizeof(cnt));
for (int i = 0; i < int(a[3]); i++) ans[sz++] = '7', ans[sz++] = '4';
cnt[0] = a[3];
cnt[1] = a[3];
cnt[3] = a[3];
cnt[2] = a[3] - 1;
if (a[2] == a[3]) ans[sz++] = '7', cnt[1]++, cnt[2]++;
bool ok = true;
for (int i = 0; i < int(4); i++)
if (cnt[i] > a[i]) ok = false;
if (ok) print();
}
error();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double const EPS = 1.0E-9;
int const MOD = (int)1e9 + 7;
inline int read(char* s) { return scanf("%s", s); }
inline int read(int& x) { return scanf("%d", &(x)); }
inline int read(long long& x) { return scanf("%lld", &x); }
inline int read(double& x) { return scanf("%lf", &x); }
inline int writeln(int x) { return printf("%d\n", x); }
inline int writeln(long long x) { return printf("%lld\n", x); }
inline int writeln(double x) { return printf("%.12f\n", x); }
template <typename... T>
int read(T&... args) {
using swallow = int[];
swallow w = {0, (read(args))...};
return sizeof(w) / sizeof(w[0]) - 1;
}
template <typename T>
int read(std::vector<T>& v) {
for (T& t : v) read(t);
return (int)v.size();
}
inline long long gcd(long long x, long long y) {
return y == 0 ? x : gcd(y, x % y);
}
inline long long lcm(long long x, long long y) {
return x == 0 && y == 0 ? 0 : x / gcd(x, y) * y;
}
inline long long powmod(long long x, long long n, long long m = MOD) {
long long r = 1;
while (n) {
if (n & 1) r = (r * x) % m;
x = (x * x) % m;
n /= 2;
}
return r;
}
static int leap(int y) { return y % 4 == 0 && y % 100 != 0 || y % 400 == 0; }
static int const month[2][12] = {
{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
{31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};
static const int maxn = 1 << 19;
static const int maxm = 1 << 22;
int n, n4, n7, n47, n74;
char s[maxm];
int fail() {
puts("-1");
exit(0);
}
int solve() {
read(n4, n7, n47, n74);
if (n47 > n4 || n47 > n7 || n74 > n4 || n74 > n7) {
fail();
}
if (abs(n47 - n74) > 1) {
fail();
}
n = 0;
if (n74 > n47) {
n4 -= n74 - 1;
n7 -= n74 - 1;
s[n++] = '7';
s[n++] = '4';
for (int i = 1; i < n4; ++i) s[n++] = '4';
for (int i = 1; i < n74; ++i) {
s[n++] = '7';
s[n++] = '4';
}
--n;
for (int i = 1; i < n7; ++i) {
s[n++] = '7';
}
s[n++] = '4';
} else if (n47 > n74) {
n4 -= n47 - 1;
n7 -= n47 - 1;
while (n4 > 0) {
s[n++] = '4';
--n4;
}
s[n++] = '7';
for (int i = 1; i < n47; ++i) {
s[n++] = '4';
s[n++] = '7';
}
while (n7 > 1) {
s[n++] = '7';
--n7;
}
} else {
n4 -= n47;
n7 -= n47;
if (n4 > 0) {
for (int i = 1; i < n4; ++i) {
s[n++] = '4';
}
for (int i = 0; i < n47; ++i) {
s[n++] = '4';
s[n++] = '7';
}
for (int i = 0; i < n7; ++i) {
s[n++] = '7';
}
s[n++] = '4';
} else if (n7 > 0) {
for (int i = 0; i < n74; ++i) {
s[n++] = '7';
s[n++] = '4';
}
for (int i = 0; i < n4; ++i) {
s[n++] = '4';
}
for (int i = 0; i < n7; ++i) {
s[n++] = '7';
}
} else {
fail();
}
}
puts(s);
return 0;
}
int main(int argc, char* argv[]) {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100000000 + 10;
int a[4], buf_cnt = 0;
char buf[MAX_N];
int main() {
scanf("%d%d%d%d", a, a + 1, a + 2, a + 3);
if (abs(a[2] - a[3]) > 1) {
goto FAIL;
}
if (a[2] > a[3]) {
if (a[0] < a[2] || a[1] < a[2]) goto FAIL;
for (int i = 0; i < a[0] - a[2]; ++i) buf[buf_cnt++] = '4';
for (int i = 0; i < a[2]; ++i) {
buf[buf_cnt++] = '4';
buf[buf_cnt++] = '7';
}
for (int i = 0; i < a[1] - a[2]; ++i) buf[buf_cnt++] = '7';
} else if (a[2] == a[3]) {
if (a[2] == 0) {
if (a[0] != 0 && a[1] != 0) goto FAIL;
for (int i = 0; i < a[0]; ++i) buf[buf_cnt++] = '4';
for (int i = 0; i < a[1]; ++i) buf[buf_cnt++] = '7';
} else if (a[0] == a[2]) {
if (a[1] <= a[2]) goto FAIL;
buf[buf_cnt++] = '7';
buf[buf_cnt++] = '4';
for (int i = 0; i < a[0] - a[2]; ++i) buf[buf_cnt++] = '4';
for (int i = 0; i < a[2] - 1; ++i) {
buf[buf_cnt++] = '7';
buf[buf_cnt++] = '4';
}
for (int i = 0; i < a[1] - a[2]; ++i) buf[buf_cnt++] = '7';
} else {
if (a[0] < a[2] + 1 || a[1] < a[2]) goto FAIL;
for (int i = 0; i < a[0] - a[2] - 1; ++i) buf[buf_cnt++] = '4';
for (int i = 0; i < a[2]; ++i) {
buf[buf_cnt++] = '4';
buf[buf_cnt++] = '7';
}
for (int i = 0; i < a[1] - a[2]; ++i) buf[buf_cnt++] = '7';
buf[buf_cnt++] = '4';
}
} else {
if (a[0] < a[3] || a[1] < a[3]) goto FAIL;
if (a[3] == 1) {
for (int i = 0; i < a[1]; ++i) buf[buf_cnt++] = '7';
for (int i = 0; i < a[0]; ++i) buf[buf_cnt++] = '4';
} else {
buf[buf_cnt++] = '7';
buf[buf_cnt++] = '4';
for (int i = 0; i < a[0] - a[3]; ++i) buf[buf_cnt++] = '4';
for (int i = 0; i < a[3] - 2; ++i) {
buf[buf_cnt++] = '7';
buf[buf_cnt++] = '4';
}
for (int i = 0; i < a[1] - a[3]; ++i) buf[buf_cnt++] = '7';
buf[buf_cnt++] = '7';
buf[buf_cnt++] = '4';
}
}
buf[buf_cnt] = 0;
printf("%s\n", buf);
return 0;
FAIL:
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int UNDEF = -1;
const int INF = 2000000000;
const double EPS = 1e-9;
const double PI = 3.1415926535897932384626433832795;
template <typename T>
T sqr(const T &x) {
return x * x;
}
template <typename T>
const string GetString(const T &val) {
ostringstream sout;
sout << val;
return sout.str();
}
int main() {
int cnt4, cnt7, cnt47, cnt74;
cin >> cnt4 >> cnt7 >> cnt47 >> cnt74;
if (abs(cnt47 - cnt74) > 1) {
cout << -1 << endl;
return 0;
}
deque<int> num;
num.push_back(4);
--cnt4;
while (true) {
if (cnt47 != 0 && num.back() == 4 && cnt7) {
num.push_back(7);
--cnt47;
--cnt7;
} else if (cnt74 != 0 && num.back() == 7 && cnt4) {
num.push_back(4);
--cnt74;
--cnt4;
} else {
break;
}
}
if (cnt74 != 0) {
num.push_front(7);
--cnt74;
--cnt7;
}
if (cnt74 != 0 || cnt47 != 0 || cnt4 < 0 || cnt7 < 0) {
cout << -1 << endl;
return 0;
}
int first4 = find((num).begin(), (num).end(), 4) - num.begin();
int last7 = (num.rend() - find(num.rbegin(), num.rend(), 7)) - 1;
for (int i = 0; i < num.size(); ++i) {
printf("%d", num[i]);
if (i == first4) {
while (cnt4--) {
printf("4");
}
}
if (i == last7) {
while (cnt7--) {
printf("7");
}
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int total;
char ans[2097152];
char buf[2097152];
int n4, n7, n47, n74;
void compare(int buflen) {
if (buflen != total) return;
int nn4 = n4;
int nn7 = n7;
int nn47 = n47;
int nn74 = n74;
for (int i = 0; i < buflen; i++) {
if (buf[i] == '4') {
nn4--;
if (buf[i + 1] == '7') {
nn47--;
}
}
if (buf[i] == '7') {
nn7--;
if (buf[i + 1] == '4') {
nn74--;
}
}
}
if (nn4 || nn7 || nn47 || nn74) return;
if (ans[0] == '\0' || strcmp(ans, buf) > 0) {
strcpy(ans, buf);
}
}
void try47(int n4, int n7, int n47, int n74) {
if (n47 != n74 && n47 != n74 + 1) return;
if (n47 == n74) {
n4 -= n47 + 1;
n7 -= n47;
if (n4 < 0 || n7 < 0) return;
int buflen = 0;
for (int i = 0; i < n4; i++) {
buf[buflen++] = '4';
}
for (int i = 0; i < n47; i++) {
buf[buflen++] = '4';
buf[buflen++] = '7';
}
for (int i = 0; i < n7; i++) {
buf[buflen++] = '7';
}
buf[buflen++] = '4';
buf[buflen] = '\0';
compare(buflen);
} else {
n4 -= n47;
n7 -= n47;
if (n4 < 0 || n7 < 0) return;
int buflen = 0;
for (int i = 0; i < n4; i++) {
buf[buflen++] = '4';
}
for (int i = 0; i < n47; i++) {
buf[buflen++] = '4';
buf[buflen++] = '7';
}
for (int i = 0; i < n7; i++) {
buf[buflen++] = '7';
}
buf[buflen] = '\0';
compare(buflen);
}
}
void try74(int n4, int n7, int n47, int n74) {
if (n47 != n74 && n74 != n47 + 1) return;
if (n47 == n74) {
n7 -= n74 + 1;
n4 -= n74;
if (n4 < 0 || n7 < 0) return;
int buflen = 0;
for (int i = 0; i < n74; i++) {
buf[buflen++] = '7';
buf[buflen++] = '4';
if (i == 0) {
for (int j = 0; j < n4; j++) {
buf[buflen++] = '4';
}
}
}
buf[buflen++] = '7';
for (int j = 0; j < n7; j++) {
buf[buflen++] = '7';
}
buf[buflen] = '\0';
compare(buflen);
} else {
n4 -= n74;
n7 -= n74;
if (n4 < 0 || n7 < 0) return;
int buflen = 0;
for (int i = 0; i < n74; i++) {
buf[buflen++] = '7';
if (i + 1 == n74) {
for (int j = 0; j < n7; j++) {
buf[buflen++] = '7';
}
}
buf[buflen++] = '4';
if (i == 0) {
for (int j = 0; j < n4; j++) {
buf[buflen++] = '4';
}
}
}
buf[buflen] = '\0';
compare(buflen);
}
}
int main() {
scanf("%d%d%d%d", &n4, &n7, &n47, &n74);
total = n4 + n7;
if (n47 - n74 < -1 || n47 - n74 > 1) {
printf("-1\n");
return 0;
}
try47(n4, n7, n47, n74);
try74(n4, n7, n47, n74);
if (ans[0] == '\0') {
printf("-1\n");
return 0;
} else {
printf("%s\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a4, a7, a47, a74;
string ans = "";
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> a4 >> a7 >> a47 >> a74;
if (abs(a74 - a47) > 1) {
cout << -1;
return 0;
}
if (a74 > a47) {
a47 -= a74 - 1;
a4 -= a74;
a7 -= a74;
while (a74) {
ans += "74";
a74--;
}
if (a74 + a47 > a4 || a74 + a47 > a7) {
cout << -1;
return 0;
}
if (a4 < 0 || a7 < 0 || a47 < 0 || a74 < 0) {
cout << -1;
return 0;
}
int first_4 = 0, last_4 = ans.size() - 1;
while (ans[first_4] != '4') first_4++;
while (ans[last_4] != '4') last_4--;
cout << ans.substr(0, first_4 + 1);
for (int i = 0; i < a4; i++) cout << 4;
cout << ans.substr(first_4 + 1, last_4 - first_4 - 1);
for (int i = 0; i < a7; i++) cout << 7;
cout << ans.substr(last_4);
return 0;
} else if (a47 > a74) {
a74 -= a47 - 1;
a4 -= a47;
a7 -= a47;
while (a47) {
ans += "47";
a47--;
}
if (a74 + a47 > a4 || a74 + a47 > a7) {
cout << -1;
return 0;
}
if (a4 < 0 || a7 < 0 || a47 < 0 || a74 < 0) {
cout << -1;
return 0;
}
for (int i = 0; i < a4; i++) cout << 4;
cout << ans;
for (int i = 0; i < a7; i++) cout << 7;
} else if (a47 == a74) {
a74 -= a47 - 1;
a4 -= a47;
a7 -= a47;
while (a47) {
ans += "47";
a47--;
}
if (a4 < 0 || a7 < 0 || a47 < 0 || a74 < 0) {
cout << -1;
return 0;
}
if (a74 + a47 > a4 && a74 + a47 > a7) {
cout << -1;
return 0;
}
if (a4 >= 1) {
ans += "4";
a4--;
int first_4 = 0, last_4 = ans.size() - 1;
for (int i = 0; i < a4; i++) cout << 4;
cout << ans.substr(0, ans.size() - 1);
for (int i = 0; i < a7; i++) cout << 7;
cout << 4;
} else if (a7 >= 1) {
ans = "7" + ans;
a7--;
cout << ans;
for (int i = 0; i < a7; i++) cout << 7;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int s4, s7, s47, s74;
int main() {
cin >> s4 >> s7 >> s47 >> s74;
if (abs(s47 - s74) > 1 || s4 < s47 || s4 < s74 || s7 < s74 || s7 < s47 ||
(s4 == s7 && s7 == s47 && s47 == s74)) {
cout << -1 << endl;
return 0;
}
if (s47 == s74 && min(s4, s7) == s47 && s7 > s4) {
for (int i = 1; i <= s47; i++) cout << 74;
for (int i = 1; i <= s7 - s47; i++) cout << 7;
} else if (s47 == s74) {
for (int i = 1; i <= s4 - s47; i++) cout << 4;
for (int i = 1; i <= s47 - 1; i++) cout << 74;
for (int i = 1; i <= s7 - s74 + 1; i++) cout << 7;
cout << 4;
}
if (s47 > s74) {
for (int i = 1; i <= s4 - s47; i++) cout << 4;
for (int i = 1; i <= s47; i++) cout << 47;
for (int i = 1; i <= s7 - s47; i++) cout << 7;
}
if (s47 < s74 && s4 == s74) {
cout << 7;
for (int i = 1; i <= s4 - s74 - 1; i++) cout << 4;
for (int i = 1; i <= s74 - 1; i++) cout << 47;
for (int i = 1; i <= s7 - s74; i++) cout << 7;
cout << 4;
} else if (s47 < s74) {
cout << 74;
for (int i = 1; i <= s4 - s74 - 1; i++) cout << 4;
for (int i = 1; i <= s74 - 1; i++) cout << 47;
for (int i = 1; i <= s7 - s74; i++) cout << 7;
cout << 4;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a4, a7, a47, a74;
bool solve() {
if (a4 < a47 || a4 < a74) return true;
if (a7 < a47 || a7 < a74) return true;
if (abs(a47 - a74) > 1) return true;
if (a47 == a74) {
int num4 = a4 - a47 - 1;
int num7 = a7 - a47;
if (num4 < 0) {
if (a7 == a4) return true;
--num7;
cout << '7';
for (int i = 0; i < a47; ++i) cout << "47";
for (int i = 0; i < num7; ++i) cout << '7';
cout << endl;
return false;
}
for (int i = 0; i < num4; ++i) cout << '4';
for (int i = 0; i < a47; ++i) cout << "47";
for (int i = 0; i < num7; ++i) cout << "7";
cout << '4' << endl;
} else if (a47 > a74) {
int num4 = a4 - a47;
int num7 = a7 - a47;
for (int i = 0; i < num4; ++i) cout << '4';
for (int i = 0; i < a47; ++i) cout << "47";
for (int i = 0; i < num7; ++i) cout << '7';
cout << endl;
} else {
--a7;
cout << '7';
int num4 = a4 - a47 - 1;
int num7 = a7 - a47;
for (int i = 0; i < num4; ++i) cout << '4';
for (int i = 0; i < a47; ++i) cout << "47";
for (int i = 0; i < num7; ++i) cout << '7';
cout << '4' << endl;
}
return false;
}
int main() {
cin >> a4 >> a7 >> a47 >> a74;
if (solve()) cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int num[3000012];
int abs1(int a) {
if (a < 0) a = -a;
return a;
}
bool check(int a1, int a2, int a3, int a4) {
if (a1 < 0 || a2 < 0 || a3 < 0 || a4 < 0) false;
if (a1 < a3 || a1 < a4) return false;
if (a2 < a3 || a2 < a4) return false;
if (abs1(a3 - a4) > 1) return false;
if (a1 + a2 <= a3 + a4) return false;
return true;
}
int main() {
int a1, a2, a3, a4, i, flag = 1, n, st, en, tmp;
scanf("%d%d%d%d", &a1, &a2, &a3, &a4);
memset(num, 0, sizeof(num));
num[0] = 0, n = a1 + a2;
if (!check(a1, a2, a3, a4)) {
printf("-1\n");
return 0;
}
if (a3 == a4) {
st = 1000000;
if (a1 > a3) {
for (i = st; i < st + a3 * 2; i += 2) {
num[i] = 4, num[i + 1] = 7;
}
num[i] = 4, en = i;
a1 -= a3 + 1, a2 -= a3;
} else {
for (i = st; i < st + a3 * 2; i += 2) {
num[i] = 7, num[i + 1] = 4;
}
a1 -= a3, a2 -= a3 + 1;
num[i] = 7, en = i;
}
} else if (a3 > a4) {
st = 1000000;
for (i = st; i < st + a3 * 2; i += 2) {
num[i] = 4, num[i + 1] = 7;
}
en = i - 1;
a1 -= a3, a2 -= a3;
} else {
st = 1000000;
for (i = st; i < a4 * 2 + st; i += 2) {
num[i] = 7, num[i + 1] = 4;
}
en = i - 1;
a1 -= a4, a2 -= a4;
}
tmp = num[st];
while (a1) {
num[st] = 4;
st--, a1--;
}
num[st] = tmp;
tmp = num[en];
while (a2) {
num[en] = 7;
en++;
a2--;
}
num[en] = tmp;
for (i = 1; i <= 3000012; i++)
if (num[i]) printf("%d", num[i]);
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(c - d) > 1) {
cout << -1 << '\n';
return 0;
}
string ans;
long long mn = min(c, d);
for (long long i = 0; i < mn; i++) {
ans += "47";
a--;
b--;
}
if (a) {
ans += "4";
a--;
if (c > d) {
ans += "7";
b--;
}
if (d > c) {
ans = "7" + ans;
b--;
}
} else {
ans = "7" + ans;
b--;
if (c > d) {
ans = "4" + ans;
a--;
}
if (d > c) {
ans += "4";
a--;
}
}
if (a < 0 or b < 0) {
cout << -1 << '\n';
return 0;
}
long long first = -1;
for (long long i = 0; i < ans.size(); i++) {
if (ans[i] == '4' and first == -1) first = i;
}
long long sz = ans.size();
ans = ans.substr(0, first) + string(a, '4') + ans.substr(first, sz - first);
sz = ans.size();
long long last = sz;
for (long long i = sz - 1; i >= 0; i--) {
if (ans[i] == '7' and last == sz) last = i;
}
ans = ans.substr(0, last) + string(b, '7') + ans.substr(last, sz - last);
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int a1, a2, a3, a4;
void output(char c, int &a, int &b) {
if (c == '4') {
for (int i = a - b + 1; i > 0; --i) {
putchar(c);
--a;
}
} else {
if (b == 1) {
for (int i = 0; i < a; ++i) putchar(c);
} else {
putchar(c);
--a;
}
}
}
void print(char c1, int a1, int b1, int c2, int a2, int b2) {
while (b1 && b2) {
if (b1) {
output(c1, a1, b1);
--b1;
}
if (b2) {
output(c2, a2, b2);
--b2;
}
}
if (b1)
for (int i = 0; i < a1; ++i) putchar(c1);
if (b2)
for (int i = 0; i < a2; ++i) putchar(c2);
}
void solve() {
if (a3 == a4) {
if (a1 >= a3 + 1 && a2 >= a4) {
print('4', a1, a3 + 1, '7', a2, a4);
return;
} else if (a2 >= a4 + 1 && a1 >= a3) {
print('7', a2, a4 + 1, '4', a1, a3);
return;
}
}
if (a3 + 1 == a4) {
if (a1 >= a4 && a2 >= a4) {
print('7', a2, a4, '4', a1, a4);
return;
}
}
if (a4 + 1 == a3) {
if (a1 >= a3 && a2 >= a3) {
print('4', a1, a3, '7', a2, a3);
return;
}
}
puts("-1");
}
int main() {
scanf("%d%d%d%d", &a1, &a2, &a3, &a4);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c > a || c > b || d > a || d > b || abs(c - d) >= 2 ||
(a == 1 && b == 1)) {
cout << -1 << endl;
return 0;
}
string ans = "";
if (c > d) {
string s = "47";
for (int i = 0; i < c; i++) ans += s;
a -= c;
b -= c;
if (a < 0 || b < 0) {
cout << -1 << endl;
return 0;
}
while (a > 0) (a--, cout << 4);
cout << ans;
while (b > 0) (b--, cout << 7);
cout << endl;
return 0;
}
if (d > c) {
string s = "74";
for (int i = 0; i < d; i++) ans += s;
a -= d;
b -= d;
if (a < 0 || b < 0) {
cout << -1 << endl;
return 0;
}
cout << ans[0];
while (a > 0) (a--, cout << 4);
for (int i = 1; i < (int)ans.size() - 1; i++) cout << ans[i];
while (b > 0) (b--, cout << 7);
cout << 4 << endl;
return 0;
}
if (b > a && 1) {
if (b < c + 1) {
cout << -1 << endl;
return 0;
}
string s = "74";
for (int i = 0; i < c; i++) ans += s;
ans += "7";
a -= c;
b -= c;
b--;
if (a < 0 || b < 0) {
cout << -1 << endl;
return 0;
}
if (a == 0) {
while (a > 0) (a--, cout << 4);
cout << ans;
while (b > 0) (b--, cout << 7);
cout << endl;
return 0;
}
a += c;
b++;
b += c;
}
ans = "";
if (a < c + 1) {
cout << -1 << endl;
return 0;
}
string s = "47";
for (int i = 0; i < c; i++) ans += s;
b -= c;
a -= c;
a--;
if (a < 0 || b < 0) {
cout << -1 << endl;
return 0;
}
while (a > 0) (a--, cout << 4);
cout << ans;
while (b > 0) (b--, cout << 7);
cout << 4 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long mx = 4e6;
const long long inf = 1e9 + 1;
const int sz = 100;
void input() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int a1, a2, a3, a4;
cin >> a1 >> a2 >> a3 >> a4;
if (a1 < max(a3, a4) || a2 < max(a3, a4) || abs(a3 - a4) > 1) {
cout << -1 << "\n";
return;
}
string ans("\0");
if (a3 == a4) {
if (a1 - a3 == 0 && a2 - a3 == 0) {
cout << -1 << "\n";
return;
} else if (a1 == a3) {
a2 -= a3;
--a2;
a1 -= a3;
string temp("\0");
while (a1--) temp += '4';
while (a3--) ans += "74";
while (a2--) ans += '7';
ans += '7';
ans.insert(1, temp);
} else {
a1 -= a3;
a1--;
a2 -= a3;
while (a1--) ans += '4';
while (a3--) ans += "47";
while (a2--) ans += '7';
ans += '4';
}
} else if (a3 > a4) {
a1 -= a3;
a2 -= a3;
while (a1--) ans += '4';
while (a3--) ans += "47";
while (a2--) ans += '7';
} else {
a1 -= a4;
a2 -= a4;
string temp("\0");
while (a1--) temp += '4';
while (a4--) ans += "74";
ans.pop_back();
while (a2--) ans += '7';
ans += '4';
ans.insert(1, temp);
}
cout << ans << "\n";
}
int main() {
input();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int oo = 1 << 20;
const double PI = M_PI;
const double EPS = 1e-15;
int A, B, C, D;
int main() {
cin >> A >> B >> C >> D;
if (C == D) {
int a = A - (C + 1), b = B - C;
if (a >= 0 && b >= 0) {
for (int i = 0; i < a; i++) cout << 4;
for (int i = 0; i < C; i++) cout << 47;
for (int i = 0; i < b; i++) cout << 7;
cout << 4 << endl;
return 0;
}
a = A - C, b = B - (C + 1);
if (a >= 0 && b >= 0) {
cout << 74;
for (int i = 0; i < a; i++) cout << 4;
for (int i = 0; i < C - 1; i++) cout << 74;
for (int i = 0; i < b + 1; i++) cout << 7;
return 0;
}
cout << -1 << endl;
return 0;
}
if (abs(C - D) > 1) {
cout << -1 << endl;
return 0;
}
if (C > D) {
A = A - C;
B = B - C;
if (A < 0 || B < 0) {
cout << -1;
return 0;
}
for (int i = 0; i < A; i++) cout << 4;
for (int i = 0; i < C; i++) cout << 47;
for (int i = 0; i < B; i++) cout << 7;
return 0;
} else {
A = A - D + 1;
B = B - D + 1;
if (A <= 0 || B <= 0) {
cout << -1;
return 0;
}
cout << 7;
for (int i = 0; i < A; i++) cout << 4;
for (int i = 0; i < D - 2; i++) cout << 74;
for (int i = 0; i < B; i++) cout << 7;
cout << 4;
return 0;
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string ans;
int a1, a2, a3, a4;
int main() {
while (~scanf("%d%d%d%d", &a1, &a2, &a3, &a4)) {
ans = "";
if (abs(a3 - a4) > 1 || a3 > a1 || a3 > a2 || a4 > a1 || a4 > a2 ||
a3 + a4 >= a1 + a2) {
puts("-1");
continue;
}
if (a3 == a4 + 1) {
for (int i = 1; i <= a1 - a3; ++i) {
ans += '4';
}
for (int i = 1; i <= a3; ++i) {
ans += '4';
ans += '7';
}
for (int i = 1; i <= a2 - a3; ++i) ans += '7';
} else if (a3 == a4 - 1) {
ans += '7';
ans += '4';
for (int i = 1; i <= a1 - a4; ++i) {
ans += '4';
}
for (int i = 1; i < a4 - 1; ++i) {
ans += '7';
ans += '4';
}
for (int i = 1; i <= a2 - (a4 - 1); ++i) ans += '7';
ans += '4';
} else {
if (a1 - a4 - 1 >= 0 && a2 - a4 >= 0) {
for (int i = 1; i <= a1 - a4 - 1; ++i) ans += '4';
for (int i = 1; i <= a4; ++i) {
ans += '4';
ans += '7';
}
for (int i = 1; i <= a2 - a4; ++i) ans += '7';
ans += '4';
} else if (a1 - a4 >= 0 && a2 - a4 - 1 >= 0) {
ans += '7';
for (int i = 1; i <= a1 - a4; ++i) ans += '4';
for (int i = 1; i <= a4; ++i) {
ans += '4';
ans += '7';
}
for (int i = 1; i <= a2 - a4 - 1; ++i) ans += '7';
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s1 = "47";
string s2 = "74";
string res;
int main() {
int a1, a2, a3, a4;
cin >> a1 >> a2 >> a3 >> a4;
if (abs(a3 - a4) <= 1) {
if (a3 > a4) {
a1 -= a3;
a2 -= a3;
if (a1 >= 0 && a2 >= 0) {
for (int i = 0; i < a1; i++) cout << '4';
for (int i = 0; i < a3; i++) cout << s1;
for (int i = 0; i < a2; i++) cout << '7';
} else
cout << -1;
}
if (a3 == a4) {
a1 -= a3;
a2 -= a3;
if (a1 == 0 && a2 == 0 || a1 < 0 || a2 < 0) {
cout << -1;
return 0;
}
if (a1 >= 0 || a2 >= 0) {
if (a1 && a2 == 0) {
for (int i = 0; i < a1 - 1; i++) cout << '4';
for (int i = 0; i < a3; i++) cout << s1;
cout << '4';
} else {
if (a1 == 0 && a2) {
cout << '7';
for (int i = 0; i < a3; i++) cout << s1;
for (int i = 0; i < a2 - 1; i++) cout << '7';
} else {
for (int i = 0; i < a1 - 1; i++) cout << '4';
for (int i = 0; i < a3; i++) cout << s1;
for (int i = 0; i < a2; i++) cout << '7';
cout << '4';
}
}
} else
cout << -1;
}
if (a3 < a4) {
a1 -= a4;
a2 -= a4;
if (a1 >= 0 && a2 >= 0) {
cout << '7';
for (int i = 0; i < a1; i++) cout << '4';
for (int i = 0; i < a3; i++) cout << s1;
for (int i = 0; i < a2; i++) cout << '7';
cout << '4';
} else {
cout << -1;
}
}
} else {
cout << -1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<char> print;
bool solve(vector<long long> a, string s1, string s2) {
string ans;
a[3] -= (a[2] - 1);
while (a[2] > 0) ans += s1, a[2]--;
if (a[3] > 0) ans += s2.back(), a[3]--;
while (a[3] > 0) ans += s2, a[3]--;
long long id = -1;
for (long long i = 0; i < ans.size(); i++) {
auto x = ans[i];
a[0] -= x == '4', a[1] -= x == '7';
if (x == '7') id = i;
}
print.clear();
for (long long i = 0; i < ans.size(); i++) {
print.push_back(ans[i]);
if (ans[i] == '4')
while (a[0]-- > 0) print.push_back('4');
if (ans[i] == '7' and id == i)
while (a[1]-- > 0) print.push_back('7');
}
return true;
}
bool check(vector<long long> v) {
for (long long i = 0; i < print.size(); i++) {
v[0] -= print[i] == '4';
v[1] -= print[i] == '7';
if (i + 1 < print.size()) {
string tp;
tp += print[i];
tp += print[i + 1];
v[2] -= tp == "47";
v[3] -= tp == "74";
}
}
return count(v.begin(), v.end(), 0) == 4;
}
void write() {
for (auto x : print) cout << x;
exit(0);
}
void solve() {
vector<long long> a(4);
for (auto &x : a) cin >> x;
vector<long long> v = a;
if (abs(a[2] - a[3]) > 1) {
cout << "-1" << '\n';
return;
}
string s1 = "47", s2 = "74", ans;
if (solve(a, s1, s2) and check(v)) write();
swap(a[2], a[3]);
if (solve(a, s2, s1) and check(v)) write();
cout << -1 << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
long long t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d;
int main() {
cin >> a >> b >> c >> d;
if (abs(c - d) > 1) return 0 * puts("-1");
int m = min(c, d);
if (min(a, b) < m) return 0 * puts("-1");
if (a == b && b == c && c == d) return 0 * puts("-1");
if (c == d) {
if (c == 0 && a && b) return 0 * puts("-1");
if (b < c) return 0 * puts("-1");
if (a < c) return 0 * puts("-1");
if (a != c) {
for (int i = 0; i < a - c - 1; ++i) putchar('4');
for (int i = 0; i < c; ++i) cout << "47";
for (int i = 0; i < b - c; ++i) putchar('7');
putchar('4');
} else {
for (int i = 0; i < c; ++i) cout << "74";
for (int i = 0; i < a - c; ++i) putchar('4');
for (int i = 0; i < b - c; ++i) putchar('7');
}
} else if (c > d) {
if (a < c) return 0 * puts("-1");
if (b < c) return 0 * puts("-1");
for (int i = 0; i < a - c; ++i) putchar('4');
for (int i = 0; i < c; ++i) cout << "47";
for (int i = 0; i < b - c; ++i) putchar('7');
} else {
if (a < d) return 0 * puts("-1");
if (b < d) return 0 * puts("-1");
cout << "74";
for (int i = 0; i < a - d; ++i) putchar('4');
for (int i = 0; i < d - 2; ++i) cout << "74";
for (int i = 0; i < b - d + 1; ++i) putchar('7');
putchar('4');
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d;
string s;
int main() {
cin >> a >> b >> c >> d;
if (min(a, b) < max(c, d) || abs(c - d) > 1 || (c == a && b == d && c == d))
cout << -1;
else {
if (c > d) {
for (int i = 0; i < a - c; i++) cout << 4;
for (int i = 0; i < c; i++) cout << 47;
for (int i = 0; i < b - c; i++) cout << 7;
} else if (c < d) {
cout << 7;
for (int i = 0; i < a - d + 1; i++) cout << 4;
for (int i = 0; i < d - 2; i++) cout << 74;
for (int i = 0; i < b - d; i++) cout << 7;
cout << 74;
} else {
if (c == a) {
cout << 7;
for (int i = 0; i < c; i++) cout << 47;
for (int i = 0; i < b - d - 1; i++) cout << 7;
} else {
for (int i = 0; i < a - c - 1; i++) cout << 4;
for (int i = 0; i < c; i++) cout << 47;
for (int i = 0; i < b - d; i++) cout << 7;
cout << 4;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using llong = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr int NINF = 0xc0c0c0c0;
constexpr llong INFLL = 0x3f3f3f3f3f3f3f3fLL;
constexpr llong NINFLL = 0xc0c0c0c0c0c0c0c0LL;
std::string multi_string(int n, const std::string& str) {
std::string res;
for (int i(0), upper_i(n); i < upper_i; ++i) {
res += str;
}
return res;
}
std::string multi_string(int n, const char* cstr) {
return multi_string(n, std::string(cstr));
}
void string_insert(std::string& str, int pos, const std::string& to_insert) {
str = str.substr(0, pos) + to_insert + str.substr(pos, str.length() - pos);
}
void insert4(std::string& str, int cnt4) {
string_insert(str, str.find("4"), multi_string(cnt4, "4"));
}
void insert7(std::string& str, int cnt7) {
string_insert(str, str.rfind("7"), multi_string(cnt7, "7"));
}
int main(int argc, char const* argv[]) {
int _4, _7, _47, _74;
scanf("%d %d %d %d", &_4, &_7, &_47, &_74);
std::string res;
int n = _4 + _7;
if (abs(_47 - _74) >= 2) {
printf("-1\n");
return 0;
}
if (_47 == _74) {
if (_7 >= _47 && _4 >= _47 + 1) {
res += multi_string(_47, "47");
res += "4";
insert4(res, _4 - _47 - 1);
insert7(res, _7 - _47);
} else if (_4 >= _47 && _7 >= _47 + 1) {
res += multi_string(_74, "74");
res += "7";
insert4(res, _4 - _47);
insert7(res, _7 - _47 - 1);
} else {
res = "-1";
}
} else if (_47 == _74 + 1) {
if (_4 >= _47 && _7 >= _47) {
res += multi_string(_47, "47");
insert7(res, _7 - _47);
insert4(res, _4 - _47);
} else {
res = "-1";
}
} else {
if (_4 >= _74 && _7 >= _74) {
res += multi_string(_74, "74");
insert7(res, _7 - _74);
insert4(res, _4 - _74);
} else {
res = "-1";
}
}
std::cout << res << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 3000000;
int a1, a2, a3, a4, t1, t2, ans[N], t[N];
int main() {
scanf("%d%d%d%d", &a1, &a2, &a3, &a4);
if (abs(a3 - a4) > 1) {
printf("-1\n");
return 0;
}
if (a3 == a4) {
if (a1 >= a3 + 1) {
for (int i = 1; i <= a3; ++i) ans[2 * i - 1] = 4, ans[2 * i] = 7;
ans[2 * a3 + 1] = 4;
} else if (a2 >= a4 + 1) {
for (int i = 1; i <= a3; ++i) ans[2 * i - 1] = 7, ans[2 * i] = 4;
ans[2 * a3 + 1] = 7;
} else {
printf("-1\n");
return 0;
}
ans[0] = 2 * a3 + 1;
} else if (a3 == a4 + 1) {
for (int i = 1; i <= a3; ++i) ans[2 * i - 1] = 4, ans[2 * i] = 7;
ans[0] = 2 * a3;
} else if (a3 + 1 == a4) {
for (int i = 1; i <= a4; ++i) ans[2 * i - 1] = 7, ans[2 * i] = 4;
ans[0] = 2 * a4;
}
for (int i = 1; i <= ans[0]; ++i)
if (ans[i] == 4)
++t1;
else
++t2;
if (t1 > a1 || t2 > a2) {
printf("-1\n");
return 0;
}
for (int i = 1; i <= ans[0]; ++i)
if (ans[i] == 4) {
t[i] += a1 - t1;
break;
}
for (int i = ans[0]; i >= 1; --i)
if (ans[i] == 7) {
t[i] += a2 - t2;
break;
}
for (int i = 1; i <= ans[0]; ++i)
for (int j = 0; j <= t[i]; ++j) printf("%d", ans[i]);
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
solve();
return 0;
}
void solve() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c - d > 1 || d - c > 1) {
cout << "-1";
return;
}
if (c == 0 && d == 0 && a * b != 0) {
cout << "-1";
return;
}
if (c == d) {
if (a > c) {
if (b < c) {
cout << "-1";
return;
}
for (int i = 0; i < a - c; i++) cout << "4";
for (int i = 0; i < c - 1; i++) cout << "74";
for (int i = 0; i < b - c; i++) cout << "7";
cout << "74";
} else if (b > c) {
if (a < c) {
cout << "-1";
return;
}
cout << "7";
for (int i = 0; i < a - c; i++) cout << "4";
for (int i = 0; i < c; i++) cout << "47";
for (int i = 0; i < b - c - 1; i++) cout << "7";
} else {
cout << "-1";
return;
}
}
if (c > d) {
if (a < c || b < c) {
cout << "-1";
return;
}
for (int i = 0; i < a - c; i++) cout << "4";
for (int i = 0; i < c; i++) cout << "47";
for (int i = 0; i < b - c; i++) cout << "7";
}
if (d > c) {
if (a < d || b < d) {
cout << "-1";
return;
}
cout << "7";
for (int i = 0; i < a - d; i++) cout << "4";
cout << "4";
for (int i = 0; i < d - 2; i++) cout << "74";
for (int i = 0; i < b - d; i++) cout << "7";
cout << "74";
}
}
|
#include <bits/stdc++.h>
int a[4];
char ans[2000010];
int check(int f, int s) {
if (f > a[0] || s > a[1]) {
return 0;
}
return 1;
}
void solve() {
int i, f, s;
if (abs(a[2] - a[3]) > 1 || a[2] > a[0] || a[3] > a[1]) {
printf("-1\n");
return;
}
if (a[2] == a[3]) {
for (i = f = s = 0; f <= a[2]; i++) {
if (i & 1) {
ans[i] = '7';
s++;
} else {
ans[i] = '4';
f++;
}
if (!check(f, s)) {
break;
}
}
if (i == (a[2] << 1) + 1) {
ans[i - 1] = '\0';
for (i = 0; i < a[0] - f; i++) {
printf("4");
}
printf("%s", ans);
for (i = 0; i < a[1] - s; i++) {
printf("7");
}
printf("4\n");
} else {
for (i = f = s = 0; s <= a[3]; i++) {
if (i & 1) {
ans[i] = '4';
f++;
} else {
ans[i] = '7';
s++;
}
if (!check(f, s)) {
printf("-1\n");
return;
}
}
printf("74");
for (i = 0; i < a[0] - f; i++) {
printf("4");
}
for (i = 2; i < (a[3] << 1) + 1; i++) {
printf("%c", ans[i]);
}
for (i = 0; i < a[1] - s; i++) {
printf("7");
}
printf("\n");
}
} else if (a[2] - a[3] == 1) {
for (i = f = s = 0; i < a[2] << 1; i++) {
if (i & 1) {
ans[i] = '7';
s++;
} else {
ans[i] = '4';
f++;
}
if (!check(f, s)) {
printf("-1\n");
return;
}
}
ans[i] = '\0';
for (i = 0; i < a[0] - f; i++) {
printf("4");
}
printf("%s", ans);
for (i = 0; i < a[1] - s; i++) {
printf("7");
}
printf("\n");
} else {
for (i = f = s = 0; i < a[3] << 1; i++) {
if (i & 1) {
ans[i] = '4';
f++;
} else {
ans[i] = '7';
s++;
}
if (!check(f, s)) {
printf("-1\n");
return;
}
}
if (a[3] == 1) {
for (i = 0; i < a[1] - s; i++) {
printf("7");
}
printf("74");
for (i = 0; i < a[0] - f; i++) {
printf("4");
}
printf("\n");
} else {
printf("74");
for (i = 0; i < a[0] - f; i++) {
printf("4");
}
for (i = 2; i + 1 < a[3] << 1; i++) {
printf("%c", ans[i]);
}
for (i = 0; i < a[1] - s; i++) {
printf("7");
}
printf("4\n");
}
}
}
int main() {
int i;
while (scanf("%d", &a[0]) == 1) {
for (i = 1; i < 4; i++) {
scanf("%d", &a[i]);
}
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
const long double PI = acos(-1.0);
const long long mod = 1000000007;
const long long INF = 1e9;
const long long LINF = 1e18;
const long long MAXN = 1e5 + 1;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
string ans = "";
if (c > a || c > b || d > a || d > b || abs(c - d) > 1) {
cout << -1;
return 0;
}
string ans1 = "";
if (d > c) {
for (int i = (0); i < (d); ++i) ans += "74";
} else {
if (c > d) {
for (int i = (0); i < (c); ++i) ans += "47";
} else {
for (int i = (0); i < (c); ++i) ans += "47";
ans += '4';
for (int i = (0); i < (d); ++i) ans1 += "74";
ans1 += '7';
}
}
int ye1 = 0, ye2 = 0;
for (int i = (0); i < ((int)((ans).size())); ++i)
if (ans[i] == '7')
++ye2;
else
++ye1;
a -= ye1;
b -= ye2;
if (a < 0 || b < 0) {
a += ye1;
b += ye2;
ye1 = ye2 = 0;
for (int i = (0); i < ((int)((ans1).size())); ++i)
if (ans1[i] == '4')
++ye1;
else
++ye2;
a -= ye1;
b -= ye2;
if (a < 0 || b < 0) {
cout << -1;
return 0;
} else
ans = ans1;
}
if (a) {
int first = -1;
for (int i = (0); i < ((int)((ans).size())); ++i)
if (ans[i] == '4') {
first = i;
break;
}
if (first != -1) {
string res;
for (int i = (0); i < (first); ++i) res += ans[i];
for (int i = (0); i < (a); ++i) res += '4';
for (int i = (first); i < ((int)((ans).size())); ++i) res += ans[i];
ans = res;
} else
throw -1;
}
if (b) {
int last = -1;
for (int i = (0); i < ((int)((ans).size())); ++i)
if (ans[i] == '7') last = i;
if (last == -1)
throw -1;
else {
string res;
for (int i = (0); i < (last); ++i) res += ans[i];
for (int i = (0); i < (b); ++i) res += '7';
for (int i = (last); i < ((int)((ans).size())); ++i) res += ans[i];
ans = res;
}
}
cout << ans;
cin >> a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pi = pair<int, int>;
const double PI = acos(-1.0);
const double eps = 1e-9;
const ll mod = 1e9 + 7;
const int inf = 1e7;
const int MAXN = 1e5 + 5;
void no() {
cout << -1 << '\n';
exit(0);
}
void cp() {
int a4, a7, a47, a74;
cin >> a4 >> a7 >> a47 >> a74;
if (abs(a47 - a74) > 1) no();
string ans;
if (a47 > a74) {
if (a47 <= a4 && a47 <= a7) {
for (int i = 0; i < a47; i++) ans += "47", a4--, a7--;
} else
no();
for (int i = 0; i < a7; i++) ans += '7';
reverse(ans.begin(), ans.end());
for (int i = 0; i < a4; i++) ans += '4';
reverse(ans.begin(), ans.end());
} else if (a47 < a74) {
if (a74 <= a4 && a74 <= a7) {
for (int i = 0; i < a74; i++) ans += "74", a4--, a7--;
} else
no();
ans.pop_back();
for (int i = 0; i < a7; i++) ans += '7';
ans += '4';
reverse(ans.begin(), ans.end());
ans.pop_back();
for (int i = 0; i < a4; i++) ans += '4';
ans += '7';
reverse(ans.begin(), ans.end());
} else {
if (a47 + 1 <= a4 && a47 <= a7) {
for (int i = 0; i < a47; i++) ans += "47", a4--, a7--;
ans += '4';
a4--;
ans.pop_back();
for (int i = 0; i < a7; i++) ans += '7';
ans += '4';
reverse(ans.begin(), ans.end());
for (int i = 0; i < a4; i++) ans += '4';
reverse(ans.begin(), ans.end());
} else if (a74 + 1 <= a7 && a74 <= a4) {
for (int i = 0; i < a74; i++) ans += "74", a4--, a7--;
ans += '7';
a7--;
for (int i = 0; i < a7; i++) ans += '7';
reverse(ans.begin(), ans.end());
ans.pop_back();
for (int i = 0; i < a4; i++) ans += '4';
ans += '7';
reverse(ans.begin(), ans.end());
} else
no();
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t;
t = 1;
while (t--) {
cp();
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, d;
while (scanf("%d%d%d%d", &a, &b, &c, &d) != EOF) {
int i, j;
if (abs(c - d) > 1) {
printf("-1\n");
continue;
}
int add = 0, max = c;
if (abs(c - d) == 1) {
if (max < d) max = d;
if (a < max || b < max) {
printf("-1\n");
continue;
}
if (c > d) {
add = a - max;
while (add--) printf("4");
add = max;
while (add--) printf("47");
add = b - max;
while (add--) printf("7");
printf("\n");
} else {
printf("7");
add = a - d;
while (add--) printf("4");
add = c;
while (add--) printf("47");
add = b - d;
while (add--) printf("7");
printf("4\n");
}
} else {
if (a < c || b < c) {
printf("-1\n");
continue;
}
if (a == b && b == c) {
printf("-1\n");
continue;
}
if (a >= c + 1) {
add = a - c - 1;
while (add--) printf("4");
add = c;
while (add--) printf("47");
add = b - c;
while (add--) printf("7");
printf("4");
} else {
add = c;
while (add--) printf("74");
add = b - c;
while (add--) printf("7");
}
printf("\n");
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a1, a2, a3, a4;
int main() {
while (cin >> a1 >> a2 >> a3 >> a4) {
if (abs(a3 - a4) > 1) {
puts("-1");
continue;
}
if (a3 > a4) {
if (a1 < a3 || a2 < a3) {
puts("-1");
continue;
}
for (int i = 1; i <= a1 - a3; ++i) printf("%c", '4');
for (int i = 1; i <= a3; ++i) printf("%c%c", '4', '7');
for (int i = 1; i <= a2 - a3; ++i) printf("%c", '7');
} else {
if (a3 == a4) {
if (a1 - a3 >= 1 && a2 - a3 >= 0) {
for (int i = 1; i < a1 - a3; ++i) printf("%c", '4');
for (int i = 1; i <= a3; ++i) printf("%c%c", '4', '7');
for (int i = 1; i <= a2 - a3; ++i) printf("%c", '7');
printf("%c", '4');
} else {
if (a2 - a3 >= 1 && a1 - a3 >= 0) {
printf("%c", '7');
for (int i = 1; i <= a1 - a3; ++i) printf("%c", '4');
for (int i = 1; i <= a3; ++i) printf("%c%c", '4', '7');
for (int i = 1; i < a2 - a3; ++i) printf("%c", '7');
} else {
puts("-1");
continue;
}
}
} else {
if (a1 - a3 < 1 || a2 - a3 < 1) {
puts("-1");
continue;
}
printf("%c", '7');
for (int i = 1; i < a1 - a3; ++i) printf("%c", '4');
for (int i = 1; i <= a3; ++i) printf("%c%c", '4', '7');
for (int i = 1; i < a2 - a3; ++i) printf("%c", '7');
printf("%c", '4');
}
}
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char arr[2000001];
int n;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(c - d) > 1 || a < min(c, d) || b < min(c, d)) {
printf("-1\n");
return 0;
}
if (c > d) {
for (int i = 0; i < (a - d); i++) arr[n++] = '4';
for (int i = 0; i < d; i++) {
arr[n++] = '7';
arr[n++] = '4';
}
for (int i = 0; i < (b - d); i++) arr[n++] = '7';
} else if (c < d) {
arr[n++] = '7';
arr[n++] = '4';
for (int i = 0; i < (a - c - 1); i++) arr[n++] = '4';
for (int i = 0; i < c - 1; i++) {
arr[n++] = '7';
arr[n++] = '4';
}
for (int i = 0; i < (b - c); i++) arr[n++] = '7';
arr[n++] = '4';
} else {
if (a > c) {
for (int i = 0; i < (a - c); i++) arr[n++] = '4';
for (int i = 0; i < c - 1; i++) {
arr[n++] = '7';
arr[n++] = '4';
}
for (int i = 0; i < (b - c + 1); i++) arr[n++] = '7';
arr[n++] = '4';
} else {
arr[n++] = '7';
for (int i = 0; i < (a - c); i++) arr[n++] = '4';
for (int i = 0; i < c; i++) {
arr[n++] = '4';
arr[n++] = '7';
}
for (int i = 0; i < (b - c - 1); i++) arr[n++] = '7';
}
}
int a1 = 0, a2 = 0, a3 = 0, a4 = 0;
for (int i = 0; i < n - 1; i++) {
if (arr[i] == '4')
a1++;
else
a2++;
if (arr[i] == '4' && arr[i + 1] == '7')
a3++;
else if (arr[i] == '7' && arr[i + 1] == '4')
a4++;
}
if (arr[n - 1] == '4')
a1++;
else
a2++;
arr[n++] = '\0';
if (a1 == a && a2 == b && a3 == c && a4 == d) {
printf("%s\n", arr);
} else
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c4, c7, c47, c74;
void solve1() {
for (int i = 0; i < c4 - c74 - 1; i++) cout << 4;
for (int i = 0; i < c74; i++) cout << 47;
for (int i = 0; i < c7 - c74; i++) cout << 7;
cout << 4;
}
void solve2() {
cout << 7;
for (int i = 0; i < c4 - c74; i++) cout << 4;
for (int i = 0; i < c74; i++) cout << 47;
for (int i = 0; i < c7 - c74 - 1; i++) cout << 7;
}
int main() {
cin >> c4 >> c7 >> c47 >> c74;
if (c47 == c74) {
if (c4 >= c74 + 1 && c7 >= c74) {
solve1();
} else if (c4 == c74 && c7 >= c74 + 1)
solve2();
else
cout << -1;
} else if (c47 == c74 + 1) {
if (c4 >= c47 && c7 >= c47) {
for (int i = 0; i < c4 - c47; i++) cout << 4;
for (int i = 0; i < c47; i++) cout << 47;
for (int i = 0; i < c7 - c47; i++) cout << 7;
} else
cout << -1;
} else if (c74 == c47 + 1) {
if (c4 >= c74 && c7 >= c74) {
cout << 74;
for (int i = 0; i < c4 - c74; i++) cout << 4;
for (int i = 0; i < c74 - 2; i++) cout << 74;
for (int i = 0; i < c7 - c74; i++) cout << 7;
cout << 74;
} else
cout << -1;
} else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
const double PI = acos(-1);
const double EPS = 1e-12;
const int MOD = 1e9 + 7;
const int INF = 1 << 30;
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(c - d) > 1)
cout << "-1" << endl;
else if (a < max(c, d) || b < max(c, d))
cout << "-1" << endl;
else if (a == b && a == c && a == d)
cout << "-1" << endl;
else {
if (c > d) {
for (int i = 1; i <= a - c; i += 1) cout << "4";
for (int i = 1; i <= c; i += 1) cout << "47";
for (int i = 1; i <= b - c; i += 1) cout << "7";
} else if (c < d) {
for (int i = 1; i <= d - 1; i += 1) {
cout << "74";
if (i == 1)
for (int i = 1; i <= a - d; i += 1) cout << "4";
}
for (int i = 1; i <= b - d + 1; i += 1) cout << "7";
cout << "4" << endl;
} else {
if (a > b) {
for (int i = 1; i <= a - c - 1; i += 1) cout << "4";
for (int i = 1; i <= c; i += 1) cout << "47";
for (int i = 1; i <= b - d; i += 1) cout << "7";
cout << "4";
} else if (a < b) {
if (a > max(c, d)) {
for (int i = 1; i <= a - max(c, d) - 1; i += 1) cout << "4";
for (int i = 1; i <= c; i += 1) cout << "47";
for (int i = 1; i <= b - d; i += 1) cout << "7";
cout << "4";
} else {
for (int i = 1; i <= d; i += 1) {
cout << "74";
if (a <= max(c, d) && i == d)
for (int i = 1; i <= b - d; i += 1) cout << "7";
}
}
} else if (a == b) {
for (int i = 1; i <= a - c - 1; i += 1) cout << "4";
for (int i = 1; i <= c; i += 1) cout << "47";
for (int i = 1; i <= b - c - 1; i += 1) cout << "7";
for (int i = 1; i <= d - c + 1; i += 1) cout << "74";
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b, long long modi) {
long long res = 1;
while (b) {
if (b % 2) res = (res * a) % modi;
b /= 2;
a = (a * a) % modi;
}
return res;
}
int dirx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int diry[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
long long n, k, sum = 0, ans = 0, cur = 0;
int a, b, c, d;
int pos(string &x, char ch) {
int i = 0;
if (ch == '4')
for (int i = 0; i < x.length(); i++)
if (x[i] == ch) return i;
for (i = x.length() - 1; i >= 0; i--) {
if (x[i] == ch) return i;
}
return 0;
}
int main() {
cin >> a >> b >> c >> d;
if (abs(c - d) > 1) {
cout << "-1";
return 0;
}
string x, y;
if (c == d) {
int p = a, q = b;
for (int i = 0; i < c; i++) {
x += "47";
p--;
q--;
}
x += '4';
p--;
if (p >= 0 && q >= 0) {
x.insert(pos(x, '4'), p, '4');
x.insert(pos(x, '7'), q, '7');
cout << x;
return 0;
}
p = a, q = b;
for (int i = 0; i < c; i++) {
y += "74";
p--;
q--;
}
y += '7';
q--;
if (p >= 0 && q >= 0) {
y.insert(pos(y, '4'), p, '4');
y.insert(pos(y, '7'), q, '7');
cout << y;
return 0;
}
cout << "-1";
} else if (c < d) {
int p = a, q = b;
for (int i = 0; i < d; i++) {
x += "74";
p--;
q--;
}
if (p >= 0 && q >= 0) {
x.insert(pos(x, '4'), p, '4');
x.insert(pos(x, '7'), q, '7');
cout << x;
return 0;
}
cout << "-1";
} else {
int p = a, q = b;
for (int i = 0; i < c; i++) {
x += "47";
p--;
q--;
}
if (p >= 0 && q >= 0) {
x.insert(pos(x, '4'), p, '4');
x.insert(pos(x, '7'), q, '7');
cout << x;
return 0;
}
cout << "-1";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline bool valid_put1(int a1, int a2, int a34) {
if (a1 < 0 || a2 < 0 || a34 < 0) return false;
return min(a1, a2) >= a34;
}
inline void put1(int a1, int a2, int a34) {
for (int i = 1; i <= a1 - a34; ++i) putchar('4');
for (int i = 1; i <= a34; ++i) putchar('4'), putchar('7');
for (int i = 1; i <= a2 - a34; ++i) putchar('7');
}
int main() {
int a1, a2, a3, a4;
scanf("%d%d%d%d", &a1, &a2, &a3, &a4);
if (a3 == a4 + 1) {
if (valid_put1(a1, a2, a3))
put1(a1, a2, a3);
else
printf("-1");
} else if (a3 == a4) {
if (valid_put1(a1 - 1, a2, a3)) {
put1(a1 - 1, a2, a3);
putchar('4');
} else if (valid_put1(a1, a2 - 1, a3)) {
putchar('7');
put1(a1, a2 - 1, a3);
} else
printf("-1");
} else if (a3 + 1 == a4) {
if (valid_put1(a1 - 1, a2 - 1, a3)) {
putchar('7');
put1(a1 - 1, a2 - 1, a3);
putchar('4');
} else
printf("-1");
} else
printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:167772160")
using namespace std;
const double pi = 2 * acos(0.0);
string ans, w;
int k1, k2, k3, k4, i, j, k, len, l1, l2;
bool OK() {
int l1 = 0, l2 = 0, l3 = 0, l4 = 0, i;
for (i = 0; i <= len - 1; ++i) {
if (ans[i] == '4') l1++;
if (ans[i] == '7') l2++;
if (i < len - 1) {
if (ans[i] == '4' && ans[i + 1] == '7') l3++;
if (ans[i] == '7' && ans[i + 1] == '4') l4++;
}
}
return (l1 == k1 && l2 == k2 && l3 == k3 && l4 == k4);
}
void pr() {
int i;
for (i = 0; i <= len - 1; ++i) cout << ans[i];
cout << endl;
}
int main() {
cin >> k1 >> k2 >> k3 >> k4;
len = k1 + k2;
ans = "";
l1 = l2 = 0;
for (i = 1; i <= k3; ++i) {
ans += "47";
l1++;
l2++;
}
w = "";
if (k3 == k4) {
bool ok;
if (l1 < k1)
ok = true;
else
ok = false;
if (ok) {
l1++;
for (i = 1; i <= k1 - l1; ++i) w += "4";
for (i = 1; i <= k3; ++i) w += "47";
for (i = 1; i <= k2 - l2; ++i) w += "7";
w += "4";
ans = w;
} else {
l2++;
w = "";
for (i = 1; i <= k1 - l1; ++i) w += "4";
w += "7";
for (i = 1; i <= k3; ++i) w += "47";
for (i = 1; i <= k2 - l2; ++i) w += "7";
ans = w;
}
} else if (k3 > k4) {
w = "";
for (i = 1; i <= k1 - l1; ++i) w += "4";
for (i = 1; i <= k3; ++i) w += "47";
for (i = 1; i <= k2 - l2; ++i) w += "7";
ans = w;
} else {
ans = "7" + ans;
l2++;
ans += "4";
l1++;
w = "7";
for (i = 1; i <= k1 - l1; ++i) w += "4";
for (i = 1; i <= k3; ++i) w += "47";
for (i = 1; i <= k2 - l2; ++i) w += "7";
w += "4";
ans = w;
}
if (OK())
pr();
else
cout << "-1" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
double const eps = 1e-10;
int const INF = 100000;
int const MOD = 1000003;
int const MAX = 1 << 17;
void out(char s[5], int k) {
for (int i = 0; i < k; ++i) printf("%s", s);
}
int main() {
int a1, a2, a3, a4;
scanf("%d%d%d%d", &a1, &a2, &a3, &a4);
if (abs(a3 - a4) > 1) {
cout << "-1";
return 0;
}
if (a3 > a4) {
if (a1 < a3 || a2 < a3) {
cout << "-1";
return 0;
}
out("4", a1 - a3 + 1);
out("74", a3 - 1);
out("7", a2 - a3 + 1);
return 0;
}
if (a3 < a4) {
if (a1 < a4 || a2 < a4) {
cout << "-1";
return 0;
}
out("7", 1);
out("4", a1 - a4 + 1);
out("74", a4 - 2);
out("7", a2 - a4 + 1);
out("4", 1);
return 0;
}
if (a1 >= a3 + 1 && a2 >= a3) {
out("4", a1 - a3);
out("74", a3 - 1);
out("7", 1 + a2 - a3);
out("4", 1);
return 0;
}
if (a1 >= a3 && a2 >= a3 + 1) {
out("7", 1);
out("4", 1 + a1 - a3);
out("74", a3 - 1);
out("7", a2 - a3);
return 0;
}
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
int a1, a2, a3, a4;
int main() {
int i, j, k, l, test, t = 1;
while (scanf("%d %d %d %d", &a1, &a2, &a3, &a4) == 4) {
int req1, req2, diff = a3 - a4;
if (diff < 0) diff = -diff;
if (diff > 1 || a1 < a3 || a2 < a4 || a2 < a3 || a1 < a4) {
puts("-1");
continue;
}
if (a3 == a4) {
if (a1 < a3 + 1) {
if (a2 - a3 <= 0) {
puts("-1");
continue;
}
for (i = 1; i <= a3; i++) printf("74");
for (i = 1; i <= a2 - a3; i++) printf("7");
puts("");
continue;
} else {
for (i = 1; i <= a1 - a3 - 1; i++) printf("4");
for (i = 1; i <= a3; i++) printf("47");
for (i = 1; i <= a2 - a3; i++) printf("7");
printf("4");
puts("");
continue;
}
}
if (a3 > a4) {
for (i = 1; i <= a1 - a3; i++) printf("4");
for (i = 1; i <= a3; i++) printf("47");
for (i = 1; i <= a2 - a3; i++) printf("7");
puts("");
}
if (a3 < a4) {
a4 -= 2;
a1 -= 2;
a2--;
printf("74");
for (i = 1; i <= a1 - a4; i++) printf("4");
for (i = 1; i <= a4; i++) printf("74");
for (i = 1; i <= a2 - a4; i++) printf("7");
puts("4");
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int i, j, n4, n7, n47, n74;
scanf("%d%d%d%d", &n4, &n7, &n47, &n74);
if (n4 + n7 <= n47 + n74 || n47 > n74 + 1 || n74 > n47 + 1 || n47 > n4 ||
n47 > n7 || n74 > n4 || n74 > n7) {
printf("-1\n");
return 0;
}
if (n47 == n74) {
if (n4 == n47) {
for (i = 0; i < n47; i++) {
printf("74");
}
for (i = 0; i < n7 - n47; i++) {
printf("7");
}
printf("\n");
return 0;
}
for (i = 0; i < n4 - n47 - 1; i++) {
printf("4");
}
for (i = 0; i < n47; i++) {
printf("47");
}
for (i = 0; i < n7 - n47; i++) {
printf("7");
}
printf("4\n");
return 0;
}
if (n47 == n74 + 1) {
if (n4 < n47 || n7 < n47) {
printf("-1\n");
return 0;
}
for (i = 0; i < n4 - n47; i++) {
printf("4");
}
for (i = 0; i < n47; i++) {
printf("47");
}
for (i = 0; i < n7 - n47; i++) {
printf("7");
}
printf("\n");
return 0;
}
if (n74 == n47 + 1) {
if (n4 < n74 || n7 < n74) {
printf("-1\n");
return 0;
}
printf("7");
for (i = 0; i < n4 - n47; i++) {
printf("4");
}
for (i = 0; i < n47 - 1; i++) {
printf("74");
}
for (i = 0; i < n7 - n74 + 1; i++) {
printf("7");
}
printf("4");
printf("\n");
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
int main(int argc, char** argv) {
using std::cin;
using std::cout;
std::vector<long> nums;
nums.reserve(4);
for (size_t i = 0; i < 4; i++) {
long t;
cin >> t;
nums.push_back(t);
}
if (std::abs(nums[2] - nums[3]) > 1) {
cout << -1;
return 0;
}
std::string answer;
answer.reserve(1000000);
size_t first4 = 0U, last7 = 0U;
if (nums[2] > nums[3]) {
for (long i = 0; i < nums[2]; ++i) answer += "47";
first4 = 0U;
last7 = 2 * nums[2] - 1;
nums[0] -= nums[2];
nums[1] -= nums[2];
} else if (nums[2] < nums[3]) {
for (long i = 0; i < nums[3]; ++i) answer += "74";
first4 = 1U;
last7 = 2 * nums[3] - 2;
nums[0] -= nums[3];
nums[1] -= nums[3];
} else {
if (nums[0] == nums[2]) {
for (long i = 0; i < nums[2]; ++i) answer += "74";
answer += "7";
first4 = 1U;
last7 = 2 * nums[2];
nums[0] -= nums[2];
nums[1] -= nums[2] + 1;
} else {
for (long i = 0; i < nums[2]; ++i) answer += "47";
answer += "4";
first4 = 0U;
last7 = 2 * nums[2] - 1;
nums[0] -= nums[2] + 1;
nums[1] -= nums[2];
}
}
if (nums[0] >= 0 && nums[1] >= 0) {
for (size_t i = 0; i < answer.size(); ++i) {
if (i == first4)
for (long j = 0; j < nums[0]; ++j) cout << "4";
if (i == last7)
for (long j = 0; j < nums[1]; ++j) cout << "7";
cout << answer[i];
}
} else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O500")
#pragma comment(linker, "/STACK:1677777216")
#pragma warning(default : 4)
using namespace std;
const double eps = 1e-12;
const int oo = 0x3F3F3F3F;
const long long ooLL = 0x3F3F3F3F3F3F3F3FLL;
const int MOD = 1000000007;
template <typename T>
T sqr(T x) {
return x * x;
}
template <typename T>
void debpr(const T &);
template <typename T1, typename T2>
void debpr(const pair<T1, T2> &);
template <typename T1, typename T2>
void debpr(const vector<T1, T2> &);
template <typename T>
void debpr(const set<T> &);
template <typename T1, typename T2>
void debpr(const map<T1, T2> &);
template <typename T>
void prcont(T be, T en, const string &st, const string &fi, const string &mi) {
debpr(st);
bool ft = 0;
while (be != en) {
if (ft) debpr(mi);
ft = 1;
debpr(*be);
++be;
}
debpr(fi);
}
template <typename T>
void debpr(const T &a) {}
template <typename T1, typename T2>
void debpr(const pair<T1, T2> &p) {
debpr("(");
debpr(p.first);
debpr(", ");
debpr(p.second);
debpr(")");
}
template <typename T1, typename T2>
void debpr(const vector<T1, T2> &a) {
prcont(a.begin(), a.end(), "[", "]", ", ");
}
template <typename T>
void debpr(const set<T> &a) {
prcont(a.begin(), a.end(), "{", "}", ", ");
}
template <typename T1, typename T2>
void debpr(const map<T1, T2> &a) {
prcont(a.begin(), a.end(), "{", "}", ", ");
}
void deb(){};
template <typename T1>
void deb(const T1 &t1) {
debpr(t1);
debpr('\n');
}
template <typename T1, typename T2>
void deb(const T1 &t1, const T2 &t2) {
debpr(t1);
debpr(' ');
debpr(t2);
debpr('\n');
}
template <typename T1, typename T2, typename T3>
void deb(const T1 &t1, const T2 &t2, const T3 &t3) {
debpr(t1);
debpr(' ');
debpr(t2);
debpr(' ');
debpr(t3);
debpr('\n');
}
template <typename T1, typename T2, typename T3, typename T4>
void deb(const T1 &t1, const T2 &t2, const T3 &t3, const T4 &t4) {
debpr(t1);
debpr(' ');
debpr(t2);
debpr(' ');
debpr(t3);
debpr(' ');
debpr(t4);
debpr('\n');
}
const double PI = acos(-1.);
long long Round(double x) { return x < 0 ? x - .5 : x + .5; }
template <typename T>
void ass(bool v, const T &x, string m = "Fail") {
if (!v) {
deb(m);
deb(x);
throw;
}
}
int main() {
void run();
run();
return 0;
}
char s[1 << 21];
int a1, a2, a3, a4;
bool go(bool re) {
int b1, b2, p = 0;
if (a3 == a4)
b1 = a1 - a3 - 1, b2 = a2 - a3;
else if (a3 == a4 + 1)
b1 = a1 - a3, b2 = a2 - a3;
else
return 0;
if (b1 < 0 || b2 < 0) return 0;
if (a3 == 0) {
if (a1 && a2) return 0;
for (int i = (0), _b(a1); i < _b; ++i) s[p++] = '4', --a1;
for (int i = (0), _b(a2); i < _b; ++i) s[p++] = '7', --a2;
}
while (a3) {
static int ft = 0;
int c1, c2;
if (re) {
c1 = a3 == 1 ? b1 : 0;
c2 = ft ? 0 : b2;
} else {
c1 = ft ? 0 : b1;
c2 = a3 == 1 ? b2 : 0;
}
--a3;
if (ft) --a4;
ft = 1;
if (re && !a3 && a4) c1 = 0;
for (int it = (0), _b(1 + c1); it < _b; ++it) s[p++] = '4', --a1;
for (int it = (0), _b(1 + c2); it < _b; ++it) s[p++] = '7', --a2;
}
if (a4) {
a4 -= bool(a1);
while (a1) s[p++] = '4', --a1;
}
if (a1 || a2 || a3 || a4) return 0;
return 1;
}
void run() {
scanf("%d %d %d %d", &a1, &a2, &a3, &a4);
vector<string> rs;
if (go(0)) rs.push_back(s);
swap(a1, a2);
swap(a3, a4);
if (go(1)) {
for (int i = (0), _b(strlen(s)); i < _b; ++i)
s[i] = s[i] == '4' ? '7' : '4';
rs.push_back(s);
}
sort((rs).rbegin(), (rs).rend());
rs.push_back("-1");
puts(rs[0].c_str());
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const double err = 1e-12;
const double PI = 3.141592653589793;
const int N = 1e5 + 5;
void no() {
cout << -1 << endl;
exit(0);
}
void solve() {
int a1, a2, a3, a4;
string res = "";
cin >> a1 >> a2 >> a3 >> a4;
if (abs(a3 - a4) > 1) no();
if (a3 > a4) {
if (min(a1, a2) < a3) no();
int rem4 = a1 - a3, rem7 = a2 - a3;
while (rem4--) {
res += '4';
}
while (a3--) {
res += "47";
}
while (rem7--) {
res += '7';
}
cout << res << endl;
return;
} else if (a3 < a4) {
if (min(a1, a2) < a4) no();
int rem4 = a1 - a4, rem7 = a2 - a4;
res += '7';
while (rem4--) res += '4';
res += '4';
a4--;
while (a4 > 1) {
res += "74";
a4--;
}
res += '7';
while (rem7--) res += '7';
res += '4';
cout << res << endl;
} else {
if (max(a1, a2) < a3 + 1 || min(a1, a2) < a3) no();
if (a1 == a3) {
int rem7 = a2 - (a3 + 1);
while (a3--) res += "74";
res += '7';
while (rem7--) res += '7';
cout << res << endl;
} else {
int rem4 = a1 - (a3 + 1), rem7 = a2 - a3;
while (rem4--) res += '4';
while (a3--) res += "47";
while (rem7--) res += '7';
res += '4';
cout << res << endl;
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int T = 1;
while (T--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char x[1010101], y[1010101];
int main() {
int a, b, c, d;
while (~scanf("%d%d%d%d", &a, &b, &c, &d)) {
if (abs(c - d) > 1) {
puts("-1");
continue;
}
if (c > a || d > b || c > b || d > a) {
puts("-1");
continue;
}
if (c == 0) {
printf("74");
a--, b--;
while (a--) putchar('4');
while (b--) putchar('7');
putchar('\n');
continue;
}
if (c == d) {
if (a == c && b == c) {
puts("-1");
continue;
}
if (a == c) {
putchar('7');
b--;
for (int i = 0; i < c; i++) printf("47"), a--, b--;
while (b--) putchar('7');
putchar('\n');
continue;
}
int p = a - c;
for (int i = 0; i < p; i++) putchar('4'), a--;
for (int i = 1; i < c; i++) printf("74"), b--, a--;
while (b--) putchar('7');
putchar('4');
putchar('\n');
continue;
}
if (c > d) {
int p = a - c + 1;
for (int i = 0; i < p; i++) putchar('4'), a--;
for (int i = 1; i < c; i++) printf("74"), b--, a--;
while (b--) putchar('7');
putchar('\n');
continue;
}
if (c < d) {
putchar('7');
b--;
int p = a - c;
while (p--) putchar('4');
for (int i = 1; i < c; i++) printf("74"), b--, a--;
while (b--) putchar('7');
putchar('4');
putchar('\n');
continue;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x, y;
int p, q, i;
cin >> a >> b >> x >> y;
if (abs(x - y) > 1) {
printf("-1\n");
return 0;
}
if (x == y) {
if (a >= x && b >= x && max(a, b) >= x + 1) {
if (a - 1 >= x) {
p = a - x - 1;
q = b - x;
printf("4");
for (; p; p--) printf("4");
i = 1;
} else {
p = a - y;
q = b - y - 1;
i = 0;
printf("7");
}
} else {
printf("-1\n");
return 0;
}
} else {
if (a >= max(x, y) && b >= max(x, y)) {
if (x < y) {
p = a - y;
q = b - y;
i = 0;
printf("7");
} else {
p = a - x;
q = b - x;
printf("4");
for (; p; p--) printf("4");
i = 1;
}
} else {
printf("-1\n");
return 0;
}
}
for (x = x + y; x; x--, i = (i + 1) % 2) {
if (i == 0) {
printf("4");
for (; p; p--) printf("4");
} else {
printf("7");
for (; q && x - i <= 1; q--) printf("7");
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a1, a2, a3, a4;
vector<pair<int, int> > v;
int min4, min7, f;
void output() {
if (a1 != 0 || a2 != 0 || a3 != 0 || a4 != 0) {
cout << -1;
exit(0);
}
for (size_t i = 0; i < v.size(); i++)
while (v[i].second) {
cout << v[i].first;
v[i].second--;
}
}
int main() {
cin >> a1 >> a2 >> a3 >> a4;
if (abs(a3 - a4) > 1) {
cout << -1;
exit(0);
}
if (a3 > a4) {
f = 4;
min4 = a3;
min7 = a3;
if (a1 < min4 || a2 < min7) {
cout << -1;
exit(0);
}
for (int i = 1; i <= a3; i++) {
v.push_back(make_pair(4, 1));
v.push_back(make_pair(7, 1));
a1--;
a2--;
if (i > 1) a4--;
}
a3 = 0;
while (a1) {
v[0].second++;
a1--;
}
while (a2) {
v[v.size() - 1].second++;
a2--;
}
} else if (a4 > a3) {
f = 7;
min4 = a4;
min7 = a4;
if (a1 < min4 || a2 < min7) {
cout << -1;
exit(0);
}
for (int i = 1; i <= a4; i++) {
v.push_back(make_pair(7, 1));
v.push_back(make_pair(4, 1));
a1--;
a2--;
if (i > 1) a3--;
}
a4 = 0;
while (a1) {
v[1].second++;
a1--;
}
while (a2) {
v[v.size() - 2].second++;
a2--;
}
} else {
f = 4;
min4 = a3 + 1;
min7 = a4;
if (a1 < min4 || a2 < min7) {
f = 7;
min4 = a3;
min7 = a4 + 1;
}
if (a1 < min4 || a2 < min7) {
cout << -1;
exit(0);
}
if (f == 4) {
for (int i = 1; i <= a3; i++) {
v.push_back(make_pair(4, 1));
v.push_back(make_pair(7, 1));
a1--;
a2--;
if (i > 1) a4--;
}
a3 = 0;
v.push_back(make_pair(4, 1));
a1--;
a4--;
while (a1) {
v[0].second++;
a1--;
}
while (a2) {
v[v.size() - 2].second++;
a2--;
}
} else {
for (int i = 1; i <= a4; i++) {
v.push_back(make_pair(7, 1));
v.push_back(make_pair(4, 1));
a1--;
a2--;
if (i > 1) a3--;
}
a4 = 0;
v.push_back(make_pair(7, 1));
a2--;
a3--;
while (a1) {
v[1].second++;
a1--;
}
while (a2) {
v[v.size() - 1].second++;
a2--;
}
}
}
output();
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:64000000")
using namespace std;
const int INF = (int)1E9;
const long long INF64 = (long long)1E18;
const long double EPS = 1E-9;
const long double PI = 3.1415926535897932384626433832795;
int a4, a7, a47, a74;
string ans;
void check(const string &s) {
int A4 = a4, A7 = a7, A47 = a47, A74 = a74;
for (int i = 0; i < (int)(s.size()); i++)
if (s[i] == '4')
A4--;
else
A7--;
for (int i = 0; i < (int)(s.size() - 1); i++) {
if (s[i] == '4' && s[i + 1] == '7') A47--;
if (s[i] == '7' && s[i + 1] == '4') A74--;
}
if (A4 != 0 || A7 != 0 || A47 != 0 || A74 != 0) throw;
}
bool solve(bool f, int a4, int a7, int a47, int a74) {
if (abs(a47 - a74) > 1) return false;
string s = "";
if (a47 > a74)
for (int i = 0; i < (int)(a47); i++) s += "47";
else if (a47 < a74)
for (int i = 0; i < (int)(a74); i++) s += "74";
else if (f) {
for (int i = 0; i < (int)(a47); i++) s += "47";
if (a47 == a74 && !s.empty()) s += "4";
} else {
for (int i = 0; i < (int)(a74); i++) s += "74";
if (a47 == a74 && !s.empty()) s += "7";
}
for (int i = 0; i < (int)(s.size()); i++) {
if (s[i] == '4') a4--;
if (s[i] == '7') a7--;
}
if (a4 < 0 || a7 < 0) return false;
for (int i = 0; i < (int)(s.size()); i++)
if (s[i] == '4' && a4 > 0) {
s.insert(i, string(a4, '4'));
a4 = 0;
break;
}
for (int i = (int)(s.size()) - 1; i >= 0; i--)
if (s[i] == '7' && a7 > 0) {
s.insert(i, string(a7, '7'));
a7 = 0;
break;
}
if (a4 != 0 || a7 != 0) return false;
if (ans.empty() || ans > s) ans = s;
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin >> a4 >> a7 >> a47 >> a74;
bool res = false;
res |= solve(true, a4, a7, a47, a74);
res |= solve(false, a4, a7, a47, a74);
if (!res) ans = "-1";
printf("%s\n", ans.c_str());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int bk1[1005], bk2[1005], ans = 0;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(c - d) > 1)
cout << "-1";
else {
if (c - d == 1) {
if (a < c || b < c) return cout << -1, 0;
for (int i = 1; i <= a - c; i++) cout << "4";
for (int i = 1; i <= c; i++) cout << "47";
for (int i = 1; i <= b - c; i++) cout << "7";
} else if (d - c == 1) {
if (a < d || b < d) return cout << -1, 0;
cout << "74";
for (int i = 1; i <= a - d; i++) cout << "4";
for (int i = 1; i <= d - 2; i++) cout << "74";
for (int i = 1; i <= b - d + 1; i++) cout << "7";
cout << "4";
} else {
if (a < c || b < c) return cout << -1, 0;
if (a >= c + 1 && b >= c + 1) {
for (int i = 1; i <= a - c - 1; i++) cout << "4";
for (int i = 1; i <= c; i++) cout << "47";
for (int i = 1; i <= b - c; i++) cout << "7";
cout << "4";
} else if (b == c && a > c) {
for (int i = 1; i <= a - c - 1; i++) cout << "4";
for (int i = 1; i <= c; i++) cout << "47";
cout << "4";
} else if (a == c && b > c) {
for (int i = 1; i <= c; i++) cout << "74";
for (int i = 1; i <= b - c; i++) cout << "7";
} else
cout << -1;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
std::istream& operator>>(std::istream& in, pair<T1, T2>& a) {
in >> a.first >> a.second;
return in;
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& out, pair<T1, T2>& a) {
out << a.first << " " << a.second;
return out;
}
long long n;
long long a, b, c, d;
string s;
void solve() {
cin >> a >> b >> c >> d;
if (c > a || d > b || c > b || d > a || (c == d && (c == max(a, b))) ||
c > d + 1 || d > c + 1) {
cout << -1;
return;
}
if (d > c) {
cout << 7;
d--;
b--;
}
for (long long i = 0; i < c; i++) {
s.push_back('4');
s.push_back('7');
b--;
a--;
}
for (long long i = 0; i < b; i++) {
s.push_back('7');
}
if (c == d) {
if (a) {
s.push_back('4');
a--;
} else {
cout << 7;
s.pop_back();
}
}
for (long long i = 0; i < a; i++) {
cout << 4;
}
cout << s;
}
signed main() {
ios_base::sync_with_stdio(false);
long long t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string res = "";
int main() {
int a1, a2, a3, a4;
cin >> a1 >> a2 >> a3 >> a4;
if (((a3 - a4 > 0) ? a3 - a4 : -(a3 - a4)) > 1) {
cout << -1 << endl;
return 0;
}
int cnt1 = 0, cnt2 = 0;
if (a3 >= a4) {
for (int i = (0); i < (a3); ++i) {
res += '4';
res += '7';
cnt1++;
cnt2++;
}
if (a3 == a4) {
if (cnt1 < a1) {
cnt1++;
res += '4';
} else {
res = '7' + res;
cnt2++;
}
}
} else
for (int i = (0); i < (a4); ++i) {
res += '7';
res += '4';
cnt1++;
cnt2++;
}
if ((cnt1 > a1) || (cnt2 > a2)) {
cout << -1 << endl;
return 0;
}
int first = 2000000000, last = -1;
for (int i = (0); i < (res.size()); ++i) {
if (res[i] == '4')
first = ((first < i) ? (first) : (i));
else
last = i;
}
char c1 = '4', c2 = '7';
for (int i = (0); i < (res.size()); ++i) {
if (i == first)
for (int j = (0); j < (a1 - cnt1); ++j) printf("%c", c1);
printf("%c", res[i]);
if (i == last)
for (int j = (0); j < (a2 - cnt2); ++j) printf("%c", c2);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, l, m, n, x, y, z, a1, a2, a3, a4, b, r;
scanf("%d", &a1);
scanf("%d", &a2);
scanf("%d", &a3);
scanf("%d", &a4);
if (abs(a3 - a4) > 1) {
printf("-1\n");
return 0;
}
if (abs(a3 - a4) == 0) {
if (a1 >= a3 + 1 && a2 >= a3) {
while (a1 > a3) {
printf("4");
a1--;
}
while (a1 > 1) {
printf("7");
a2--;
printf("4");
a1--;
}
while (a2 > 0) {
printf("7");
a2--;
}
while (a1 > 0) {
printf("4");
a1--;
}
printf("\n");
return 0;
} else if (a1 >= a3 && a2 >= a3 + 1) {
if (a2 > 0) {
printf("7");
a2--;
}
while (a1 > a3) {
printf("4");
a1--;
}
while (a3 > 0) {
printf("4");
a1--;
printf("7");
a2--;
a3--;
}
while (a2 > 0) {
printf("7");
a2--;
}
printf("\n");
return 0;
} else {
printf("-1\n");
return 0;
}
}
if (a3 - a4 == 1) {
if (a1 >= a3 && a2 >= a3) {
while (a1 > a3) {
printf("4");
a1--;
}
while (a3 > 0) {
printf("4");
a1--;
printf("7");
a2--;
a3--;
}
while (a2 > 0) {
printf("7");
a2--;
}
printf("\n");
return 0;
} else {
printf("-1\n");
return 0;
}
}
if (a4 - a3 == 1) {
if (a1 >= a4 && a2 >= a4) {
if (a2 > 0) {
printf("7");
a2--;
}
while (a1 > a4) {
printf("4");
a1--;
}
while (a4 > 1) {
printf("4");
a1--;
printf("7");
a2--;
a4--;
}
while (a2 > 0) {
printf("7");
a2--;
}
if (a1 > 0) {
printf("4");
}
printf("\n");
return 0;
} else {
printf("-1\n");
return 0;
}
}
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
#pragma GCC optimize("unroll-loops")
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a1, a2, a3, a4;
cin >> a1 >> a2 >> a3 >> a4;
if (abs(a3 - a4) > 1) {
cout << -1;
return 0;
}
if (a3 == a4) {
if (a3 + 1 <= a1 and a3 <= a2) {
a1 -= a3 + 1;
a2 -= a3;
while (a1--) cout << 4;
cout << 4;
while (a3--) {
cout << 7;
if (a3 == 0)
while (a2--) cout << 7;
cout << 4;
}
} else if (a3 + 1 <= a2 and a3 <= a1) {
a2 -= a3 + 1;
a1 -= a3;
cout << 7;
while (a1--) cout << 4;
while (a3--) cout << "47";
while (a2--) cout << 7;
} else
cout << -1;
} else if (a3 - a4 == 1) {
if (a3 <= a1 and a3 <= a2) {
a1 -= a3;
a2 -= a3;
while (a1--) cout << 4;
while (a3--) cout << "47";
while (a2--) cout << 7;
} else
cout << -1;
} else {
if (a4 <= a1 and a4 <= a2) {
a1 -= a4;
a2 -= a4;
cout << 7;
while (a1--) cout << 4;
while (a3--) cout << "47";
while (a2--) cout << 7;
cout << 4;
} else
cout << -1;
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
int a1, a2, a3, a4;
int abs(int x) { return x > 0 ? x : -x; }
int main() {
while (~scanf("%d%d%d%d", &a1, &a2, &a3, &a4)) {
if (abs(a3 - a4) > 1) {
printf("-1\n");
continue;
}
if (a3 > a1 || a3 > a2 || a4 > a1 || a4 > a2) {
printf("-1\n");
continue;
}
if (a3 == a4) {
if (a1 > a3) {
for (int i = 0; i < (a1 - a3 - 1); i++) printf("4");
for (int i = 0; i < a3; i++) printf("47");
for (int i = 0; i < (a2 - a3); i++) printf("7");
printf("4\n");
continue;
}
if (a2 > a3) {
for (int i = 0; i < a3; i++) printf("74");
for (int i = 0; i < (a2 - a3); i++) printf("7");
printf("\n");
continue;
}
printf("-1\n");
continue;
}
if (a3 > a4) {
for (int i = 0; i < (a1 - a3); i++) printf("4");
for (int i = 0; i < a3; i++) printf("47");
for (int i = 0; i < (a2 - a3); i++) printf("7");
printf("\n");
continue;
}
if (a3 < a4) {
printf("7");
for (int i = 0; i < (a1 - a4 + 1); i++) printf("4");
for (int i = 0; i < (a4 - 2); i++) printf("74");
for (int i = 0; i < (a2 - a4 + 1); i++) printf("7");
printf("4\n");
continue;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000007;
list<char> u;
bool gao(int a1, int a2, int a3, int a4) {
if (a3 == a4) {
if (a1 >= a3 + 1 && a2 >= a3) {
for (int i = 0; i < a3; i++) {
u.push_back('4');
a1--;
u.push_back('7');
a2--;
}
for (int i = 0; i < a2; i++) u.push_back('7');
u.push_back('4');
a1--;
for (int i = 0; i < a1; i++) u.push_front('4');
return true;
}
if (a1 >= a3 && a2 >= a3 + 1) {
for (int i = 0; i < a3; i++) {
u.push_back('4');
a1--;
u.push_back('7');
a2--;
}
for (int i = 0; i < a1; i++) u.push_front('4');
u.push_front('7');
a2--;
for (int i = 0; i < a2; i++) u.push_back('7');
return true;
}
return false;
}
if (a3 == a4 + 1) {
if (a1 >= a3 && a2 >= a3) {
for (int i = 0; i < a3; i++) {
u.push_back('4');
a1--;
u.push_back('7');
a2--;
}
for (int i = 0; i < a2; i++) u.push_back('7');
for (int i = 0; i < a1; i++) u.push_front('4');
return true;
}
return false;
}
if (a3 + 1 == a4) {
if (a1 >= a4 && a2 >= a4) {
for (int i = 0; i < a3; i++) {
u.push_back('4');
a1--;
u.push_back('7');
a2--;
}
for (int i = 1; i < a1; i++) u.push_front('4');
u.push_front('7');
a2--;
for (int i = 0; i < a2; i++) u.push_back('7');
u.push_back('4');
return true;
}
return false;
}
return false;
}
int random(int x) { return unsigned(rand() << 15 ^ rand()) % x; }
int main() {
int a1, a2, a3, a4;
scanf("%d%d%d%d", &a1, &a2, &a3, &a4);
if (!gao(a1, a2, a3, a4)) return puts("-1") & 0;
for (auto c : u) putchar(c);
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 123;
const int INF = (int)1e9 + 123;
const double eps = 1e-6;
int a, b, c, d;
void check_possibility() {
if (abs(c - d) > 1 || a < c || b < d) {
cout << -1;
exit(0);
}
}
void check() {
if (a < 0 || b < 0) {
cout << -1;
exit(0);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> a >> b >> c >> d;
check_possibility();
if (c > d) {
a -= c;
b -= c;
check();
for (int i = 1; i <= a; i++) {
cout << 4;
}
for (int i = 1; i <= c; i++) {
cout << 47;
}
for (int i = 1; i <= b; i++) {
cout << 7;
}
return 0;
}
if (c == d) {
a -= c + 1;
b -= c;
if (a == -1) {
a++;
b--;
check();
cout << 74;
--d;
for (int i = 1; i <= a; i++) {
cout << 4;
}
for (int i = 1; i < d; i++) {
cout << 74;
}
if (d) cout << 74;
cout << 7;
for (int i = 1; i <= b; i++) {
cout << 7;
}
return 0;
}
check();
for (int i = 1; i <= a; i++) {
cout << 4;
}
for (int i = 1; i <= c; i++) {
cout << 47;
}
for (int i = 1; i <= b; i++) {
cout << 7;
}
cout << 4;
return 0;
} else {
a -= d;
b -= d;
check();
cout << 74;
--d;
for (int i = 1; i <= a; i++) {
cout << 4;
}
for (int i = 1; i < d; i++) {
cout << 74;
}
for (int i = 1; i <= b; i++) {
cout << 7;
}
if (d)
;
cout << 74;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, a3, a4;
cin >> a1 >> a2 >> a3 >> a4;
if (abs(a3 - a4) > 1) {
cout << "-1";
return 0;
}
if (a1 < max(a3, a4) || a2 < max(a3, a4)) {
cout << "-1";
return 0;
}
if (a1 == a2 && a1 == a3 && a1 == a4) {
cout << "-1";
return 0;
}
vector<int> res;
if (a3 == a4) {
if (a1 == a3) {
res.push_back(7);
for (int(i) = (0); (i) < (a3); ++(i)) {
res.push_back(4);
res.push_back(7);
}
for (int(i) = (0); (i) < (a2 - a3 - 1); ++(i)) res.push_back(7);
} else {
for (int(i) = (0); (i) < (a1 - a3 - 1); ++(i)) res.push_back(4);
for (int(i) = (0); (i) < (a3); ++(i)) {
res.push_back(4);
res.push_back(7);
}
for (int(i) = (0); (i) < (a2 - a4); ++(i)) res.push_back(7);
res.push_back(4);
}
}
if (a3 == a4 + 1) {
for (int(i) = (0); (i) < (a1 - a3); ++(i)) res.push_back(4);
for (int(i) = (0); (i) < (a3); ++(i)) {
res.push_back(4);
res.push_back(7);
}
for (int(i) = (0); (i) < (a2 - a4 - 1); ++(i)) res.push_back(7);
}
if (a3 == a4 - 1) {
res.push_back(7);
for (int(i) = (0); (i) < (a1 - a3); ++(i)) res.push_back(4);
for (int(i) = (0); (i) < (a3 - 1); ++(i)) {
res.push_back(7);
res.push_back(4);
}
for (int(i) = (0); (i) < (a2 - a4 + 1); ++(i)) res.push_back(7);
res.push_back(4);
}
for (int(i) = (0); (i) < (res.size()); ++(i)) cout << res[i];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a4, a7, a47, a74;
cin >> a4 >> a7 >> a47 >> a74;
if (a47 == a74) {
long long x = a4 - a47 - 1;
long long y = a7 - a47;
if (x < 0 or y < 0) {
x = a4 - a47;
y = a7 - a47 - 1;
if (x < 0 or y < 0)
cout << "-1";
else {
cout << "74";
while (x--) cout << "4";
a74--;
while (a74--) cout << "74";
cout << "7";
while (y--) cout << "7";
}
} else {
while (x--) cout << "4";
while (a47--) cout << "47";
while (y--) cout << "7";
cout << "4";
}
} else if (a47 == a74 + 1) {
long long x = a4 - a47;
long long y = a7 - a47;
if (x < 0 or y < 0)
cout << "-1";
else {
while (x--) cout << "4";
while (a47--) cout << "47";
while (y--) cout << "7";
}
} else if (a47 == a74 - 1) {
long long x = a4 - a74;
long long y = a7 - a74;
if (x < 0 or y < 0)
cout << "-1";
else {
cout << "74";
while (x--) cout << "4";
a74 -= 2;
while (a74--) cout << "74";
while (y--) cout << "7";
cout << "74";
}
} else
cout << "-1";
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int a1, a2, a3, a4, type = 0;
cin >> a1 >> a2 >> a3 >> a4;
a4 = a4 - a3 + 1, a2 -= a3, a1 -= a3;
if (a4 == 2)
a1--, a2--, type = 3;
else if (a4 == 1) {
if (a1)
a1--, type = 1;
else
a2--, type = 2;
}
if (a1 < 0 || a2 < 0 || a4 > 2 || a4 < 0) return cout << -1 << endl, 0;
if (type == 3 || type == 2) cout << '7';
for (int i = 0; i < a1; i++) cout << '4';
for (int i = 0; i < a3; i++) cout << "47";
for (int i = 0; i < a2; i++) cout << '7';
if (type == 1 || type == 3) cout << '4';
}
|
#include <bits/stdc++.h>
using namespace std;
std::vector<long long int> v, ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int a1, a2, a3, a4, i;
cin >> a1 >> a2 >> a3 >> a4;
if (abs(a3 - a4) > 1) {
cout << "-1\n";
return 0;
}
long long int x = 0, y = 0;
if (a3 == a4) {
if (a1 >= a3 + 1) {
for (i = 0; i < a3; i++) {
v.push_back(47);
x++;
y++;
}
v.push_back(4);
x++;
} else {
for (i = 0; i < a3; i++) {
v.push_back(74);
x++;
y++;
}
v.push_back(7);
y++;
}
} else {
if (a3 > a4) {
for (i = 0; i < a3; i++) {
v.push_back(47);
x++;
y++;
}
} else {
for (i = 0; i < a4; i++) {
v.push_back(74);
x++;
y++;
}
}
}
if (x > a1 || y > a2) {
cout << "-1\n";
return 0;
}
long long int p = v.size();
long long int lst = -1;
for (i = 0; i < p; i++) {
if (v[i] == 47 || v[i] == 7 || v[i] == 74) lst = i;
}
for (i = 0; i < p; i++) {
if (v[i] == 4) {
while (a1 > x) {
cout << "4";
x++;
}
cout << v[i];
}
if (v[i] == 47) {
while (a1 > x) {
cout << "4";
x++;
}
cout << v[i];
if (lst == i) {
while (a2 > y) {
cout << "7";
y++;
}
}
}
if (v[i] == 74) {
if (lst == i) {
while (a2 > y) {
cout << "7";
y++;
}
}
cout << v[i];
while (a1 > x) {
cout << "4";
x++;
}
}
if (v[i] == 7) {
cout << v[i];
if (lst == i) {
while (a2 > y) {
cout << "7";
y++;
}
}
}
}
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a1, a2, a3, a4;
int i, j, k, pre;
int main() {
scanf("%d%d%d%d", &a1, &a2, &a3, &a4);
if (max(a3, a4) > a1 || max(a3, a4) > a2 || abs(a4 - a3) > 1) {
puts("-1");
return 0;
}
if (a3 > a4) {
int f4 = a1 - a3, b7 = a2 - a3;
for (i = 0; i < f4; i++) putchar('4');
for (i = 0; i < a3; i++) printf("47");
for (i = 0; i < b7; i++) putchar('7');
} else if (a4 > a3) {
int f4 = a1 - a4, b7 = a2 - a4;
putchar('7');
for (i = 0; i < f4; i++) putchar('4');
for (i = 0; i < a3; i++) printf("47");
for (i = 0; i < b7; i++) putchar('7');
putchar('4');
} else {
int f4 = a1 - a3, b7 = a2 - a4 + 1;
if (f4 == 0) {
if (a2 == a3) {
puts("-1");
return 0;
}
for (i = 0; i < a3; i++) printf("74");
for (i = 0; i < a2 - a3; i++) putchar('7');
} else {
for (i = 0; i < f4; i++) putchar('4');
for (i = 1; i < a3; i++) printf("74");
for (i = 0; i < b7; i++) putchar('7');
putchar('4');
}
}
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d;
int main() {
cin >> a >> b >> c >> d;
if (c == d) {
if (a >= c + 1 && b >= c) {
for (int i = 0; i < a - c - 1; i++) putchar('4');
for (int i = 0; i < c; i++) putchar('4'), putchar('7');
for (int i = 0; i < b - c; i++) putchar('7');
for (int i = 0; i < 1; i++) putchar('4');
} else if (a >= c && b >= c + 1) {
for (int i = 0; i < 1; i++) putchar('7'), putchar('4');
for (int i = 0; i < a - c; i++) putchar('4');
for (int i = 0; i < c - 1; i++) putchar('7'), putchar('4');
for (int i = 0; i < b - c; i++) putchar('7');
} else
cout << -1 << endl;
} else if (c == d + 1) {
if (a >= c && b >= c) {
for (int i = 0; i < a - d - 1; i++) putchar('4');
for (int i = 0; i < d; i++) putchar('4'), putchar('7');
for (int i = 0; i < 1; i++) putchar('4');
for (int i = 0; i < b - d; i++) putchar('7');
} else
cout << -1 << endl;
} else if (d == c + 1) {
if (a >= d && b >= d) {
for (int i = 0; i < 1; i++) putchar('7'), putchar('4');
for (int i = 0; i < a - c - 1; i++) putchar('4');
for (int i = 0; i < c - 1; i++) putchar('7'), putchar('4');
for (int i = 0; i < b - c; i++) putchar('7');
for (int i = 0; i < 1; i++) putchar('4');
} else
cout << -1 << endl;
} else
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
static const double EPS = 1e-6;
const long double pi = acos(-1.0);
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1, 0},
dy[] = {1, 0, -1, 0, 1, -1, 1, -1, 0};
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
string ans;
if (c == d) {
string add;
if (a > c) {
ans = "4";
add = "74";
--a;
} else {
ans = "7";
add = "47";
--b;
}
for (int i = 0; i < (int)(c); ++i) {
ans += add;
--a, --b;
}
} else if (c == d + 1) {
for (int i = 0; i < (int)(c); ++i) ans += "47";
a -= c;
b -= c;
} else if (d == c + 1) {
for (int i = 0; i < (int)(d); ++i) ans += "74";
a -= d;
b -= d;
} else {
cout << -1 << endl;
return 0;
}
if (a < 0 || b < 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < (int)((int(ans.size()))); ++i) {
if (ans[i] == '4' && i < 2)
for (int j = 0; j < (int)(a); ++j) cout << '4';
if (ans[i] == '7' && i + 2 >= (int(ans.size())))
for (int j = 0; j < (int)(b); ++j) cout << '7';
cout << ans[i];
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[11];
int main() {
for (int i = 0; i < 4; i++) scanf("%d", a + i);
if (min(a[0], a[1]) < max(a[2], a[3])) {
puts("-1");
return 0;
}
if (abs(a[2] - a[3]) > 1) {
puts("-1");
return 0;
}
if (a[2] > a[3]) {
for (int i = 0; i < a[0] - a[2]; i++) putchar('4');
for (int i = 0; i < a[2]; i++) putchar('4'), putchar('7');
for (int i = 0; i < a[1] - a[2]; i++) putchar('7');
} else if (a[3] > a[2]) {
putchar('7');
for (int i = 0; i < a[0] - a[2]; i++) putchar('4');
for (int i = 0; i < a[2] - 1; i++) putchar('7'), putchar('4');
for (int i = 0; i < a[1] - a[2]; i++) putchar('7');
putchar('4');
} else {
if (a[0] > a[2]) {
for (int i = 0; i < a[0] - a[2]; i++) putchar('4');
for (int i = 0; i < a[2] - 1; i++) putchar('7'), putchar('4');
for (int i = 0; i < a[1] - a[2] + 1; i++) putchar('7');
putchar('4');
} else if (a[1] > a[2]) {
for (int i = 0; i < a[2]; i++) putchar('7'), putchar('4');
for (int i = 0; i < a[1] - a[2]; i++) putchar('7');
} else {
puts("-1");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char f[5000000];
int e[5000000];
int main() {
int a, b, c, d, i;
scanf("%d%d%d%d", &a, &b, &c, &d);
if (abs(c - d) > 1) {
puts("-1");
return 0;
}
if (min(a, b) < max(c, d)) {
puts("-1");
return 0;
}
if (c == d + 1) {
for (i = 1; i <= c; ++i) {
f[i + i - 1] = 4;
f[i + i] = 7;
}
e[1] = a - c;
e[c + c] = b - c;
} else if (c + 1 == d) {
for (i = 1; i <= d; ++i) {
f[i + i - 1] = 7;
f[i + i] = 4;
}
e[d + d - 1] = b - d;
e[2] = a - d;
} else if (max(a, b) <= c) {
puts("-1");
return 0;
} else if (a >= c + 1) {
for (i = 1; i <= 2 * c + 1; ++i) {
if (i & 1)
f[i] = 4;
else
f[i] = 7;
}
e[1] = a - c - 1;
e[c + c] = b - c;
} else {
for (i = 1; i <= 2 * d + 1; ++i) {
if (i & 1)
f[i] = 7;
else
f[i] = 4;
}
e[d + d + 1] = b - d - 1;
e[2] = a - d;
}
for (i = 1; f[i]; ++i) {
for (int j = 1; j <= e[i] + 1; ++j) printf("%d", f[i]);
}
return 0;
}
|
#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;
struct debugger {
template <typename T>
debugger& operator,(const T& v) {
cerr << v << " ";
return *this;
}
} dbg;
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);
}
char in[100];
int n;
int get(int v) {
int i, ret = 0;
for (i = 0; i < n - 1; i++) {
if (v == 47) {
if (in[i] == '4' && in[i + 1] == '7') ret++;
} else {
if (in[i + 1] == '4' && in[i] == '7') ret++;
}
}
return ret;
}
int main() {
int T, t = 1, m, i, j, k, c4, c7, c47, c74;
scanf("%d", &c4);
scanf("%d", &c7);
scanf("%d", &c47);
scanf("%d", &c74);
if (c47 - c74 == 1) {
c4 -= c47;
c7 -= c47;
if (c4 < 0 || c7 < 0) {
puts("-1");
return 0;
}
for (i = 0; i < c4; i++) printf("4");
for (i = 0; i < c47; i++) printf("47");
for (i = 0; i < c7; i++) printf("7");
puts("");
return 0;
}
if (c47 - c74 == -1) {
c7 -= c74;
c4 -= c74;
if (c4 < 0 || c7 < 0) {
puts("-1");
return 0;
}
printf("7");
for (i = 0; i < c4; i++) printf("4");
printf("4");
for (i = 0; i < c74 - 2; i++) printf("74");
printf("7");
for (i = 0; i < c7; i++) printf("7");
printf("4");
puts("");
return 0;
}
if (c47 == c74) {
if (c4 >= c47 + 1) {
c4 -= c47 + 1;
c7 -= c47;
if (c4 < 0 || c7 < 0) {
puts("-1");
return 0;
}
for (i = 0; i < c4; i++) printf("4");
for (i = 0; i < c47; i++) printf("47");
for (i = 0; i < c7; i++) printf("7");
printf("4");
puts("");
} else {
c4 -= c74;
c7 -= c74;
if (c4 < 0 || c7 <= 0) {
puts("-1");
return 0;
}
for (i = 0; i < c74; i++) printf("74");
for (i = 0; i < c7; i++) printf("7");
puts("");
}
return 0;
}
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int replay[3];
bool ok;
int main() {
int a1, a2, a3, a4;
cin >> a1 >> a2 >> a3 >> a4;
if (abs(a4 - a3) > 1) {
cout << -1;
exit(0);
}
int c1 = 0, c2 = 0;
string ans = "";
if (a4 > a3) {
c2++;
ans += '7';
} else if (a3 > a4) {
c1++;
ans += '4';
} else if (a2 > 1 && a1 == 1) {
c2++;
ans += '7';
} else {
c1++;
ans += '4';
}
int cnt1 = 0, cnt2 = 0;
for (int i = 1;; i++) {
if (ans[i - 1] == '4') {
ans += '7';
cnt1++;
c2++;
} else {
ans += '4';
cnt2++;
c1++;
}
if (cnt1 == a3 && cnt2 == a4) break;
}
if ((c1 > a1 || c2 > a2) && (c2 > a1 || c1 > a2)) {
cout << -1;
return 0;
}
if ((c1 > a1 || c2 > a2)) {
swap(c1, c2);
swap(cnt1, cnt2);
for (int i = 0; i < ans.size(); i++) {
if (ans[i] == '4')
ans[i] = '7';
else if (ans[i] == '7')
ans[i] = '4';
}
}
replay[0] = replay[1] = -1;
for (int i = 0; i < ans.size(); i++) {
if (ans[i] == '4' && replay[0] == -1) replay[0] = i;
if (ans[i] == '7') replay[1] = i;
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i];
if (replay[0] == i) {
while (c1 < a1) {
cout << '4';
c1++;
}
}
if (replay[1] == i) {
while (c2 < a2) {
cout << '7';
c2++;
}
}
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
template <typename T, size_t N>
int SIZE(const T (&t)[N]) {
return N;
}
template <typename T>
int SIZE(const T &t) {
return t.size();
}
string to_string(const string s, int x1 = 0, int x2 = 1e9) {
return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char c) { return string({c}); }
template <size_t N>
string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) {
string t = "";
for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
__iii__ <= __jjj__; ++__iii__) {
t += b[__iii__] + '0';
}
return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B>
string to_string(const pair<A, B> &p) {
l_v_l_v_l++;
string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
l_v_l_v_l--;
return res;
}
template <typename A, typename... C>
string to_string(const A(&v), int x1, int x2, C... coords) {
int rnk = rank<A>::value;
string tab(t_a_b_s, ' ');
string res = "";
bool first = true;
if (l_v_l_v_l == 0) res += '\n';
res += tab + "[";
x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
auto l = begin(v);
advance(l, x1);
auto r = l;
advance(r, (x2 - x1) + (x2 < SIZE(v)));
for (auto e = l; e != r; e = next(e)) {
if (!first) {
res += ", ";
}
first = false;
l_v_l_v_l++;
if (e != l) {
if (rnk > 1) {
res += '\n';
t_a_b_s = l_v_l_v_l;
};
} else {
t_a_b_s = 0;
}
res += to_string(*e, coords...);
l_v_l_v_l--;
}
res += "]";
if (l_v_l_v_l == 0) res += '\n';
return res;
}
void dbgm() { ; }
template <typename Heads, typename... Tails>
void dbgm(Heads H, Tails... T) {
cout << to_string(H) << " | ";
dbgm(T...);
}
const int MOD = (int)1e9 + 7;
string ascii_lowercase = "abcdefghijklmnopqrstuvwxyz";
string ascii_uppercase = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
long long inv(long long a, long long b) {
return 1 < a ? b - inv(b % a, a) * b / a : 1;
}
const long long INF = 1e6;
unordered_map<int, int, custom_hash> mp;
unordered_map<int, unordered_map<int, int, custom_hash>, custom_hash> g;
long long gcd(long long a, long long b, long long &x, long long &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
long long x1, y1;
long long d = gcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
long long n, m;
map<int, vector<pair<int, int>>> diags;
map<int, vector<pair<int, int>>> adiags;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
vector<string> q;
if (c == 0 && d == 0) {
if (a > 0 && b > 0) {
puts("-1\n");
return 0;
} else if (a > 0) {
for (int i = 0; i < (a); i++) printf("4");
} else if (b > 0) {
for (int i = 0; i < (b); i++) printf("7");
}
printf("\n");
return 0;
}
if (abs(c - d) >= 2) {
puts("-1\n");
return 0;
}
if (c > d) {
for (int i = 0; i < (c); i++) {
q.push_back("47");
}
int tmp = c;
d -= tmp - 1;
c -= tmp;
a -= tmp;
b -= tmp;
} else if (d > c) {
for (int i = 0; i < (d); i++) {
q.push_back("74");
}
int tmp = d;
c -= tmp - 1;
d -= tmp;
a -= tmp;
b -= tmp;
} else if (d == c) {
if (b > a && a == c) {
for (int i = 0; i < (d); i++) {
q.push_back("74");
}
q.push_back("7");
b -= c + 1;
a -= c;
} else {
for (int i = 0; i < (c); i++) {
q.push_back("47");
}
q.push_back("4");
a -= c + 1;
b -= c;
}
c = 0;
d = 0;
}
if (a < 0 || b < 0 || c < 0 || d < 0) {
puts("-1\n");
return 0;
}
string ret;
for (const auto &z : q) ret += z;
string as(a, '4');
string bs(b, '7');
if (a > 0) {
int ai = 0;
while (ret[ai] != '4') ai++;
ret = ret.substr(0, ai) + as + ret.substr(ai);
}
if (b > 0) {
int bi = (int)ret.size() - 1;
while (ret[bi] != '7') bi--;
ret = ret.substr(0, bi) + bs + ret.substr(bi);
}
printf("%s\n", ret.c_str());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b < a) {
long long int temp = a;
a = b;
b = temp;
}
if (a == 0) {
return b;
}
return gcd(b % a, a);
}
long long int max(long long int a, long long int b) {
if (a > b) return a;
return b;
}
long long int lcm(long long int a, long long int b) {
return (a * b / gcd(a, b));
}
long long int fact(long long int x) {
long long int ans = 1;
if (x == 0) {
return 1;
}
while (x > 0) {
ans = (ans * x) % 1000000007;
x--;
}
return ans % 1000000007;
}
long long int comb(long long int n, long long int r) {
long long int x = fact(r), y = fact(n - r);
x = (x * y) % 1000000007;
if (fact(n) > x) return fact(n) / x;
return (fact(n) + 1000000007) / x;
}
long long int power(long long int a, long long int p) {
long long int ans = 1;
while (p > 0) {
if (p % 2) {
ans *= a;
ans %= 1000000007;
}
a *= a;
a %= 1000000007;
p /= 2;
}
return ans % 1000000007;
}
long long int dist(long long int x1, long long int y1, long long int x2,
long long int y2) {
return (1.0 * (x1 - x2) * (x1 - x2) + 1.0 * (y1 - y2) * (y1 - y2));
}
vector<long long int> getbinary(long long int x) {
vector<long long int> bin(20000, 0);
long long int iter = 0;
while (x > 0) {
if (x % 2 == 1) {
bin[iter] = 1;
} else {
bin[iter] = 0;
}
iter++;
x /= 2;
}
return bin;
}
int main() {
long long int a, b, c, d, x = 0, y = 0;
cin >> a >> b >> c >> d;
vector<char> s;
if (abs(c - d) > 1) {
cout << -1 << endl;
return 0;
}
if (d > c) {
x = 1;
y = 1;
}
if (d == c && a > c) {
y = 1;
} else if (d == c) {
x = 1;
}
while (c > 0) {
s.push_back('4');
s.push_back('7');
a--;
b--;
c--;
d--;
}
if (y == 1) {
a--;
}
if (x == 1) {
b--;
}
if (a < 0 || b < 0) {
cout << -1 << endl;
return 0;
}
if (x == 1) {
cout << '7';
}
while (a > 0) {
cout << '4';
a--;
}
for (d = 0; d < s.size(); d++) {
cout << s[d];
}
while (b > 0) {
cout << '7';
b--;
}
if (y == 1) {
cout << '4';
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool can(int x, int n) { return x >= n; }
vector<int> f(int x, int n) {
vector<int> v;
for (int i = 0; i < n - 1; i++) v.push_back(1);
v.push_back(x - n + 1);
return v;
}
int main() {
ios::sync_with_stdio(false);
int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(c - d) > 1) {
cout << -1;
return 0;
}
int seg = c + d + 1;
if (seg == 1) {
if (a && b) {
cout << -1;
return 0;
}
if (a)
for (int i = 0; i < a; i++) cout << '4';
else
for (int i = 0; i < b; i++) cout << '7';
return 0;
}
if (c == d) {
int s4 = seg / 2 + seg % 2;
int s7 = seg - s4;
if (!can(a, s4) || !can(b, s7)) {
s7 = seg / 2 + seg % 2;
s4 = seg - s7;
if (!can(a, s4) || !can(b, s7)) {
cout << -1 << endl;
return 0;
}
}
vector<int> v4 = f(a, s4), v7 = f(b, s7);
reverse(v4.begin(), v4.end());
if (s4 >= s7) {
for (int i = 0; i < v4.size(); i++) {
for (int j = 0; j < v4[i]; j++) cout << '4';
if (b && i < v7.size())
for (int j = 0; j < v7[i]; j++) cout << '7';
}
} else {
for (int i = 0; i < v7.size(); i++) {
for (int j = 0; j < v7[i]; j++) cout << '7';
if (a && i < v4.size())
for (int j = 0; j < v4[i]; j++) cout << '4';
}
}
} else if (c > d) {
int s4 = seg / 2 + seg % 2;
int s7 = seg - s4;
if (!can(a, s4) || !can(b, s7)) {
cout << -1;
return 0;
}
vector<int> v4 = f(a, s4), v7 = f(b, s7);
reverse(v4.begin(), v4.end());
for (int i = 0; i < v4.size(); i++) {
for (int j = 0; j < v4[i]; j++) cout << '4';
if (b && i < v7.size())
for (int j = 0; j < v7[i]; j++) cout << '7';
}
} else {
int s7 = seg / 2 + seg % 2;
int s4 = seg - s7;
if (!can(a, s4) || !can(b, s7)) {
cout << -1;
return 0;
}
vector<int> v4 = f(a, s4), v7 = f(b, s7);
reverse(v4.begin(), v4.end());
for (int i = 0; i < v7.size(); i++) {
for (int j = 0; j < v7[i]; j++) cout << '7';
if (a && i < v4.size())
for (int j = 0; j < v4[i]; j++) cout << '4';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const double EPS = 1e-9;
const double PI = acos(-1.);
const long long LL_INF = 1e17 + 16;
const int INF = 1e9 + 10;
const long long MOD = 1e9 + 7;
const int MAXN = 2e6 + 5;
char ans[MAXN];
void solve() {
int a1, a2, a3, a4;
scanf("%d%d%d%d", &a1, &a2, &a3, &a4);
if (max(a3, a4) > min(a1, a2) || a3 + a4 + 1 > a1 + a2 || abs(a3 - a4) > 1) {
printf("-1\n");
return;
}
int top = 0;
if (a3 - a4 == 1) {
for (int i = (0); i < (int)(a3); i++) {
ans[top++] = '4';
ans[top++] = '7';
}
} else if (a3 - a4 == -1) {
for (int i = (0); i < (int)(a4); i++) {
ans[top++] = '7';
ans[top++] = '4';
}
} else {
if (a1 == a3) {
ans[top++] = '7';
for (int i = (0); i < (int)(a3); i++) {
ans[top++] = '4';
ans[top++] = '7';
}
} else {
for (int i = (0); i < (int)(a3); i++) {
ans[top++] = '4';
ans[top++] = '7';
}
ans[top++] = '4';
}
}
int cnt4 = 0, cnt7 = 0;
int ind4 = -1, ind7 = -1;
for (int i = (0); i < (int)(top); i++) {
if (ans[i] == '4') {
cnt4++;
if (ind4 == -1) {
ind4 = i;
}
} else {
cnt7++;
ind7 = i;
}
}
for (int i = (0); i < (int)(top); i++) {
putchar(ans[i]);
if (i == ind4) {
for (int j = (0); j < (int)(a1 - cnt4); j++) {
putchar('4');
}
}
if (i == ind7) {
for (int j = (0); j < (int)(a2 - cnt7); j++) {
putchar('7');
}
}
}
putchar('\n');
}
int main() {
int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int A1, A2, A3, A4;
int main() {
int i;
scanf("%d%d%d%d", &A1, &A2, &A3, &A4);
if (abs(A3 - A4) > 1)
printf("-1");
else {
if (A3 == A4) {
if ((((A1) > (A2) ? (A1) : (A2)) - A3 - 1 < 0) ||
(((A1) < (A2) ? (A1) : (A2)) < A3))
printf("-1");
else {
if (A1 - A3 - 1 < 0) {
for (i = 1; i <= A3; ++i) printf("74");
for (i = A2 - A3; i >= 1; --i) printf("7");
} else {
for (i = A1 - A3 - 1; i >= 1; --i) printf("4");
for (i = 1; i <= A3; ++i) printf("47");
for (i = A2 - A3; i >= 1; --i) printf("7");
printf("4");
}
}
} else {
if (A3 > A4) {
if ((A1 - A3 < 0) || (A2 - A3 < 0))
printf("-1");
else {
for (i = A1 - A3; i >= 1; --i) printf("4");
for (i = 1; i <= A3; ++i) printf("47");
for (i = A2 - A3; i >= 1; --i) printf("7");
}
} else {
if ((A1 - A3 - 1 < 0) || (A4 - 2 < 0) || (A2 - A3 < 0))
printf("-1");
else {
printf("74");
for (i = A1 - A3 - 1; i >= 1; --i) printf("4");
for (i = A4 - 2; i >= 1; --i) printf("74");
for (i = A2 - A3; i >= 1; --i) printf("7");
printf("4");
}
}
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a1, a2, a3, a4;
int main() {
cin >> a1 >> a2 >> a3 >> a4;
if (abs(a3 - a4) > 1) {
cout << "-1" << endl;
return 0;
}
if (a3 > a4) {
if (a1 < a3 || a2 < a3) {
cout << "-1" << endl;
} else {
a1 -= a3;
a2 -= a3;
for (int i = 0; i < a1; i++) {
putchar('4');
}
for (int i = 0; i < a3; i++) {
putchar('4');
putchar('7');
}
for (int i = 0; i < a2; i++) {
putchar('7');
}
putchar('\n');
}
return 0;
}
if (a3 < a4) {
if (a1 < a4 || a2 < a4) {
cout << "-1" << endl;
} else {
a1 -= a4;
a2 -= a4;
putchar('7');
for (int i = 0; i < a1; i++) {
putchar('4');
}
for (int i = 0; i < a3; i++) {
putchar('4');
putchar('7');
}
for (int i = 0; i < a2; i++) {
putchar('7');
}
putchar('4');
putchar('\n');
}
return 0;
}
bool flag = false;
if (a1 < a3 || a2 < a3) {
cout << "-1" << endl;
return 0;
}
if (a1 > a3) {
a1 -= (a3 + 1);
a2 -= a3;
for (int i = 0; i < a1; i++) {
putchar('4');
}
for (int i = 0; i < a3; i++) {
putchar('4');
putchar('7');
}
for (int i = 0; i < a2; i++) {
putchar('7');
}
putchar('4');
putchar('\n');
flag = true;
} else {
if (a2 > a3) {
a2 -= a3;
for (int i = 0; i < a3; i++) {
putchar('7');
putchar('4');
}
for (int i = 0; i < a2; i++) {
putchar('7');
}
putchar('\n');
flag = true;
}
}
if (!flag) cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
void CI(int &_x) { scanf("%d", &_x); }
void CO(int &_x) { cout << _x; }
template <typename T>
void getarray(T a[], int n) {
for (int i = 0; i < n; i++) cin >> a[i];
}
template <typename T>
void printarray(T a[], int n) {
for (int i = 0; i < n - 1; i++) cout << a[i] << " ";
cout << a[n - 1] << endl;
}
const double EPS = 1e-9;
const int INF = 0x7f7f7f7f;
int dr8[8] = {1, -1, 0, 0, 1, -1, -1, 1};
int dc8[8] = {0, 0, -1, 1, 1, 1, -1, -1};
int dr4[4] = {0, 0, 1, -1};
int dc4[4] = {-1, 1, 0, 0};
int kn8r[8] = {1, 2, 2, 1, -1, -2, -2, -1};
int kn8c[8] = {2, 1, -1, -2, -2, -1, 1, 2};
string ans = "";
void process(string s, int n) {
for (int i = 0; i < n; i++) ans += s;
}
int main() {
int a1, a2, a3, a4;
cin >> a1 >> a2 >> a3 >> a4;
int four = 0, seven = 0, fouerty_seven = 0, seventy_four = 0;
if (abs(a3 - a4) > 1) {
puts("-1");
return 0;
}
if (a3 == a4) {
process("47", a3);
a4 -= a3;
a1 -= a3;
a2 -= a3;
a3 -= a3;
if (a1) {
a1--;
ans += "4";
} else if (a2) {
a2--;
ans = "7" + ans;
} else {
puts("-1");
return 0;
}
} else if (a3 > a4) {
process("47", a3);
a4 -= a3 - 1;
a1 -= a3;
a2 -= a3;
a3 -= a3;
} else if (a4 > a3) {
process("74", a4);
a3 -= a4 - 1;
a1 -= a4;
a2 -= a4;
a3 -= a3;
}
if (a3 < 0 || a1 < 0 || a2 < 0 || a4 < 0) {
puts("-1");
return 0;
}
int st = 1 << 30;
for (int i = 0; i < ans.size(); i++) {
if (ans[i] == '4') {
while (a1--) cout << "4";
st = i;
break;
}
cout << ans[i];
}
int ed = 1 << 30;
for (int i = ans.size() - 1; i >= 0; i--)
if (ans[i] == '7') {
ed = i;
break;
}
for (int i = st; i < ans.size(); i++) {
if (i == ed) {
while (a2--) cout << "7";
break;
}
cout << ans[i];
}
for (int i = ed; i < ans.size(); i++) cout << ans[i];
puts("");
}
|
#include <bits/stdc++.h>
using namespace std;
int fours, sevens, fourseven, sevenfour;
int main() {
cin >> fours >> sevens >> fourseven >> sevenfour;
if (abs(fourseven - sevenfour) > 1) return cout << -1, 0;
string x = "";
int ifours = 0, isevens = 0;
if (fourseven == sevenfour) {
if (fours >= fourseven + 1 && sevens >= fourseven) {
for (int i = 0; i < fourseven; i++) x += "47";
ifours = fourseven + 1;
isevens = fourseven;
x += "4";
} else if (fours >= fourseven && sevens >= fourseven + 1) {
for (int i = 0; i < fourseven; i++) x += "74";
ifours = fourseven;
isevens = fourseven + 1;
x += "7";
} else
return cout << -1, 0;
} else if (fourseven > sevenfour) {
for (int i = 0; i < fourseven; i++) x += "47";
isevens = fourseven;
ifours = fourseven;
} else {
for (int i = 0; i < sevenfour; i++) x += "74";
isevens = sevenfour;
ifours = sevenfour;
}
if (isevens > sevens || ifours > fours) return cout << -1, 0;
if (sevens > isevens) {
string a = "";
int tmp = sevens - isevens;
while (tmp--) a += '7';
int lst = -1;
for (int i = 0; i < x.size(); i++)
if (x[i] == '7') lst = i;
if (lst == -1) return cout << -1, 0;
x = x.substr(0, lst + 1) + a + x.substr(lst + 1);
}
if (fours > ifours) {
string a = "";
int tmp = fours - ifours;
while (tmp--) a += '4';
int lst = 1e6;
for (int i = x.size() - 1; i >= 0; i--)
if (x[i] == '4') lst = i;
if (lst == 1e6) return cout << -1, 0;
x = x.substr(0, lst + 1) + a + x.substr(lst + 1);
}
cout << x;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a4, a7, a47, a74;
int main() {
int n;
cin >> a4 >> a7 >> a47 >> a74;
if (abs(a47 - a74) > 1) {
cout << -1;
return 0;
}
if (a47 == a74) {
if (!((a4 >= a47) && (a7 > a47)) && !((a4 > a47) && (a7 >= a47))) {
cout << -1;
return 0;
}
}
if ((a47 > a74) && (min(a4, a7) < a47)) {
cout << -1;
return 0;
}
if ((a47 < a74) && (min(a4, a7) < a74)) {
cout << -1;
return 0;
}
if (a47 == a74) {
if (a4 == a47) {
for (int i = 0; i < a74; i++) {
cout << 74;
}
for (int i = 0; i < a7 - a74; i++) {
cout << 7;
}
} else {
for (int i = 0; i < a4 - a47; i++) {
cout << 4;
}
for (int i = 0; i < a74 - 1; i++) {
cout << 74;
}
for (int i = 0; i < a7 - a74; i++) {
cout << 7;
}
cout << 74;
}
}
if (a47 > a74) {
for (int i = 0; i < a4 - a47; i++) {
cout << 4;
}
for (int i = 0; i < a47; i++) {
cout << 47;
}
for (int i = 0; i < a7 - a47; i++) {
cout << 7;
}
}
if (a47 < a74) {
cout << 74;
for (int i = 0; i < a4 - a74; i++) {
cout << 4;
}
for (int i = 0; i < a74 - 2; i++) {
cout << 74;
}
for (int i = 0; i < a7 - a74; i++) {
cout << 7;
}
cout << 74;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, a3, a4;
scanf("%d%d%d%d", &a1, &a2, &a3, &a4);
if (a3 == a4) {
if (a1 > a3 && a2 >= a3) {
for (int i = a3; i < a1; i++) printf("4");
for (int i = 1; i < a3; i++) printf("74");
for (int i = a3; i < a2; i++) printf("7");
return puts("74") & 0;
}
if (a1 >= a3 && a2 > a3) {
printf("7");
for (int i = a3; i < a1; i++) printf("4");
for (int i = 0; i < a3; i++) printf("47");
for (int i = a3 + 1; i < a2; i++) printf("7");
return puts("") & 0;
}
}
if (a3 == a4 + 1) {
if (a1 >= a3 && a2 >= a3) {
for (int i = a3; i < a1; i++) printf("4");
for (int i = 0; i < a3; i++) printf("47");
for (int i = a3; i < a2; i++) printf("7");
return puts("") & 0;
}
}
if (a3 + 1 == a4) {
if (a1 >= a4 && a2 >= a4) {
printf("7");
for (int i = a4; i < a1; i++) printf("4");
for (int i = 0; i < a3; i++) printf("47");
for (int i = a4; i < a2; i++) printf("7");
return puts("4") & 0;
}
}
puts("-1");
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int maxn = 200005;
void task() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(c - d) > 1 or min(a, b) < max(c, d)) {
cout << -1 << "\n";
} else {
if (c > d) {
for (int i = 0; i < a - d; i++) cout << 4;
for (int i = 0; i < d; i++) cout << 74;
for (int i = 0; i < b - d; i++) cout << 7;
} else if (c < d) {
cout << 7;
for (int i = 0; i < a - c; i++) cout << 4;
for (int i = 0; i < c - 1; i++) cout << 74;
for (int i = 0; i < b - c; i++) cout << 7;
cout << 4;
} else {
if (a + b < c + d + 1) {
puts("-1");
return;
}
for (int i = 0; i < a - c; i++) cout << 4;
if (a - c > 0) {
for (int i = 0; i < c - 1; i++) cout << 74;
for (int i = 0; i < b - c + 1; i++) cout << 7;
cout << 4;
} else {
cout << 7;
for (int i = 0; i < c; i++) cout << 47;
for (int i = 0; i < b - 1 - c; i++) cout << 7;
}
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
while (T--) {
task();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct debugger {
template <typename T>
debugger& operator,(const T& v) {
cerr << v << " ";
return *this;
}
} dbg;
template <class T>
string i2s(T x) {
ostringstream o;
o << x;
return o.str();
}
vector<string> splt(string s, char c = ' ') {
vector<string> rv;
int p = 0, np;
while (np = s.find(c, p), np >= 0) {
if (np != p) rv.push_back(s.substr(p, np - p));
p = np + 1;
}
if (p < int((s).size())) rv.push_back(s.substr(p));
return rv;
}
void print(vector<int> v, int sz = -1) {
if (sz == -1) sz = int((v).size());
cerr << "[";
if (sz) cerr << v[0];
for (int i = (1), _b = (sz); i < _b; ++i) cerr << ", " << v[i];
cerr << "]" << endl;
}
void print(vector<double> v, int sz = -1) {
if (sz == -1) sz = int((v).size());
cerr << "[";
if (sz) cerr << v[0];
for (int i = (1), _b = (sz); i < _b; ++i) cerr << ", " << v[i];
cerr << "]" << endl;
}
void print(vector<string> v, int sz = -1) {
if (sz == -1) sz = int((v).size());
cerr << "[";
if (sz) cerr << v[0];
for (int i = (1), _b = (sz); i < _b; ++i) cerr << ", " << v[i];
cerr << "]" << endl;
}
void print(pair<int, int> v) {
cerr << "{ " << v.first << ", " << v.second << " }";
}
void print(vector<pair<int, int> > v, int sz = -1) {
if (sz == -1) sz = int((v).size());
cerr << "[ ";
if (sz) print(v[0]);
for (int i = (1), _b = (sz); i < _b; ++i) {
cerr << ", ";
print(v[i]);
}
cerr << "]" << endl;
}
void print(vector<vector<int> > v, int sz1 = -1, int sz2 = -1) {
if (sz1 == -1) sz1 = int((v).size());
if (sz2 == -1) sz2 = int((v[0]).size());
cerr << "[ ---" << endl;
if (sz1) cerr << " ", print(v[0], sz2);
for (int i = (1), _b = (sz1); i < _b; ++i) cerr << " ", print(v[i], sz2);
cerr << "--- ]\n";
}
const double EPS = 1e-9;
const int MOD = int(1e9) + 7;
const double PI = acos(-1.0);
void pre() {}
int main() {
pre();
int a1, a2, a3, a4;
string str;
cin >> a1 >> a2 >> a3 >> a4;
queue<char> q, temp1, temp2;
int ma = max(a1, a2);
if (abs(a3 - a4) > 1) {
cout << -1 << endl;
return 0;
}
if (a3 - a4 == 1) {
int re1 = a1, re2 = a2;
string ans;
for (int _n = a3, i = 0; i < _n; ++i) {
re1--;
re2--;
}
if (re1 < 0 || re2 < 0) {
cout << -1 << endl;
return 0;
}
for (int _n = re1, i = 0; i < _n; ++i) cout << "4";
for (int _n = a3, i = 0; i < _n; ++i) cout << "47";
for (int _n = re2, i = 0; i < _n; ++i) cout << "7";
cout << endl;
} else if (a3 == a4) {
int re1 = a1, re2 = a2;
string ans1, ans2;
if (a1 > a3 && a2 >= a4) {
for (int _n = a1 - a3 - 1, i = 0; i < _n; ++i) cout << "4";
for (int _n = a3, i = 0; i < _n; ++i) cout << "47";
for (int _n = a2 - a4, i = 0; i < _n; ++i) cout << "7";
cout << "4" << endl;
} else if (a1 >= a3 && a2 > a4) {
cout << "7";
for (int _n = a1 - a3, i = 0; i < _n; ++i) cout << "4";
for (int _n = a3, i = 0; i < _n; ++i) cout << "47";
for (int _n = a2 - a4 - 1, i = 0; i < _n; ++i) cout << "7";
cout << endl;
} else {
cout << -1 << endl;
return 0;
}
} else {
int re1 = a1, re2 = a2;
string ans;
for (int _n = a4, i = 0; i < _n; ++i) {
re1--;
re2--;
}
if (re1 < 0 || re2 < 0) {
cout << -1 << endl;
return 0;
}
cout << "7";
for (int _n = re1, i = 0; i < _n; ++i) cout << "4";
for (int _n = a3, i = 0; i < _n; ++i) cout << "47";
for (int _n = re2, i = 0; i < _n; ++i) cout << "7";
cout << "4" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
int main() {
int a1, a2, a3, a4;
cin >> a1 >> a2 >> a3 >> a4;
if (max(a1, a2) < min(a3, a4)) {
cout << -1 << endl;
return 0;
}
string x;
bool haveX = false;
for (int i = 0; i <= a1; ++i) {
for (int j = i - 1; j <= i; ++j) {
if (j < 0) {
continue;
}
if (i + j == 0) {
continue;
}
int c, d;
if (i == j + 1) {
c = j;
d = j;
} else {
c = i;
d = i - 1;
}
if (c != a3 || d != a4) {
continue;
}
if (i > a1 || j > a2) {
continue;
}
vector<int> p, q;
for (int k = 0; k < i; ++k) {
if (k == 0) {
p.push_back(a1 - (i - 1));
} else {
p.push_back(1);
}
}
for (int k = 0; k < j; ++k) {
if (k + 1 == j) {
q.push_back(a2 - (j - 1));
} else {
q.push_back(1);
}
}
string current;
int pi = 0, qi = 0;
for (int k = 0; k < i + j; ++k) {
if (k % 2 == 0) {
for (int l = 0; l < p[pi]; ++l) {
current += '4';
}
++pi;
} else {
for (int l = 0; l < q[qi]; ++l) {
current += '7';
}
++qi;
}
}
if (current.size() != a1 + a2) {
continue;
}
if (!haveX || current < x) {
x = current;
haveX = true;
}
}
}
string y;
bool haveY = false;
for (int i = 0; i <= a2; ++i) {
for (int j = i - 1; j <= i; ++j) {
if (j < 0) {
continue;
}
if (i + j == 0) {
continue;
}
int c, d;
if (i == j + 1) {
c = j;
d = j;
} else {
c = i - 1;
d = i;
}
if (c != a3 || d != a4) {
continue;
}
if (i > a2 || j > a1) {
continue;
}
vector<int> p, q;
for (int k = 0; k < j; ++k) {
if (k == 0) {
p.push_back(a1 - (j - 1));
} else {
p.push_back(1);
}
}
for (int k = 0; k < i; ++k) {
if (k + 1 == i) {
q.push_back(a2 - (i - 1));
} else {
q.push_back(1);
}
}
string current;
int pi = 0, qi = 0;
for (int k = 0; k < i + j; ++k) {
if (k % 2 == 1) {
for (int l = 0; l < p[pi]; ++l) {
current += '4';
}
++pi;
} else {
for (int l = 0; l < q[qi]; ++l) {
current += '7';
}
++qi;
}
}
if (current.size() != a1 + a2) {
continue;
}
if (!haveY || current < y) {
y = current;
haveY = true;
}
}
}
if (!haveX && !haveY) {
cout << -1 << endl;
return 0;
}
if (!haveX) {
puts(y.c_str());
} else if (!haveY) {
puts(x.c_str());
} else {
puts(min(x, y).c_str());
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long a[4];
for (long long i = 0; i < 4; i++) {
cin >> a[i];
}
if (abs(a[2] - a[3]) > 1) {
cout << -1;
return 0;
}
deque<pair<long long, long long>> ans;
long long cnt4 = 0, cnt7 = 0;
for (long long i = 0; i < a[2]; i++) {
ans.push_back({4, 1});
ans.push_back({7, 1});
cnt4++;
cnt7++;
}
a[3] -= (a[2] - 1);
a[0] -= cnt4;
a[1] -= cnt7;
cnt4 = 0;
cnt7 = 0;
if (a[3] == 1) {
if (a[0]) {
ans.push_back({4, 1});
cnt4++;
} else {
ans.push_front({7, 1});
cnt7++;
}
} else if (a[3] == 2) {
ans.push_back({4, 1});
ans.push_front({7, 1});
cnt7++;
cnt4++;
}
a[0] -= cnt4;
a[1] -= cnt7;
if (a[0] < 0 || a[1] < 0) {
cout << -1;
return 0;
}
for (long long i = 0; i < ans.size(); i++) {
if (ans[i].first == 4) {
ans[i].second += a[0];
break;
}
}
for (long long i = ans.size() - 1; i >= 0; i--) {
if (ans[i].first == 7) {
ans[i].second += a[1];
break;
}
}
for (long long i = 0; i < ans.size(); i++) {
while (ans[i].second--) {
cout << ans[i].first;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[5];
int main() {
int i, j;
cin >> a[0] >> a[1] >> a[2] >> a[3];
if (a[2] > a[3]) {
if (a[2] - a[3] > 1 || a[0] < a[2] || a[1] < a[2]) {
cout << -1 << endl;
return 0;
}
a[0] -= a[2], a[1] -= a[2];
for (i = 0; i < a[0]; i++) cout << "4";
for (i = 0; i < a[2]; i++) cout << "47";
for (i = 0; i < a[1]; i++) cout << "7";
cout << endl;
return 0;
} else if (a[2] == a[3]) {
if (a[0] >= a[2] + 1 && a[1] >= a[2]) {
a[0] -= a[2] + 1, a[1] -= a[3];
for (i = 0; i < a[0]; i++) cout << "4";
for (i = 0; i < a[2]; i++) cout << "47";
for (i = 0; i < a[1]; i++) cout << "7";
cout << "4" << endl;
return 0;
}
if (a[0] >= a[2] && a[1] >= a[2] + 1) {
a[0] -= a[2], a[1] -= a[3] + 1;
cout << "7";
for (i = 0; i < a[0]; i++) cout << "4";
for (i = 0; i < a[2]; i++) cout << "47";
for (i = 0; i < a[1]; i++) cout << "7";
cout << endl;
return 0;
}
cout << -1 << endl;
return 0;
} else {
if (a[3] - a[2] > 1 || a[0] < a[3] || a[1] < a[3]) {
cout << -1 << endl;
return 0;
}
a[0] -= a[3], a[1] -= a[3];
cout << "7";
for (i = 0; i < a[0]; i++) cout << "4";
for (i = 0; i < a[3] - 1; i++) cout << "47";
for (i = 0; i < a[1]; i++) cout << "7";
cout << "4" << endl;
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
long long int power(long long int a, long long int b, long long int m) {
if (b == 0) return 1;
if (b == 1) return a % m;
long long int t = power(a, b / 2, m) % m;
t = (t * t) % m;
if (b & 1) t = ((t % m) * (a % m)) % m;
return t;
}
long long int modInverse(long long int a, long long int m) {
return power(a, m - 2, m);
}
long long int a1, a2, a3, a4;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> a1 >> a2 >> a3 >> a4;
if (abs(a3 - a4) > 1) {
cout << "-1";
return 0;
}
string s = "";
long long int v = max(a3, a4), i, j;
if (a3 == a4) {
while (v > 0) {
s += "47";
v--;
}
s += '4';
} else if (a3 > a4) {
while (v > 0) {
s += "47";
v--;
}
} else {
while (v > 0) {
s += "74";
v--;
}
}
long long int x = s.length();
long long int fr = 0, sv = 0, g = -1, h = -1;
for (i = 0; i < x; i++) {
if (s[i] == '4') {
if (g == -1) g = i;
fr++;
} else {
h = i;
sv++;
}
}
if ((a1 < fr || a2 < sv) && a3 != a4) {
cout << "-1";
return 0;
}
if ((a1 < fr || a2 < sv)) {
s.clear();
v = max(a3, a4);
while (v > 0) {
s += "74";
v--;
}
s += '7';
fr = 0;
sv = 0;
g = -1;
h = -1;
for (i = 0; i < x; i++) {
if (s[i] == '4') {
if (g == -1) g = i;
fr++;
} else {
h = i;
sv++;
}
}
}
if ((a1 < fr || a2 < sv)) {
cout << "-1";
return 0;
}
a1 -= fr;
a2 -= sv;
for (i = 0; i <= g; i++) {
cout << s[i];
}
while (a1 > 0) {
cout << "4";
a1--;
}
for (i = g + 1; i <= h; i++) {
cout << s[i];
}
while (a2 > 0) {
cout << "7";
a2--;
}
for (i = h + 1; i < x; i++) {
cout << s[i];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using vc = vector<T>;
using pii = pair<long long, long long>;
void xmax(long long& a, long long b) { a = max(a, b); }
void xmin(long long& a, long long b) { a = min(a, b); }
void print(vc<long long>& a, string second) {
cerr << second << " : ";
for (long long i = 0; i < a.size(); i++) {
cerr << a[i] << " ";
}
cerr << endl;
}
string second;
vc<char> b{'0', '4', '7'};
long long anz_total(vc<long long> a, long long last) {
for (long long i = 0; i < 4; i++)
if (a[i] < 0) return 1e9;
if (a[2] == 0 && a[3] == 0) {
if (last == 1) {
if (a[1] != 0) return a[1] + a[0] + 1;
return a[0];
}
if (last == 2) {
if (a[0] != 0) return a[1] + a[0] + 1;
return a[1];
}
if (a[1] != 0 && a[0] != 0) return a[1] + a[0] + 1;
return a[1] + a[0];
}
long long needa;
long long needb;
long long add = 0;
long long anz_null = 0;
if (last == 1) {
if (a[2] > a[3]) {
needa = a[2] - 1;
needb = a[2];
anz_null = a[2] - a[3] - 1;
} else {
needa = needb = a[3];
anz_null = a[3] - a[2];
}
}
if (last == 2) {
if (a[3] > a[2]) {
needa = a[3];
needb = a[3] - 1;
anz_null = a[3] - a[2] - 1;
} else {
needa = needb = a[3];
anz_null = a[2] - a[3];
}
}
if (last == 0) {
needa = max(a[2], a[3]);
needb = max(a[2], a[3]);
anz_null = abs(a[2] - a[3]);
if (a[2] == a[3]) {
add = 1;
}
}
if (a[0] < needa) return 1e9;
if (a[1] < needb) return 1e9;
if (a[0] + a[1] < needa + needb + add) return 1e9;
if (anz_null > 0) return 1e9;
return anz_null + a[0] + a[1];
}
void add_next(vc<long long> a, long long last) {
long long l = 1e9;
if (a[0] + a[1] + a[2] + a[3] == 0) return;
vc<long long> res(3);
vc<vc<long long> > c(3);
for (long long i = 0; i < 3; i++) {
c[i] = a;
if (i == 1) {
c[i][0]--;
if (last == 2) {
c[i][3]--;
}
}
if (i == 2) {
c[i][1]--;
if (last == 1) {
c[i][2]--;
}
}
res[i] = anz_total(c[i], i);
if (i == 0) res[i] = 1e9;
xmin(l, res[i]);
}
if (l > 1e8) {
cout << "-1";
return;
}
for (long long i = 0; i < 3; i++) {
if (l == res[i]) {
second += b[i];
cout << b[i];
return add_next(c[i], i);
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
vc<long long> a(4);
for (long long i = 0; i < 4; i++) cin >> a[i];
if (abs(a[2] - a[3]) > 1) {
cout << "-1";
return 0;
}
if (a[2] == a[3] + 1) {
if (a[0] < a[2] || a[1] < a[2]) {
cout << "-1";
return 0;
}
while (a[0] > a[2]) {
cout << "4";
a[0]--;
}
for (long long i = 0; i < a[2]; i++) {
cout << "47";
}
while (a[1] > a[2]) {
cout << "7";
a[1]--;
}
}
if (a[3] == a[2] + 1) {
if (a[0] < a[3] || a[1] < a[3]) {
cout << "-1";
return 0;
}
cout << "7";
while (a[0] > a[3]) {
cout << "4";
a[0]--;
}
for (long long i = 0; i < a[2]; i++) {
cout << "47";
}
while (a[1] > a[3]) {
cout << "7";
a[1]--;
}
cout << "4";
}
if (a[2] == a[3]) {
if (a[0] < a[2] || a[1] < a[2]) {
cout << "-1";
return 0;
}
if (a[0] > a[2]) {
while (a[0] > a[2] + 1) {
cout << "4";
a[0]--;
}
for (long long i = 0; i < a[2]; i++) {
cout << "47";
}
while (a[1] > a[2]) {
cout << "7";
a[1]--;
}
cout << "4";
} else if (a[1] > a[2]) {
cout << "7";
for (long long i = 0; i < a[2]; i++) {
cout << "47";
}
while (a[1] > 1 + a[2]) {
cout << "7";
a[1]--;
}
} else {
cout << "-1";
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c4, c7, c47, c74;
cin >> c4 >> c7 >> c47 >> c74;
if (c47 > c4 || c47 > c7 || c74 > c4 || c74 > c7 || abs(c47 - c74) > 1) {
cout << "-1" << endl;
return 0;
}
if (c47 > c74) {
int p4 = c4 - c47, p7 = c7 - c47;
for (int i = 0; i < (p4); i++) cout << "4";
for (int i = 0; i < (c47); i++) cout << "47";
for (int i = 0; i < (p7); i++) cout << "7";
cout << endl;
} else if (c47 == c74) {
if (c47 == c4 && c47 == c7) {
cout << "-1" << endl;
return 0;
}
if (c47 == c4) {
int p7 = c7 - c47;
for (int i = 0; i < (c47); i++) cout << "74";
for (int i = 0; i < (p7); i++) cout << "7";
cout << endl;
} else {
int p4 = c4 - c47;
int p7 = c7 - c47;
for (int i = 0; i < (p4); i++) cout << "4";
for (int i = 0; i < (c47 - 1); i++) cout << "74";
for (int i = 0; i < (p7); i++) cout << "7";
cout << "74" << endl;
}
} else {
int p4 = c4 - c74, p7 = c7 - c74;
cout << "7";
for (int i = 0; i < (p4); i++) cout << "4";
cout << "4";
for (int i = 0; i < (c74 - 2); i++) cout << "74";
for (int i = 0; i < (p7); i++) cout << "7";
cout << "7";
cout << "4";
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, a3, a4;
scanf("%d %d %d %d", &a1, &a2, &a3, &a4);
if (a3 == a4 && a1 >= a4 + 1 && a2 >= a4) {
a1 -= a4 + 1;
a2 -= a4;
for (int i = 0; i < a1; ++i) putchar('4');
for (int i = 0; i < a4; ++i) printf("47");
for (int i = 0; i < a2; ++i) putchar('7');
putchar('4');
} else if (a3 == a4 && a1 >= a4 && a2 >= a4 + 1) {
a1 -= a4;
a2 -= a4 + 1;
printf("74");
for (int i = 0; i < a1; ++i) putchar('4');
for (int i = 0; i < a4 - 1; ++i) printf("74");
putchar('7');
for (int i = 0; i < a2; ++i) putchar('7');
} else if (a3 + 1 == a4 && a1 >= a4 && a2 >= a4) {
a1 -= a4;
a2 -= a4;
for (int i = 0; i < a4; ++i) {
if (i == a4 - 1) {
for (int j = 0; j < a2; ++j) putchar('7');
}
printf("74");
if (i == 0) {
for (int j = 0; j < a1; ++j) putchar('4');
}
}
} else if (a3 == a4 + 1 && a1 >= a3 && a2 >= a3) {
a1 -= a3;
a2 -= a3;
for (int i = 0; i < a1; ++i) putchar('4');
for (int i = 0; i < a3; ++i) printf("47");
for (int i = 0; i < a2; ++i) putchar('7');
} else {
printf("-1");
}
putchar('\n');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, p;
int main() {
cin >> a >> b >> c >> d;
d -= c - 1;
a -= c;
b -= c;
if (d == 2) {
a--;
b--;
p = 3;
}
if (d == 1) {
if (a) {
a--;
p = 1;
} else {
b--;
p = 2;
}
}
if (a < 0 || b < 0 || d > 2 || d < 0)
cout << "-1";
else {
if (p & 2) cout << "7";
for (; a > 0; a--) cout << "4";
for (; c > 0; c--) cout << "47";
for (; b > 0; b--) cout << "7";
if (p & 1) cout << "4";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void multi(vector<int> &a, int pos, int num) {
int n = a.size();
a.resize(n + num);
for (int j = n - 1; j >= pos; j--) a[j + num] = a[j];
for (int j = pos; j < pos + num; j++) a[j] = a[pos + num];
}
int main() {
int a, b, c, d;
while (scanf("%d%d%d%d", &a, &b, &c, &d) >= 1) {
if (a < c || a < d || b < c || b < d) {
printf("-1\n");
continue;
}
if (c == d) {
int num = c + d + 1;
if (a + b < num) {
printf("-1\n");
continue;
}
int topr[2] = {4, 7};
if (a == c) swap(topr[0], topr[1]), swap(a, b);
vector<int> ans;
for (int i = 0; i < num; i++) ans.push_back(topr[i & 1]);
a = a - (c + 1);
b = b - c;
if (topr[0] > topr[1]) swap(topr[0], topr[1]), swap(a, b);
for (int i = 0; i < (int)ans.size(); i++)
if (topr[0] == ans[i]) {
multi(ans, i, a);
break;
}
for (int i = (int)ans.size() - 1; i >= 0; i--)
if (topr[1] == ans[i]) {
multi(ans, i, b);
break;
}
for (int i = 0; i < (int)ans.size(); i++) printf("%d", ans[i]);
printf("\n");
continue;
}
if (abs(c - d) > 1) {
printf("-1\n");
continue;
}
int topr[2] = {4, 7};
if (c < d) swap(c, d), swap(a, b), swap(topr[0], topr[1]);
vector<int> ans;
for (int i = 0; i < 2 * c; i++) ans.push_back(topr[i & 1]);
a -= c, b -= c;
if (topr[0] > topr[1]) swap(topr[0], topr[1]), swap(a, b);
for (int i = 0; i < (int)ans.size(); i++)
if (topr[0] == ans[i]) {
multi(ans, i, a);
break;
}
for (int i = (int)ans.size() - 1; i >= 0; i--)
if (topr[1] == ans[i]) {
multi(ans, i, b);
break;
}
for (int i = 0; i < (int)ans.size(); i++) printf("%d", ans[i]);
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
string s = "";
long long int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(c - d) > 1)
cout << -1 << '\n';
else {
long long int cnt4 = 0;
long long int cnt7 = 0;
if (c == d) {
if (c + 1 <= a) {
cnt7 += c;
cnt4 += c + 1;
if (cnt4 > a || cnt7 > b)
cout << -1 << '\n';
else {
a -= cnt4;
b -= cnt7;
for (long long int j = 1; j <= a; j++) cout << "4";
for (long long int j = 1; j <= c; j++) cout << "47";
for (long long int j = 1; j <= b; j++) cout << "7";
cout << "4" << '\n';
}
} else {
cnt7 += c + 1;
cnt4 += c;
if (cnt4 > a || cnt7 > b)
cout << -1 << '\n';
else {
a -= cnt4;
b -= cnt7;
if (c > 0) {
cout << "7";
for (long long int j = 1; j <= a; j++) cout << "4";
cout << "4";
}
for (long long int j = 1; j < c; j++) cout << "74";
for (long long int j = 1; j <= b; j++) cout << "7";
cout << "7" << '\n';
}
}
} else if (c > d) {
cnt4 += c;
cnt7 += c;
if (cnt4 > a || cnt7 > b)
cout << -1 << '\n';
else {
a -= cnt4;
b -= cnt7;
for (long long int j = 1; j <= a; j++) cout << "4";
for (long long int j = 1; j <= c; j++) cout << "47";
for (long long int j = 1; j <= b; j++) cout << "7";
}
} else {
cnt4 += d;
cnt7 += d;
if (cnt4 > a || cnt7 > b)
cout << -1 << '\n';
else {
a -= cnt4;
b -= cnt7;
if (d > 0) {
cout << "7";
for (long long int j = 1; j <= a; j++) cout << "4";
cout << "4";
}
d--;
for (long long int j = 1; j < d; j++) cout << "74";
for (long long int j = 1; j <= b; j++) cout << "7";
cout << "74" << '\n';
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int T = 1;
while (T--) {
long long int a, b, c, d;
cin >> a >> b >> c >> d;
long long int count4 = 0, count7 = 0;
if (abs(c - d) > 1) {
cout << "-1";
return 0;
}
std::vector<char> v;
if (c > d) {
for (long long int i = 0; i < c; i = i + 1) {
v.push_back('4');
v.push_back('7');
count7++;
count4++;
}
} else if (d > c) {
for (long long int i = 0; i < d; i = i + 1) {
v.push_back('7');
v.push_back('4');
count4++;
count7++;
}
} else {
if (a >= c + 1) {
for (long long int i = 0; i < c; i = i + 1) {
v.push_back('4');
v.push_back('7');
count7++;
count4++;
}
v.push_back('4');
count4++;
} else if (b >= d + 1) {
for (long long int i = 0; i < d; i = i + 1) {
v.push_back('7');
v.push_back('4');
count4++;
count7++;
}
v.push_back('7');
count7++;
} else {
cout << "-1";
return 0;
}
}
a = a - count4;
b = b - count7;
if ((a < 0) || (b < 0)) {
cout << "-1";
return 0;
}
std::vector<char> tmp1, tmp2;
for (long long int i = 0; i < v.size(); i++) {
if (v[i] == '4') {
while (a > 0) {
tmp1.push_back('4');
a--;
}
tmp1.push_back(v[i]);
} else if (v[i] == '7') {
tmp1.push_back(v[i]);
}
}
for (long long int i = tmp1.size() - 1; i >= 0; i--) {
if (tmp1[i] == '4') {
tmp2.push_back(tmp1[i]);
} else if (tmp1[i] == '7') {
while (b > 0) {
tmp2.push_back('7');
b--;
}
tmp2.push_back(tmp1[i]);
}
}
for (long long int i = tmp2.size() - 1; i >= 0; i--) {
cout << tmp2[i];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c > a || c > b || d > a || d > b || (d < c && d != c - 1) ||
(c < d && c != d - 1) || (c == d && (a <= c && b <= d))) {
cout << -1;
return 0;
}
string ans = "";
if (c > d || (c == d && a > c)) {
a -= c;
b -= c;
while (a--) {
ans.append("4");
}
a++;
if (d == c) {
ans.pop_back();
a++;
}
while (c--) {
ans.append("47");
}
while (b > 0) {
ans.append("7");
b--;
}
if (a == 1) {
ans.append("4");
a--;
}
cout << ans;
} else {
a -= d;
b -= d;
int flag = 0;
if (d == c) {
flag = 1;
}
while (d--) {
ans.append("74");
while (a > 0) {
ans.append("4");
a--;
}
if (d == 0 && flag == 0) {
ans.pop_back();
while (b--) {
ans.append("7");
}
ans.append("4");
}
}
if (flag == 1) {
while (b--) ans.append("7");
}
cout << ans;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int c4, c7, c47, c74;
cin >> c4 >> c7 >> c47 >> c74;
if (max(c47, c74) > min(c4, c7) || abs(c74 - c47) > 1) return cout << -1, 0;
string ans = "";
int cnt4 = 0, cnt7 = 0;
if (c47 > c74) {
for (int i = 0; i < c47; i++) {
ans += "47";
cnt4++;
cnt7++;
}
if (cnt4 > c4 || cnt7 > c7) return cout << -1, 0;
c4 -= cnt4;
while (c4--) cout << 4;
cout << ans;
c7 -= cnt7;
while (c7--) cout << 7;
} else if (c47 == c74) {
cnt4 = 1;
ans.push_back('4');
for (int i = 0; i < c47; i++) {
ans += "74";
cnt4++;
cnt7++;
}
if (cnt4 > c4 || cnt7 > c7) {
cnt4 = 0;
cnt7 = 1;
ans.clear();
for (int i = 0; i < c47; i++) {
ans += "47";
cnt4++;
cnt7++;
}
if (cnt4 > c4 || cnt7 > c7) return cout << -1, 0;
cout << 7;
c4 -= cnt4;
while (c4--) cout << 4;
cout << ans;
c7 -= cnt7;
while (c7--) cout << 7;
return 0;
}
c4 -= cnt4;
while (c4--) cout << 4;
ans.pop_back();
cout << ans;
c7 -= cnt7;
while (c7--) cout << 7;
cout << 4;
} else {
cnt4 = cnt7 = 1;
for (int i = 1; i < c74; i++) {
ans += "74";
cnt4++;
cnt7++;
}
if (cnt4 > c4 || cnt7 > c7) return cout << -1, 0;
cout << "74";
c4 -= cnt4;
while (c4--) cout << 4;
ans.pop_back();
cout << ans;
c7 -= cnt7;
while (c7--) cout << 7;
cout << 4;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename... T>
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << "=" << a << ", ";
err(++it, args...);
}
const long long inf = 1LL << 60;
const long long md = 1000000007;
void solve() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(c - d) >= 2) {
cout << -1;
return;
}
string s;
for (long long i = 0; i < c; i++) s += "47";
if (c > d) {
a -= c;
b -= c;
if (a < 0 || b < 0) {
cout << -1;
return;
}
for (long long i = 0; i < a; i++) cout << 4;
cout << s;
for (long long i = 0; i < b; i++) cout << 7;
}
if (d > c) {
s += "47";
s = s.substr(2);
a -= d;
b -= d;
if (a < 0 || b < 0) {
cout << -1;
return;
}
cout << 7;
for (long long i = 0; i < a; i++) cout << 4;
cout << s;
for (long long i = 0; i < b; i++) cout << 7;
cout << 4;
}
if (c == d) {
if (a >= c + 1 && b >= c) {
b -= c;
a -= c + 1;
for (long long i = 0; i < a; i++) cout << 4;
cout << s;
for (long long i = 0; i < b; i++) cout << 7;
cout << 4;
} else if (b >= c + 1 && a >= c) {
b -= c + 1;
a -= c;
s = s.substr(2);
cout << 7;
for (long long i = 0; i < a; i++) cout << 4;
cout << s;
cout << 4;
for (long long i = 0; i < b; i++) cout << 7;
cout << 7;
} else
cout << -1;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t = 1;
for (long long i = 1; i <= t; i++) {
solve();
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a1, a2, a3, a4;
string a;
string b;
string c;
int solvef7() {
int c1, c2, c3, c4;
for (int i = 0; i < a3; i++) a.append("47");
c1 = a3;
c2 = a3;
c3 = a3;
c4 = a3 - 1;
if ((a4 - c4) == 1) {
if ((a1 - c1) == 0) return 0;
for (int i = 0; i < a1 - c1 - 1; i++) b.push_back('4');
b.append(a);
for (int i = 0; i < a2 - c2; i++) b.push_back('7');
b.push_back('4');
return 1;
} else if (a4 == c4) {
for (int i = 0; i < a1 - c1; i++) b.push_back('4');
b.append(a);
for (int i = 0; i < a2 - c2; i++) b.push_back('7');
return 1;
}
return 0;
}
int solves4() {
c.push_back('7');
if (a4 == a3) {
if (a2 - a4 == 0) return 0;
a2--;
for (int i = 0; i < a1 - a4 + 1; i++) {
c.push_back('4');
}
for (int i = 0; i < a4 - 1; i++) c.append("74");
for (int i = 0; i < a2 - a4 + 1; i++) c.push_back('7');
return 1;
} else if (a4 == a3 + 1) {
a2--;
for (int i = 0; i < a1 - a4 + 1; i++) c.push_back('4');
for (int i = 0; i < a4 - 2; i++) c.append("74");
for (int i = 0; i < a2 - a4 + 1; i++) c.push_back('7');
c.append("74");
return 1;
}
return 0;
}
int main() {
scanf("%d", &a1);
scanf("%d", &a2);
scanf("%d", &a3);
scanf("%d", &a4);
if (a1 < a3 || a1 < a4) {
cout << "-1" << endl;
return 0;
}
if (a2 < a3 || a2 < a4) {
cout << "-1" << endl;
return 0;
}
if (abs(a3 - a4) > 1) {
cout << "-1" << endl;
return 0;
}
int f7 = solvef7();
if (f7 == 1) {
cout << b << endl;
return 0;
}
a = "";
int s4 = solves4();
if (s4 == 1) {
cout << c << endl;
} else {
cout << "-1" << endl;
}
}
|
#include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define PI acos(-1)
#define pb push_back
#define F first
#define S second
#define lson i << 1
#define rson i << 1 | 1
#define mem(x, y) memset(x, y, sizeof(x))
#define fin(x) freopen(x, "r", stdin)
#define fout(x) freopen(x, "w", stdout)
#define fcl fclose(stdin), fclose(stdout)
#define ioss ios::sync_with_stdio(false), cout.tie(NULL)
#define pii pair<int, int>
#define vec vector
#define all(x) x.begin(), x.end()
#define lowbit(x) x &(-x)
const double eps = 1e-6;
const int MAX = 5e2 + 10;
const int MOD = 1e9 + 7;
using namespace std;
int t;
int n, m,a[MAX][MAX];
int main()
{
ioss;
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> a[i][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
int k = a[i][j];
if ((i + j) & 1)
cout << 720720 << " ";
else
cout << 720720 - k * k * k * k << " ";
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
//typedef tree<int,null_type,less<int >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template<class T1, class T2>
ostream &operator <<(ostream &os, pair<T1,T2>&p);
template <class T>
ostream &operator <<(ostream &os, vector<T>&v);
template <class T>
ostream &operator <<(ostream &os, set<T>&v);
template <class T1, class T2>
ostream &operator <<(ostream &os, map<T1,T2>&v);
#ifdef APURBA
#define HERE cout<<"here - "<<__LINE__<<"\n";
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it)
{
cout<<endl;
}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
cout << *it << " = " << a << " ";
err(++it, args...);
}
#else
#define HERE
#define debug(args...)
#endif
const ll N = 1e6;
const ll mod = 1e9+7;
typedef pair<int,int> pii;
void TEST_CASES(int cas)
{
ll n,m;
cin>>n>>m;
vector<vector<ll> >a(n,vector<ll>(m));
vector<vector<ll> >b(n,vector<ll>(m));
for(ll i=0;i<n;i++)
{
for(ll j=0;j<m;j++)
{
cin>>a[i][j];
}
}
ll now =0;
ll val = 720720;
for(ll i=0;i<n;i++)
{
ll turn = now;
for(ll j=0;j<m;j++)
{
if(turn==0)
{
b[i][j] = val;
}
else{
ll eta = a[i][j];
for(ll x= 1;;x++)
{
ll bal = val + (x*x*x*x);
if(bal %eta==0)
{
b[i][j] = bal;
break;
}
}
}
turn = 1-turn;
}
now = 1-now;
}
for(ll i=0;i<n;i++)
{
for(ll j=0;j<m;j++)
{
cout<<b[i][j]<<" ";
}
cout<<"\n";
}
}
/*
*/
int32_t main()
{
#ifndef APURBA
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#endif
//freopen("input.txt","r",stdin);
//freopen("out1.txt","w",stdout);
int t=1,cas=0;
//cin>>t;
while(t--)
{
TEST_CASES(++cas);
}
return 0;
}
template<class T1, class T2>
ostream &operator <<(ostream &os, pair<T1,T2>&p)
{
os<<"{"<<p.first<<", "<<p.second<<"} ";
return os;
}
template <class T>
ostream &operator <<(ostream &os, vector<T>&v)
{
os<<"[ ";
for(int i=0; i<v.size(); i++)
{
os<<v[i]<<" " ;
}
os<<" ]";
return os;
}
template <class T>
ostream &operator <<(ostream &os, set<T>&v)
{
os<<"[ ";
for(T i:v)
{
os<<i<<" ";
}
os<<" ]";
return os;
}
template <class T1, class T2>
ostream &operator <<(ostream &os, map<T1,T2>&v)
{
for(auto i:v)
{
os<<"Key : "<<i.first<<" , Value : "<<i.second<<endl;
}
return os;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=998244353;
const int N=200005;
int prime[1100000],primesize;
bool isprime[11000000];
ll f[N],invf[N];
ll inv[N];
void getlist(int listsize){
memset(isprime,1,sizeof(isprime));
isprime[1]=false;
for(int i=2;i<=listsize;i++){
if(isprime[i])prime[++primesize]=i;
for(int j=1;j<=primesize&&i*prime[j]<=listsize;j++) {
isprime[i*prime[j]]=false;
if(i%prime[j]==0) break;
}
}
}
void extend_gcd(ll a, ll b, ll& d, ll& x, ll& y)
{
if(!b){ d = a; x = 1; y = 0; }
else { extend_gcd(b, a%b,d, y, x); y -= x*(a/b);}
}
void ni(int n)
{
inv[0] = inv[1] = 1;
for(int i = 2; i <= n; i++)
{
inv[i] = (mod - (mod/i))*inv[mod%i]%mod;
}
}
ll fpow(ll a,ll k){
ll res=1;
while(k){
if(k&1) res=(res*a)%mod;
k>>=1;
a=a*a%mod;
//cout<<1<<endl;
}
return res;
}
void init(int n){
f[0]=1;
for(int i=1;i<=n;++i){
f[i]=f[i-1]*i%mod;
}
invf[n]=fpow(f[n],mod-2);
for(int i=n-1;i>=0;--i){
invf[i]=invf[i+1]*(i+1)%mod;
}
}
ll C(int n,int k){
if(k<0 || k>n) return 0;
return f[n]*invf[k]%mod*invf[n-k]%mod;
}
const int d=2*2*2*2*3*3*5*7*11*13;
void solve(){
ll n,m,a;
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>a;
if((i+j)&1){
cout<<d<<" ";
}
else{
cout<<d+a*a*a*a<<" ";
}
}
cout<<endl;
}
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);
// getlist(1e7);
int t=1;
// cin>>t;
while(t--){
solve();
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
//cout.flush
ll n, m, c[20];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for(int i=1; i<=n; i++){
for(int t=1; t<=m; t++){
cin >> c[1];
if((i+t)%2)cout << "720720 ";
else cout << 720720-(c[1]*c[1]*c[1]*c[1]) << " ";
}
cout << "\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=3e5+9;
const int MAX=6e5+9;
const int MAX1=5e6+9;
const int INF=0x3f3f3f3f;
const long double ep=1e-12;
const double ep1=1e-14;
const int mod=998244353;
const double inf=1e20;
const long double pi=acos(-1);
#define debug1 puts("?");
#define debug(x) cout<<"##"<<(x)<<endl;
#define mk make_pair
#define PII pair<int,int>
#define PDI pair<double,int>
#define PIII pair<int,PII >
#define PIII1 pair<PII,int>
#define PIIII pair<PII,PII >
#define PIL pair<int,ll>
#define PLI pair<ll,int>
#define PLIII pair<PLI,PII >
#define PLL pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define dep(i,a,b) for(int i=(a);i>=(b);--i)
#define sd(x) scanf("%d",&(x))
#define slld(x) scanf("%lld",&(x))
#define sdd(x,y) scanf("%d%d",&(x),&(y))
#define sc(s) scanf("%s",(s))
#define pd(x) printf("%d\n",(x))
#define plld(x) printf("%lld\n",(x))
#define pdk(x) printf("%d ",(x))
#define plldk(x) printf("%lld ",(x))
#define pdd(x,y) printf("%d %d\n",(x),(y))
#define PR(x) printf("Case %d: ",(x))
#define INF 0x3f3f3f3f
typedef long double ld;
typedef unsigned long long ull;
/*
给你一个n*m的矩阵a
需要构造一个n*m的矩阵b
bij是aij的倍数
1<=bij<=1e6
对于某一个位置，它跟相邻4个数的差值的绝对值都为k^4(爬
对于任意一对相邻的两个数，差值都为某个正数的4次方
1-16的最小公倍数为720720
*/
int f[20],n,m,a;
void solve()
{
rep(i,1,16)
{
rep(k,1,30)
{
if((720720-k*k*k*k)%i==0)
{
f[i]=720720-k*k*k*k;
break;
}
}
}
sdd(n,m);
rep(i,1,n)
{
rep(j,1,m)
{
sd(a);
if((i+j)&1)pdk(720720);
else pdk(f[a]);
}
puts("");
}
}
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);
int T=1;
// sd(T);
while(T--)solve();
}
|
#include<bits/stdc++.h>
using namespace std;
int gcd(int x,int y){
while(y){
int tmp=x%y;
x=y;
y=tmp;
}
return x;
}
int lcm(int x,int y){
return x*y/gcd(x,y);
}
int a[510][510],b[510][510];
int main(){
int n,m;
cin>>n>>m;
int d=1;
for(int i=2;i<=16;i++)d=lcm(d,i);
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>a[i][j];
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
if(i+j &1)b[i][j]=d;
else b[i][j]=d+pow(a[i][j],4);
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cout<<b[i][j]<<" ";
}
cout<<endl;
}
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
#include <list>
#include <map>
#include <set>
#include <limits>
#include <random>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int ui;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
using namespace std;
const int N = 510;
const int M = 6;
const int MOD = 1000000007;
const int INF = 1009000999;
const ll LINF = (1ll << 60) + 1337;
const ld EPS = 0.00000001;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int _lca(int a, int b) {
return (a * 1ll * b) / gcd(a, b);
}
int a[N][N];
int n, m;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef _DEBUG
freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#endif
//#ifndef _DEBUG
// freopen("segmentupdate.in", "r", stdin); freopen("segmentupdate.out", "w", stdout);
//#endif
int lca = 1;
for (int i = 2; i <= 16; i++) {
lca = _lca(lca, i);
}
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
if ((i + j) % 2) {
cout << lca << " ";
}
else {
cout << lca - pow(a[i][j], 4) << " ";
}
}
cout << "\n";
}
}
/*
Important stuff
- int overflow
- array bounds
- special cases (n=1, max n) maybe adhoc problem
- doubles are read for a long time (4 * 10 ^ 5 danger GNU vs MS ICPC 2020 1/4)
- don't get stuck on one approach
- don't get stuck on one problem
- recheck submissions if near the end of the tournament and there is nothing to do
- do something instead of nothing and stay organized
*/
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=5e2+7;
const int modn = 1e9+7;
int n,m;
int a[maxn][maxn];
int four[maxn];
int gongbei;
int gcd(int a,int b){
if(b == 0)return a;
return gcd(b,a%b);
}
void init(){
for(int i = 1;i < maxn;i++){
ll res = i*i*i*i;
if(res > 1000000)break;
four[i] = res;
// printf("four[%d]: %d\n",i,four[i]);
}
gongbei = 1;
for(int i = 2;i <= 16;i++){
gongbei = gongbei * i / gcd(gongbei,i);
}
// printf("%d\n",gongbei);
}
int main(){
scanf("%d%d",&n,&m);
for(int i = 1;i <= n;i++){
for(int j = 1;j <= m;j++){
scanf("%d",&a[i][j]);
}
}
init();
for(int i = 1;i <= n;i++){
for(int j = 1;j <= m;j++){
if((i+j)&1)a[i][j] = gongbei - four[a[i][j]];
else a[i][j] = gongbei;
// printf("%d %d\n",gongbei,a[1][2]);
// printf("a[%d][%d]: %d\n",i,j,a[i][j]);
}
}
for(int i = 1;i <= n;i++){
for(int j = 1;j < m;j++){
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][m]);
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.