Cod sursa(job #2666741)
Utilizator | Data | 2 noiembrie 2020 14:33:34 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
using namespace std;
int fibo(int x)
{
int a = 1, b = 1;
while(b <= x){
b += a;
a = b - a;
}
return a;
}
int main()
{
int n; cin >> n;
while(n > 0){
int f = fibo(n);
cout << f << " ";
n -= f;
}
return 0;
}