Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
35963 | 马祎杨 | 排列组合 | C++ | Accepted | 2 MS | 688 KB | 364 | 2022-08-06 11:27:46 |
#include <iostream> using namespace std; int main() { int cnt = 0; for (int i = 2; i <= 8; i += 2) { for (int j = 2; j <= 8; j += 2) { for (int k = 2; k <= 8; k += 2) { if (i == j || i == k || j == k) { continue; } else { cout << i << j << k << endl; cnt ++; } } } } cout << cnt << endl; return 0; }