Submission #77372

#	Time	Username	Problem	Language	Result	Execution time	Memory
77372		duality	Toys (CEOI18_toy)	C++11	100 / 100	1654 ms	113048 KiB

toy

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

vi f;
vi dp[100000];
int main() {
    int n;
    scanf("%d",&n);

    int i,j,k;
    for (i = 1; i*i <= n; i++) {
        if ((n % i) == 0) {
            f.pb(i);
            if (i*i != n) f.pb(n/i);
        }
    }
    sort(f.begin(),f.end());
    dp[0].pb(0);
    for (i = 1; i < f.size(); i++) {
        for (j = 0; j < i; j++) {
            if ((f[i] % f[j]) == 0) {
                for (k = 0; k < dp[j].size(); k++) dp[i].pb(dp[j][k]+f[i]/f[j]-1);
            }
        }
        sort(dp[i].begin(),dp[i].end());
        dp[i].resize(unique(dp[i].begin(),dp[i].end())-dp[i].begin());
    }
    printf("%d\n",dp[f.size()-1].size());
    for (i = 0; i < dp[f.size()-1].size(); i++) printf("%d ",dp[f.size()-1][i]);
    printf("\n");

    return 0;
}

Compilation message (stderr)

toy.cpp: In function 'int main()':
toy.cpp:73:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 1; i < f.size(); i++) {
                 ~~^~~~~~~~~~
toy.cpp:76:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (k = 0; k < dp[j].size(); k++) dp[i].pb(dp[j][k]+f[i]/f[j]-1);
                             ~~^~~~~~~~~~~~~~
toy.cpp:82:40: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n",dp[f.size()-1].size());
                   ~~~~~~~~~~~~~~~~~~~~~^
toy.cpp:83:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < dp[f.size()-1].size(); i++) printf("%d ",dp[f.size()-1][i]);
                 ~~^~~~~~~~~~~~~~~~~~~~~~~
toy.cpp:62:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~

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