Encryption Validity Test

Problem Statement

Encryption Validity Test Problem Description A message is encrypted so that it stays confidential for a fixed stretch of time called the validity period . An attacker (a hijacker ) has limited processing power and can test a fixed number of keys every second; that rate is the instruction count . If the hijacker can test at least as many keys as the encryption's strength demands before the validity period runs out, the message is not safe. You are given the instruction count, the validity period, and a list of n positive integers keys . Report whether the hijacker can crack the encryption in time, and report the strength of the encryption. The strength of the encryption is defined from the list keys as follows. The degree of divisibility of a value m is the number of entries keys[j] of the whole list that satisfy both keys[j] > 1 and m % keys[j] == 0 . Every entry of the list is examined, including the entry m itself, and duplicate entries are counted separately. For example, if keys