貼上代碼：
#include <iostream>
#include <string>
using namespace std;
void func(string s, int m)
{
int i, j, sum = 0;
i = 0;
for(j = s.size()-1; j >= 0; j--)
{
if('0' == s[j]) //position no occupied
{
i = j-m;
while((i < 0 || s[i] == '0') && i < j) //search the possible student from left with in m
i++;
//cout << "i:"<<i << endl;
if('1' == s[i])
{
s[j] = s[i];
s[i] = '0';
sum ++;
}
// cout << "j:"<<j << endl;
}
// cout << j << endl;
}
cout << sum << endl;
// cout << s << endl;
}
int main()
{
string s;
int m;
while(cin >> s >> m)
{
if(s.size() > 148 || m < 1 || m > 10)
continue;
func(s, m);
}
return 0;
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/114477.html
標籤：基礎類
上一篇：16.DRF-JWT