UVa OJ Board

Tnx Hikari9... Though in ur 3rd output u missed a '5' For n=27 result sud be 23751 .. I don't knw if it was intentional or not :lol: Yeah AC.... :D Got It But I can't understand... Clearly the problem statement says " number of different equilateral triangles that can be found" And I'm 5th for this ...

Hello.. plzzz Help.. I don't know But every time i m submitting i m getting Submission Error ... :x I don't knw whats the problem... and for my entire UVa lifetime i hv never got an Submission Error (What is this!!)... Its Driving me creazy... :oops: PLZ Help!!! import java.math.BigInteger; import j...

I m getting WA for this problem... I think its a straight cut problem with a straight cut formula No. of triangle = floor [(n*(n+2)*(2n+1))/8] .... where 'n' is 1 less dan the problem description (1 in case of 2).... Some Body help me with some Case... Isn't it 13 for n=4 and 27 for n=5 ?? Code Remo...

Hello.. plzzz Help.. I don't know But every times i m submitting i m getting Submission Error ... :x I don't knw whats the problem... and for my entire UVa lifetime i hv never got an Submission Error (What is this!!)... Its Driving me creazy... :oops: PLZ Help!!! import java.math.BigInteger; import ...

I m also getting RTE for this problem again & agian... Plz help me to sleep soundly.... :cry: :x :( #include<cstdio> #include<iostream> #include<vector> #include<queue> #include<map> #include<algorithm> #include<string> #include<cstring> using namespace std; vector<long>G[5000]; map<string,long>ind...

I think the judge input data sets for this problem is weak... :lol: :lol: Data set contains n=0 for only the last case... I gor AC with if(n[0]=='0') return 0; 8) :lol: But there should be case like this : Input: 2547 0 Output: 1 Sooo funnyyy.... and guys This is sooo number theory.... just try to f...

Topic's of his/her spam was " Buy Adipex at reputable online phamacy and save big ".... :lol: :x Plz banned dis user....... :evil: http://online-judge.uva.es/board/viewtopic.php?f=38&t=18196&start=60 http://online-judge.uva.es/board/viewtopic.php?f=1&t=65950 http://online-judge.uva.es/board/viewtopi...

I use my own prime factorization function... this is Child's math... divide a number a number until it can't be divided... dan increment it by 2..bcoz all primes except for 2 are odd... and my code gave me 0.032 s... It would b more faster if i use only da prime... but sometimes Simplicity is more f...

I have tried every possible case given in this forum... But still WA... can ny1 help me... I can't sleep... :( :cry: :roll: #include<stdio.h> int main() { long day_1,mon_1,yr_1,day_2,mon_2,yr_2,t,cas; long yr_dif; scanf("%ld",&t); for(cas=1; cas<=t; cas++) { scanf("%ld/%ld/%ld",&day_1,&mon_1,&yr_1);...

I thing its a Clever call.... See the last word... It must be apended by a non-alphabetic character.... (space or . or something else)

The problem clearly state's..." N positive integers (all are less than 100000)"
But the Input file include's "0"... "There is a huge difference between POSITIVE & NON-NEGATIVE" I think problem setter had forgotten this fact...

Or Intentionally Cheated

Hi...Some 1 please give me some critical Input for this problem.... I m getting WA again and again...please some 1 help me finding my bug :( :oops: #include<stdio.h> #include<math.h> void divisor(long a[],long n); long d[100000]; int main() { long t,a,b,k,i,cas=0,l; scanf("%ld",&t); while(++cas<=t) ...

I m getting WA!! But i dont know why?? Plzz anyone help me finding my bug.... :( :oops: #include<stdio.h> int main() { freopen("Input.txt","r",stdin); int a[110],b[110],i,j,n1,n2,cas=1,c[110][110],n,m; while(1) { scanf("%d %d",&n1,&n2); if(n1==0&&n2==0) return 0; if(n1>n2) { n=n1; m=n2; } else { m=n...

I have modified my binary search algorithm...that is even if it can't find the data it always return nearest location.... I got it AC in 0.036 s .... Plz be careful using this code...Coz the nearest location can be either smaller or the greater one.... long b_src(long a[],long n,long x) //a[] is the...