1120. Friend Numbers (20)

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

//題目大意 給出n個數字 将其每一位加起來sum  輸出不同sum的個數  按sum 大小
//思路：(1)用字元串 友善求sum (2)用map 友善記錄不同sum

int main(){
    int n, sum = 0;
    string st;
    cin >> n;
    vector<int> ans;
    map<int, bool> ma;
    
    for (int i = 0; i < n; i++) {
        cin >> st;
        sum = 0;
        for (int j = 0; j < st.size(); j++) {
            sum += st[j] - '0';
        }
        if(!ma[sum]){
            ma[sum] = true;
            ans.push_back(sum);
        }
    }
    sort(ans.begin(), ans.end());
    cout << ans.size() << endl;
    for (int i = 0; i < ans.size(); i++) {
        if(i != 0) cout << ' ';
        cout << ans[i];
    }
    cout << endl;
    
    return 0;
}