ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1013. K-based Numbers. Version 3

Is it possible ?
Posted by Todor Tsonkov 6 Jul 2006 22:20
After A lot of attemps I Got AC with pretty desent times (according to me :) ):
http://acm.timus.ru/status.aspx?space=1&num=1013&author=40769.

I wonder, is it possible??
http://acm.timus.ru/status.aspx?space=1&author=43335

He uses only 2 K memory

Edited by author 06.07.2006 22:21

Edited by author 06.07.2006 22:21
Re: Is it possible ?
Posted by xwj1234 12 Oct 2008 17:09
astonishing!
It was a temporary derangement of the checking service
Posted by Vladimir Yakovlev (USU) 12 Oct 2008 20:58
Re: Is it possible ?
Posted by S▓i.l.e.n.t 26 Feb 2009 14:43
shocked
Re: Is it possible ?
Posted by Honest 14 Aug 2009 23:06
I don't know the reason.
Re: Is it possible ?
Posted by vongang 30 Sep 2011 19:28
Orz, 拜大牛!
Re: Is it possible ?
Posted by amirani 12 Jan 2012 01:38
I don't think it's possible. In FAQ it's written that minimal memory is over 100k because of compilator.Even only 2 variables need more than 2 k.And time is impossible to :)
I really can't understand the reason.
And 'vongang ' please respect others.Use English.