Remove 'Translated by' notes (cp-algorithms#151)

tcNickolas · web-flow · commit e251674000d7 · 2016-11-27T15:31:06.000-08:00
diff --git a/src/data_structures/fenwick.md b/src/data_structures/fenwick.md
@@ -191,6 +191,3 @@ struct FenwickTree2D {
 
 * [Fenwick tree on Wikipedia](http://en.wikipedia.org/wiki/Fenwick_tree)  
 * [Binary indexed trees tutorial on TopCoder](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-indexed-trees/)
-
-
-Translated by [sylap97](http://codeforces.com/profile/sylap97)
diff --git a/src/graph/bridge-searching.md b/src/graph/bridge-searching.md
@@ -79,12 +79,8 @@ Constant $MAXN$ at beginning of code is initialised to maximum number of nodes i
 
 It should be noted that this does not work correctly if multiple edges are present in the graph, as it actually ignores their presence. Of course, multiple edges must not be a part of the answer, so checks must be made in the function $IS$_$BRIDGE$. Another way to work with multiple edges more accurately is to transfer the number of edges by which we entered the current node(we all need to store this additionally).
 
-## Tasks in online judges
-
-Some tasks in which we aim to find bridges:
+## Practice Problems
 
 - [UVA #796 "Critical Links" [difficulty: low]](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=737)
 - [UVA #610 "Street Directions" [difficulty: medium]](http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=551)
 - [Case of the Computer Network (Codeforces Round #310 Div. 1 E) [difficulty: hard]](http://codeforces.com/problemset/problem/555/E)
-
-####Note: Translated by [NibNalin](http://codeforces.com/profile/NibNalin)
