-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfinal_lab1.cpp
More file actions
53 lines (48 loc) · 1.14 KB
/
Copy pathfinal_lab1.cpp
File metadata and controls
53 lines (48 loc) · 1.14 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <bits/stdc++.h>
using namespace std;
void Fibonacchi(){
int val;
cin >> val;
if(val <= 1){
cout << val << " th Fibonacchi value is: " << val << endl;
}
else{
int fibo_0 = 0;
int fibo_1 = 1;
int fibo_n;
for(int i = 2; i<val; i++){
fibo_n = fibo_0 + fibo_1;
fibo_0 = fibo_1;
fibo_1 = fibo_n;
}
cout << val << " th Fibonacchi value is: " << fibo_n << endl;
}
}
void LCS(){
string s1,s2;
cin >> s1 >> s2;
int size_s1 = s1.size();
int size_s2 = s2.size();
int arr[size_s1 + 1][size_s2 + 1];
for(int i = 0; i<=size_s1; i++){
for(int j = 0; j<=size_s2; j++){
if(i == 0 || j == 0){
arr[i][j] = 0;
}
else if(s1[i-1] == s2[j-1]){
arr[i][j] = arr[i-1][j-1] + 1;
}
else{
arr[i][j] = max(arr[i-1][j], arr[i][j-1]);
}
}
}
cout << "Length of the LCS is: " <<arr[size_s1][size_s2] << endl;
}
int main(){
Fibonacchi();
Fibonacchi();
LCS();
LCS();
return 0;
}