分解字符串

按要求分解字符串，输入两个数M，N；M代表输入的M串字符串，N代表输出的每串字符串的位数，不够补0。例如：输入2,8， “abc” ，“123456789”，则输出为“abc00000”,“12345678“,”90000000”

int main(){
int m,n;
vector<string>vc;
while(cin>>m>>n){
string str;
for(int i = 0; i < m; i++){
cin>>str;
vc.push_back(str);
}
for(int j = 0; j < m; j++){
int len = vc[j].size();
if(len<=n){
for(int k = 0; k<(n-len); k++){
vc[j].push_back('0');
}
cout<<vc[j]<<endl;
}else{
vector<vector<string>>vct;
int pos = 0;
vector<string>tmp;
while(len>n){
string sub = str.substr(pos,pos+n-1);
tmp.push_back(sub);
len = len - n;
pos = pos+n;
if(len<=n){
string s;
for(int k = 0; k<(n-len); k++){
s.push_back('0');
}
s = str.substr(pos) + s;
tmp.push_back(s);
}
}
for(int w = 0; w < tmp.size(); w++)
cout<<tmp[w]<<endl;
}
}
}
return 0;
}