119 lines
3.1 KiB
C++
119 lines
3.1 KiB
C++
//
|
|
// Created by zacharias on 2026-04-17.
|
|
//
|
|
|
|
#include <cstdio>
|
|
#include <iostream>
|
|
|
|
int main() {
|
|
int n;
|
|
|
|
scanf("%d", &n);
|
|
|
|
int minNumbers[n];
|
|
int maxNumbers[n];
|
|
|
|
for (int i = 0; i < n; i++) {
|
|
minNumbers[i] = 0;
|
|
maxNumbers[i] = 0;
|
|
char number[4];
|
|
scanf("%s", number);
|
|
|
|
for (int j = 0; j < 4; j++) {
|
|
switch (number[j]) {
|
|
case '0': {
|
|
minNumbers[i] += 0;
|
|
maxNumbers[i] += 0;
|
|
break;
|
|
}
|
|
case '1': {
|
|
minNumbers[i] += 1;
|
|
maxNumbers[i] += 1;
|
|
break;
|
|
}
|
|
case '2': {
|
|
minNumbers[i] += 2;
|
|
maxNumbers[i] += 2;
|
|
break;
|
|
}
|
|
case '3': {
|
|
minNumbers[i] += 3;
|
|
maxNumbers[i] += 3;
|
|
break;
|
|
}
|
|
case '4': {
|
|
minNumbers[i] += 4;
|
|
maxNumbers[i] += 4;
|
|
break;
|
|
}
|
|
case '5': {
|
|
minNumbers[i] += 5;
|
|
maxNumbers[i] += 5;
|
|
break;
|
|
}
|
|
case '6': {
|
|
minNumbers[i] += 6;
|
|
maxNumbers[i] += 6;
|
|
break;
|
|
}
|
|
case '7': {
|
|
minNumbers[i] += 7;
|
|
maxNumbers[i] += 7;
|
|
break;
|
|
}
|
|
case '8': {
|
|
minNumbers[i] += 8;
|
|
maxNumbers[i] += 11;
|
|
break;
|
|
}
|
|
case '9': {
|
|
minNumbers[i] += 9;
|
|
maxNumbers[i] += 9;
|
|
break;
|
|
}
|
|
case 'A': {
|
|
minNumbers[i] += 10;
|
|
maxNumbers[i] += 10;
|
|
break;
|
|
}
|
|
case 'B': {
|
|
minNumbers[i] += 8;
|
|
maxNumbers[i] += 11;
|
|
break;
|
|
}
|
|
case 'C': {
|
|
minNumbers[i] += 12;
|
|
maxNumbers[i] += 12;
|
|
break;
|
|
}
|
|
case 'D': {
|
|
minNumbers[i] += 13;
|
|
maxNumbers[i] += 13;
|
|
break;
|
|
}
|
|
case 'E': {
|
|
minNumbers[i] += 14;
|
|
maxNumbers[i] += 14;
|
|
break;
|
|
}
|
|
case 'F': {
|
|
minNumbers[i] += 15;
|
|
maxNumbers[i] += 15;
|
|
break;
|
|
}
|
|
default: break;
|
|
}
|
|
}
|
|
}
|
|
|
|
int maxFinal = 0;
|
|
int minFinal = 0;
|
|
|
|
for (int i = 0; i < n; i++) {
|
|
minFinal += minNumbers[i];
|
|
maxFinal += maxNumbers[i];
|
|
}
|
|
|
|
std::cout << std::hexfloat << minFinal << " " << maxFinal << std::endl;
|
|
}
|