Middle/func3.cpp at main · korolinakila/Middle · GitHub

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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include "middle.h"
#include <iostream>
using namespace std;

int itc_second_max_num(long long number){
 long long s = 10, p=0, h, g=0;
    if(number==-9223372036854775808){
       return 8;
    }
    if(number<0){
        number = number*(-1);
    }
    if(number/10==0){
        return -1;
    }
    s = number;
    while(s!=0){
        h = s%10;
        if(h>=p){
            g=p;
            p=h;
        }
        if(h>g && h<p){
            g=h;
        }
        s = s/10;
    }
    return g;
}   //11


int itc_second_simple_max_num(long long number){
 long long s, p=0, h, g=0, j, u=1;
    if(number<0){
        number = number*(-1);
    }
    if(number/10==0){
        return -1;
    }
    s = number;
    h = s%10;
        if(h>p){
            p=h;
        }
        if(h>g && h<p){
            g=h;
        }
        s = s/10;
        j=h;
    while(s!=0){
        h = s%10;
        if(h>j || h<j){
            u=0;
        }
        j=h;
        if(h>p){
            g=p;
            p=h;
        }
        if(h>g && h<p){
            g=h;
        }
        s = s/10;
    }
    if(u==1){
        return -1;
    }
    else{
    return g;
    }
}   //12

long long itc_bin_num(long long number){
    long long main, ost=1, p=0;
    main = number;
while(main!=0){
    ost = ost*10+main%2;
    main = main/2;
    }
    while( ost!=0){
        p+=ost%10;
        p = p*10;
        ost = ost/10;
    }
    return(p/100);
}   //13

 long long itc_oct_num(long long number){
     long long main, ost=1, p=0;
    main = number;
while(main!=0){
    ost = ost*10+main%8;
    main = main/8;
    }
    while( ost!=0){
        p+=ost%10;
        p = p*10;
        ost = ost/10;
    }
    return(p/100);
 }  //14

 int itc_rev_bin_num(long long number){
     long long ost, dva=1, main, sum=0;
     ost = number;
 while(ost!=0){
    main = (ost%10)*dva;
    sum+=main;
    dva = dva*2;
    ost = ost/10;
    }
    return sum;
 }  //15