数的分解（蓝桥杯2019D）

#include<iostream>
using namespace std;
bool judge(int num) {
	while (num != 0) {
		int mod = num % 10;
		if (mod == 2 || mod == 4) {
			return  false;
		}
		num /= 10;
	}
	return true;
}
int main() {
	int sum = 0;
	for (int i = 1; i < int(2019/3) + 1;i++) {
		if (judge(i)) {
			for (int j = i + 1; j < (2019 - i) - j; j++) {
				if (judge(j)) {
					if (judge(2019 - i - j)) {
						sum++;
					}
				}
			}
		}
	}
	cout << sum << endl;
	return 0;
}