Cod sursa(job #2014649)
| Utilizator | Data | 24 august 2017 11:32:25 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
FILE *F=fopen("submultimi.in", "r"), *G=fopen("submultimi.out", "w");
int st[25], n;
void bck(int niv, int k)
{
if(niv-1 == k)
{
for(int i = 1; i <= k; ++ i)
fprintf(G, "%d ", st[i]);
fputc('\n', G);
return;
}
for(int i = st[niv-1]+1; i <= n-niv+k; ++ i)
{
st[niv] = i;
bck(niv+1, k);
}
}
int main()
{
fscanf(F, "%d ", &n);
for(int i = 1; i <= n; ++ i) bck(1, i);
return 0;
}
