Cod sursa(job #521673)
Utilizator | Data | 13 ianuarie 2011 08:55:01 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int m,n,k,i,x[1000],nr;
int main(){
f>>m>>n;
nr=0; k=1; x[k]=0;
do{
while(x[k]<m-(n-k)){
x[k]++;
if(k==n){
nr++;
for(i=1; i<=n; ++i) g<<x[i]<<" ";
g<<'\n';
}
else {k++; x[k]=x[k-1];}
}
k--;
}while(k);
g.close(); return 0;
}