Pagini recente » Cod sursa (job #2343477) | Cod sursa (job #1861608) | Cod sursa (job #1957684) | Cod sursa (job #1313234) | Cod sursa (job #2508984)
#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("submultimi.in");
ofstream fout("submultimi.out");
void combi(int x){
vecc.push_back(x);
for(int i=0;i<vecc.size();i++) fout << vecc[i] << ' ';
fout << '\n';
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;
for(int i=1;i<=n;i++){
combi(i);
}
}