We will hold SuntoryProgrammingContest2024（AtCoder Beginner Contest 357）.
- Contest URL: https://atcoder.jp/contests/abc357
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20240608T2100&p1=248
- Duration: 100 minutes
- Writer: Nyaan, math957963, physics0523, MtSaka
- Tester: toam, Aotsuki
- Rated range: ~ 1999
- The point values: 100-200-250-350-450-550-650
We are looking forward to your participation!
Auto comment: topic has been updated by atcoder_official (previous revision, new revision, compare).
only 5 contributions away from the top-contributors.
glhf
Problem E is similar to this!
E was exactly same as this. Probably that explains so many submissions on E.
what is hand_00.txt in D? only failed that test :/
n*len(n) can overflow. Maybe you missed that ?
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))topow((mlong)10, num_digits(n))and got AC nowWA AC
I spent over 40 mins implementing E only to find out here that it was available on Leetcode :/
I used Condensation Graph for E which is a bit overkill but it worked.
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 :)
how to solve F?
Some segment tree magic. I misread statement and solved for $$$\sum_i \sum_j A_iB_j $$$
Why submission giving WA on test_03.txt :(
you must print # for N = 0 not .
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()
This may help you.
Anyone please explain me the logic or Intution of Problem D.
Prerequisite: Binary Exponentiation and Modular arithmetic
Could You please tell me why this fails — https://atcoder.jp/contests/abc357/submissions/54764020
Can anyone help me with problem F? I used lazy segment tree. code
Anyone help please