tills[0]+=customers[i]; ??? then why the whole vector

Is it better to sort it, so the element that differs is either at the end or beginning? Or, should we pick a sample between two numbers to find which is supposed to be the commoners, and then find the different one?

cheaper than a cast?

and hows that dynamic allocation? the heap? this is in the stack

i think this is the best solution

or just an array as number can be an index so the array is of strings

also using map

map<int,stirng> nums{{0,"Zero"},...};

return nums[number];

nevermind, i just found out

(a = classpoints_sumatory) (b = notes_count) (c = mynote)

a / b < c -> (b) * (a / b) < c * (b) -> a < c * b

cant get the logic behind, can u explain please?, whenever it's possible

one lined code has no need for them