OSt's blog

By OSt, 6 years ago, translation, In English,

Added possibility to choose order for "defrosting" problems for contestant.

Implemented two approaches:

  • By alphabetic order of problem name

  • By increasing contestant last submit time for problem (thanks to snarknews for feedback)

Demo stand was updated

Distributive was updated

Hot Fix 1.9.1

  • Fixed issue with wrong calculation of contestant last successful submit

Defrosting with presenter (experimental branch from master on GitHub)

Now you can use your presenter (for example, Logitech R700) for "defrosting" without standing behind your computer with S4RiS StanD! Enjoy the freedom!

  • Next Step — button "Next" on presenter or Pade Down on keyboard

  • Fast Next Step — button "Back" on presenter or Pade Up on keyboard

  • Back step — temporary only by keyboard button "B".

Read more »

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

By OSt, 7 years ago, translation, In English,

Hi!

Let me introduce an updated version of the release S4RiS StanD — 1.8.

Changes:

  • Short manual about service was added to load page

  • "Lighten up" the results page to the halls with bright lighting easier to see

  • All sources and materials was added to project at GitHub

  • Developed and published on GitHub project's page log's convertor of Judge System Rybinsk SAT University (Russia).

Demo-stand was updated

Some screenshots (under cut) :)

Read more »

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

By OSt, 7 years ago, translation, In English,

Hello!

Today released a new version of my the service for defrosting contest standings — S4RiS StanD.

Main updates:

  • New design of load page and monitor page. In the first case, I made the load page more pleasant to look at, the monitor I tried to find a more vibrant and contrasting colors, remove the green background :-).

  • Fixed a bug with the defrost very rare situation in the monitor. Thanks to Dovier Ripoll Méndez, (Caribbean ACM-ICPC Regional Contest Director) for note.

  • Add new active button "B" — move down current row.

  • Minor changes logic of "defrosting". Now, after the current line has been completely "defrosted" moving to the next immediately above does not happen, that was clear when awarding — who is now awarded.
  • Some outer scripts was updated (jQuery libs).

Demo site and distributive were updated.

The plan is to add normal "adaptive" layout for different resolutions.

If you have any suggestions or you found a bug — write to me!

Thank you for using this service!

Read more »

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

By OSt, 8 years ago, translation, In English,

Good afternoon.

Today I want to share with the public my little project (which was part of my thesis), service on the "defrost" the results of the competition format ACM ICPC — "System for Right Solutions Standings Dancing" (S4RiS StanD). Hosted on github.

Introduction

In 2011, my team is still held in the semifinals, where at the close I saw the live operation of such a system ITMO. The feeling was strong. But after analyzing the work and reviewing captured my video, I realized that it is possible to improve this implementation, make it open to and more modest, local competitions, the participants were able to watch in awe tabulation of results. It was chosen as part of my thesis was used already in one competition and received a logical extension.

Read more »

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

By OSt, 9 years ago, translation, In English,

I congratulate all with 8th of March!

 Dear girls! Warmly we congratulate you on this remarkable holiday. You are the best that are in our life. Thanks you for all. 

Forever modest, meek in bearing,
As gay as morning's rosy dress,
Like any poet — open, caring,
As sweet as love's own soft caress.

Alexander Pushkin

Read more »

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

By OSt, 10 years ago, In English,
Last weekends didn’t promise anything unusual. By an old tradition I won the programming competition among the students of the Vologda State Pedagogical University.

When I came back home, I soon discovered a list of problems, sent over by the coach to be solved by the end of the week. I decided to start immediately, and about midnight I sat down to the problems.

By 4 o’clock I was done with 2 of them, and went to bed, pleased.

Next day I decided to go on with the problems, and there it started…

By some miracle in 1 day I was through with 6 problems out of 7. I didn’t expect such vim from myself. The coach was a bit shocked as well. But the evening stuck in my memory because of the problem “ Nikifor” from the Timus Online Judge.

Brute-force method was discarded at the very outset as having no prospects. Just for fun I decided to try the following:

it’s obvious that each 7th number is divisible by 7. Thus, the probability to get the result divisible by 7 by a random permutation of digits with truncation of initially incorrect variants was about 1 to 7.

As a result, I wrote a program that chooses at random which digit from this number to insert into the current position.

At first I got WA a couple of times. Introduced some changes and immediately got AC with the total time about 0.5 seconds (Java).

PS: the coach said it was silly to rely on this and I should never return to the practice of applying brute-force search to problems by means of “black art”.

And I have a question to you, as more experienced and successful participants of programming contests, what is your opinion about this approach (probability) to problem-solving, if in principle one can do without it there. Has it ever helped you? Is there any point thinking over such solutions?

UPD: I’ll be grateful if someone counts more accurately – how many attempts at a potentially correct answer does this program need to give the really right answer?

--------

Great thanks to Julia for help in translation my original russian text.


Read more »

 
 
 
 
  • Vote: I like it
  • -1
  • Vote: I do not like it

By OSt, 10 years ago, translation, In English,
Last weekends didn’t promise anything unusual. By an old tradition I won the programming competition among the students of the Vologda State Pedagogical University.

When I came back home, I soon discovered a list of problems, sent over by the coach to be solved by the end of the week. I decided to start immediately, and about midnight I sat down to the problems.

By 4 o’clock I was done with 2 of them, and went to bed, pleased.

Next day I decided to go on with the problems, and there it started…

By some miracle in 1 day I was through with 6 problems out of 7. I didn’t expect such vim from myself. The coach was a bit shocked as well. But the evening stuck in my memory because of the problem “ Nikifor” from the Timus Online Judge.

Brute-force method was discarded at the very outset as having no prospects. Just for fun I decided to try the following:

it’s obvious that each 7th number is divisible by 7. Thus, the probability to get the result divisible by 7 by a random permutation of digits with truncation of initially incorrect variants was about 1 to 7.

As a result, I wrote a program that chooses at random which digit from this number to insert into the current position.

At first I got WA a couple of times. Introduced some changes and immediately got AC with the total time about 0.5 seconds (Java).

PS: the coach said it was silly to rely on this and I should never return to the practice of applying brute-force search to problems by means of “black art”.

And I have a question to you, as more experienced and successful participants of programming contests, what is your opinion about this approach (probability) to problem-solving, if in principle one can do without it there. Has it ever helped you? Is there any point thinking over such solutions?

UPD: I’ll be grateful if someone counts more accurately – how many attempts at a potentially correct answer does this program need to give the really right answer?

--------

Great thanks to Julia for help in translation my original russian text.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it