Sunday 30 June 2019

Facebook Hacker Cup - Qualification Round 2019

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 !
at No comments:
Subscribe to: Posts (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 ...

  • __int128_t and __float128 in GNU
    Usage of __int128_t: supports really big intermediate numbers, from -2^128 + 1 to 2^128 - 1 it has 128 bits Usage of __float128 : ...
  • Extensions of GNU
    Here are some extensions that I have found. Some of them are more useful than others. indexed set power(x,y) rope indexed set is j...
  • Fastest way to read input from stdin C++
    Method 1 : A noob's way : #include <iostream> using namespace std; int main(){     int nb,a;     cin >>...