<? echo $row['title']." - ".$MSG_PROBLEM."

Problem2776--ba<x>se2

_{[Creator : ]}

Time Limit : 1.000 sec Memory Limit : 128 MB

You are given a sequence $A = (A_{0}, A_{1}, \dots, A_{63})$ of length $64$ consisting of $0$ and $1$ .

Find $A_{0} 2^{0} + A_{1} 2^{1} + \dots + A_{63} 2^{63}$ .

The input is given from Standard Input in the following format:

Print the answer as an integer.

1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

AtCoder

Submit