Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void solve()
- {
- int zeros = 0;
- string n, w;
- cin >> n >> w;
- vector<ll> ans, holder;
- for (int i = 0; i < n.length(); i++)
- {
- holder.push_back(n[i] - '0');
- }
- sort(holder.begin(), holder.end());
- for (int i = 0; i < n.length(); i++)
- {
- if (holder[i] == 0)
- {
- zeros++;
- continue;
- }
- else if (zeros and ans.size() == 1)
- {
- while (zeros--)
- ans.push_back(0);
- ans.push_back(holder[i]);
- continue;
- }
- else
- {
- ans.push_back(holder[i]);
- continue;
- }
- }
- while (ans.size() != holder.size())
- {
- ans.push_back(0);
- }
- for (int i = 0; i < w.length(); i++)
- {
- if (ans[i] != w[i] - '0')
- {
- cout << "WRONG_ANSWER" << endl;
- return;
- }
- }
- cout << "OK" << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment