Recently, I saw a tweet from Phaza Ventures, a local sponsor of Hello Muscat:

Dear Participants, As the Corona Virus is still spreading, and to ensure everybody's safety, we have decided to postpone the Bootcamp to later dates to be announced.

Sponsored by: @BP_Oman Event Organizers: @ukomandigihub @Harbour_Space @GUtech_CSC Local Host: @GUtech_Oman

https://twitter.com/PhazeVentures/status/1236923603368755200?s=19

As I understand, the bootcamp is going to be postponed.

Hello everyone. I need your help. I have been trying to solve a problem from code chef, and I wonder whether, it is possible to count number of paths with length i for all i in [1..n] on an acyclic undirected graph in O(n*log(n)) time complexity or not. Here, by length of a path I mean the number of nodes the path contains.