OK, second question: I need an advice to become red before the nationals in Syria, It's after 45 days, I am blue now, quick please :(
Read more… (26 words)
Active In
Competitive Programming
UI/UX Design
International Olympiad in Informatics
Algorithms and Data Structures
TED Talks
Featured Contributions
NaN.
Q&A session
Q&A session with Amr Mahmoud, Codeforces Egypt #1
My name is Amr Mahmoud. I'm currently studying Computer and Systems Engineering at Alexandria University. I was on the team that got the first place in Egypt National CPC, also the first place...
Read more…(128 words)
reply in this discussion
NaN.
Q&A session
Q&A session with Amr Mahmoud, Codeforces Egypt #1
My name is Amr Mahmoud. I'm currently studying Computer and Systems Engineering at Alexandria University. I was on the team that got the first place in Egypt National CPC, also the first place...
Read more…(128 words)
reply in this discussion
Hi Amr
I was looking for a solution for this problem for a while, how to solve the Chinese postman problem also known as the Route inspection problem if the number of nodes is greater than 25??? I know it could be solved using bit-masks technique by pairing the nodes with odd degree and adding the minimum pairing cost, but can this problem be solved in a faster way??? if yes, can you please give me some links to read about???
Thanks in advance :D
Read more… (85 words)