A. Double Cola

A. Double Cola

Sheldon, Leonard, Penny, Rajesh and Howard are in the queue for a “Double Cola” drink vending machine; there are no other people in the queue. The first one in the queue (Sheldon) buys a can, drinks it and doubles! The resulting two Sheldons go to the end of the queue. Then the next in the queue (Leonard) buys a can, drinks it and gets to the end of the queue as two Leonards, and so on. This process continues ad infinitum.

For example, Penny drinks the third can of cola and the queue will look like this: Rajesh, Howard, Sheldon, Sheldon, Leonard, Leonard, Penny, Penny.

Write a program that will print the name of a man who will drink the n-th can.

Note that in the very beginning the queue looks like that: Sheldon, Leonard, Penny, Rajesh, Howard. The first person is Sheldon.

Input
The input data consist of a single integer n (1 ≤ n ≤ 109).

It is guaranteed that the pretests check the spelling of all the five names, that is, that they contain all the five possible answers.

Output
Print the single line — the name of the person who drinks the n-th can of cola. The cans are numbered starting from 1. Please note that you should spell the names like this: “Sheldon”, “Leonard”, “Penny”, “Rajesh”, “Howard” (without the quotes). In that order precisely the friends are in the queue initially.

问题链接：A. Double Cola.

问题简述：

Sheldon, Leonard, Penny, Rajesh and Howard排着队喝饮料，喝完饮料后，一个人会分裂成两个人，并排在队尾。
问：第n个喝饮料的人是谁？

问题分析：

第一次5个人，第二次10个人，第三次20个人。。。先算出是第几次，再算是谁。

程序说明：

AC通过的C语言程序如下：

#include <iostream>
using namespace std;
//将人名化为标号
char p[5][10] = {"Sheldon", "Leonard", "Penny", "Rajesh", "Howard"};

int main() 
{
	int n,c = 0,i;
	cin>>n;
	if(n<=5)
	{
		cout<<p[n-1]<<endl;
		return 0;
	}
	//c是次数，i是每个人的分身有多少个
	for(i = 1;n>0;c++)
	{
		n = n-5*i;
		i = i*2;
	} 
	i = i/2;n = n+5*i;
	cout<<p[n/i]<<endl; 
	return 0;
}