UVa OJ Board

Why do I keep getting WA? #include <iostream> #include <string> using namespace std; int main() { int B[3],G[3],C[3]; long BGC,BCG,CGB,CBG,GBC,GCB; while(cin>>B[0]>>G[0]>>C[0]>>B[1]>>G[1]>>C[1]>>B[2]>>G[2]>>C[2]) { BCG=G[0]+C[0]+ B[1]+G[1]+ B[2]+C[2]; BGC=G[0]+C[0]+ B[1]+C[1]+ B[2]+G[2]; CBG=G[0]+B[...

Is this the right formula f(n)=2*f(n-1) where f(1)=1?

Hi, I'm wondering, is there a more efficient way of determining a hand. I was thinking about looking at the probability of getting a hand, and seeing if it matches the probability of getting say a flush.

#include<iostream> int foo(long num) { long c=num; long iter=1; while (c!=1) { if ((c%2)==0) c/=2; else c=c*3+1; iter++; } return iter; } int main() { long i,j,tmp,max; while (std::cin>>i>>j) { std::cout<<i<<" "<<j<<" "; if (i>j) { tmp=i; i=j; j=tmp; } max=0; for (long x =i;x<=j;x++) { tmp=foo(x); ...

This problem is really tuff, even if it is the first one, anyway here is a source code, it got AC. var i, j: integer; function getCL(N: integer): integer; var k: integer; begin k := 1; while N <> 1 do begin if odd(N) then N := 3*N + 1 else N := N div 2; k := k + 1; end; getCL := k; end; function ge...

Leonid wrote:

Codemonkey2000 wrote:I'm not getting WA, I'm getting Tile limit exceeded.

Use more efficient implementation

I know, but how can I make my code any more efficient? I posted the code above.

I'm not getting WA, I'm getting Tile limit exceeded.

All the dates display my birth day. THis is just weird.

I keep getting time limit exceeded. I don't know how to make this code any more efficient. Am I missing something? :S uses crt; var i,j,max,x,tmp:longInt; function foo(a:longInt):longInt; var x,c:longInt; begin x:=a; c:=1; while (x<>1) do begin if ((x mod 2) =0) then x:=x div 2 else x:=x*3+1; c:=c+1...