2021年山东省C++应用编程比赛小学组参考代码及视频讲解

Posted 2021-04-23 小树信息学竞赛

T1

视频讲解：https://www.bilibili.com/video/BV1Rz4y117Ms

代码

#include<iostream>

using namespace std;

 

int main()

{

    int t;

    cin >> t;

    while(t--)

    {

        double a, b, c, d;

        cin >> a >> b >> c >> d;

        if(a * c * 0.01 + b * d * 0.01 >= 60)

        {

            cout << "pass!\n";

        }

        else

        {

            cout << "poor little A!\n";

        }

    }

 

    return 0;

}

T2

视频讲解：https://www.bilibili.com/video/BV1oy4y1878o

代码

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int ans = 10000;
    int n, a;
    cin >> n;

    if( n % 2 == 0)
    {
        cout << 0;
        return 0;
    }

    for(int i = 1; i <= n; i++)
    {
        cin >> a;
        if(i % 2)
        {
            ans = min(ans, a);
        }
    }
    cout << ans - 1;

    return 0;
}

T3

视频讲解：https://www.bilibili.com/video/BV1jv411a7un

代码

#include <iostream>

using namespace std;

int main()
{
    int t, n;
    cin >> t;
    while(t--)
    {
        cin >> n;
        cout << (n % 4 ? 'A' : 'B') << endl;
    }

    return 0;
}

T4

视频讲解：

 https://www.bilibili.com/video/BV1PZ4y1A7YN

代码

#include <bits/stdc++.h>
using namespace std;

const int maxN = 20;
bool a[maxN], used[maxN];
int p[maxN];
int n, cnt;

void dfs(int pos)
{
    if(pos == n + 1)
    {
        cnt++;
    }

    for(int num = 1; num <= n; num++)
    {
        if(0 == a[pos] && pos % num)
        {
            continue;
        }
        else if(1 == a[pos] && num % pos)
        {
            continue;
        }

        if(!used[num])
        {
            p[pos] = num;
            used[num] = true;
            dfs(pos + 1);
            used[num] = false;
        }
    }
}

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        cin >> n;
        for(int i = 1; i <= n; i++)
        {
            cin >> a[i];
        }

        cnt = 0;
        memset(used, false, sizeof(used));

        dfs(1);

        cout << cnt << endl;
    }

    return 0;
}

>>>