Submission #920759

#	Time	Username	Problem	Language	Result	Execution time	Memory
920759		Muhammad_Aneeq	Toys (CEOI18_toy)	C++17	79 / 100	5052 ms	64296 KiB

toy

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <cmath>
#include <set>
#include <unordered_map>
using namespace std;
unordered_map<int,set<int>>d;
set<int> divsum(int n)
{
    if (d.find(n)!=d.end())
        return d[n];
    set<int>ans;
    ans.insert(n-1);
    for (int i=2;i<=sqrt(n);i++)
    {
        if (n%i==0)
        {
            set<int>x=divsum(i);
            set<int>y=divsum(n/i);
            for (auto k:x)
                for (auto j:y)
                    ans.insert(k+j);
        }
    }
    d[n]=ans;
    return ans;
}
inline void solve()
{
    int n;
    cin>>n;
    set<int>ans=divsum(n);
    cout<<ans.size()<<endl;
    for (auto i:ans)
        cout<<i<<' ';
    cout<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

• Subtask 1: 19 / 19
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 20 / 20
• Subtask 5: 0 / 21