Timus : 1131 (Copying)



// http://acm.timus.ru/problem.aspx?space=1&num=1131
// runtime: 0.015s
// tag: math


#include <stdio.h>
#include <math.h>

int main ()
{
	int n, k; scanf ("%d %d", &n, &k);

	int hrs = 0;
	int activePc = 1;

	while ( true ) {
		if ( activePc <= k ) activePc *= 2;
		hrs++;

		if ( activePc >= n ) break;

		if ( k < activePc ) {
			hrs += (int) ceil ((n - activePc) / (double) k);
			break;
		}
	}

	printf ("%d\n", hrs);

	return 0;
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s