题解 | #牛牛的通勤#
牛牛的通勤
https://www.nowcoder.com/practice/1fe33d534843473eb086c4b42655e13d
知识点：
分支控制：分支控制
#include <iostream>
using namespace std;
int main() {
int distance = 0;
char traffic = ' ';
int time_walk = 0;
int time_taxi = 0;
cin >> distance;
time_walk = distance / 1;
time_taxi = distance / 10 + 10;
if (time_walk < time_taxi ) {
traffic = 'w';
} else {
traffic = 'v';
}
cout << traffic;
return 0;
}
#算法#
数禾科技公司福利 312人发布