Search found 50 matches

by shaon_cse_cu08
Mon May 27, 2013 2:06 pm
Forum: Volume 126 (12600-12699)
Topic: 12630 - Equilateral Triangle in a Triangle Grid
Replies: 3
Views: 2175

Re: 12630 - Equilateral Triangle in a Grid

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 ...
by shaon_cse_cu08
Mon May 27, 2013 12:14 pm
Forum: Volume 100 (10000-10099)
Topic: 10013 - Super long sums
Replies: 212
Views: 38319

10013 - Super Long Sum (Submission Error!!!)

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...
by shaon_cse_cu08
Sun May 26, 2013 5:33 pm
Forum: Volume 126 (12600-12699)
Topic: 12630 - Equilateral Triangle in a Triangle Grid
Replies: 3
Views: 2175

12630 - Equilateral Triangle in a Triangle Grid

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...
by shaon_cse_cu08
Sat May 25, 2013 6:29 pm
Forum: Volume 100 (10000-10099)
Topic: 10013 - Super long sums
Replies: 212
Views: 38319

Re: 10013 - Super Long Sums

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 ...
by shaon_cse_cu08
Sun Mar 18, 2012 10:07 am
Forum: Volume 7 (700-799)
Topic: 762 - We Ship Cheap
Replies: 51
Views: 19731

Re: 762 - We Ship Cheap

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...
by shaon_cse_cu08
Sat Nov 12, 2011 10:43 am
Forum: Volume 105 (10500-10599)
Topic: 10515 - Powers Et Al.
Replies: 124
Views: 28994

Re: 10515 - Power et al.

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...
by shaon_cse_cu08
Tue Nov 08, 2011 8:00 pm
Forum: Bugs and suggestions
Topic: CypePoizizelp is advertizing (Spamming)
Replies: 1
Views: 1292

CypePoizizelp is advertizing (Spamming)

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...
by shaon_cse_cu08
Tue Nov 08, 2011 7:52 pm
Forum: Volume 114 (11400-11499)
Topic: 11466 - Largest Prime Divisor
Replies: 29
Views: 15283

Re: 11466 - Largest Prime Divisor

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...
by shaon_cse_cu08
Mon Nov 07, 2011 6:04 pm
Forum: Volume 118 (11800-11899)
Topic: 11889 - Benefit
Replies: 27
Views: 11131

11889 - Benefit : WA WA!!

Code: Select all

Code Removed After AC  :wink: 
by shaon_cse_cu08
Wed Nov 02, 2011 5:28 pm
Forum: Volume 112 (11200-11299)
Topic: 11219 - How old are you?
Replies: 117
Views: 33113

11219 - How old are you? -->WA WA WA!!!

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);...
by shaon_cse_cu08
Thu Aug 25, 2011 9:26 pm
Forum: Volume 4 (400-499)
Topic: 492 - Pig-Latin
Replies: 213
Views: 24636

Re: 492 - Pig Latin

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

Code: Select all

Input:
Amar nam shaon
Amar nam shaon.
10th
10th <--(space)
10th.
10th,
10th"

Output:
Amaray amnay haon
Amaray amnay haonsay.
10h
10htay 
10htay.
10htay,
10htay"

by shaon_cse_cu08
Wed Aug 24, 2011 6:17 pm
Forum: Volume 109 (10900-10999)
Topic: 10954 - Add All
Replies: 80
Views: 27199

Re: 10954 - Tricky / Cheat

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 :P :-? :lol: :evil:
by shaon_cse_cu08
Wed Jul 06, 2011 9:26 pm
Forum: Volume 120 (12000-12099)
Topic: 12043 - Divisors
Replies: 6
Views: 3139

12043 - Divisors

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) ...
by shaon_cse_cu08
Mon Jul 04, 2011 9:32 pm
Forum: Volume 100 (10000-10099)
Topic: 10066 - The Twin Towers
Replies: 35
Views: 12854

Re: 10066 - The Twin Towers

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...
by shaon_cse_cu08
Thu Jun 23, 2011 8:56 pm
Forum: Volume 106 (10600-10699)
Topic: 10611 - The Playboy Chimp
Replies: 44
Views: 16931

Re: 10611 - The Playboy Chimp

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...

Go to advanced search