OJ Board

What believe you... who are better and/or efficient (fast and
optimal):
System.out.println("result is" +r);
or
System.out.print("result is");
System.out.println(r);

I say it, because the compiler translates
System.out.println("result is" +r);
thus :
System.out.println(new StringBuffer ...

The java.math.BigInteger not is supported in the Vallladolid Judge, but you can use the implementacion of BigInt in this link
http://online-judge.uva.es/board/viewto ... 7a75ae0c24

Good Luck !

I got accepted using BigInt (C and Java 1.332 seconds) with a array of 1050 digits!.

Good Luck!

You need to take into account the characters \n (13) and \r (10) (they do not in rank > = the 39 and > = 126 ).
this code it is sufficient:

[java] while((c=System.in.read())>=0){
if(c!=13 && c!=10) car=(char) (c-7);
else car=(char) c;
System.out.print (car);
}
[/java]

Good Luck!

The java.util sources (and of all the classes) they are in
the file src.zip, which this in the folder where you installed the
JDK.
you can use java.util.Vector and java.util.HashTable...

This problem is of BigNum or it is possible to use long double or double?
Thank... :wink:

my code is WA:

[cpp]
// Problem 485 - Triangle Pascal
#include <iostream>
using namespace std;

#include <stdio.h>
#include <stdlib.h>

double ant[10000],actual[10000],*pact,*pant;
char *maxi ...

The problem can be in the search, these using "binary search" and this return the position of the element if it finds it in the center and not in the first occurrence.

Test this input:
3 1
2
2
2
2
0 0

Test using linear search, good luck!

Test in google using like key words:
union find algorithm
I found alli good information