# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
2259 | kriii | 생일수 II (GA4_birthday2) | C++98 | 53 ms | 13232 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <string>
using namespace std;
const long long mod = 19980305;
long long linear[200020];
long long scalar[200020];
long long sum[200020];
long long ten[200020],cnt[200020];
long long three[200020];
long long eight[200020];
void add(long long &a, long long p){a = (a + p) % mod;}
void mul(long long &a, long long p){a = (a * p) % mod;}
long long get(string s)
{
int i,l=s.length()-1;
long long res = sum[l];
long long in = 0, p, c;
for (i=0;i<s.length();i++,l--){
p = ten[l]; c = cnt[l];
if (s[i] == '3'){
in += 3 * p;
}
if (s[i] == '5'){
add(res,(in+3*p)*(in+3*p)%mod*(c+mod-1)%mod);
add(res,(linear[l]*2+mod*2-three[l]-eight[l])%mod*(in+3*p)%mod);
add(res,scalar[l]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |