1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
| #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
const int mod=1e9+7;
ll n,dif[(int)1e5+9],ans;
char s[(int)1e5+9];
int main()
{
scanf("%lld%s",&n,s+1);
for(int i=1;i<n;++i)if(s[i]=='1')dif[i+1]+=1;
for(int i=1;i<=n;++i){
dif[i]+=dif[i-1];
if(dif[i]>mod)dif[i]-=mod;
}
for(int i=1;i<=n;++i){
dif[i]+=dif[i-1];
if(dif[i]>mod)dif[i]-=mod;
}
for(int i=1;i<=n;++i){
if(s[i]=='1'){
ans+=dif[i];
if(ans>mod)ans-=mod;
}
}
printf("%lld\n", ans);
return 0;
}
|