华为算法笔试题

 

 

#include 
#include 
using namespace std;

int main()
{
    int k;
    cin>>k;
    vectorint> > arr;
    vector<int> a;
    int tmp;
    while(cin>>tmp){
        int i=0;
        if(arr.size()1) arr.push_back(a);
        arr[i].push_back(tmp);
        while(cin.get()!='\n'){
            cin>>tmp;
            i++;
            if(arr.size()1) arr.push_back(a);
            arr[i/k].push_back(tmp);
            
        }
    }
    for(int i=0;i){
        for(int j=0;j){
            if(i==arr.size()-1 && j==arr[i].size()-1){
                cout<endl;
            }else{
                cout<",";
            }
        }
    }
    return 0;
    
}
/*
3
1,2,3,4,5,6,7
8,9,5,6,7
*/

 

 

转载于:https://www.cnblogs.com/joelwang/p/10651592.html