The 48h qualification round consisits of 4 algorithmic problems to do on the facebook interface. You shall do 1 question to advance in Round 1.
The first two questions were the easisiest ones. The solution is just some simple implementations, most people were able to do them. The 30th July will start Round 1 !
Now, is the time for Round 1 ! Good Luck to all !
Subscribe to:
Post Comments (Atom)
std::next_permutation(arr.begin(),arr.end());
What is next_permutation(a.begin(),a.end()) ? Next permutation is like what its name says, finds the next permutation of a and assigns ...
-
I really enjoyed this contest ! The questions were nice and I had a lot of time to do them. So here I want to share my approaches to the pro...
-
Time : 30 minutes Question Optimise this function : f(int n){ if (n == 0) return 1; if (n == 1) return 2; return f(n-1)+...
-
Prime numbers are numbers that can only be divided by itself and one. A prime number has two divisors so one is not a prime number. Prime nu...
No comments:
Post a Comment