题解 | 牛牛的通勤

牛牛的通勤

https://www.nowcoder.com/practice/1fe33d534843473eb086c4b42655e13d

#include <stdio.h>
#include <math.h>
int main() {
    int distance,time1,time2;
    int v1 = 1;
    int v2 = 10;
    scanf("%d",&distance);
    time1 = distance / v1;
    time2 = ceil(distance / v2) + 10;
    int time = (time1 < time2)?time1 :time2;
    if( time1 == time){
    printf("w");
    }
    if( time2 == time){
    printf("v");
    }
    return 0;
}

全部评论

相关推荐

评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务