2273.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 41 行

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
char w[100];

int main( ) {
	
	int a, b, i, s;
	char *p;
	
	while( 1 ) {
		scanf( "%s", w );
		if( w[1] == '0' )
			break;
		p = strchr( w, 'C' );
		*p = '\0';
		b = atoi( w+1 );
		a = atoi( p+1 );

		a--;
		for( s=26, i=0; a>=s; i++, s*=26 )
			a -= s;

		s = i;
		for( i=0; i<=s; i++ ) {
			w[i] = a%26+'A';
			a/=26;
		}

		while( i-- )
			printf( "%c", w[i] );
		
		printf( "%d\n", b );
	}
		
	return 0;
}