Pagini recente » Cod sursa (job #1654038) | Cod sursa (job #906175) | Cod sursa (job #996317) | Cod sursa (job #1332600) | Cod sursa (job #1743384)
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream cin("nunta.in");
ofstream cout("nunta.out");
const int MAXD = 250;
int a[MAXD], b[MAXD];
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "1\n";
return 0;
}
if (n == 2) {
cout << "2\n";
return 0;
}
if (n == 3) {
cout << "3\n";
return 0;
}
a[0] = 2;
b[0] = 3;
int nra = 0, nrb = 0;
for (int j = 4; j <= n; j++) {
int k = 0, i;
for (i = 0; i <= nra || i <= nrb || k != 0; i++) {
int temp = a[i];
a[i] = b[i];
int digit = temp + k + b[i];
b[i] = (temp + k + b[i]) % 10;
k = digit / 10;
}
nra = nrb;
nrb = i - 1;
}
for (int i = nrb; i >= 0; i--)
cout << b[i];
return 0;
}