Submission #425026

#	Time	Username	Problem	Language	Result	Execution time	Memory
425026		Blistering_Barnacles	Toys (CEOI18_toy)	C++11	39 / 100	5052 ms	218812 KiB

toy

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < pll , ll > mp ;
map < ll , ll > pp ;
vll adj[555555];
const ll mod = 1e9+7;
str s;
vll v ;
void mem(ll i , ll sum , ll op){
    if(mp[{op , sum}])R ;
    if(op > n)R ;
    if(i > m){
        if(n == op)pp[sum]++ ;
        R ;
    }
    mem(i + 1 , sum , op) , mem(i , sum + v[i] - 1 , op * v[i]) ;
    mp[{op , sum}]++ ;
}
void solve(){
    scanf("%d" , &n) ;
    for(ll i = 1 ; i * i <= n ; i++){
        if(n % i)C ;
        if(i - 1)v.pb(i) ;
        if(i * i == n)C ;
        v.pb(n / i) ;
    }
    sort(all(v)) ;
    m = sz(v) - 1 ;
    mem(0 , 0 , 1) ;
    printf("%d\n" , sz(pp)) ;
    for(auto u : pp){
        printf("%d " , u.F) ;
    }
}
int main(){
    fast ;
    //cin >> q;
    q = 1;
    while(q--){
        solve();
    }
}

Compilation message (stderr)

toy.cpp: In function 'void solve()':
toy.cpp:50:13: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll*' {aka 'long long int*'} [-Wformat=]
   50 |     scanf("%d" , &n) ;
      |            ~^    ~~
      |             |    |
      |             int* ll* {aka long long int*}
      |            %lld
toy.cpp:60:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::map<long long int, long long int>::size_type' {aka 'long unsigned int'} [-Wformat=]
   60 |     printf("%d\n" , sz(pp)) ;
      |             ~^
      |              |
      |              int
      |             %ld
toy.cpp:62:18: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   62 |         printf("%d " , u.F) ;
      |                 ~^
      |                  |
      |                  int
      |                 %lld
toy.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     scanf("%d" , &n) ;
      |     ~~~~~^~~~~~~~~~~

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