zhuichao001 / hawker

Common engineering data structures and algorithms, such as linear,tree,linked list,graph,greedy,divide and conquer,dynamic programming, backtracking, depth search, breadth search and so on

senior project algrithm adventure

• *A STAR(A) **
• LRU CACHE
• LFU CACHE
• LOCK FREE(list/ring-buffer)
• QUIC SORT
• CONSISTENT HASH
• FREE LOCK RING BUFFER
• BINARY SEARCH
• EDIT DISTANCE
• BINARY HEAP
• FREQUENCE STACK
• SKIP LIST
• AVL TREE
• RATE LIMITER
• COUT PRIMER
• UNION FIND
• GCD LCM
• HUFF MAN
• SEGMENT TREE
• HASH CODE / HASH FUNCTOR
• BIG PRIMES
• BLOOM FILTER
• C++11 ADVANCED FEATURES
• B+ TREE
• PERMUTATIONS
• SLIDING WINDOW

hawker's Issues

Algorithmic problem

Hi. Thanks for your repo.
I am new to competitive programming, and on one platform I came across the following problem. I would be grateful for advice in its optimal solution.

Two binary matrices are given. You need to bring them to the same size and count the number of differences. There can be up to 10^6 elements in the matrix.

For example, for the following two matrices
110 11
000
the answer is 8 (the final size is 2x6).

It is clear that they can be reduced to the same size using the Euclidean algorithm, but I have no further ideas.