Cod sursa(job #1753452)
Utilizator | Data | 6 septembrie 2016 16:09:06 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int n,k,i,p[20];
void bkt(int);
int main()
{
f>>n>>k;
bkt(1);
return 0;
}
void bkt(int i)
{
int j;
for(j=p[i-1]+1;j<=n;j++)
{
p[i]=j;
for(k=1;k<=i;k++)
g<<p[k]<<' ';
g<<'\n';
bkt(i+1);
}
}