Skip to content

monish-1/DAA-Assignment-6

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

24 Commits
 
 
 
 

Repository files navigation

Design and Analysis of Algorithms

Team Members

Enrollment No. Name
IIB2019031 Debasish Das
IIB2019032 Surya Kant
IIB2019033 MD Monish Ansari

Group No- 30

Instructor Name- Mr.Rahul Kala

Mentor Name- Mr.Md. Meraz


Problem Statement

Shortest path to reach one prime to other by changing single digit at a time. Given two four-digit prime numbers, suppose 1033 and 8179, we need to find the shortest path from 1033 to 8179 by altering only single digit at a time such that every number that we get after changing a digit is prime. For example, a solution is 1033, 1733, 3733, 3739, 3779, 8779, 8179


About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published