# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258060 | tqbfjotld | Lucky Numbers (RMI19_lucky) | C++14 | 92 ms | 1528 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 <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007LL
int n,q;
int arr[100005];
int memo[100005];
int func(int a){
if (memo[a]!=-1) return memo[a];
if (a==0) return memo[0] = 0;
if (a==1) return memo[1] = 1;
return memo[a] = (10*func(a-1)-func(a-2))%MOD;
}
main(){
scanf("%lld%lld",&n,&q);
for (int x = 0; x<n; x++){
char c;
scanf(" %c",&c);
arr[x] = c-'0';
}
memset(memo,-1,sizeof(memo));
func(n+1);
int ans = 1;
for (int x = n-1;x>=0; x--){
if (arr[x]==0){
continue;
}
//printf("ans += %lld * %lld - %lld\n",arr[x],memo[n-x],memo[n-1-x]);
ans += arr[x]*memo[n-x]-memo[n-1-x];
ans %= MOD;
}
printf("%lld\n",(ans+MOD)%MOD);
while (q--){
int a,b,c;
scanf("%lld%lld%lld",&a,&b,&c);
if (a==2){
arr[b-1] = c;
}
else{
int ans = 1;
for (int x = c-1; x>=b-1; x--){
if (arr[x] == 0) continue;
ans += arr[x]*memo[c-x]-memo[c-1-x];
ans %=MOD;
}
printf("%lld\n",(ans+MOD)%MOD);
}
}
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |