Cod sursa(job #2498798)
| Utilizator | Data | 24 noiembrie 2019 14:05:59 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#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;
}
