Timus Problem 1064(Binary Search) Solution

Timus Problem Solution

Problem 1064 Binary Search details description : http://acm.timus.ru/problem.aspx?space=1&num=1064

Timus Problem 1064 Solution :

#include <stdio.h>

int main()

{

int n = 1;

while(n <= 100) {

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

n++;

if(n > 10) {

break;

}



n = 200;

while(n <= 300) {

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

n++;

if(n > 150) {

break;

}

}}

return 0;

}

 

0 Comments

You may find interest following article