m0_63494135的博客

PAT (Basic Level) Practice （中文） 1058

map<long, int> company; // 记录种类 map自动实现排序void deal(const string& num){ long sum = 0; for (int i = 0; i < num.size(); i++)sum += num[i] - '0'; if (company.find(sum) != company.end()) company[sum]++; else company.insert({ sum,1 });}i.

#include<iostream>#include<cmath>#include<stack>using namespace std;// 记录答案struct solution{ int a, b; solution(int a1, int b1) :a(a1), b(b1) {}; friend ostream& operator<<(ostream& out, const solution&...