시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 512 MB | 547 | 187 | 141 | 38.950% |
bobo has $n$ integers $1, 2, \dots, n$ and uses them to play a game.
He would like to choose a subset $S$ of $\{1, 2, \dots, n\}$ such that for all $x \in S$, $(2x + 2) \notin S$.
Now he is curious about the maximum size of $S$.
The first line contains an integer $n$ ($1 \leq n < 10^{100})$.
A single integer denotes the maximum size.
4
3
10000000000
6666666667