#include <iostream>
#include <vector>
using namespace std;
void insertionSort(vector<int> &a_){
vector<int> t;
int n = a_.size();
for(int i = 0; i < n; i++){
int u = i;
for(int j = i + 1; j < n; j++)
if(a_[j] < a_[u])
u = j;
swap(a_[i], a_[u]);
if(!(a_[i] & 1))
t.push_back(a_[i]);
}
a_ = t;
}
void solve(){
vector<int> a = {-2, 4, 10, -1, 1, 6, 3, 7, 8, 5};
insertionSort(a);
cout << "a = {";
for(int i = 0; i < a.size() - 1; i++)
cout << a[i] << ", ";
cout << a.back() << "}";
}
int main(){
solve();
}
Код (python 3.5):
codes = "."
with open('input.txt', 'r') as f:
encoded = list(map(int,list(f.read(
if len(encoded) == 1:
print(codes[encoded[0]])
else:
decoded = [codes[encoded[0]], ""]
for i in range(1, len(encoded)):
if (decoded[0] is None) or (encoded[i] == 0):
decoded = [decoded[1] + codes[10*encoded[i-1] + encoded[i]], decoded[0]]
elif (10*encoded[i-1] + encoded[i]>26) or (decoded[1] is None) or \
(len(decoded[1]) >= len(decoded[0])):
decoded = [decoded[0] + codes[encoded[i]], decoded[0]]
else:
decoded = [decoded[1] + codes[10*encoded[i-1] + encoded[i]], decoded[0]]
with open('output.txt', 'w') as f:
f.write(decoded[0])