1051 - Bipartite Numbers

The executive officers of the company where you work want to send each other encrypted messages. Rather than use off-the-shelf encryption software such as PGP, they have tasked the IT staff with handling the encryption problem. The IT staff decided on a solution that requires ``public" and ``private" integer keys. The idea is that everyone can see your public key, but only you know your private key.

Your best friend in the company is a wonderful person but a not-so-wonderful programmer. He has created a publicprivate key scheme as follows. A public key can be any positive integer. The corresponding private key is the smallest bipartite number that is greater than and a multiple of the public key.

A bipartite number is any positive integer that contains exactly 2 distinct decimal digits s and t such thats is not 0 and all occurrences of s precede all occurrences of t. For example 44444411 is bipartite (s is 4 and t is 1), So are 41, 10000000, and 5555556. However, neither 4444114 nor 44444 are bipartite.

Notice that the large bipartite number 88888888888800000 can be nicely described as 12 8's followed by 5 0's. You can express any bipartite number using four numbers: m s n t. The numbers s and t are the leading and trailing digits as described above, m is the number of times the digit s appears in the bipartite number, and n is the number of times the digit t appears.

The trouble with your friend's scheme is that it is not too difficult to compute a private key if you know the public key. You need to convince your friend that his public-private key scheme is inadequate before he loses his job over his bad decision! You must write a program that takes public keys as input and displays the corresponding private keys.

Input 

The input consists of several test cases. Each test case is on a separate line, and it consists of a single public key in the range 1...99999.

The last case is followed by a line containing the integer zero.

Output 

For each test case, display a line consisting of the public key, a colon, then 4 integers m s n t where m,n, s, and t are as described above.

Sample Input 

125 
17502 
2005 
0

Sample Output 

125: 1 5 2 0 
17502: 4 7 4 8 
2005: 3 2 3 5

Claimer: The data used in this problem is unofficial data prepared by Derek Kisman. So any mistake here does not imply mistake in the offcial judge data. Only Derek Kisman is responsible for the mistakes. Report mistakes to dkisman@acm.org

#include<stdio.h>
int ones[9999],tens[999],n,i,j,k,s,t,best_i,best_j,best_s,best_t;
bool ck()
{
	int p,q,r;
	if(i>5)
		return 1;
	p=s;
	r=t;
	for(q=0;q<j;q++)
		p=p*10+s;
	for(q=0;q<i-j;q++)
		p=p*10;
	for(q=1;q<i-j;q++)
		r=r*10+t;
	return p+r>n;
}

int main()
{
	while(scanf("%d",&n)*n)
	{
		printf("%d: ",n);
		if(n==1)
		{
			puts("1 1 1 0");
			continue;
		}
		ones[0]=1;
		tens[0]=1;
		for(i=1;i<9999;i++)
			ones[i]=(ones[i-1]*10+1)%n;
		for(i=1;i<999;i++)
			tens[i]=tens[i-1]*10%n;
		for(i=1,best_s=0;i<9999;i++)
		{
			k=0;
			if((n%10==0||n%25==0) && i>11)
				k=i-11;
			for(j=k;j<i;j++)
				for(s=1;s<10;s++)
					for(t=0;t<(n%10?10:1);t++)
						if(t!=s&&(((long long)ones[j])*tens[i-j]*s + ones[i-j-1]*t)%n==0 && ck() && (!best_s||s<best_s||s==best_s&&j>best_j&&s<best_t))
						{
							best_i=i;
							best_j=j;
							best_s=s;
							best_t=t;
						}
			if(best_s)
				break;
			}
			printf("%d %d %d %d\n",best_j+1,best_s,best_i-best_j,best_t);
	}
	return 0;
}