团体程序设计天梯赛练习题L1_part 11(51~55)

 L1-051 打折 (5 分)

#include <bits/stdc++.h>
using namespace std;
int main(void)
{
    double n, m;
    cin >>n >>m;
    n *= (m*0.1);
    printf("%.2lf", n);
    return 0;
}

 L1-052 2018我们要赢 (5 分)

#include <bits/stdc++.h>
using namespace std;
int main(void)
{
    printf("2018\nwo3 men2 yao4 ying2 !");
    return 0;
}

L1-053 电子汪 (10 分) 

#include <bits/stdc++.h>
using namespace std;
int main(void)
{
    int a, b;
    cin >>a >>b;
    for(int i = 1; i <= a+b; i++)
        cout <<"Wang!";
    return 0;
}

L1-054 福到了 (15 分) 

#include <bits/stdc++.h>
using namespace std;
int main(void) {
    char x, c[110][110], res[110][110];
    int n;
    //读入
    cin >> x >> n;
    getchar();
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++) {
            c[i][j] = getchar();
            if (j == n) getchar();
        }
    }
    //翻转
    for(int i = n; i >= 1; i--){
        for(int j = n; j >= 1; j--){
            if(c[n + 1 - i][n + 1 - j] == ' ')
                res[i][j] = ' ';
            else
                res[i][j] = x;
        }
    }
    //判断
    bool ans = true;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if((res[i][j] == ' ' && c[i][j] != ' ') || (c[i][j] == ' ' && res[i][j] != ' ')){
                ans = false;
                break;
            }
        }
    }
    //输出
    if(ans) cout <<"bu yong dao le" <<endl;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++)
            cout <<res[i][j];
        if(i != n) cout <<endl;
    }
    return 0;
}

L1-055 谁是赢家 (10 分)

#include <bits/stdc++.h>
using namespace std;
int main(void) {
    int p1, p2, k;
    int j1 = 0, j2 = 0;
    cin >>p1 >>p2;
    for(int i = 1; i <= 3; i++){
        cin >>k;
        if(k) j2++;
        else j1++;
    }
    if(j1 == 3 || (p1 > p2 && j1))
        printf("The winner is a: %d + %d", p1, j1);
    else
        printf("The winner is b: %d + %d", p2, j2);
    return 0;
}