Submission

Score: 0

User: samsenpisardmoo

Problemset: C.Sort Number

Language: cpp

Time: 1.096 second

Submitted On: 2025-10-13 20:46:38

#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; 
        for(int j = 1; j <= dec[i]; j++) 
        {
            if(dec[i] % j == 0) 
            {
                sum[i] += j;
            }
        }
    }
    
    sort(sum,sum+n);

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

    return 0;
}