Codeforces 1B. Spreadsheets

6 篇文章 0 订阅
4 篇文章 0 订阅

Codeforces 1B. Spreadsheets


题目

B. Spreadsheets

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.

Examples
input

2
R23C55
BC23

output

BC23
R23C55

题目大意

给出一个字符串为字母串(表示列)+数字串(表示行)或R+数字串(表示列)+C+数字串(表示行),将给出的字符串转换成另一种类型


题解

字符串操作+模拟

(C++字符串操作不会……看了半天的资料……QAQ)
(关于sscanf操作的链接:https://baike.baidu.com/item/sscanf/10551550?fr=aladdin


代码

#include<cstdio>
using namespace std;

char s[10005],t[10005],*p;
int n,r,c;

void work(int c) 
{
    if (c) work((c-1)/26),putchar((c-1)%26+'A');
}

int main()
{
    scanf("%d",&n);
    while (n--)
    {
        scanf("%s",s);
        if (sscanf(s,"R%dC%d",&r,&c)==2) work(c),printf("%d\n",r);
        else 
        {
            sscanf(s,"%[A-Z]%d",t,&r);
            for (p=t,c=0;*p;p++) c=c*26,c+=*p-'A'+1;
            printf("R%dC%d\n",r,c);
        }
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值