#include <iostream>
#include <cmath>
#include <algorithm>
#pragma GCC optimize("Ofast")
#define ll long long
#define ld long double
using namespace std;
ll digits(ll a){
ll c = 0;
while(a > 0){
a /= 10;
c++;
}
return c;
}
signed main() {
srand(time(NULL));
const ll n = 25;
ll sum = 0;
ll mas[n];
for(ll i = 0; i < n; i++){
mas[i] = rand() % 493 - 246;
cout << mas[i] << " ";
if(digits(mas[i]) == 2 && mas[i] % 4 == 0)
sum += mas[i];
}
cout << "\n" << sum;
}
begin
var n:=ReadInteger('n=');
var a:=ArrRandom(n,10,40); a.Println;
var b:=a.Select(e->2*e+1).ToArray;
b[0]:=a[0]; b[n-1]:=a[n-1];
b.Println
end.
Тестовое решение
n= 10
16 11 28 30 20 39 12 27 12 31
16 23 57 61 41 79 25 55 25 31