#include <iostream>
using namespace std;
const int N = (int)1e5+1;
string s;
int a[N];
int main()
{
cin >> s;
int idx = 0;
for (int i = 0; i < s.length(); i++) {
a[idx] = s[i] - '0';
idx++;
}
for (int i = 0; i < idx; i++) {
cout << a[i] << ' ';
}
return 0;
}#include <iostream>
using namespace std;
const int N = (int)1e5+1;
string s;
int a[N];
int main()
{
cin >> s;
int idx = 0;
for (int i = 0; i < s.length(); i++) a[idx++] = s[i] - '0';
for (int i = 0; i < idx; i++) cout << a[i] << ' ';
return 0;
}#include <iostream>
using namespace std;
const int N = (int)1e5+1;
string s;
vector <int> a[N];
int main()
{
cin >> s;
for (int i = 0; i < s.length(); i++) a.push_back(s[i] - '0');
for (int i = 0; i < a.size(); i++) cout << a[i] << ' ';
return 0;
}
280138
798081
Первый массив:
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
+---+---+---+---+---+---+---+---+---+---+
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 2 | 0 |
Второй массив:
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
+---+---+---+---+---+---+---+---+---+---+
| 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 2 | 1 |
Минимумы:
| 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
+---+---+---+---+---+---+---+---+---+---+
| 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 |
Результат:
8810
Простой
Простой
Простой
