题目:http://acm.hdu.edu.cn/showproblem.php?pid=6144
思路:那个num只有一位啊
代码:
#include<bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
const int N = 1e6+5;
char str[N];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%s",str);
int n = strlen(str);
long long sum = 0;
for(int i = 0,j;i < n;)
{
if(str[i] == '(')
{
j = i;
while(j < n && str[j] != ')')
j++;
int num = str[j+3] - '0';
while(num--)
{
for(int k = i+1;k < j;k++)
sum = (sum*10 + str[k]-'0')%MOD;
}
i = j+5;
}
else
{
sum = (sum*10 + str[i]-'0')%MOD;
i++;
}
}
printf("%lld\n",sum);
}
return 0;
}