oj.uz

Submission #444709

# Submission time Handle Problem Language Result Execution time Memory
444709 2021-07-15T00:40:49 Z definitelynotmee Toys (CEOI18_toy) C++
0 / 100
 0 ms 204 KB 
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int MAXN = 1e6+1;



int main(){

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    set<int> resp;
    function<void(int,int,int)> bt =[&](int n, int cur, int sum){
        if(n==1)
            resp.insert(sum);
        for(int i = cur; i <= sqrt(n); i++){
            if(n%i == 0)
                bt(n/i,cur,sum-1);
        }
    };
    cout << resp.size() << '\n';
    for(int i : resp)
        cout << i << ' ';
    cout << '\n';
    return 0;

}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -