Subtract middle by youngest to find age difference then add it back to the middle value to find oldest
def ages(a,b):
d = b - a
if a == b:
print(a)
else:
print(b + d)
age1 = int(input())
age2 = int(input())
ages(age1,age2)#include<iostream> #include <vector> #include <algorithm> #include <cmath> #include <stack> using namespace std; int main() { int r, c,...
s1 = input() s2 = input() silly = '' silly_o = '' quiete = '-' i = 0 j = 0 while i < len(s1) and j < len(s2): if s1[i] != s2[j]: if...
#include<iostream> #include <vector> #include <algorithm> #include <cmath> using namespace std; bool rowcom(pair<int, int> a, pair<int,...
Comments