At ancient times,There are no calculators this casting out nines approach is used to tally the calculations and this is a very good approach to find the digital root of a number. def digital_root(n): return 9 if n%9==0 else n%9 OUTPUT print(digital_root(942)) 6
Sometimes,It become very essential to Compress a code in python,In realworld context to find motifs in DNA sequences compressing them in a certain way is necessary.One such example is presented below def compress_string(s): n=len(s) for size in range(1,n//2+1): if n%size==0: sub=s[:size] if sub*(n//size)==s: return f”{n//size}({sub})” return s s=”abcabcabcaba” print(compress_string(s)) OUTPUT: 4(abc)
This is a classic situation where we have to find the maximum number of straight cuts possible on a cake which is termed as combinatorial geometry. def max_pieces(n): MOD=1000000007 return(N*(N+1)//2+1)%MOD N=int(input()) print(max_pieces(N)) OUTPUT: print(max_pieces(7)) 29