codeforces——B. Spreadsheets

B. Spreadsheets
time limit per test
10 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output

In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second — number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column 27 has number AA, 28 — AB, column 52 is marked by AZ. After ZZ there follow three-letter numbers, etc.

The rows are marked by integer numbers starting with 1. The cell name is the concatenation of the column and the row numbers. For example, BC23 is the name for the cell that is in column 55, row 23.

Sometimes another numeration system is used: RXCY, where X and Y are integer numbers, showing the column and the row numbers respectfully. For instance, R23C55 is the cell from the previous example.

Your task is to write a program that reads the given sequence of cell coordinates and produce each item written according to the rules of another numeration system.

Input

The first line of the input contains integer number n (1 ≤ n ≤ 105), the number of coordinates in the test. Then there follow n lines, each of them contains coordinates. All the coordinates are correct, there are no cells with the column and/or the row numbers larger than 106 .

Output

Write n lines, each line should contain a cell coordinates in the other numeration system.

Sample test(s)
Input
2
R23C55
BC23
Output
BC23
R23C55

       模拟题,麻烦了点


#include <map>  
#include <set>  
#include <list>  
#include <stack>  
#include <vector>  
#include <queue>  
#include <cmath>  
#include <cstdio>  
#include <cstring>  
#include <iostream>  
#include <algorithm>  

using namespace std;

char str[105];
char RC[105];

__int64 pow(int a, int b)
{
	__int64 c = 1;
	while(b)
	{
		if (b & 1)
		{
			c *= a;
		}
		b >>= 1;
		a *= a;
	}
	return c;
}

int main()
{
	int n;
	scanf("%d", &n);
	while (n--)
	{
		int cnt = 0;
		scanf("%s", str);
		int len = strlen(str);
		for (int i = 1; i < len; i++)
		{
			if ((str[i] >= '0' && str[i] <= '9') && (str[i - 1] >= 'A' && str[i] <= 'Z'))
			{
				cnt++;
			}
		}
		if (cnt >= 2)
		{
			__int64 r = 0;
			int i = 1;
			while (str[i] != 'C')
			{
				r = r * 10 + str[i] - '0';
				i++;
			}
			__int64 c = 0, cnt = 0;
			i++;
			while (str[i] != '\0')
			{
				c = c * 10 + str[i] - '0';
				i++;
			}
			i = 0;
			while (c)
			{
				if (c % 26 == 0)
				{
					RC[i] = 'Z';
					c /= 26;
					c--;
				}
				else
				{
					RC[i] = 'A' + (c % 26) - 1;
					c /= 26;
				}
				i++;
			}
			while(i >= 1)
			{
				printf("%c", RC[i - 1]);
				i--;
			}
			printf("%I64d\n", r);
			continue;
		}
		int i = 0;
		while (str[i] >= 'A' && str[i] <= 'Z')
		{
			RC[i] = str[i];
			i++;
		}
		__int64 r = 0;
		for (int j = 0; j < i; j++)
		{
			r +=  pow(26, i - j - 1) * (RC[j] - 'A' + 1);
		}
		printf("R");
		for (; str[i] != '\0'; i++)
		{
			printf("%c", str[i]);
		}
		printf("C%I64d\n", r);
	}
	return 0;
} 


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值