# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598371 | _martynas | ASM (LMIO18_asm) | C++11 | 14 ms | 316 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << " = " << x << "\n";
using ll = long long;
const int MXN = 55;
int n;
ll A[MXN];
string B[MXN];
int it[MXN];
ll X[MXN];
int main()
{
cin >> n;
for(int i = 0; i < n; i++) {
cin >> A[i] >> B[i];
}
if(n == 1) {
ll x = A[0];
ll x0 = stoll(B[0]);
stringstream sstr;
int commands = 0;
if(x0 != x) {
if(x0 > x) {
sstr << "add " << x0-x << "\n";
commands++;
}
else {
sstr << "multiply " << 0 << "\n";
commands++;
if(x0) {
sstr << "add " << x0 << "\n";
commands++;
}
}
}
commands++;
sstr << "print\n";
cout << commands << "\n";
cout << sstr.str();
return 0;
}
const int L = 7;
string best = "";
int best_commands = 10000;
// b0, b1 - spliting (printing) points
// never makes sense to multiply by 0:
// can be changed to mupltiply by 10^x and addition then print
for(int b0 = 0; b0 < (1<<L); b0++) {
for(int b1 = 0; b1 < (1<<L); b1++) {
// ax+b=x0
// ay+b=y0
bool flag = false;
int i = 0, j = 0;
ll x = A[0], y = A[1];
stringstream sstr;
int commands = 0;
while(i < B[0].size() || j < B[1].size()) {
ll x0 = 0, y0 = 0;
// construct numbers until break or end
while(i < B[0].size()) {
x0 *= 10;
x0 += B[0][i]-'0';
i++;
if(((b0 >> (i-1)) & 1)) {
break;
}
}
while(j < B[1].size()) {
y0 *= 10;
y0 += B[1][j]-'0';
j++;
if(((b1 >> (j-1)) & 1)) {
break;
}
}
// ax+b=x0
// ay+b=y0 | (-1)
// a(x-y)=x0-y0
// a = x0-y0/(x-y)
// b = x0-ax
// (visos A[i] reiksmes skirtingos)
if((x0-y0)%(x-y) != 0) {
flag = true; break;
}
ll a = (x0-y0)/(x-y);
ll b = x0-a*x;
if(a < 0 || b < 0) {
flag = true; break;
}
// DEBUG(x);
// DEBUG(y);
// DEBUG(x0);
// DEBUG(y0);
if(a != 1) {
sstr << "multiply " << a << "\n";
commands++;
}
if(b != 0) {
sstr << "add " << b << "\n";
commands++;
}
sstr << "print\n";
commands++;
}
if(flag) continue;
if(commands < best_commands) {
best_commands = commands;
best = sstr.str();
}
// found answer
//return 0;
}
}
if(best == "") {
cout << "-1\n";
}
else {
cout << best_commands << "\n";
cout << best;
}
return 0;
}
/*
2
1 2
2 3
2
11 1122
22 2244
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |