Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: samsenpisardmoo26
Problemset: C.Sort Number
Language: cpp
Time: 0.057 second
Submitted On: 2026-10-10 16:21:20
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
string num[n][2];
vector<long long> v;
for(int i=0; i<n; i++)
{
cin >> num[i][0];
cin >> num[i][1];
v.push_back(stoll(num[i][1], nullptr, stoi(num[i][0])));
}
vector<long long> c;
for(int k=0; k<v.size(); k++)
{
long long cnt=0;
for(long long i=1; i*i<=v[k]; i++)
{
if(v[k]%i == 0)
{
cnt+=i;
if(i != v[k]/i)
{
cnt+=v[k]/i;
}
}
}
c.push_back(cnt);
}
sort(c.begin(), c.end(), greater<long long>());
for(int i=0; i<c.size(); i++)
{
cout << c[i] << "\n";
}
}