Search found 16 matches

by rajib_sust
Sat Sep 13, 2008 6:15 am
Forum: Volume 110 (11000-11099)
Topic: 11042 - Complex, difficult and complicated
Replies: 20
Views: 13558

Re: 11042 - Complex, difficult and complicated

may be judge input there no such case like 96 32.
becoz i also get ACC using this

Code: Select all

1. 1
2. 2
3. 4
4. TOO COMPLICATED
i think there no need calculation. think simple
by rajib_sust
Mon Sep 01, 2008 10:04 am
Forum: Volume 109 (10900-10999)
Topic: 10922 - 2 the 9s
Replies: 38
Views: 13997

Re: 10922 - 2 the 9s

saiful_sust use code tag for input code

Code: Select all

here
rajib
sust
by rajib_sust
Sat Aug 30, 2008 7:15 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 178880

Re: The 3n + 1 problem

u r code fail when i > j also make wrong answer for long data
it make overflow for int that why give wrong output
by rajib_sust
Sat Aug 30, 2008 6:47 pm
Forum: Volume 4 (400-499)
Topic: 444 - Encoder and Decoder
Replies: 155
Views: 20837

Re: Why #444 WA?

Code: Select all

	sprintf(b,"%lld",j);
u r keeping long long number just a 10 size array but long long contain 18 digit most
cheek it
by rajib_sust
Fri Aug 29, 2008 10:40 am
Forum: Volume 106 (10600-10699)
Topic: 10684 - The jackpot
Replies: 34
Views: 18633

Re: 10684 - The Jackpot

Code: Select all

he can identify patterns of consecutive wins and elaborate a win-win strategy.
A bet is an amount of money and is either winning (and this is recorded as a positive value). 
i am not understand this two line of code. what do u mean by win win strategy.

rajib
sust
by rajib_sust
Mon Aug 18, 2008 8:50 pm
Forum: Volume 3 (300-399)
Topic: 332 - Rational Numbers from Repeating Fractions
Replies: 83
Views: 19416

help ::332 why WA please help me

Code: Select all

ACC
thanks for help
by rajib_sust
Sun Aug 17, 2008 11:29 pm
Forum: Volume 113 (11300-11399)
Topic: 11385 - Da Vinci Code
Replies: 70
Views: 23002

help :: 11385 - Da Vinci Code

Code: Select all

ACC

Rajib, sust
by rajib_sust
Sat Aug 16, 2008 10:44 pm
Forum: Volume 113 (11300-11399)
Topic: 11332 - Summing Digits
Replies: 17
Views: 9491

11332 - Summing Digits

you do not need any calculation it is just like this. this is from number theory

Code: Select all

		temp = number % 9;
		if( temp == 0 ) temp = 9;

Rajib, sust
by rajib_sust
Sat Aug 16, 2008 8:38 pm
Forum: Volume 4 (400-499)
Topic: 406 - Prime Cuts
Replies: 187
Views: 21779

Reply - Prime Cuts

rhsumon ,
some of case your code give wrong answer
your out put::
3 1
3 1: 2 -858993460
my AC output::
3 1
3 1: 2
cheek it carefully


Rajib, sust
by rajib_sust
Sat Aug 16, 2008 8:22 pm
Forum: Volume 4 (400-499)
Topic: 406 - Prime Cuts
Replies: 187
Views: 21779

reply on :: 406 - Prime Cuts

try to read the problem carefully it is simple explain
it is easy also

Rajib, sust
by rajib_sust
Sat Aug 16, 2008 8:18 pm
Forum: Volume 2 (200-299)
Topic: 263 - Number Chains
Replies: 45
Views: 7586

Re: #263 .. plz help :~~~

may be 59994 is not in list becoz my AC also give output result 3
after modify i also get AC and result is 2

Rajib, sust
by rajib_sust
Fri Aug 15, 2008 10:45 pm
Forum: Volume 114 (11400-11499)
Topic: 11480 - Jimmy's Balls
Replies: 12
Views: 5550

Re: 11480 - Jimmy's Balls

can somebody tell me how to solve this problem? i think it is a Combinatorics problem, what we want to solve is there are how many a,b,c such that a+b+c=n and a<b<c. but it is out of my ability. :oops: u can solve it using looping. if u using 2 loop it will take TLE so i us one loop and reduce othe...
by rajib_sust
Fri Aug 15, 2008 10:08 pm
Forum: Volume 114 (11400-11499)
Topic: 11415 - Count the Factorials
Replies: 11
Views: 4993

11415

i am strange no one can give me any idea.

but i get now ACC.

thanks :o
by rajib_sust
Fri Aug 15, 2008 11:27 am
Forum: Volume 101 (10100-10199)
Topic: 10176 - Ocean Deep ! - Make it shallow !!
Replies: 37
Views: 11982

Re: 10176 - Ocean Deep! Make it shallow!!

you can try to continuous input with continuous mod . it is good runtime take.
by rajib_sust
Fri Aug 15, 2008 5:43 am
Forum: Volume 114 (11400-11499)
Topic: 11415 - Count the Factorials
Replies: 11
Views: 4993

11415 - Count the Factorials

I am continuous getting TLE!!
any one can give me good algo i can not found a faster algo
my algo
1. generate prime factor
2. linear search and count

if any good idea?

thanks

nikson

Go to advanced search