Egor's blog

By Egor, 7 years ago, In English

Just fyi. Migration ended

CHelper new home YAAL new home

You are welcome to contribute in either

Read more »

  • Vote: I like it
  • +45
  • Vote: I do not like it

By Egor, 7 years ago, translation, In English


I can't solve this зproblem. My code:

#include <iostream> using namespace std; int main() { int a, b; cin >> a >> b; int ans = 0; for (int i = 0; i < a; i++) ans++; for (int i = 0; i < b; i++) ans++; cout << ans << endl; return 0; }

Please help

Read more »

  • Vote: I like it
  • +1170
  • Vote: I do not like it

By Egor, 7 years ago, In English

Hello from Berlin!

Get ready for some action as participants are ready to battle for Grand Prize of 300000 russian roubles and coveted title of Yandex.Algorithm champion

Stay tuned for live commentaries

If you have any questions about the competition feel free to ask. Competition starts at 11:30 CET, about an hour from now. Currently participants set up their PCs

-0:33 — We have quite tough field this year including ACM ICPC World Champions, TCO, GCJ and IOI winners. snarknews had provided some info on finalists here

-0:10 — Contest is delayed for 10 minutes

-0:09 — You can follow live results here

-0:05 — Currently contest area is filled with several journalists and cameramen

0:01 — Contest had been started, participants reading problems atm

0:11 — Petr and cerealguy

0:16 — there are several submits on D, some blind and some open. and 1 submit on both B and E, blind

0:19 — peter50216 is gettings TLEs on problem D, seems like map just do not cut it

0:23 — First submit on A. Also second one on B. All submits not on D are blind now

0:24 — marek.cygan is first one to submit 2 problems and currently in the lead

0:26 — Problem A is a tricky one — sometimes you need to add something for stack before removing

0:30 — tourist and eatmore

0:32 — During test run I solved A, B and D during the contest and C a couple of minutes later, though I have seen A and B before

0:33 — Currently marek.cygan, pperm, s-quark and LayCurse are in lead with 2, while usual favorites have only one problem under their belt

0:36 — Some more subbmits, most of participants with 2 solved D and either B or E, though there are also one blind submission on A

0:42 — Merkurev may spend a lot of time on A as currently he have the mistake I mentioned. To his defence authors originaly made the very same mistake

0:44 — A lot of photos made by some professionals

0:46 — Contest almost reached its equator, and we have out first participant with 3 problems — s-quark. He solved all the usual suspects — B, D and E

0:50 — vepifanov joined him, though remeber — as Yandex empoyee he participates out of competition

0:51 — And now we have someone we sure solved 3 problems — peter50216

1:00 — Both Petr and tourist are now in group of people who solved 3

1:01 — eatmore is actually quite close to solve A — he only needs to understand that sometimes it is good to make 2048

1:04 — SirShokoladina has most chances to be first to solve 4 as he still have B to submit. Also Eryx is the first one to solve C, he uses all open tactics and guaranteed to has at least 3 problems

1:07 — Seems like polish participants have good 3D imagination — pparys solves C as well

1:08 — And first submit from GCJ and TCO champion rng_58 — correct solution on F. We now have at least blind submits on all problems

1:13 — Petr and origami

1:14 — And s-quark claims the lead with 4 problems. He solved A

1:16 — As evident from the posted image Petr works on C

1:18 — And peter50216 joins him with all open submits

1:21 — 3 people with 4 tasks — are this our winners?

1:22 — Though one of them participates out of competition, so no

1:27 — Both Petr and tourist debugging problem C

1:29 — And Petr takes the lead with submit on C

1:31 — The contest currently fulfills all 4 criterias for ideal one — everyone solved something, nobody solved everything, every problem is solved by someone, no problem is solved by everyone

1:33 — 7 people with 4 problems atm, SirShokoladina in the lead

1:35 — Both Petr and tourist trying to solve A in time

1:37 — Winter is coming. Oh, I mean, end of the contest

We have out final results. Congratulations for Gennady Korotkevich for winning it all!

Read more »

  • Vote: I like it
  • +205
  • Vote: I do not like it

By Egor, 7 years ago, In English


It seems that even after changing libraries to correct version Cojac still do not fully work with Java 8 — namely it fails to work with lambdas. I got following exception:

java.lang.InternalError: compileToBytecode
	at java.lang.invoke.MethodHandleStatics.newInternalError(
	at java.lang.invoke.LambdaForm.compileToBytecode(
	at java.lang.invoke.DirectMethodHandle.makePreparedLambdaForm(
	at java.lang.invoke.DirectMethodHandle.preparedLambdaForm(
	at java.lang.invoke.DirectMethodHandle.preparedLambdaForm(
	at java.lang.invoke.DirectMethodHandle.make(
	at java.lang.invoke.DirectMethodHandle.make(
	at java.lang.invoke.DirectMethodHandle.make(
	at java.lang.invoke.LambdaForm$NamedFunction.resolve(
	at java.lang.invoke.DirectMethodHandle$Lazy.<clinit>(
	at java.lang.invoke.DirectMethodHandle.makePreparedLambdaForm(
	at java.lang.invoke.DirectMethodHandle.preparedLambdaForm(
	at java.lang.invoke.DirectMethodHandle.preparedLambdaForm(
	at java.lang.invoke.DirectMethodHandle.make(
	at java.lang.invoke.DirectMethodHandle.make(
	at java.lang.invoke.DirectMethodHandle.make(
	at java.lang.invoke.LambdaForm$NamedFunction.initializeInvokers(
	at java.lang.invoke.LambdaForm.<clinit>(
	at java.lang.invoke.DirectMethodHandle.makePreparedLambdaForm(
	at java.lang.invoke.DirectMethodHandle.preparedLambdaForm(
	at java.lang.invoke.DirectMethodHandle.preparedLambdaForm(
	at java.lang.invoke.DirectMethodHandle.make(
	at java.lang.invoke.MethodHandles$Lookup.getDirectMethodCommon(
	at java.lang.invoke.MethodHandles$Lookup.getDirectMethodNoSecurityManager(
	at java.lang.invoke.MethodHandles$Lookup.getDirectMethodForConstant(
	at java.lang.invoke.MethodHandles$Lookup.linkMethodHandleConstant(
	at java.lang.invoke.MethodHandleNatives.linkMethodHandleConstant(
	at net.egork.TaskE.solve(
	at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
	at sun.reflect.NativeMethodAccessorImpl.invoke(
	at sun.reflect.DelegatingMethodAccessorImpl.invoke(
	at java.lang.reflect.Method.invoke(
	at net.egork.chelper.tester.NewTester.test(
	at net.egork.chelper.tester.NewTester.main(
Caused by: java.lang.NoClassDefFoundError: ch/eiafr/cojac/models/CheckedInts
	at java.lang.invoke.InvokerBytecodeGenerator.classFilePrologue(
	at java.lang.invoke.InvokerBytecodeGenerator.generateCustomizedCodeBytes(
	at java.lang.invoke.InvokerBytecodeGenerator.generateCustomizedCode(
	at java.lang.invoke.LambdaForm.compileToBytecode(
	... 33 more

To fix this I created clone repository here and would want to welcome anyone who wants to help fix this

Read more »

  • Vote: I like it
  • +19
  • Vote: I do not like it

By Egor, 8 years ago, translation, In English

Just FYI


UPD: Unique opportunity! For just 40 euro per night there is bed in twin room in Hilton West End in Budapest for May 2-5. Included breakfast, Internet and, most likely, executive lounge access. Also Petr would live in same hotel


Team Participants
Havka_papstvo Egor, pashka, Petr
Omnibus_trip cerealguy, niyaznigmatul, tourist

Read more »

  • Vote: I like it
  • +20
  • Vote: I do not like it

By Egor, 8 years ago, In English

15:24 — Closing ceremony will start shortly and you can watch it on ICPC Live. That's probably it for this translation. Bye-bye, see you soon

Read more »

  • Vote: I like it
  • +108
  • Vote: I do not like it

By Egor, 8 years ago, In English

13:59 — Petr's blog for today

12:15 — That's it for Dress Rehearsal. Tune in tommorow. Bye-bye, see you soon

12:07 — Contest is over. Results should be availabe shortly

12:00 — Peking University

11:31 — I now accept requests for team photos ;)

11:28 — NRU ITMO:

11:25 — Taiwan National:

11:23 — SPb State:

11:16 — Scoreboard is frozen for the last hour, let's have some more photos :) Moscow State:

11:11 — Problems are same as last year, with slight change in wording

11:09 — Scoreboard is available online (tip of the hat to SuprDewd)

11:03 — Teams previewed in this blog are now placed like this:

2: Shanghai Jiao Tong, 10

3: Tokyo, 9

4: Moscow State, 8

7: SPb SU State, 8

14: Taiwan, 7

17: NRU ITMO, 7

11:00 — Shanghai Jiao Tong:

10:58 — Stanford first with 10, Shanghai Jiao Tong and Tokyo trail with 9

10:55 — Current leaders:

10:48 — Stanford leading with 10, Shanghai, Moscow and Tokyo with 8

10:40 — Stanford and Shanghai Jiao Tong lead with 8, Tokyo, Moscow and National University of Singapore with 7

10:36 — In the meantime NRU ITMO is 72nd with 2 problems solved

10:34 — All problems are now available in Kattis. Problem J is solved as well which leaves us with only one task not solved by anyone — Problem H. Stanford is leading with 8, Tokyo second with 7

10:30 — Only H and J are not solved as of yet. National Taiwan is close to solve J though — they only have problems with output format. And H is Power Tower again!

10:28 — B, F and E are now solved as well. Tokyo and Stanford are leading with 6

10:22 — First 8 problems are available on Kattis. In the meantime Stanford and Tokyo solved 5 problems, SungKyunKwan, Moscow State, Tehran and Southern California solved 4

10:18 — And now with 5

10:16 — Stanford University is now leading with 4

10:13 — C is solved as well. Shanghai Jiao Tong University is leading with 3. First two problems are available in Kattis

10:11 — Problem A is now available on Kattis for you to solve!

10:09 — A, D, J and K are all solved now as well. University of Chicago is in the lead with 2 solved tasks (and unsuccessful attempt on A)

10:08 — SungKyunKwan University is first team to solve Problem I

10:07 — Problem L is quite easy — given set of ints, you need to find maximum, minimum and their difference

10:05 — Six teams got problem L correct already

10:02 — Contest is started. No submissions yet

9:57 — One more delay, but this is business as usual. Currently contest in the state of "Two minute hold"

9:52 — Teams are currently being instructed. 5 minutes before the start

9:47 — Tune in tommorow for ICPC Live

9:23 — It seems Dress Rehearsal would be a little bit delayed and will start in 34 minutes. Currently teams are exiting arena and will reenter it shortly

9:13 — Remember, this year you can submit problems yourself from both Dress Rehearsal and main contest — just go to Kattis judjing system

9:10 — Teams are currently called to stage in turn by Bill Poucher and got photoed with World Finals Cup and Bill himself

8:51 — Hi! Dress Rehearsal will start in 39 minutes, stay tuned

Read more »

  • Vote: I like it
  • +67
  • Vote: I do not like it

By Egor, 8 years ago, In English

Hello from St. Petersbutg where long awaited World Finals were officially opened at last.

Before the openning there was lunch near Anichkov palace, courtesy of Yandex, from which I have very cute shot of 2004 World Champion, Pavel Mavrin a. k. a. pashka

The openning itself took place in Alexandrinsky Theatre, one of the oldest in Russia. It was for the most part quick-paced, with a lot of music and art, including a part of ballet and sand drawing.

And now the main part — for the first time ever everyone in the world can have their chance to solve World Finals problems and submit them for testing. Starting 15 minutes after scheduled contest start, at 6:45 GMT on July 2nd (Dress Rehearsal) and 3rd you can submit your solutions to Kattis judjing system, the very same system used by World Finalists themselves. Also do not forget to tune in to ICPC Live and this blog, where I will provide live coverage as well.

Bye-bye, see you soon!

Read more »

  • Vote: I like it
  • +67
  • Vote: I do not like it

By Egor, 8 years ago, In English

So, what is the last team I want to preview. Do you have any guesses? So many variants... Well, you must have guessed it right — it is SPb NRU ITMO 1.

Let’s start with small facts about each of team members:

  • Mikhail won several trips to the next TCO through various side competitions (like photo competition) during TCO 2011

  • Niyaz tweeted in April: “Playing dice with Gennady. This is the only game in which he can possibly lose”

Well, I cheated — one fact for two teammates :)

So, 2 of its participants are world champions already. And the third one will probably be. Why everyone thinks they will be champions again. Only once this team was behind another World Finals team in 2013. They won 13th OpenCup with overwhelming advantage (150 points ahead of second place, just 20 points shy of perfect score), although team finished third in previous edition. 7 wins and 4 second places on stages, OpenCup onsite win, NEERC championship — and that’s all in just 10 months. Well, during last OpenCup they ousted a team that featured 2 TCO, 2 GCJ, 2 Hacker Cup and 3 World Finals wins total. So, does anyone else have a fighting chance?

Well, yes. They are humans after all (despite some rumors). And World Finals are known for tricky problem sets. Well, in 5 days we’ll see.

Line up:

Mikhail Kever — Codeforces rating 2530, TopCoder rating 2969, 2012 World Champion, TopCoder Open 2011 finalist, Google Code Jam 2013 finalist, Facebook Hacker Cup 2012 and 2013 finalist

Niyaz Nigmatullin — Codeforces rating 2523, TopCoder rating 2818, 2012 World Champion

Gennady Korotkevich — Codeforces rating 3088, TopCoder rating 3657, TopCoder Open 2013 semifinalist, Google Code Jam 2013 finalist, Facebook Hacker Cup 2013 finalist, 6 time Gold (2007-2012, 1st place in 2009-2011) and Silver (2006) medalist in IOI.

Gold chances? Well, 95%. There is always 5% chance for something really odd to happen

Read more »

  • Vote: I like it
  • +137
  • Vote: I do not like it

By Egor, 8 years ago, In English

Only two previews remaining, and today’s team is National Taiwan University +1 ironwood branch. This team already participated in World Finals in 2011 and had not won medal with 6 problems solved, but they make good use of this 2 years with outstanding progress in both personal and team competitions.

In 2010 team finished 3rd in Kaohsiung and 1st in Jakarta Regional Contests. In 2011 they placed 1st in Kuala Lumpur and 2nd in Hsinchu Regional Contests, but another team from the same university was selected. In 2012 they won both Kaohsiung and Jakarta Regional Contests. After Jakarta regional they were interviewed, you can view it here.


Pi-Hsun Shih — Codeforces rating 2823, TopCoder rating 3158, TopCoder Open 2013 Semifinalist, Gold medalist in 2009 IOI.

Che-Yang Wu — Codeforces rating 2229, TopCoder rating 2154, Gold (2008) and Silver (2009) medalist in IOI.

Han-Jay Yang — Codeforces rating 2463, TopCoder rating 2790, TopCoder Open 2013 Semifinalist, VK Cup 2012 Finalist, Gold (2008) and Silver (2007) medalist in IOI.

Pretty impressive results in regionals (they had beaten University of Tokyo team in Jakarta) and recent personal result (peter50216 is second in Codeforces rating, kelvin and peter50216 qualified to upcoming TCO onsite) make them quite dangerous. I will give them 60% chance for Gold.

Read more »

  • Vote: I like it
  • +60
  • Vote: I do not like it

By Egor, 8 years ago, In English

I found this near my subway station

Read more »

  • Vote: I like it
  • +109
  • Vote: I do not like it

By Egor, 8 years ago, In English

Next team is Tokyo University team called “University of Agitsune”. Its name has an interesting history. The team members name themselves like 3 animals — rabbit (usagi in Japanese), eel (unagi) and fox (kitsune). If you combine a rabbit and a fox, you will get usagitsune. If you combine an eel and a fox, you will get unagitsune. Replacing by dash letters that differ, we can obtain u-agitsune. And as University of Tokyo is sometimes referred to as U-Tokyo, reversing the rule, we get the team name (credit for this explanation should go to qnighy).

Last year 2 of its members participated in OpenCup under name “Kroliki” (transliteration of Russian word for rabbits). This is not a coincidence, as Makoto Soejima learns Russian. They finished 7th in general classification with one second and one third places on stages.

This team finished first in Tokyo Regional Contest, one problem ahead of second place, and third in Kaohsiung Regional Contest. They also finished first in Japan Domestic Contest.


Kazuhiro Hosaka — Codeforces rating 2400, TopCoder rating 3101, TopCoder Open 2011 finalist, Google Code Jam 2009, 2012 and 2013 finalist, Facebook Hacker Cup 2011-2013 finalist, Gold medalist in 2008 and 2009 IOI, Gold (2009) and Silver (2008) medalist in IMO.

Kensuke Imanishi — Codeforces rating 2436, TopCoder rating 2614, Google Code Jam 2013 finalist, Silver medalist in 2010 and 2011 IOI.

Makoto Soejima — Codeforces rating 2814, TopCoder rating 3468 (currently TopCoder algorithms admin), TopCoder Open 2010 and 2011 champion, Google Code Jam 2011 champion and 2010 and 2012 finalist, Facebook Hacker Cup 2011 and 2013 finalist, VK Cup 2012 finalist, Silver medalist in 2008 and 2009 IOI, 3 times Gold (2007-2009) and Bronze (2005) medalist in IMO.

Their personal achievements make this team one of favorites without any doubt. My guess is they have about 70% chance to get gold.

Read more »

  • Vote: I like it
  • +96
  • Vote: I do not like it

By Egor, 8 years ago, In English

SPbSU 4 team is up for preview today. This is team’s second season in this line up, although it was not eligible for ACM ICPC last season as Egor Suvorov was still a high school student.

This team is the only team participating in World Finals that finished ahead of NRU ITMO in this year team competition — they won OpenCup GP of Ukraine. They finished 3rd overall in 13th season, while previous 2 seasons they finished 9th and 2nd (3 points ahead of NRU ITMO). During this seasons they won 3 stages and finished second and third once. In last NEERC they finished 4th (with 4 tasks passed during last hour) despite the fact that they were second one minute before end.

Personal achievements are splendid as well:

Egor Suvorov — Codeforces raintg 2607, TopCoder rating 2895, Facebook Hacker Cup 2013 finalist, VK Cup 2012 finalist, Silver (2011) and Gold (2012) medalist in IOI

Pavel Kunyavskiy — Codeforces rating 2564, TopCoder rating 3019, Google Code Jam 2013 finalist, Gold medal (3rd overall place) in IOI 2011

Dmitry Egorov — Codeforces rating 2397, TopCoder rating 2773, TopCoder Open 2012 Wild Card Round participant, Silver medal in both IOI and IMO 2011

Overall I think this is one of a few teams that have chance to win World Finals. At the same time I think consistency is not one of their strengths, hence I think they have 50% chance to win gold.

Read more »

  • Vote: I like it
  • +130
  • Vote: I do not like it

By Egor, 8 years ago, translation, In English

Second to go is Shanghai Jiao Tong University Mithril team. I have a little trivia to share about this team actually. SJTU won World Finals three times — in 2002, 2005 and 2010. One student usually can participate in no more than 2 finals, but from what I heard (correct me if I’m wrong) in China there is a custom rule that student can’t participate in more than one World Finals. Hence Bin Jin started as substitute in his team.

SJTU won Jinhua (2 problems ahead of second place) and Dhaka Regional Contests. They were highest placed (3rd) Chinese team in the Battle of Giants (team match between Russia and China)


Xiaoxu Guo — Codeforces rating 2264, TopCoder rating 2485

Bin Jin — Codeforces rating 2428, TopCoder rating 2743, TopCoder Open 2009 winner, Google Code Jam 2011 finalist, World Finals 2010 Champion as part of SJTU Rhodea team

Jingbo Shang — Codeforces rating 2309, TopCoder rating 2813, VK Cup 2012 finalist, TopCoder Open 2012 finalist

This team has very good results, but what is more important — experience of winning big things. I think they have at least 60% chance to win gold.

Read more »

  • Vote: I like it
  • +151
  • Vote: I do not like it

By Egor, 8 years ago, In English

Let’s start with previewing some teams that will participate in World Finals. I will write about 6 teams that I believe are favorites to win gold medals, but anything can happen. Feel free to post your top 6 (top 3, top 12, top n) in comments.

 Photo by Yan Tsench

First to go is Moscow State University team ST. It's name has become a brand that has a very long history. My own team, Moscow SU x13, competed against a team with the same name. It usually consist of Moscow SU students that are originally from Saratov.

This is the second time this lineup participate in World Finals. Last year they were 10th and won bronze medals. With last minute (more like last 5 seconds) submission they got 2nd place in last NEERC, which is repeat of 2011 performance. They won last Moscow subregionals.

In last 6 seasons of OpenCup they placed 7th, 8th, 5th, 6th, 4th and 4th in general classification, 2 second places as well as 6 third places on separate stages as well as third place in finals of 11th OpenCup.

Personal achievements are also very solid:

Sergey Fedorov — Codeforces rating 2406, TopCoder rating 2802, TopCoder Open 2012 wildcard round participant, 2 (2009 and 2010) gold medals in IOI

Aleksandr Kaluzhin — Codeforces rating 2206, TopCoder rating 2294, 2 (2007 and 2008) silver medals in IOI

Sergey Rogulenko — Codeforces rating 2601, TopCoder rating 2926, TopCoder Open 2011 semifinalist, Google Code Jam 2010 finalist, gold (2008) and silver (2009) medals in IOI.

Very solid team and individual achievements would put this team in list of favorites in any programming competition. I’m absolutely sure they would win medal and their chances for gold are at least 50%. What do you think about Moscow SU ST?

Read more »

  • Vote: I like it
  • +232
  • Vote: I do not like it

By Egor, 9 years ago, In English

Just a kindly reminder that TopCoder SRM #568 will start in about hour and a half

Read more »

  • Vote: I like it
  • +58
  • Vote: I do not like it

By Egor, 9 years ago, In English

I would really appreciate any new ideas of what new features to add

I would also appreciate donations


Kattis support for both Chrome and Contest parsers. You'd need to accept new permissions for Chrome extension. Good luck at ACM ICPC World Finals online contest!


Codechef fix


Fixed issue with template selection and Chrome plugin interaction


Smallish update — you can now select task template per task. You can have several templates for general tasks, one where you need to output with Case #, GCJ where you need to integrate parallelization and similar


Support for Idea 14.1+

Parsers for RCC and USACO fixed

You can now parse other Codeforces contests when live contest is ongoing

Sorry for big delay, it was couple of crazy months for me


All parsers should work now. Chrome extension may disable itself on update, reenable it


Bayan support (will be live after Chrome store will approve update), fix for GCJ and HackerRank


Fixed Java 8 support. From now on Java 8 is target version, previous Java versions may or may not work properly

Also speed up and for RCC parsing, HackerRank parsing fix and Delete Task pop up fix


GCJ support should be fixed now. Also RCC support is fixed. Please note that non-current round take a lot of time to load as there is no place where I can see all round ids (it may appear after second round, I'll update then). Please also note that 1st round is currently have 2 instances as both id 4 and id 7 corresponds to it. I'm not sure how well my plugin will handle increased load on their servers and weird pages returned because of it, but I hope for the best

TopCoder checker support coming up in next release


GCJ support fixed, also GCJ is now supported through Chrome extension as well


Fix for Idea 13.1


Mostly fixes (Codeforces, Hackerrank, Yandex). Includes new memory limits support for TC and new action to edit task (if you for some reason do not want to do this through Edit configurations)


Facebook Hacker Cup and USACO support through Chrome plugin. Also HackerRank should work now


HackerRank support. Also compatible with Java 6


Added Codeforces support for Chrome extension. Should be usefull for those Gym contest that have non pdf/doc/etc problem statements


Rejoice Chrome users — there is now extension to Chrome that will assist in parsing Yandex.Contest tasks. Support for other sites (Codeforces Gym, for example) is coming as well. You will be prompted to install Chrome extension on first load of CHelper-supported project

You can download extension here

Some bugfixes and improvements are also included (Timus should work for now)


GCJ support finally! With it comes new type of input — local regular expression. Main classes build with this input type would take most recently modified file that matches provided regexp as input.

Also some little fixes to smart testing


Small fix due to Russian CodeCup page format change. GCJ support would be developed during next week


Smart testing

New mode, which automatically will test your program only on first failed test from last run and will test on all tests if that test will pass. With this feature you can easily start debug on failed test without need to switch tests on/off. This mode is on by default, you can disable it in project settings

Also test case generation mechanism changed a bit. You now can have at most one class with test cases, but multiple test case methods in it. This method shoule be annotated @TestCase. For compatibility if test class implements TestProvider/TopCoderTestProvider createTests() would still be called. If you create checker or test class through task settings it will now automatically be opened

Finally, templates for TopCoder are introduced


Templates for automatically generated stubs added 3 new files are automatically added to eligible projects (i. e. projects with — TaskClass.template, CheckerClass.template and TestCaseClass.template. You may use following placeholders in all this files: %package% — package where file will be created %InputClass% — short name of input class %InputClassFQN% — fully qualified name of input class (used in imports) %OutputClass% — short name of output class %OutputClassFQN% — fully qualified name of output class (used in imports)

Also you can use %TaskClass% in TaskClass.template, %CheckerClass% in CheckerClass.template and %TestCaseClass% in TestCaseClass.template, which is basically short class names of corresponding classes

Would you delete this files by mistake they would be recreated next time you reopen project or when they are needed

TopCoder gengerated files are currently do not have templates, will do in next version


Previous version was built using Java 1.7, which may lead for Idea to fail on start up if run under Java 1.6. If this is your case please download it here and unpack to %home%\.IntelliJIdea%version%\config\plugins


This version contains minor and major changes

Minor change is hopefully last iteration of changes in TopCoder support. From now on you do not need to restart arena after restarting Idea. Also socket method is reinstaited with more checks to insure no fails and with automatic back up from file method

Major change is contributed mostly by Petr and provides support for Cojac. This is to help find errors such as unitended integer overflow and others. Support is turned off by default, you can turn it on or off for separate task in task configuration as well as for all new tasks in project settings


Urgent — temporary TopCoder fix


Leda (Idea 12) readiness

3.02 — even smaller update

Force locale setting was cleared on opening of Edit Tests dialog (and some others)

3.01 — small update:

Timus current/future contests now works

Redundant caption removed

So I decided it is a good time to go on with the release.

You can read intallation (and some other, under development) instructions here. I would not recommend manual installation, but you can download plugin directly here.

You are welcome to contribute and/or provide translations for manual for different languages. Source code is located here

Feature requests are appretiated as well

Read more »

  • Vote: I like it
  • +5
  • Vote: I do not like it