Could someone explain me how to solve problem Discount on crackers

[manpreet001]

https://www.codechef.com/LRNDSA08/problems/ACM14KG3

[ssjgz]

ACM14KG3 - Editorial

PROBLEM LINK: Practice Contest Author: Anudeep Nekkanti Tester: Mahbubul Hasan Editorialist: Jingbo Shang DIFFICULTY: Easy PREREQUISITES: Directed Graph, Floyd Algorithm PROBLEM: There are M mappings from lower case English alphabet to lower case English alphabet. Using these mappings, can one transform a string S to another string T? EXPLANATION: Let Can[i][j] denote whether the lower case English character i could be transformed to j in some combinations of given mappings. Initially, o…

[manpreet001]

thanks a lot sir

[manpreet001]

Sir could you please explain me why we can’t use dijkstra here.