contests/13-problem.cpp at main · FlyingPotato-131/contests · 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
#include <iostream>
std::int64_t pow(int value, int p) {
    if (p == 0) {
        return 1;
    }
    int result = 1;
    for (int i = 0; i < p; i++)
    {
        result *= value;
    }
    return result;
}
char* itoa(std::int64_t num) {
    int size = 0;
    int temp_copy = num;
    while (temp_copy) {
        temp_copy /= 10;
        size++;
    }
    char* str = static_cast<char*>(std::malloc(size));// static_cast можно заменить на (char*s)
    int position = 0;
    str[size]='\0';
    while (size) {
        int pos=((num % pow(10, size)) / pow(10, size - 1));
        switch (pos) {
            case 0:
                str[position]='0';
                break;
            case 1:
                str[position]='1';
                break;
            case 2:
                str[position]='2';
                break;
            case 3:
                str[position]='3';
                break;
            case 4:
                str[position]='4';
                break;
            case 5:
                str[position]='5';
                break;
            case 6:
                str[position]='6';
                break;
            case 7:
                str[position]='7';
                break;
            case 8:
                str[position]='8';
                break;
            case 9:
                str[position]='9';
                break;
        }
        size--;
        position++;
    }
    return str;
}

int main(){
	std::cout << itoa(-324234) << std::endl;
}