2022年12月

//第一道-编程题
#include<iostream>using namespace std;int main(){    int n, ans = 0;    cin >> n;    while (n > 0)    {        ans++;        n /= 10;    }    cout << ans;    return 0;}






//第二道-编程题

#include<iostream>#include<string> using namespace std;int main(){    string s;    cin >> s;    for (int i = 0; i < s.size(); i++)    {        if (i % 2 == 0)            cout << s[i];        else if (s[i] == 'W')            cout << 'M';        else cout << 'W';    }    return 0;}







//第三道-编程题


#include<iostream>#include<algorithm> using namespace std;struct Player{    int id;    int score;} player[51];bool cmp(Player a, Player b) {    if (a.score != b.score)        return a.score > b.score;    else        return a.id < b.id;}int main(){    int n;    cin >> n;    for (int i = 0; i < n; i++)    {        cin >> player[i].id >> player[i].score;    }    sort(player, player + n, cmp);    for (int i = 0; i < n; i++)    {        cout << player[i].id << ' ' << player[i].score << endl;    }    return 0;}




//第四道-编程题

#include<iostream>using namespace std;int dis[102];int main(){    int d, n, ans = 0;    cin >> d >> n;    bool f = false;    int curr_d = 0;    for (int i = 1; i < n; i++)    {        cin >> dis[i];    }    for (int i = 1; i < n; i++)    {        if (dis[i] > d)        {            f = true;            break;        }        if (curr_d >= dis[i])        {            curr_d -= dis[i];        }        else        {            curr_d = d - dis[i];            ans++;//            cout << " gas: " << i << endl;                    }//        cout << "curr_d: " << curr_d << endl;                           }    if (curr_d < 0)        ans++;    if (!f)        cout << ans;    else        cout << -1;    return 0;}
//第五道-编程题#include<iostream>#include<algorithm>using namespace std;const int N = 20;int a[N+1];bool vis[N+1];int f[N+1];int maxs = 0;bool hasr = false;void output(int k){    for(int i = 1; i <= k; i++)    {        cout << f[i] << ' ';    }    cout << endl;}void dfs(int n, int k, int lstp, int t, int s){    int maxsum = 0;    if (t > k)    {        if (s > maxs)            maxs = s;       // output(k);        hasr = true;        return;    }    for (int i = lstp+1; i <= n; i++)    {        if(a[i] < a[lstp]) // 下降，跳过             continue;        if(vis[i])      // 已选，跳过             continue;//        if(t + a[i] < maxs) // 和比最大值小，跳过 //            continue;        vis[i] = true;        f[t] = a[i];        dfs(n, k, i, t + 1, s + a[i]);        f[t] = 0;        vis[i]  = false;    }    return;}int main(){    int n, k;    int f = false;    cin >> n >> k;    for(int i = 1; i <= n; i++)    {        cin >> a[i];    }    dfs(n, k, 0, 1, 0);    if(hasr)        cout << maxs;    else        cout << 0;    return 0;}/*4 32 3 3 4
4 34 3 3 2
4 34 3 3 3
4 34 3 3 4
14 313 7 9 16 38 24 37 18 44 19 21 22 63 15
4 316 12 16 17
4 114 16 17 1717
5 314 14 13 12 100
8 313 18 20 15 14 19 17 1651
11 3133 179 209 155 140 195 174 164 160 110 131521
3 2209 215 165424
12 5132 113 126 161 149 150 155 155 130 130 173 189822
*/