During the past month I have been feeling bored with my studies and sometimes even C++ programming. So, I and my roommate decided to do something entirely new. We went to learn Swift, developed an iOS app, and published it on App Store a couple of days ago.

It was a really good experience and I felt that my programming have turned from black and white, to colourful. In fact, instead of just thinking about optimality and speed of your code, you will think about how to make your app more popular/addictive. Also, I really enjoyed programming with Swift!

If you think that you ever reached a dead-end in programming like me, writing a simple app is a different experience. It's worth a shot!

App name: “The Ultimate Brainstormer” Link: https://appsto.re/ca/mUTwfb.i

Hello everyone,

I was thinking that the sorting of the submissions for a problem can be improved. Here is the case: Imagine that you want to learn Java language better. It is good if you can sort the submissions according to "Lang" attribute. Besides, in such a case you would probably prefer to see the code of those who have higher rankings. Therefore, you might want to first sort the submission by "Lang" and then sort it by the ranking of the person who has submitted the code.

Another solution could be the use of filters, so that you can only see the submissions with Java.

What do you think?

Any help, advice, or opinion is appreciated,

Hello everyone,

It's been a long time since the last time I participated in a contest. Now I see that my color has changed from Violet to Blue; however, my rating has remained unchanged (rating=1728). Does this mean that I fell to Division 2? Has the color system changed? Besides, for the next contests should I register in Division 2 or 1?

More importantly, if such a big change has been made, shouldn't the Official FAQ (question 8) be modified as well?

Thank you all in advance, Any help would be appreciated

I think, when ratings resembled military ranks it was cooler than chess ratings. I know it's not academic and might seem rather harsh, but words like "colonel", "general", "captain", ... make you feel stronger.

Hello every one, I wonder if there is an exact or approximation algorithm for the following problem: given a complete weighted graph, find a a minimum spanning tree such that the degree of each non-leaf node is bigger than a constant number (say b).