Submission #1512965

---

Source Code Expand

import std.array;
import std.stdio;
import std.range;
import std.algorithm;
import std.format;
import std.bigint;
import std.functional;
import std.string;
import std.conv;

void main()
{
	int N, M;
	string input = readln();
	input.formattedRead("%s %s", &N, &M);
	auto result = solve(N, M);
	format("%s %s %s", result[0], result[1], result[2]).writeln();
}

int[] solve(int n, int m)
{
	foreach (p3; 0 .. 2)
	{
		int _m = m - (p3 * 3);
		int _n = n - p3;
		for (int p4 = 0; p4 <= _n && p4 * 4 <= _m; p4++)
		{
			if (_m - (p4 * 4) == 2 * (_n - p4))
			{
				return [_n - p4, p3, p4];
			}

		}
	}
	return [-1, -1, -1];
}

Submission Info

Judge Result