Submission #1307520

#	Time	Username	Problem	Language	Result	Execution time	Memory
1307520		Nonoze	Multiply (CEOI17_mul)	C++20	0 / 100	0 ms	332 KiB

mul

/*
*	Author: Nonoze
*	Created: Saturday 03/01/2026
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef DEBUG
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}




int n, m;


void solve() {
	read(n, m);
	string a, b; read(a, b);
	string res(n+m-1, '0');
	reverse(all(a)), reverse(all(b));
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) {
			int mul = (a[i]-'0') * (b[j]-'0');
			int pos = i + j;
			int sum = (res[pos]-'0') + mul;
			res[pos] = (sum % 10) + '0';
			int carry = sum / 10;
			int k = pos + 1;
			while (carry > 0) {
				sum = (res[k]-'0') + carry;
				res[k] = (sum % 10) + '0';
				carry = sum / 10;
				k++;
			}
		}
	}
	while (sz(res)>1 && res.back()=='0') res.pop_back();
	reverse(all(res));
	cout << res << endl;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30