Search found 29 matches

by robot
Tue Jan 10, 2012 9:36 am
Forum: Volume 124 (12400-12499)
Topic: 12405 - Scarecrow
Replies: 5
Views: 3288

Re: 12405

Hello, try this input...
I think ur code does not work for this input..think easily, its a easy problem
2
10
..#..##...
13
..#..##....#.

out:
Case 1: 3
Case 2: 4

ASU(SUST) :)
by robot
Fri Sep 02, 2011 9:40 pm
Forum: Volume 119 (11900-11999)
Topic: 11944 - $ 10 to Win?
Replies: 5
Views: 2589

11944: $ 10 to Win?

Can anyone tell what I am wrong..i cannot find any case to bug my code.....Here is my code.. #include <iostream> #include <string> #include <map> #include <queue> #include <stack> #include <algorithm> #include <list> #include <set> #include <cmath> #include <cstring> #include <stdio.h> #include <str...
by robot
Mon Aug 22, 2011 2:18 pm
Forum: Volume 120 (12000-12099)
Topic: 12028 - A Gift from the Setter
Replies: 2
Views: 1725

Re: 12028

Hi unaisah .. you have a simple mistake... A sort function require....According ur code..... a[0]=t; for(li=1;li<n;li++) { a[li]=(k*a[li-1]+c)%1000007; y+=a[li]; } sort(&a[0],&a[n]); xx=sum(a,n); printf("Case %d: %lld\n",j,xx); In Sum funtion: for(i=0;i<nn;i++) { } return sum I hope u will get Accep...
by robot
Mon Aug 22, 2011 2:00 pm
Forum: Volume 120 (12000-12099)
Topic: 12036 - Stable Grid
Replies: 2
Views: 1638

Re: 12036 WA??

please thinking easy....its a simple problem....
just think when a grid's in every column number is unique? Hints: u can count the unique number occurence...
by robot
Mon Aug 22, 2011 1:49 pm
Forum: Volume 120 (12000-12099)
Topic: 12049 - Just Prune The List
Replies: 14
Views: 4166

Re: Why I m getting RE for 12049- Just Prune The List

Hi, ferd@ud$ is right..
u can use data structure map.......bcz the value r so large...... :)
by robot
Thu Jun 09, 2011 7:11 am
Forum: Volume 118 (11800-11899)
Topic: 11800 - Determine the Shape
Replies: 47
Views: 13059

Re: 11800 - Determine the Shape

Hi suraya... For ur input my accepted output is given... Case 1: Square Case 2: Rectangle Case 3: Rhombus Case 4: Parallelogram Case 5: Trapezium Case 6: Ordinary Quadrilateral Case 7: Ordinary Quadrilateral Case 8: Ordinary Quadrilateral Case 9: Trapezium Case 10: Parallelogram Case 11: Trapezium C...
by robot
Mon Jun 06, 2011 9:06 pm
Forum: Volume 117 (11700-11799)
Topic: 11787 - Numeral Hieroglyphs
Replies: 6
Views: 3045

Re: 11787 - Numeral Hieroglyphs

Hi farhan...
try this input... for this situition properly doesn't work ur program....
1
SUUUUUUUUUU
ouput:
error
by robot
Mon Jun 06, 2011 7:17 pm
Forum: Volume 118 (11800-11899)
Topic: 11800 - Determine the Shape
Replies: 47
Views: 13059

Re: 11800 - Determine the Shape

Hi.. Surya.. Actually i don't see ur code..but from ur explanation i think something is wrong.. you can forward below this approach.. 1.if 4 arm length is equal if 4 angle is 90 --> square else ---> Rhombus 2. if (2 * 2)opposite arm length is equal if 4 angle is 90 --->Rectangle else---->Parallelogr...
by robot
Sun Jun 05, 2011 8:56 pm
Forum: Volume 118 (11800-11899)
Topic: 11892 - ENimEN
Replies: 9
Views: 3230

Re: 11892-EnimEn

Hi receme..
I think ur process something wrong..
1
6
3 5 2 4 6 8
output:
poopi

my hints: u can use XOR concept..
ASU(SUST) :)
by robot
Sun Jun 05, 2011 8:35 pm
Forum: Volume 119 (11900-11999)
Topic: 11970 - Lucky Numbers
Replies: 7
Views: 3565

Re: 11970 - Lucky Numbers

Hi Kalochita...
Please be careful of problem statement ....you have in simple mistake..
1. change: case->Case
2.if(j!=T) //no need
always print a new line .
I hope u will get Accepted..
ASU(SUST) :)
by robot
Sun Jun 05, 2011 10:03 am
Forum: Volume 119 (11900-11999)
Topic: 11965 - Extra Spaces
Replies: 31
Views: 7716

Re: 11965 - Extra Spaces

Hi SS....
you have a simple mistake..The problem says print a blank line between test case but not at all..your program print always a blank line.
try this case:
2
1
<space><space>
1
<space><space>i am a student.
output:
Case 1:
<space>
Case 2:
<space>i am a student.
ASU(SUST)
by robot
Tue May 31, 2011 12:17 pm
Forum: Volume 120 (12000-12099)
Topic: 12024 - Hats
Replies: 5
Views: 3064

Re: 12024

Hi Naj..
This problem actually based on Dearagement theorem...so u have to little study in this topics..
I think u know , the number of n things are arrange in n! if the n things are not arrange in their own position what have you done? ..... :)
ASU(SUST)
by robot
Sun May 01, 2011 2:33 pm
Forum: Volume 119 (11900-11999)
Topic: 11960 - Divisor Game
Replies: 19
Views: 5347

Re: 11960 Divisor Game Getting WA!!

Imti ur code is right, but ur fac() funtion has too much complexity. so change this method. and try prime factor efficiently.
use sqrt(N) for prime factor. I hope u will get Accepted...
ASU(SUST) :)
by robot
Fri Apr 29, 2011 7:46 pm
Forum: Volume 119 (11900-11999)
Topic: 11960 - Divisor Game
Replies: 19
Views: 5347

Re: 11960 Divisor Game Getting WA!!

Imti can u send ur code?
ASU(SUST) :D
by robot
Thu Apr 28, 2011 7:49 pm
Forum: Volume 117 (11700-11799)
Topic: 11777 - Automate the Grades
Replies: 32
Views: 5731

Re: 11777 why no AC?

please check ur code condition
else if( total >= 7) ---> else if( total >= 70)
printf("Case %d: %c\n",ks,'C');
else if( total >= 6) ----> else if( total >= 60)
printf("Case %d: %c\n",ks,'D');

ASU(SUST) :)

Go to advanced search