1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

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

int cycle(int n,int len){
    //printf("%d ",n);
    if(n==1) return len+1;
    if(n%2!=0) len=cycle(3*n+1,len+1);
    else len=cycle(n/2,len+1);
    return len;
}

int main(){
    multimap<int,int> mmap;
    for(int i=1;i<100000;i++) mmap.insert(make_pair(cycle(i,0),i));

    int a,b;
    while(scanf("%d %d",&a,&b)!=EOF){
        //cout<<a<<" "<<b<<" ";
        printf("%d %d ",a,b);
        if(a<b) swap(a,b);
        for(auto it=--mmap.end();it!=mmap.begin();it--){
            if((*it).second<a && (*it).second>b){
                //cout<<(*it).first<<'\n';
                printf("%d\n",(*it).first);
                break;
           }
        }
    }
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

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

int cycle(int n,int len){
    //printf("%d ",n);
    if(n==1) return len+1;
    if(n%2!=0) len=cycle(3*n+1,len+1);
    else len=cycle(n/2,len+1);
    return len;
}

class Node{
public:
    int start;
    int end;
    int max;
    Node *left=nullptr;
    Node *right=nullptr;
    Node(int start,int end,int max,Node *left=nullptr,Node *right=nullptr):
    start(start),end(end),max(max),left(left),right(right){}
};

Node *build(int start,int end,int val[]){
    if(start==end){
        //if(end<=300) cout<<"build: ["<<start<<", "<<end<<"] node->max="<<val[start]<<"\n";
        return new Node(start,end,val[start],nullptr,nullptr);
    }
    int mid=(start+end)/2;
    Node *left=build(start,mid,val);
    Node *right=build(mid+1,end,val);
    //if(end<=300) cout<<"build: ["<<start<<", "<<end<<"]"<<" node->max="<<max(left->max,right->max)<<"\n";
    return new Node(start,end,max(left->max,right->max),left,right);
}

int query_max(Node *root,int i,int j){
    int sum=0;
    if(root->start==root->end) return root->max;
    if(root->start==i&&root->end==j) return root->max;
    int mid=root->start+(root->end-root->start)/2;
    //cout<<"query: ["<<i<<", "<<j<<"] @ ["<<root->start<<", "<<root->end<<"] root->max="<<root->max<<"\n";
    if(j<=mid) return query_max(root->left,i,j);
    else if(i>mid) return query_max(root->right,i,j);
    else return max(query_max(root->left,i,mid),query_max(root->right,mid+1,j));
}

int arr[1000002];
int main(){
    for(int i=1;i<100000;i++) arr[i]=cycle(i,0);
    Node *root=build(0,1000000,arr);
    int a,b;
    while(scanf("%d %d",&a,&b)!=EOF){
        printf("%d %d ",a,b);
        if(a>b) swap(a,b);
        printf("%d\n",query_max(root,a,b));
    }
    return 0;
}