Comments
On FahimR → Editorial of SPC Round 69, 2 years ago
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
On FahimR → Editorial of SPC Round 68, 2 years ago
0

Thanks for your feedback
On FahimR → Editorial of SPC Round 68, 2 years ago
0

I can share you another idea. If lcm goes beyond n then it doesn't effect on answer. Now, it can be guessed that the lcm are going over n or not.

Let's find lcm(a,b,c) :

We can say, lcm(a, b, c) = lcm(lcm(a,b), c). Let, d = lcm(a, b), lcm(a, b, c) = lcm(d, c). Here maximum d can be 10^18 and c 10^9. lcm(d, c) = (d * c) / gcd(d, c). let g = gcd(d, c).

Now update:

let gc = gcd(d, g)

d /= gc g /= gc

let, gc = gcd(c, g)

c /= gc g /= gc (Upor niche katakati korlam)

Now g is equal to 1.

Now I have to find if d * c > n or not. If log(d) + log(c) > log(n) then you can say It's over n, it doesn’t effect on my answer otherwise return d * c which is lcm(a, b, c).

But this theory hasn’t applied in the testcase, so testcase is wrong actually and I apologise for that.
On FahimR → Editorial of SPC Round 68, 2 years ago
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
On FahimR → Editorial of SPC Round 68, 2 years ago
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
On FahimR → Editorial of SPC Round 68, 2 years ago
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
On FahimR → SPC Round 68, 2 years ago
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
On FahimR → Spc Round 67, 2 years ago
0

Editorial has been updated here
On FahimR → Spc Round 67, 2 years ago
0

Editorial : here
On FahimR → Editorial of SPC Round 67, 2 years ago
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
On FahimR → Spc Round 67, 2 years ago
+5

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
0

Editorial has been uploaded for this contest here
0

you are welcome

0

Thanks for noticing, please check now
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
0

Editorial has been uploaded. Check here
On FahimR → Editorial of SPC Round 64, 2 years ago
+3

Yes I appreciate your idea that helps us to avoid extra log complexity. But you can do this with 26 character hashing , that might give less complex and easy to understand . Submission

O(n) complexity
On FahimR → Editorial of SPC Round 64, 2 years ago
+3

The complexity will be O(t) only. mistake

On FahimR → Editorial of SPC Round 64, 2 years ago
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
On FahimR → Editorial of SPC Round 64, 2 years ago
0

Auto comment: topic has been updated by FahimR (previous revision, new revision, compare).
0

Problem C was not qualityfull at all whereas B was enough good
0

If I get TLE instantly in my first submission then maybe I could find an optimal solution. Which may guide me to Expert. Actually I am stucked in 1593 max. for a long time. That's why it hurts me a lot
-10

Problem D is such a low quality problem. I got hacked with verdict TLE but after the system testing I submitted same hacked code and got accepted . I was ranked 444(official) before hacked and finished at 2k+ after hacked . And lost my opportunity to be expert.
-7

Inshallah going to be expert today
On Ahmed_Solyman → Rainboy red!, 2 years ago
+7

In every round, The place where I stop is the place Where rainboy starts solving. Huge respect legend.
0

Yes, It's more easy and simple solution

0

For problem C :

I used Binary Search.

I guessed total number of coins. For every mid, I go through all bets and calculated minimum coins are needed to be bet on i-th position. Then if total number of required coins is less or equal than my mid then it’s okay to bet that amount of coins.

If no valid mid found then simply it’s impossible.

Using this strategy, I calculated the minimum possible coins that satisfies the conditions.

After that I distributed the coins for every i-th bet such a way that if I win i-th bet I get at least tootal coins. If some coins stays unused, then I distributed the remaining coins among all bets almost equilibrium way.

Finally I checked wheather any position I bet more than 1e9 or not. If yes, then I said it’s impossible otherwise this is the answer. (I don't know is it required to check, it may not affect the solution but I remained in safety).

I think this binary search approach is more easy to understand with less mathmatical calculation .

My submission : 264454935
0

So, recommend me the practice way. Do I practice from problemset section or participate in virtual contests? Which will be better for me?
0

I can able to to solve problems till E after the contest with first submission but I can't do that during the contest time.Moreover I feel very shaky and make silly mistakes and blunder during contests. It this my fate / bad luck only or is there any lack of my skills on it?

It there, anyone please help me to overcome this frustrating conduct, share me some tips and strategies if you used to face these conditions before.

Advance thanks to you. May almighty bless you.
0

Accepted The challange. Inshallah I can
On night.watchman → CP vs Chess, 2 years ago
0

Codeforces max. 1593

Chess max. 946
0

That was an amazing contest with some cool problems like C and E