DCP-2: 6-N-Cryption Back to All Problems

Easy Math > Basic Math


In a software company a security team is working on an encryption system called 6-N-Cryption. Their task is to encrypt a data by using dynamic number of keys. Then encrypt those keys again by a secret key. Then they store them to a Database. You can assume that the original data is always an integer. **Encrypt Original Data:** The original data is encrypted by adding some keys with it. All the keys are prime numbers and none of the keys are used more than once. Also it is guaranteed that in every encryption they must use at least 2 keys. **Encrypt the key:** Every key is encrypted by multiplying it with a big prime number, p. This big prime number must be greater than all the keys. Then the encrypted data and keys are stored in the database. Now, you are sitting in their office for an interview and they give you this problem. You have to find the original data. **Sample Encrypt process with 2 keys:** Original data + Key_1 + Key_2 = Encrypted data (E). Then the team generates a big prime number ‘p’ that has to be greater than all keys to encrypt all of them. Key_1 * p = Encrypted_Key_1 Key_2 * p = Encrypted_Key_2 **Sample Decrypt process with 2 keys:** Determine the big prime number, **p**. Then divide those Encrypted_Keys to get the real keys. Key_1 = Encrypted_Key_1 / p; Key_2 = Encrypted_Key_2 / p; Original data = Encrypted data - Key_1 - Key_2; Input: ------ Each test case start with an encrypted number, **E**. Then the number of keys N(1<**N**<=10). Then there are N lines of input for the encrypted keys **EK**( 1< **EK** < 2^63) Two successive cases are separated by a single new line. Output: ------- For each test case, print “Output : O” (without quotation) where **O** denotes the original data. Sample Input ------------ 29 2 14 21 61 3 481 703 185 58 5 253 299 391 115 46 119 4 7199 939 13459 3443 Sample Output ------------- Output: 24 Output: 24 Output: 10 Output: 39 **Explanation of First Test Case:** Encrypted data is 29. In this case we have found **7** as big prime number. Then we divide those encrypted keys by this big prime number. 14 / 7 = 2 21 / 7 = 3 Original data = 29 - 2 - 3 = 24.


Problem Setter:

Md. Azizur Rahman Faiem

Please login to submit solution to this problem.

Problem Limits

Language Time Limit (seconds)
C 1.00
C++ 1.00
C++14 1.00
C# 2.00
Go 2.00
Java 2.00
JavaScript 2.00
Objective-C 2.00
Perl 2.00
PHP 2.00
Python 2.00
Python3 2.00
Ruby 2.00
VB.Net 2.00

Problem Stats

89/385

Solve/Submission

Ranking

# User Language Timing
01 haasib Cpp14 0.00s
02 Salty_Coder Cpp14 0.00s
03 shahed_shd Cpp14 0.00s
04 parthapratimbanik Cpp14 0.00s
05 MAHRahat Cpp14 0.00s
06 momin12 Cpp14 0.00s
07 ammasum Cpp14 0.00s
08 ash12 Cpp14 0.00s
09 sadia2427 Cpp14 0.00s
10 shahid_ullah Cpp14 0.00s
11 Knight_King Cpp14 0.00s
12 ozone Cpp14 0.00s
13 a_rahman Cpp14 0.00s
14 Robiussani152 Cpp14 0.00s
15 porag Cpp14 0.00s
16 smriad Cpp14 0.00s
17 Dark_Ocean Cpp14 0.00s
18 sb_rithu Cpp14 0.00s
19 rithu Cpp14 0.00s
20 anik_JU Cpp14 0.00s
21 afzalul Cpp14 0.00s
22 Dragon_162 Cpp14 0.00s
23 Shammo Cpp14 0.00s
24 Ehsanul_Fahad Cpp 0.00s
25 Morass Cpp14 0.00s
26 feodorv C 0.01s
27 return_aim Cpp 0.01s
28 khmahbub20 Cpp 0.01s
29 Nazmul0092 Cpp 0.01s
30 naim2711 Cpp14 0.01s
31 emrul Cpp14 0.01s
32 SbrTa Cpp14 0.01s
33 pulak_ict_mbstu Cpp14 0.01s
34 tonu Cpp14 0.01s
35 nasibsu Cpp14 0.01s
36 bengal_tiger Cpp14 0.01s
37 sjsakib Cpp14 0.01s
38 rajdipsaha Cpp14 0.01s
39 ProMAGFAT Cpp14 0.01s
40 adil_reza Cpp14 0.01s
41 mhsjaber CSharp 0.04s
42 Partha11 Cpp14 0.08s
43 Bruteforcekid Python 0.19s
44 ashraf_neo Cpp 0.19s
45 jalal Cpp14 0.22s
46 khayrul Cpp14 0.23s
47 Amit_Khan Cpp14 0.23s
48 moshiur_bd Cpp14 0.25s
49 Tamim028 Cpp 0.29s
50 Dinar Cpp14 0.33s
Feedback

Your feedback is our precious!



Or call +88 02 9853138 for support