Search found 63 matches

by mukeshtiwari
Fri Oct 01, 2010 9:45 pm
Forum: Volume 100 (10000-10099)
Topic: 10023 - Square root
Replies: 121
Views: 27370

Re: Problem 10023 Square Root

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
by mukeshtiwari
Sun May 16, 2010 8:46 pm
Forum: Volume 100 (10000-10099)
Topic: 10023 - Square root
Replies: 121
Views: 27370

Problem 10023 Square Root

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...
by mukeshtiwari
Sun May 16, 2010 7:34 pm
Forum: Volume 100 (10000-10099)
Topic: 10023 - Square root
Replies: 121
Views: 27370

Re: 10023 - Square Root

Edit; Posted in Java forum.Sorry for posting here.
by mukeshtiwari
Sat Mar 29, 2008 9:37 pm
Forum: Volume 9 (900-999)
Topic: 941 - Permutations
Replies: 7
Views: 6202

@jan
empty code is accepted while my valid solution timeout.
by mukeshtiwari
Fri Mar 28, 2008 8:01 pm
Forum: Volume 114 (11400-11499)
Topic: 11428 - Cubes
Replies: 64
Views: 17130

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=((-3*k1)+(long long int...
by mukeshtiwari
Sat Jan 26, 2008 12:19 pm
Forum: Volume 111 (11100-11199)
Topic: 11149 - Power of Matrix
Replies: 42
Views: 19761

no reply :(
by mukeshtiwari
Tue Jan 22, 2008 9:11 am
Forum: Volume 111 (11100-11199)
Topic: 11149 - Power of Matrix
Replies: 42
Views: 19761

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=...
by mukeshtiwari
Sun Jan 20, 2008 8:17 am
Forum: Volume 111 (11100-11199)
Topic: 11149 - Power of Matrix
Replies: 42
Views: 19761

Thank you
It was quite helpful but don't know why it was not giving compiler error on my pc.
by mukeshtiwari
Sat Jan 19, 2008 10:35 pm
Forum: Bugs and suggestions
Topic: NEW JUDGE'S STATUS
Replies: 20
Views: 18450

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...
by mukeshtiwari
Sat Jan 19, 2008 9:15 pm
Forum: Volume 111 (11100-11199)
Topic: 11149 - Power of Matrix
Replies: 42
Views: 19761

Compilation Error

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,...
by mukeshtiwari
Wed Nov 21, 2007 5:24 pm
Forum: Volume 102 (10200-10299)
Topic: 10236 - The Fibonacci Primes
Replies: 28
Views: 11398

thnkx rio .
by mukeshtiwari
Sun Nov 11, 2007 5:29 pm
Forum: Volume 102 (10200-10299)
Topic: 10236 - The Fibonacci Primes
Replies: 28
Views: 11398

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.
by mukeshtiwari
Sun Nov 11, 2007 7:22 am
Forum: Volume 102 (10200-10299)
Topic: 10236 - The Fibonacci Primes
Replies: 28
Views: 11398

no response :(
by mukeshtiwari
Thu Nov 08, 2007 10:50 pm
Forum: Volume 102 (10200-10299)
Topic: 10236 - The Fibonacci Primes
Replies: 28
Views: 11398

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...
by mukeshtiwari
Sat Nov 03, 2007 3:41 pm
Forum: Volume 1 (100-199)
Topic: 125 - Numbering Paths
Replies: 56
Views: 5638

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

Go to advanced search