Submission #2320419

---

Source Code Expand

import std.stdio;
import std.string;
import std.conv;
import std.algorithm.comparison;
import std.algorithm.searching;

int[] a;
bool[3] b;
bool f;
uint nest = 0;
ulong maxIndex(int[] a){
	int max = a[0];
	ulong index = 0;
	foreach(i,n; a){
		if(n > max){
			max = n;
			index = i;
		}
	}
	return index;
}
ulong minIndex(int[] a){
	int min = a[0];
	ulong index = 0;
	foreach(i,n; a){
		if(n < min){
			min = n;
			index = i;
		}
	}
	return index;
}
void check(){
	b = new bool[3];
	f = false;
	if(a[0] == a[1] && a[1] == a[2]){
		return;
	}
	auto mx = a.maxIndex;
	foreach(i,n; a){
		if(i != mx && n == a[mx]){
			f = true;
			break;
		}
	}
	if(f){
		a[a.minIndex] += 2;
	}else{
		b[mx] = true;
		for(int i = 0; i < 3; ++i){
			if(!b[i]){
				a[i]++;
			}
		}
	}
	nest++;
	check();
}
void main(){
	a = new int[3];
	readf("%d %d %d", &a[0], &a[1], &a[2]);
	check();
	nest.writeln;
}

Submission Info

Judge Result