(华为笔试题)分解字符串,输入两个数M,N;M代表输入的M串字符串,N代表输出的每串字符串的位数,不够补0。例如:输入2,8, “abc” ,“123456789”,则输出为“abc00000”,“12345678“,”90000000”
#include<iostream>
#include<cstdio>
using namespace std;
void solve(char *str, int n, int len){
int i, j, k, quotient, reminder;
quotient = len / n;
reminder = len - n*quotient;//计算一个字符串切掉n个字符后剩下几个字符
for (i = 0; i < len; i += n){ //注意这里的i=i+n;
if (len - i < n){
k = n - len + i;
for (j = i; j < len; ++j)
cout << str[j];
for (j = 0; j < k; ++j)
cout << '0';
}
else
for (j = i; j < i + n; ++j)
cout << str[j];
cout << ' ';//此处的空格是为了分开两个字符串
}
cout << endl;
}
int main(){
int i, m, n, len;
char str[1000];
cin >> m;
cin >> n;
while (m != NULL && n != NULL){
cin >> str;
len = strlen(str);//会用求字符串长函数
solve(str, n, len);
}
return 0;
}