Problem of the day
Given a string, compute recursively a new string where all appearances of "pi" have been replaced by "3.14".
Constraints :1 <= |S| <= 50
where |S| represents the length of string S.
1 <= |S| <= 50
where |S| represents the length of string S.
xpix
x3.14x
pipi
3.143.14
pip
3.14p
1<=|S|<=50