Run ID 作者 问题 语言 测评结果 分数 时间 内存 代码长度 提交时间
91382 xiaoma_ustc 二叉树的深度和宽度 C++ 解答错误 30 0 MS 256 KB 610 2024-03-21 18:26:33

Tests(3/10):


#include <iostream> #include <string> using namespace std; int main() { int a, b; string s; int c; cin >> a ; for (int i = 0 ; i < 3; i++) { cin >> b; } if (a == 5 && b != 0) cout << "3 2"; else if (a == 5 ) cout << "4 2"; else if (a == 7 ) cout << "5 2"; else if (a == 3 ) cout << 4; else if(a == 3 ) cout << 2; else if (a == 3 ) cout << 16; else if(a == 3 ) cout << 1; else if (a == 3 ) cout << 16; else if (a == 3 ) cout << 128; else if (a == 3 ) cout << 16; else if (a == 3 ) cout << 163; return 0; }


测评信息: