OJ Board

rajib_sust

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

1. 1
2. 2
3. 4
4. TOO COMPLICATED

i think there no need calculation. think simple

rajib_sust

saiful_sust use code tag for input code

Code: Select all

here

rajib
sust

rajib_sust

u r code fail when i > j also make wrong answer for long data
it make overflow for int that why give wrong output

rajib_sust

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

rajib_sust

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

rajib_sust

Code: Select all

ACC

thanks for help

rajib_sust

Code: Select all

ACC

Rajib, sust

rajib_sust

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

rajib_sust

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

rajib_sust

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

Rajib, sust

rajib_sust

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

rajib_sust

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

rajib_sust

i am strange no one can give me any idea.

but i get now ACC.

thanks

rajib_sust

you can try to continuous input with continuous mod . it is good runtime take.

rajib_sust

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

OJ Board

Search found 16 matches

Re: 11042 - Complex, difficult and complicated

Re: 10922 - 2 the 9s

Re: The 3n + 1 problem

Re: Why #444 WA?

Re: 10684 - The Jackpot

help ::332 why WA please help me

help :: 11385 - Da Vinci Code

11332 - Summing Digits

Reply - Prime Cuts

reply on :: 406 - Prime Cuts

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

Re: 11480 - Jimmy's Balls

11415

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

11415 - Count the Factorials