CodeForces 165C - Another Problem on Strings

C. Another Problem on Strings
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A string is binary, if it consists only of characters "0" and "1".

String v is a substring of string w if it has a non-zero length and can be read starting from some position in string w. For example, string "010" has six substrings: "0", "1", "0", "01", "10", "010". Two substrings are considered different if their positions of occurrence are different. So, if some string occurs multiple times, we should consider it the number of times it occurs.

You are given a binary string s. Your task is to find the number of its substrings, containing exactly k characters "1".

Input

The first line contains the single integer k (0 ≤ k ≤ 106). The second line contains a non-empty binary string s. The length of s does not exceed 106 characters.

Output

Print the single number — the number of substrings of the given string, containing exactly k characters "1".

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cincout streams or the %I64dspecifier.

Sample test(s)
input
1
1010
output
6
input
2
01010
output
4
input
100
01010
output
0
Note

In the first sample the sought substrings are: "1", "1", "10", "01", "10", "010".

In the second sample the sought substrings are: "101", "0101", "1010", "01010".



===============================

找含k个1的子串有多少个


自己做了好久,一直都有没考虑到的情况orz看别人都是几分钟就A了于是学习了下别人的方法……看了半天才看懂orz

要注意最后的答案可能会超过int

strlen()不能直接放进循环里否则会超时


#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;
long long num[1111111];
char str[1111111];

int main()
{
    int k,cnt=0;long long ans=0;
    scanf("%d",&k);
    scanf("%s",str);
    num[0]=1;
    int len=strlen(str);
    for(int i=0;i<len;i++)
    {
        if(str[i]=='1') cnt++;//1的个数
        if(cnt>=k) ans+=num[cnt-k];//截止到第i位,第 cnt-k 个1前面有几个0答案就有几种可能
        num[cnt]++;//第cnt个1前面的0的个数(cnt从0开始)
    }
    printf("%I64d\n",ans);
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值