EPROBLEM - A Very Easy Problem! (Challenge Mode)
This is challenge version of A Very Easy Problem!. Given integer i, Your task is to convert integer i into http://www.spoj.com/problems/EASYPROB/ format.
Score is the length of your source.
Input
There are multiple test cases, each line contain an integer i(0 < i < 264). Process input until EOF.
Output
For each case, output the converted number in separate line.
Example
Input: 137
1315 Output: 137=2(2(2)+2+2(0))+2(2+2(0))+2(0)
1315=2(2(2+2(0))+2)+2(2(2+2(0)))+2(2(2)+2(0))+2+2(0)
hide comments
David:
2021-12-16 17:31:06
560 bytes in Java! Last edit: 2021-12-16 17:36:32 |
|
vector1996:
2016-09-06 19:57:25
finally!! took me 7 hrs to reduce from 976 to 289 bytes |
|
dwij28:
2016-01-24 18:08:39
17 attempts in python, can't cross source limit.. One attempt in ruby --> AC with 259.. For golfing Ruby > Python .. |
|
chinmay rakshit:
2015-07-01 10:26:39
error in reading input 18446744073709551615
|
|
Rahul Jain:
2014-12-19 18:48:35
only 300B...WTH!!! |
|
shiv prasad chabarval:
2014-06-13 09:46:12
don't know why i am getting WA. my code is working fine here :( |
|
Maciej Misiak:
2013-10-22 16:41:50
I wish I knew why (ID:10322239) is getting wrong answer... |
|
[Lakshman]:
2013-05-01 02:19:26
stucked at 319.... Last edit: 2013-05-04 17:21:36 |
|
:-):
2013-04-19 15:41:04
Great problem |
|
Robert Gerbicz:
2012-11-27 17:54:09
There is no n=1 in the input. It can help you (like me) to write a shorter code. Could you add it? And rejudge the submissions? (Or change the problem's description).
|
Added by: | Tjandra Satria Gunawan |
Date: | 2012-07-13 |
Time limit: | 1.997s |
Source limit: | 300B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM32-GCC ASM64 MAWK BC C-CLANG NCSHARP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY JULIA KTLN NIM NODEJS OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 PY_NBC R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET |
Resource: | A Very Easy Problem! (Classical Mode) |