Encryption Validity

Problem Statement

Encryption Validity Problem Description A hijacker is trying to break into a system that is protected by a list of encryption keys. How hard the system is to break is decided by the highest degree of divisibility found among those keys. The degree of divisibility of a key is the number of entries in the key list that are greater than 1 and divide that key exactly. The key itself counts whenever it is greater than 1, and repeated values in the list are counted once each, so a value that appears three times contributes three to every key it divides. The encryption strength is the highest degree of divisibility multiplied by 10^5 ; that is how many attempts the hijacker would need. The hijacker tests instructionCount keys every second for validityPeriod seconds, so the hijacker can make instructionCount * validityPeriod attempts in all. Report whether that is enough. Print [success, encryption_strength] , where success is 1 when instructionCount * validityPeriod is at least the encryption