oj.uz

답안 #291602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
291602 2020-09-05T14:25:42 Z NaimSS Toys (CEOI18_toy) C++14
39 / 100
 9 ms 1408 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) (int)v.size()
#define int long long
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left sefude
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl; 
typedef long long ll;
typedef pair<int,int> pii;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll a,ll b,ll m){
    if(b==0LL) return 1LL;
    if(b==1LL) return mod(a,m);
    ll k = mod(exp(a,b/2,m),m);
    if(b&1LL){
        return mod(a*mod(k*k,m),m);
    }
    else return mod(k*k,m);
}


const int N = 10100;
bool ok[N];
map<int,int> vis[N];
void go(int n,int sum){
  if(vis[n][sum])return;
  if(n == 1){ok[sum] = 1;return;}
  for(int i=2;i<=n;i++){
    if(n%i == 0){
      go(n/i,sum + i - 1);
    }
  }
  return;
}
int divi(int n){
  int r=0;
  for(int i=1;i<=n;i++){
    if(n%i == 0)r++;
  }
  return r;
}
int32_t main(){
  fastio;
  int n;
  cin >> n;
  //for(n=1;n<=50;n++){
    rep(i,0,N)ok[i]=0;
    go(n,0);
    int cnt=0;
    rep(i,0,N)if(ok[i])cnt++;
  //  cout << n <<": ";
    //cout << cnt << " - "<<divi(n) << endl;
    cout << cnt << endl;
    rep(i,0,N){
      if(ok[i])cout << i<<" ";
      ok[i]=0;
    }
    cout << endl;
 // }

  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 1 ms 768 KB Output is correct
18 Correct 1 ms 768 KB Output is correct
19 Correct 1 ms 768 KB Output is correct
20 Correct 1 ms 768 KB Output is correct
21 Correct 1 ms 768 KB Output is correct
22 Correct 1 ms 768 KB Output is correct
23 Correct 1 ms 768 KB Output is correct
24 Correct 1 ms 768 KB Output is correct
25 Correct 1 ms 768 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 1 ms 768 KB Output is correct
18 Correct 1 ms 768 KB Output is correct
19 Correct 1 ms 768 KB Output is correct
20 Correct 1 ms 768 KB Output is correct
21 Correct 1 ms 768 KB Output is correct
22 Correct 1 ms 768 KB Output is correct
23 Correct 1 ms 768 KB Output is correct
24 Correct 1 ms 768 KB Output is correct
25 Correct 1 ms 768 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
27 Correct 3 ms 896 KB Output is correct
28 Correct 2 ms 896 KB Output is correct
29 Correct 1 ms 896 KB Output is correct
30 Correct 2 ms 896 KB Output is correct
31 Correct 9 ms 964 KB Output is correct
32 Correct 5 ms 896 KB Output is correct
33 Correct 4 ms 896 KB Output is correct
34 Correct 1 ms 768 KB Output is correct
35 Correct 1 ms 768 KB Output is correct
36 Correct 2 ms 896 KB Output is correct
37 Correct 4 ms 896 KB Output is correct
38 Correct 2 ms 896 KB Output is correct
39 Correct 1 ms 768 KB Output is correct
40 Correct 3 ms 896 KB Output is correct
41 Correct 1 ms 768 KB Output is correct
42 Correct 1 ms 768 KB Output is correct
43 Correct 1 ms 840 KB Output is correct
44 Correct 1 ms 800 KB Output is correct
45 Correct 1 ms 896 KB Output is correct
46 Correct 1 ms 768 KB Output is correct
47 Correct 3 ms 896 KB Output is correct
48 Correct 1 ms 768 KB Output is correct
49 Correct 1 ms 768 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 1 ms 768 KB Output is correct
18 Correct 1 ms 768 KB Output is correct
19 Correct 1 ms 768 KB Output is correct
20 Correct 1 ms 768 KB Output is correct
21 Correct 1 ms 768 KB Output is correct
22 Correct 1 ms 768 KB Output is correct
23 Correct 1 ms 768 KB Output is correct
24 Correct 1 ms 768 KB Output is correct
25 Correct 1 ms 768 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
27 Correct 3 ms 896 KB Output is correct
28 Correct 2 ms 896 KB Output is correct
29 Correct 1 ms 896 KB Output is correct
30 Correct 2 ms 896 KB Output is correct
31 Correct 9 ms 964 KB Output is correct
32 Correct 5 ms 896 KB Output is correct
33 Correct 4 ms 896 KB Output is correct
34 Correct 1 ms 768 KB Output is correct
35 Correct 1 ms 768 KB Output is correct
36 Correct 2 ms 896 KB Output is correct
37 Correct 4 ms 896 KB Output is correct
38 Correct 2 ms 896 KB Output is correct
39 Correct 1 ms 768 KB Output is correct
40 Correct 3 ms 896 KB Output is correct
41 Correct 1 ms 768 KB Output is correct
42 Correct 1 ms 768 KB Output is correct
43 Correct 1 ms 840 KB Output is correct
44 Correct 1 ms 800 KB Output is correct
45 Correct 1 ms 896 KB Output is correct
46 Correct 1 ms 768 KB Output is correct
47 Correct 3 ms 896 KB Output is correct
48 Correct 1 ms 768 KB Output is correct
49 Correct 1 ms 768 KB Output is correct
50 Runtime error 2 ms 1408 KB Execution killed with signal 11
51 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 1 ms 768 KB Output is correct
18 Correct 1 ms 768 KB Output is correct
19 Correct 1 ms 768 KB Output is correct
20 Correct 1 ms 768 KB Output is correct
21 Correct 1 ms 768 KB Output is correct
22 Correct 1 ms 768 KB Output is correct
23 Correct 1 ms 768 KB Output is correct
24 Correct 1 ms 768 KB Output is correct
25 Correct 1 ms 768 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
27 Correct 3 ms 896 KB Output is correct
28 Correct 2 ms 896 KB Output is correct
29 Correct 1 ms 896 KB Output is correct
30 Correct 2 ms 896 KB Output is correct
31 Correct 9 ms 964 KB Output is correct
32 Correct 5 ms 896 KB Output is correct
33 Correct 4 ms 896 KB Output is correct
34 Correct 1 ms 768 KB Output is correct
35 Correct 1 ms 768 KB Output is correct
36 Correct 2 ms 896 KB Output is correct
37 Correct 4 ms 896 KB Output is correct
38 Correct 2 ms 896 KB Output is correct
39 Correct 1 ms 768 KB Output is correct
40 Correct 3 ms 896 KB Output is correct
41 Correct 1 ms 768 KB Output is correct
42 Correct 1 ms 768 KB Output is correct
43 Correct 1 ms 840 KB Output is correct
44 Correct 1 ms 800 KB Output is correct
45 Correct 1 ms 896 KB Output is correct
46 Correct 1 ms 768 KB Output is correct
47 Correct 3 ms 896 KB Output is correct
48 Correct 1 ms 768 KB Output is correct
49 Correct 1 ms 768 KB Output is correct
50 Runtime error 2 ms 1408 KB Execution killed with signal 11
51 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 1 ms 768 KB Output is correct
18 Correct 1 ms 768 KB Output is correct
19 Correct 1 ms 768 KB Output is correct
20 Correct 1 ms 768 KB Output is correct
21 Correct 1 ms 768 KB Output is correct
22 Correct 1 ms 768 KB Output is correct
23 Correct 1 ms 768 KB Output is correct
24 Correct 1 ms 768 KB Output is correct
25 Correct 1 ms 768 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
27 Correct 3 ms 896 KB Output is correct
28 Correct 2 ms 896 KB Output is correct
29 Correct 1 ms 896 KB Output is correct
30 Correct 2 ms 896 KB Output is correct
31 Correct 9 ms 964 KB Output is correct
32 Correct 5 ms 896 KB Output is correct
33 Correct 4 ms 896 KB Output is correct
34 Correct 1 ms 768 KB Output is correct
35 Correct 1 ms 768 KB Output is correct
36 Correct 2 ms 896 KB Output is correct
37 Correct 4 ms 896 KB Output is correct
38 Correct 2 ms 896 KB Output is correct
39 Correct 1 ms 768 KB Output is correct
40 Correct 3 ms 896 KB Output is correct
41 Correct 1 ms 768 KB Output is correct
42 Correct 1 ms 768 KB Output is correct
43 Correct 1 ms 840 KB Output is correct
44 Correct 1 ms 800 KB Output is correct
45 Correct 1 ms 896 KB Output is correct
46 Correct 1 ms 768 KB Output is correct
47 Correct 3 ms 896 KB Output is correct
48 Correct 1 ms 768 KB Output is correct
49 Correct 1 ms 768 KB Output is correct
50 Runtime error 2 ms 1408 KB Execution killed with signal 11
51 Halted 0 ms 0 KB -