atcoder_official's blog

SuntoryProgrammingContest2024（AtCoder Beginner Contest 357） Announcement
By atcoder_official, history, 22 months ago, In English

We will hold SuntoryProgrammingContest2024（AtCoder Beginner Contest 357）.

We are looking forward to your participation!

  • Vote: I like it
  • +134
  • Vote: I do not like it

Comments Comments (22)
| Write comment?
»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
22 months ago, hide # |
← Rev. 2  
Vote: I like it +10 Vote: I do not like it

only 5 contributions away from the top-contributors.

→ Reply
»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

glhf

→ Reply
»
22 months ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Problem E is similar to this!

→ Reply
»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

E was exactly same as this. Probably that explains so many submissions on E.

→ Reply
»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

what is hand_00.txt in D? only failed that test :/

→ Reply
  • »
    »
    22 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    n*len(n) can overflow. Maybe you missed that ?

    → Reply
  • »
    »
    22 months ago, hide # ^ |
    ← Rev. 2  
    Vote: I like it 0 Vote: I do not like it

    thanks for trying to help guys. I realized I was using the built-in pow to calculate pow(10, len(n)) instead of the pow in my mod template :(

    I changed pow(10, num_digits(n)) to pow((mlong)10, num_digits(n)) and got AC now

    WA AC

    → Reply
»
22 months ago, hide # |
 
Vote: I like it +9 Vote: I do not like it

I spent over 40 mins implementing E only to find out here that it was available on Leetcode :/

→ Reply
»
22 months ago, hide # |
 
Vote: I like it +10 Vote: I do not like it

Why there are so many D&C NTT problems in ABC, but almost no problems about suffix array or suffix automaton ??? I think they are educational too :)

→ Reply
»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

how to solve F?

→ Reply
  • »
    »
    22 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Some segment tree magic. I misread statement and solved for $$$\sum_i \sum_j A_iB_j $$$

    → Reply
»
22 months ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

Why submission giving WA on test_03.txt :(

→ Reply
»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

WA — https://atcoder.jp/contests/abc357/submissions/54368958 AC — https://atcoder.jp/contests/abc357/submissions/54381026

Can somebody explain why my first submission was not accepted whereas the other one was accepted and the only difference both have is that in the not accepted one, I have define k = 1+(int)log10(n) whereas, in the accepted one I have define k = to_string(n).size()

→ Reply
»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Anyone please explain me the logic or Intution of Problem D.

→ Reply
»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Can anyone help me with problem F? I used lazy segment tree. code

→ Reply