Obfuscated Confession
Problem
This is Valentine Week!!!
Our Friend ForeverAlone(FA) is deeply in love with AC.
(Of course you know ACs,you are a Programmer after all)
This Valentine he has written a Obfuscated C++ code which is as follows:
#include <cstdio>
double m[]= {KEY,291};
int main()
{m[1]--?m[0]*=2,main():printf((char*)m);}
On successfully execution it prints "ACILikeU" (quotes for clarity).
Well he does not remember The KEY now.
His friend Amvi wants the KEY expressed as ANSWER as follows.. Suppose KEY=1356=1*2*2*3*113 , sumKEY=113+3+2+2+1=121ANSWER=12+1=13(Since number of digits is odd).
If sumKEY would have been 1213(number of digits is even),then ANSWER=12+13=25.Input:
(There is no Input)Output:
ANSWERTime Limit: 1
Memory Limit: 256
Source Limit:
Explanation
The program should take No Input. There is a unique value of KEY,and hence a unique value of ANSWER. In this question Compile & Test is of no use :-(
