牛客练习赛15

A-吉姆的运算式

题解：寻找最后出现的数字。

#pragma warning(disable:4996)
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long 
using namespace std;

const int maxn = 10005;

string s;

int main()
{
    while (cin >> s) {
        int n = s.size();
        int pos = -1;
        for (int i = n - 1; i >= 0; i--) if (s[i] >= '0'&&s[i] <= '9') { pos = i; break; }
        int los = 0;
        for (int i = pos; i >= 0; i--) if (s[i] == ',' || s[i] == '(' || s[i] == ')') { los = i + 1; break; }
        for (int i = los; i <= pos; i++) cout << s[i];
        cout << endl;
    }
    return 0;
}

B-沃老师学生的成绩

来自官方题解：score要去掉末尾‘0’，否则可能会TLE。。。还是太菜了。。。别忘了将开始删除的末尾0在输出的时候加上。

感受：对STL提供的模板函数还是不熟啊，学习了一波代码的写法。

#pragma warning(disable:4996)
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long 
using namespace std;

const int maxn = 200005;

int n;

struct node {
    string name, score;
    int zero_cnt;
    void init() {
        zero_cnt = 0;
        int len = score.size();
        while (zero_cnt < len && score[len - 1 - zero_cnt] == '0') zero_cnt++;
        score.resize(len - zero_cnt);
    }
    bool operator<(const node& i)const {
        if (score == i.score) return name < i.name;
        else return score > i.score;
    }
}pe[maxn];

int main()
{
    while (cin >> n) {
        for (int i = 1; i <= n; i++) {
            cin >> pe[i].name >> pe[i].score;
            pe[i].init();
        }
        sort(pe + 1, pe + n + 1);
        for (int i = 1; i <= n; i++) cout << pe[i].name << " " << pe[i].score + string(pe[i].zero_cnt,'0') << endl;
    }
    return 0;
}