[Sanjaypkhandanm.eee2021] c/c++ 1

[sanjayp-khandan-M]

b'\x1bh\x7f\xb0E\xf2\xe1H\xe4\xa9\xd5\xff\xba\xae7?\xd7P+\xdfN\xfe\x89\xe1\x16]\xf6\xec<\xf0\xbf\xf3&zn\xe43\x00\xa0cp/\x10?=\x05\xea\x1f"\xc8\t\xc1\x1e--\xca\x8f\x93\x870\xc4(\xed^\x8c\x989cE\xfd\xca\xdb|\xcc\xf9\xf8\x87?\xda\xf0\r1 \xe8\xc6\xb0\xd2\xac\xe1\xcc\xd8\xe7Q\xa1\xce\x9e\xd6\xceI\xb6\x07\xea\xe9\x00i\x7f\xd7\xda\xaf\x134;\xadWD\x8d\t9\xb4#\xa1\xa4\x91\xd0|\x01'

b'gAAAAABl9SGHiLSibDHdiBQOtr2qn5dNGDp_fmN48nZW-IlNmNLPAEtzPDo8QJjjy2kh7OhWHYMAGIAUe1N09FshefxkaeUhAdRpwW8_PHfFcgcqyXQY_Gd3MxFwKC_FXPTwc-5qdwl1ckP59wrd1vFrv3JtIx0ZU5ewzS6I0QuMaTQFi4N9tskm4WV4Pou3Z6XgtmUL-A1WTW27pIvnB2lA5P8xskErEnYONs2_mu-EPLQXWEh4ndMvysOT2oZi0phTQUpxSMjxQc3lW6LiaUTBqVujgBaqvA1sKQTRQIYmjSSW27TcjKXNWrLwFgvHh2W72TVK3e0hQ5q2fiV9fzAsqvRlYR5XRERIcTtLXsLu1xtz1ynlhAW_E0JSWkKujG_syR7bmGXUAHp470kVyD0-Hz4-UZzVpJUnFu9N9zvk52s341nyWQenKRBsH9lOP8PNKpL8MDHDm8abR4nc6yFh0UTIwKHb8GTY4rvofARlwJbcp5tgf5fLbKbDjLA-to_OM16Sk36SH7IiP7evsKyt3cVIsgtnpP-9E2S4WanB2FYZznfgsgh_NV0Px17nnYe2k3-H1oShZyPBEJXygeFfBOLyTYn-L5OrWjTp-pfOByIQ2DkyCVgEpjKaWojcBK7vLjaLNBstkGSejKGBouKOo67C1qN7WrdfMQSsliEc5utxY-K-zEAqXVilzBEugOXFcW13bsJzD63xFv2nffK7by4L_HykdsgXAjL37rIE-yLxUihWVVDCUCMduxFmqpOdef6FTJG90rYb_TDaRsPJbfRYaBLtOYMqtsxYtlQQMCCN8sA44faEOyWvM7-ZHpEIUSdMgnwxtWhwEGsoL595HCuYuwxkl0-QCNtQgJ7o7mkgHI5VAdwsUI8OtPU2f6sAs3IUdw6j-CbR1knyaCLb7eZLoJROXd3ZlVQNx5Tjk3XzvUCN21PWYpdLGrazZhnml8u6usFeJ6vj-hwar9_rDp_xPtCoxhmA09HD1WUXA1t_RuEuVXRDHIqjlVriQ9zo7fFjQ8vQ-lnZ62y6VjZ05iAX-pmDdS75DOB6dRwATKb92QzUck5Ic2nB3PXYRd4ptF1K3vuiR_IAroPxLhLz7ZuR1pxk00uY9Pl0OJH5t27X3SVoMVVukyYcq01ejzN_6qxS97oUgexnnMQuESoSSf_2gaWpW6fCZJpVIAAUAlaZkCn9ejss6zwHdLqkNAaGA0HWxNsDHq68iDSX3X6rNr_1vzs8D9h4uzBS6gyZDHZ1Jnntbvxw5U2lILbAM7UitvdARlnkRzgXKVdBjGx1bVqBjnkC7LssSvdl4IJ5Jwcb6XJckmAWzrF6jm8pj91Hte9kEsUvK1LvRLjrm4Z8EYJx-qrjG6bClE-STaxT5lRbhCof23DIOLEdUU6iFKWwShZA842fDCqSh-CAa6R6NWezBvM3wNwWov31eDovX6vKg5EdMYJFTJF58QLFQSs7A9IF7O5X5fJWMMCryuckqWUGd6HJ3YFesmlVAyJRzJw6keIGqjjJ8QsZmaTGPz91spYokWDwAy68NzEJtnUhym7u-5EX7JGxKltz1mbGI4SPJ4mwPgj9XZ33z1h17GQSkARrnEtruRVpNsMBvsBXvWtwiAu8T02tTf99HZRaSbpwn8oDexr8eovpDqoQw7N8IZDfoJV5b6TCHtRCLRTZkMfc0sulg7U_hq6pkhI98ze5Ta8RaBrB6ZJrlgDJvWiVucfII3dFRKo2Y-e5BtG_7MVUyorP2ScICKAzj0lwtH0WIEv0dgOv7zNiBbtfSK1Rg3X-tOLM1mWixLc6H-u2ywg0Ccft4mYVLtnwwaK50phdWtPM0Mbm4OYs-XM0dxobsgNnGPx88n1hQL9DaR0xyAtqk58xZ2gyX4VL51-M-Eiu-yF9W8FAXhj8czy8rI2L-xYm3XXeCarMYIKsnMB375h3l9_itRZYBRZsGeJ8ucfE4Y10DqhODC3SERj9CpvLUgCeOlzX'

[bughunt-bot[bot]]

Team Name: Sanjaypkhandanm.eee2021 File Name: c/c++ 1 Line Number: [36] Bug Description: the index value should be reduced only when the (a[i - 1] == b[j - 1]) Solution: #include

include

using namespace std;

int func(string s){ int counter=0; while(counter<s.length()) counter++;

return counter;

}

include <bits/stdc++.h>

using namespace std;

void LCS(string a, string b, int m, int n) { int dp[m + 1][n + 1];

for (int i = 0; i <= m; i++) { for (int j = 0; j <= n; j++) { if (i == 0 || j == 0) dp[i][j] = 0; else if (a[i - 1] == b[j - 1]) dp[i][j] = dp[i - 1][j - 1] + 1; else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]); } }

cout << dp[m][n] << endl; //length of LCS

int index = dp[m][n]; char lcs[index + 1]; lcs[index] = '\0';

int i = m, j = n; while (i > 0 && j > 0) { if (a[i - 1] == b[j - 1]) { lcs[index - 1] = a[i - 1]; i--; j--; index--; } else if (dp[i - 1][j] > dp[i][j - 1]) i--; else j--;

} cout << "LCS: " << lcs << endl; }

int main() { string a = "ABFCDE"; string b = "AFCZE"; int m = a.length(); int n = b.length();

LCS(a, b, m, n); }

[bughunt-bot[bot]]

Bug Hunt Evaluation: Answer: ((33,),) Correctness: 0/1 Points: 0/100