OJ Board

Today i tried again with try and catch block but no luck.I am still getting RTE. I guess this community not active as it was initially when i joined this site[around 2006-07].
Thank you

Could some one please tell me why i am getting Run Time Error for this code. Thank You /* * To change this template, choose Tools | Templates * and open the template in the editor. */ //package uvaproblem_10023; import java.io.*; import java.math.BigInteger; /** * * @author user */ public class Main...

Edit; Posted in Java forum.Sorry for posting here.

@jan
empty code is accepted while my valid solution timeout.

Could someone please tell me why this code is giving WA for problem cubes. #include<cstdio> #include<cmath> int main() { long long int n=1; long long int k1,k2,x,y,w,flag; while(scanf("%lld",&n) && n) { flag=1; for(long long int i=1;i*i*i<=n;i++) { if(!(n%i)) { k1=i,k2=n/i; w=(...

no reply

Could someone please tell me why judge is giving WA for this problem.Its giving all output correct for inputs given on board.If someone can point out error it will be very much thankful. //kindly compile with g++ #include<cstdio> #include<cstdlib> int n,**I,MOD=10; int **alloc(int n) { int **a,i; a=...

Thank you
It was quite helpful but don't know why it was not giving compiler error on my pc.

Respected Carlos I am trying to submit a solution for problem 11149 and getting compiler error. Initially judge always send me a mail if it is accepted ,wrong answer or compiler error.Judge also send what is the error which is not in the new judge so i can not know why i am getting compiler error.Th...

Could some one please help me why this code is giving compilation error. The code is working fine on my pc. #include<stdio.h> #include<stdlib.h> int n,**I,MOD=10; int **alloc(int n) { int **a,i; a=malloc(n*sizeof(int *)); for(i=0;i<n;i++) a[i]=malloc(n*sizeof(int)); return a; } int **mul(int **res1,...

thnkx rio .

so is it possible to get k in o(1) time or should i use binary search . plz suggest me how to calculate k because now i am exhausted with this problem.

no response

Getting TLE. plz someone reply me , what is wrong with my code and algorithm . according to problem description, all fibonacci primes will occur at prime postions so i calculated first 22000 primes . then i use the following formula (http://mathworld.wolfram.com/FibonacciNumber.html) F(n)=phi^n/sqrt...

Thnkx jubin for such valuble observation .

check if path[x][x] is valid. If there is a path from x, to x, then every path with x in the path is infinite.

thnkx a lot