### Zlatan's blog

By Zlatan, history, 8 days ago, , Hey guys! My professor proposed me to solve this problme. Given a number p <= 10^7, print the sum of the digits of 2^p. For exemple, 2^4 = 16 so we'll print 7. How can I do this properly? I first tried to use in a way or in another, the little theorem of fermat but it made no sense here. By Zlatan, history, 5 weeks ago, , Hey! Can anybody help me with a solution to this? We have an array of pairs [ (x1,y1) , (x2,y2), ... , (xn,yn) ]. Initially, we are at the coordinates (0,0). We can use whatever pair from the array (maximum one time) to move from the actual position (a,b) where we are to (x + xi, y + yi). The numbers from the array's pair are between [-10^4, +10^4]. Which is the maximum distance we can move from the origin (0,0) after using some of these pairs from the array? We have a maximum of 2000 pairs. I am grateful to those who brighten me. By Zlatan, history, 8 months ago, , Hey guys! Can anybody explain to me how to find the bridges in a graph? I know how to find the articulation points, but I don't know how to handle the bridges. Also, is there any platform where I can submit these 2 classical algorithms? Thank you in advance! By Zlatan, history, 10 months ago, , 