Unfortunately, due to network issues, we are forced to reschedule the round. Let's do it in the coming days. Apologize. ×

### SmartCoder's blog

By SmartCoder, history, 13 months ago,

:( let's just hope everyone is safe.

• +26

By SmartCoder, history, 18 months ago,

LEAVE THE CONTEST

• +86

By SmartCoder, history, 7 years ago,

HI Folks,we Have SRM tomorrow at Time
Good luck to everyone.
Let us discuss problems here after the end of the contest

• +123

By SmartCoder, 7 years ago,

HI Folks, we Have SRM at Time it's 4 AM here in Egypt :( .
Good luck to everyone.
Let us discuss problems here after the end of the contest
Registration just started

• +31

By SmartCoder, history, 7 years ago,

HI Folks, Finally we Have SRM ( Sponsored by Cisco ) today at Time
Good luck to everyone.
Let us discuss problems here after the end of the contest

• +31

By SmartCoder, 7 years ago,

HI folks
any Idea when topcoder will add new SRMs to the calendar
chrome it seems that you asked for vacation :D

• +26

By SmartCoder, history, 7 years ago,

In the tutorial he said Process the pairs of cells in upper from right to left ? why that's work when we process from right to left and doesn't work when we process from left to right
can you explain more about that?
Thanks!

• 0

By SmartCoder, 8 years ago,

HI,
After I got the idea of this problem and solved it true, it's my first time to solve E during contest but sadly I got TLE it seems that the time limit is too strict.
I used loop in My Ternary search (my loop limit is 400 ) and It got TLE ,after the contest I changed it to 398 and it suddenly passed.
I asked about that in a comment and ho-jo-bo-ro-lo told me he use 500 in loop and it passed but I have to use cin.tie(0);
what about submitting the same code twice with cin.tie(0) one got TLE and the other got Accepted.
Accepted
Time limit exceeded on test 22
during the contest I got TLE on Testcase #15 so if the TLE because reading and writing speed I think testcase 13,14 has the maximum limit and similar numbers so why it passed them and failed in 15.
Thanks

• +8

By SmartCoder, 8 years ago,

Hi my second family, After long thinking I decide to share my statistics website with you & because of currently I have no time I will stop developing it but soon I will back again.

UPD Latest Contest

Codeforces Round #322 (Div. 2)

Play with it

## Let's Go

-CodeForces Contestants Populations

Do you want to see where Grandmasters live take a look at Contestant population page if you are not a Grandmaster don't worry you can see your rating also ,you can swap between ratings with click and unclick

-CodeForces standing filtered by country

Standing filtered by country and barchart about solved & unsolved problems during contest.

it support teams

-CodeForces users filtered by country

users with rating and maxrating also Bie chart represent number of contestants have same rating in this country.

-Fighting.

This page to compare users on graph still need more work to add what types of problems solved by each one and number of them. this is me and my friend KrK we are in different zones :D

keep smiling karolis this is you again vs tourist :D :P

behind the scene

this is just a snapshot of part of my bad database design :D

Tool still need more development and contains little bugs but due to time and also limitation of codeforces API I just shared it but really it need more work.

Have a great day :)

• +214

By SmartCoder, 8 years ago,

Hi All,
First thanks to MikeMirzayanov & .o. for preparing a Good Bye contest but I like the Idea of making it for both divisions competing at the same problem set so it will be like a party and we all competing to each others.
what do you think ?
UPD Thanks now Good Bye 2014 will be for both divisions

• +164

By SmartCoder, 8 years ago,

dreamoon_love_AA back from International Grandmaster to candidate master (till now)
I was curious about why his rating decrease contest follows contest so I asked him in Arena in TCO.
can you guess why his rating decrease every contest ?

UPD accidentallygivenfuck is the winner :D
UPD congraaats for dreamoon_love_AA he now a Div2 contestant (welcome!)

• +76

By SmartCoder, 8 years ago,

just I noticed that memset doesn't work well with long double arrays
so is there any way to use it with long double if not what's the effective way to fill long double arrays without using nested loops

long double memo[50][50][50][50];
memset(memo,-1,sizeof memo);
cout<<memo[0][0][0][0]<<endl; //value will be nan


I use this array for memoization
also I noticed that if I used memset with -1 then if I checked if this transitions seen before or not

long double &re=memo[i][j][k][l];
if(re != -1)return re; //doesn't work
if(re  > -1)return re; //worked well


Thanks

• +14

By SmartCoder, 9 years ago,

HI All ,
First I'm not seeking for a job I say that (just to avoid misunderstanding of whole entry wrong)
I graduated from computer science about 3 years ago and I worked about 1.5 year ,I'm solving a lot of problems and participating on various online judges from long period I didn't make a good training because of work time.
My work now is really interesting but I didn't have any clear plan for myself for next few years.
I'm not so good to work at large companies but also I'm not very bad to work on most of Egyptian companies that any normal graduate doesn't have any problem solving skills work on it.
I like problem solving & I hope to find a good position that know the value of having such skills but here in Egypt it's hard to find such places.
I applied for a lot of companies that I hope to work on it or at least make intership but no response.
What I have to do ?
Is I have to continue in a specific field like ML , NLP ,Computer Vision and make master ,... but I didn't like research or at least I didn't try it & I didn't find myself in academic part.
Companies like google or facebook take most of candidates from ICPC contest which I'm not eligible for it because of age.
Taking part in online contests like GCJ or TCO or FB hacker-cup ... maybe I will Qualify but it need a very good training for next phases and it's very very hard.
Can we make brainstorming and discuss all available options ?

• +39

By SmartCoder, 9 years ago,

HI all
Because I consider that we all here like a family and as I shared my sadness when my father passed away now I'm sharing my happiness with you.
This week I have 3 fantastic things
- I got Engaged.
- First on Room at SRM and solved all 3 problem (First time to solve 1000).
- First on Room at Codeforces and First Time to be a Div1 contestant after 111 Round.

Good luck for all :)

• +263

By SmartCoder, 9 years ago,

Just don't miss it
BTW it's the last chance to advance to next Stage & this is the last TCO round for me this year :)
See what time it starts in your area
http://www.timeanddate.com/worldclock/fixedtime.html?msg=TCO14+Algorithm+Round+2C&iso=20140705T12&p1=98
Let us discuss problems here after the contest.
GL & HF

• +23

By SmartCoder, 9 years ago,

First Thanks for every one spend time to prepare an contests to us I really Appreciate that.
Tutorials here are very weak comparable with Topcoder (vexorian make his best to make every thing as simple as possible).
Really most of tutorials here need another tutorials to explain it
The weird thing I noticed is when writer write a tutorial for his problemset write this sentence.
It's Obvious... , It's Easy to notice... , and something like that.
when you see this phrase almost he will tell us something neither Obvious nor understandable to us some of writers write something like that , It's obvious that this problem has an optimal subproblems so dp will work :) (Really THANKS for your neat explanation :) )
If it's obvious to me why then I'm reading this tutorial now ?
Thanks & hope you got my words in a right way

• +66

By SmartCoder, 9 years ago,

humblefool passed away in a car crash he is from India and he was a red coder at Topcoder last round to him at topcoder was TCO 2B :(
I would like to send my condolences to his family and friends.
RIP humblefool :(

• +114

By SmartCoder, 9 years ago,

Just I notice that codeforces add new feature to rating graph (your max rating like topcoder).

• +63

By SmartCoder, 9 years ago,

Algorithms: Design and Analysis, Part 1
by Tim Roughgarden

I think this course will be very useful and this is the right position to post this post.
This course started already ( from short period of time ) So you still have a chance to join and see First week lectures and submit Assignments.
FYI ,I will start after writing this post.
This course is part #1 and I think it contains most of Algorithms you need to be good at competitions
you can check what you will learn in Syllabus
but to summarize you will learn Algorithm Analysis,D&C,Sorting & Searching,BFS,DFS,SCC,Topological Sort,Dijkstra,Heaps , Hash Tables,BST,... and more
Students who successfully complete the class will receive a statement of accomplishment signed by the instructor.Tim Roughgarden
So let us try to pass this course and to be ready for next part.
Algorithms: Design and Analysis, Part 2

So I hope to discuss course here and discussion of problems will be after the Hard Deadline for each week.
I will try to post deadlines of assignments.

• +13

By SmartCoder, 9 years ago,

If you want to back to old TopCoder Theme just follow this steps
click MyTopCoder -> Theme preference -> old TopCoder theme (black and red) -> save
I discovered that today.

• +165

By SmartCoder, 9 years ago,

I noticed that Hacks is allowed even if you doesn't have positive points
At TopCoder you must have positive points to make challenges & I think this is true
MikeMirzayanov What do you think about that ?

• -4

By SmartCoder, 9 years ago,

First don't miss this round will be hold after one day Time HERE
Second any one got Qualification mail Result ,Till now I didn't get it.
UPD: I got TCO'14 Algorithm Round 1B official results while Writing this post.

• +14

By SmartCoder, 9 years ago,

Why there are No Virtual participation for Coder-Strike 2014 — Finals ?
UPD: Thanks now it work

• +27

By SmartCoder, 9 years ago,

If I have two polygons (maybe one of them is concave or both) & I want to know the intersection between them so some times if polygons are concave the result may be 2 or more polygon.
Is there any Algorithm for that.

• -25

By SmartCoder, 9 years ago,

My father passed away :(