Mr7Wrv - Online C++0x Compiler & Debugging Tool

/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C/C++.
Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

vector < vector < int > > finalVec;

void printArray(int p[], int n)
{
	vector < int > vec;
    for (int i = 0; i < n; i++)
       vec.push_back(p[i]);
    finalVec.push_back(vec);
    return;
}

void printAllUniqueParts(int n)
{
    int p[n]; // An array to store a partition
    int k = 0;  // Index of last element in a partition
    p[k] = n;  // Initialize first partition as number itself

    // This loop first prints current partition, then generates next
    // partition. The loop stops when the current partition has all 1s
    while (true)
    {
        // print current partition
        printArray(p, k+1);

        // Generate next partition

        // Find the rightmost non-one value in p[]. Also, update the
        // rem_val so that we know how much value can be accommodated
        int rem_val = 0;
        while (k >= 0 && p[k] == 1)
        {
            rem_val += p[k];
            k--;
        }

        // if k < 0, all the values are 1 so there are no more partitions
        if (k < 0)  return;

        // Decrease the p[k] found above and adjust the rem_val
        p[k]--;
        rem_val++;


        // If rem_val is more, then the sorted order is violeted.  Divide
        // rem_val in differnt values of size p[k] and copy these values at
        // different positions after p[k]
        while (rem_val > p[k])
        {
            p[k+1] = p[k];
            rem_val = rem_val - p[k];
            k++;
        }

        // Copy rem_val to next position and increment position
        p[k+1] = rem_val;
        k++;
    }
}


int main() {
	int n,m,a[11][11],minim=INT_MAX,p[11];
    cin>>n;
    cin>>m;
    for(int i=0;i<11;i++){
        p[i]=1;
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
        }
    }
    for(int j=0;j<m;j++){
        for(int i=0;i<n;i++){
            p[j]=p[j]*a[i][j];

        }
        if(p[j]<minim){
            minim=p[j];
        }
    }
    for(int j=m-1;j>=0;j--){
       if(p[j]==minim){
            int k=0;
            for(int i=0;i<n;i++){
                for(int x=j+1;j<m;j++){
                    a[i][x-1]=a[i][x];
                }
            }
            m--;
           if(k==0) {
            break;
           }
          }

    }
      for(int i=0;i<n;i++){
      for(int j=0;j<m;j++){
        cout<<a[i][j]<<" ";
      }
      cout<<" "<<endl;}


	return 0;
}