백준/백준-C++
10448번: 유레카 이론
Beabletoet
2017. 9. 8. 20:47
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 | #include <cstdio> int main() { int tri[44], t, k; bool next = 1; for (int i = 1; i < 45; ++i) tri[i-1] = i*(i + 1) / 2; for (scanf("%d", &t); t--;next = 1) { scanf("%d", &k); for (int i = 0; i < 44 && next; ++i) for (int j = i; j < 44 && next; ++j) for (int l = j; l < 44 && next; ++l) if (tri[i] + tri[j] + tri[l] == k) next = 0; if (next) printf("0\n"); else printf("1\n"); } } | cs |