Pagini recente » Cod sursa (job #1220036) | Cod sursa (job #2510257) | Cod sursa (job #318499) | Cod sursa (job #1021011) | Cod sursa (job #2498798)
#include <fstream>
#define f in
#define g out
using namespace std;
ifstream in ( "combinari.in" );
ofstream out( "combinari.out" );
int fr[20], v[20];
int n, m;
void back ( int poz ){
if ( poz > m ){
for ( int i=1; i <= m; i++ )
g<<v[i]<<" ";
g<<"\n";
return;
}
for ( int i = v[poz-1]+1; i <= n; i++ ){
v[poz] = i;
back( poz+1 );
}
}
int main() {
f>>n>>m;
back ( 1 );
return 0;
}