题外

第一次用51nod刷题，wtcl，只能刷最简单的。

3056: 小明爱数列

#include <iostream>
#include <vector>
using namespace std;

void print(vector<int> num)
{
    cout << num.size() << endl;
    vector<int>::iterator it;
    for(it=num.begin();it!=num.end();it++)
    {
        if(it != num.begin())
            cout << " ";
        cout<<*it;
    }
    cout << endl;
}

int main() {
    int m, n;
    cin >> n >> m;
    vector<int> num;
    for(int i = 0; i < n; i++)
    {
        int temp;
        cin >> temp;
        num.push_back(temp);
    }
    for(int i = 0; i < m; i++)
    {
        char op;
        cin >> op;
        if(op == 'D')
        {
            int x;
            cin >> x;
            if(x >= num.size())
                continue;
            num.erase(num.begin()+x);
        }
        else
        {
            int x, y;
            cin >> x >> y;
            if(x >= num.size())
                num.push_back(y);
            else
                num.insert(num.begin()+x, y);
        }
    }
    print(num);
    return 0;
}

3034: 矩形的数量V2

这道题因为数据大小问题出错了很多次...

#include <iostream>
#include <math.h>
using namespace std;

int main() {
    long m, n;
    cin >> m >> n;
    if(m < n)
    {
        long temp = n;
        n = m;
        m = temp;
    }
    long total = ((1 + n) * n) / 2 + n * (m - n);
    long mod = 1e9+7;
    cout << total % mod << endl;
    return 0;
}