View Code of Problem 64

//2  1 3 1 2 5 3 5 8
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int car(int k,int l,int n){
	int m,u=k;
	m=k;
	u=u-k/2+m;
	if(u<l&&n>0){
		k=k-k/2;
		k=k+m;
		//printf("%d\n",k);
		car(k,l,n-1);
		
	}
	else{
		return k;
	}
}
int main(){
	int n,k,l;
	while(cin>>n>>k>>l){
		if(n==0&&k==0&&l==0)break;
		cout<<car(k,l,n-2)<<'\n';
		
	}
}

Double click to view unformatted code.


Back to problem 64