Cod sursa(job #2508982)

Utilizator bigmixerVictor Purice bigmixer Data 13 decembrie 2019 16:12:13
Problema Combinari Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.17 kb
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;
 
const int mod=1e9+7;
const int modp=1999999973;
const int modx=998244353;

vector<int>vecc;
int n,k;
 
ifstream fin("combinari.in");
ofstream fout("combinari.out"); 

void combi(int x){
	vecc.push_back(x);
	if(vecc.size()==k){
		for(int i=0;i<vecc.size();i++) fout << vecc[i] << ' ';
		fout << '\n';
	}
	if(vecc.size()<k)
		for(int i=x+1;i<=n;i++){
			combi(i);
		}	
	vecc.pop_back();
}
 
int32_t main(){
 //   ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
  //  srand(chrono::steady_clock::now().time_since_epoch().count());
    fin >> n >> k;
	for(int i=1;i<=n-k+1;i++){
		combi(i);
	}
}