OJ Board

No problem..

I already do it using MAXMIN floyds.

Well.. that is a good question..

That's why I dont use java..

The only way I see now is to pass it to string and .. find the dot.. and you know the rest.

Sorry..

ok misof.

Done

I am having the same problem.. can someone post some input and output so I can test my problem?

Thanks.

Hi to all!!! I am trying to solve this graph problem but it gives me TLE.. I use this metoth to find the MAX.. void bfs(long a, long b, long cost) { long i; visitado[a]=1; if (a==b && cost>max) max=cost; else { for (i=0;i<=n;i++) if (!visitado[i] && edges[a][i]>0 && min(edges[a][i], cost)>max) bfs(i...

well..

For integers up to 2^64 you can use long long on C or Int64 on Pascal.. but if the numbers are much more larger you need to write it..

well.. if you have a number of test cases.. you just do a for cycle.. if your task is to read until end of file just control EOF (end of file). For example scanf returns the number of arguments read if the value returned is 0 then input ends. gets function is almost like that.. if 0 is returned then...

I think your only problem is to assume that start<end ..

For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j.

I hope this help you.

hmm..

Well.. I know Pascal, C, a little Basic .. and now i am learning Java

Your code is OK..

The problem its your array size .. put one more zero on MAX.

Hi.. I dont understand why my code give me WA... Can somenone who got AC tell me the output for this please.. test test test test sdfasdf (blank Line = (Length=0)) kgds (Space charaters) ..... asd The the My code output: 1. Length of longest match: 1 2. Blank! 3. Length of longest match: 0 4. Length...

I have the same problem I dont no why but my source give me WA... Why?? [pascal] Program Acm_444(Input, Output); Var Letra: Char; Dado: Integer; Result: AnsiString; Function Reverse(X: Integer): String; Var Y, Temp: String; I, Outro: Integer; Begin Str(X, Y); Temp:=''; For I:=Length(Y) DownTo 1 Do T...

Can somone help me with this... I have WA ... why?? [pascal] Program Acm_412(Input, Output); Function Verificou(X, Y: Integer): Boolean; Var I: Integer; Begin Verificou:=True; If (Y Mod (Y Div 2)=0) And (X Mod (Y Div 2)=0) And (Y Div 2<>1) Then Verificou:=False Else For I:=2 To Trunc(Sqrt(Y)) Do If ...

THis is my code for problem 10391 [pascal] Program Problema_A(Input, Output); Var Conta, I, Temp, Conta2: LongInt; Words: Array[1..120000] Of String; Function Procurar(N: String): LongInt; Var I, J, A: Integer; Begin I:=1; J:=Conta; While (I<J) Do Begin A:=(I+J) Div 2; If N<=Words[A] Then J:=A Else ...