Cod sursa(job #1241068)
| Utilizator | Data | 12 octombrie 2014 16:17:33 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
using namespace std;
FILE *f1=fopen("submultimi.in","r"),*f2=fopen("submultimi.out","w");
int n,x[17];
void afis(int n)
{
int i;
for(i=1;i<=n;i++)
fprintf(f2,"%d ",x[i]);
fprintf(f2,"\n");
}
void back(int k)
{
int i;
for(i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
afis(k);
back(k+1);
}
}
int main()
{
fscanf(f1,"%d",&n);
back(1);
return 0;
}
//Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time.
