Submission

Score: 0

User: samsenpisardmoo

Problemset: C.Sort Number

Language: cpp

Time: 0.049 second

Submitted On: 2025-10-13 20:51:39

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;

    vector<pair<int,string>> a(n); 
    int dec[n], sum[n];

    for(int i = 0; i < n; i++) cin >> a[i].first >> a[i].second;

    for(int i = 0; i < n; i++) 
    {
        dec[i] = stoi(a[i].second, nullptr, a[i].first);
    }

    for(int i = 0; i < n; i++) 
    {
        sum[i] = 0;
        int x = dec[i];
        for(int j = 1; j * j <= x; j++) 
        {
            if(x % j == 0) 
            {
                sum[i] += j;
                if(j != x / j) sum[i] += x / j; 
            }
        }
    }

    sort(sum,sum+n);
    for(int i = n-1; i >= 0; i--) cout << sum[i] << endl;

    return 0;
}