[code deleted]

Edited by moderator 01.12.2019 21:49

Got AC. There were "Time Limit Exceeded" at tests 32, 56, 59, 60 before i made some complicated enhancements to my program. The monitor have shown smth around 0,9 second for some tests, so it was pretty close.

My algo uses O(N*N) memory and O(N*Ln(N)) or O(N*N) operations (depends on input string; there are too slightly different ways of algorithm). I suppose there should be better solution. Any hints about that?

Edited by author 12.10.2008 05:22

i dont know how to set the frist...
this is my program i wanna start from 1 but it start from 2..
thks :-)...



public class SelfNumbers
{
public static void main (String args[]) throws Exception
{
int i = 1;
int sum=0,recu,result=0,i_first;
while(result<10)
{
i_first = i;
sum=0;
do
{
recu = i%10;
i= i/10;
sum+=recu;

}
while(i!=0);
result=sum+i_first;
if(result<=10)
System.out.println(result );
i=result;
}
}
}

Hi, Just as a Recommendation for Java programmers Using BigInteger this problem is the same as 1009, well' u Just will have to find a way to run faster so you dont get TL, but BigInteger works fine! ;)

WA test 5 why??
test PLEASE

As i can see from my compilation error ( http://acm.timus.ru/ce.aspx?id=2270863 ), there is no System.Collections.Generic.HashSet in your .NET framework, so your version should be older than 3.5 (or you have disabled the HashSet).
Can you please say what exactly is supported and what is not; or which version of C#/.NET framework do you have?
Also, it would be great to include an example of minimal working code in the FAQ. For example, solution of problem #1000:
--
using System;

namespace Task1000a {
    class Program {
        static void Main(string[] args) {

            String[] numbers = Console.ReadLine().Split();
            Console.WriteLine((int.Parse(numbers[0]) + int.Parse(numbers[1])).ToString());
        }
    }
}
--

Thanks

Edited by author 11.10.2008 20:13

I cant undrestand how to count rectangles?
pleaze explain it.

Right math idea was having TLE for
using set and vector after set.
The same idea has AC 0.125 with malloc function for
dynamic arrays.

abzzbbbzza
ans:
4
a b zzbbbzz a

pls explain it me

Naskol'ko ya mogu ponyat', dlya vychislenya kachestva neobhodimo znat' A i B. No... Oni tam vrode ne dany...

WHAT IS 3 TEST

For it is a convex polygon the best path won't self-cross, so a vertex Pi can only be connected to Pi-1 or Pi+1.

Good Luck!

Edited by author 11.08.2006 16:27

test 11 PLEASE


Edited by author 11.10.2008 15:36

Билеты на самолет продают до момента вылета самолета фактического, или до момента вылета самолета по расписанию?

Wa test #7

test please

Edited by author 11.10.2008 23:11

test please