Note

NOTE: For registering (to get access to our codes) please send your full info on nirmaciphers@gmail.com.
Your information will be TOTALLY CONFIDENTIAL.

Thursday, August 9, 2012

Graplin programming challenge

It's been long time, There is no updates! But now again we're on job!

Just got a nice thing for furnishing basic programming skills!! There is a "3 levels programming challenge"!!! just completed its 2 steps now heading to 3rd 1! dont mind if you couldn't complete Mr. Graplin's expectations which is to complete whole challenge in less then 2 hrs..!!!! I culdn't do dat :P bt it was really fun..! :) :)


http://challenge.greplin.com/

Sunday, March 20, 2011

SUDOKU Generator

In today's exercise We are going to make a program that can generate a SUDOKU of 9x9. We have to make board on which user can a play sudoku. There are some RANDOM numbers already provided by our program at random places. Depending upon how many random no.s, we have to make sudoku of different difficulty levels.
Our sudoku should be look like the picture provided in the following link.

http://www.mediafire.com/imageview.php?quickkey=3h1ier5rtw9ga9n&thumb=4

Thursday, February 24, 2011

Messaging Program in C++

The program in C++ which enables messaging to your friend has been created.

Cellphone Messaging!!

http://www.mediafire.com/?z6ibrd3h27o5p6u

Messaging application in C++

Alphabet contains 26 characters and telephones only have ten digits on the keypad. We would like to make it easier to write a message to your friend using a sequence of keypresses to indicate the desired characters. The letters are mapped onto the digits as 2=ABC, 3=DEF, 4=GHI, 5=JKL, 6=MNO, 7=PQRS, 8=TUV, 9=WXYZ. To insert the character B for instance, the program would press 22. In order to insert two characters in sequence in cellphone from the same key, the user must pause before pressing the key a second time. The space character should be printed to indicate a pause. For example “2 2″ indicates AA whereas “22″ indicates B. Each message will consist of only lowercase characters a-z and space characters. Pressing ZERO (0) emits a SPACE between words. For instance, the message “hi” is encoded as “44 444″, “yes” is encoded as “999337777″, “foo  bar” (note two spaces) is encoded as “333666 6660022 2777″, and “hello world” is encoded as “4433555 555666096667775553″. To get acquainted with graphics try to make a cellphone using graphics which shows which key is pressed simultaneously the encoded message(which is to be sent to your friend) should appear in cellphone's screen. 

Saturday, February 19, 2011

CIPHER DECODING

We've done the program which uses the concept of cryptography. User are required to enter the ENCRYPTED STRING. Our aim is to write a program that DECRYPT the entered string without asking the key to user!

for example:
if user inputs "flskhu" the output should be "cipher". Our program will apply the key -3 or 23 to it n after that it will check the keyed string in dictionary for its significance. The applied key will not be produced by user our program will find the key to be applied.

other example:"K jcvg fqiu"

LOST PRIME No.s

Johnny have almost done his job! but still there is a way to go..!

http://www.mediafire.com/?6je9jt2tadtpfzd

Thursday, February 10, 2011

Lost Prime No.s

The BSA (Bytelandian Security Agency) has intercepted several secret keys from the Trojan Kingdom. Each secret key is a prime number. But BSA was only able to retrieve some part of the digits, not all of them!
Johnny's job is to help BSA recover these lost primes, and he has delegated the task to you!

Input

The first line contains a number t (about 15) which is the number of test cases. Then t test cases follow. Each test case is described in a single line containing the patterns of the lost primes (the unknown digits are represented by '?'s.
Each pattern's length is at most 12.

Output

For each test case, print the recovered prime. If there are multiple solutions, print any of them. The recovered prime should have the same number of digits as the corresponding pattern and should contain no leading zeros.
You can assume that there is at least one solution for each test case.

Example

Input:
3
?
?3
1??

Output:
5
23
101