博客
关于我
B. Spreadsheets(进制转换,数学)
阅读量:426 次
发布时间:2019-03-06

本文共 2421 字,大约阅读时间需要 8 分钟。

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.

Examples
input
2 R23C55 BC23
output
BC23 R23C55

 

 

 

#include 
#include
#define M 1*10^6+10char str[M];/* 十进制变为二十六进制 */void solve_10_to_26(char str[]){ char re[M]; int p = M - 1; int r, c; sscanf(str, "R%dC%d", &r, &c); re[p--] = 0; while(r) { re[p--] = r % 10 + '0'; r = r/10; } while(c) { re[p--] = (c-1) % 26 + 'A'; c = (c-1)/26; } printf("%s\n", &re[p+1]);}/* 二十六进制变为十进制 */void solve_26_to_10( char str[] ){ char cc[M]; int c = 0; int r; sscanf( str, "%[A-Z]%d", &cc, &r ); int len = strlen(cc); int p = 0; while(p < len) { c = c + cc[p++] - 'A' + 1; c = c * 26; } c = c / 26; printf("R%dC%d\n", r, c);}int main(){ int n; scanf("%d", &n); while(n--) { scanf("%s", &str); int a, b; if ( sscanf(str, "R%dC%d", &a, &b ) == 2) solve_10_to_26(str); else solve_26_to_10(str); } return 0;}
View Code

 

转载地址:http://gltuz.baihongyu.com/

你可能感兴趣的文章
Netty中集成Protobuf实现Java对象数据传递
查看>>
Netty事件注册机制深入解析
查看>>
Netty原理分析及实战(四)-客户端与服务端双向通信
查看>>
Netty和Tomcat的区别已经性能对比
查看>>
Netty客户端断线重连实现及问题思考
查看>>
Netty工作笔记0006---NIO的Buffer说明
查看>>
Netty工作笔记0007---NIO的三大核心组件关系
查看>>
Netty工作笔记0011---Channel应用案例2
查看>>
Netty工作笔记0013---Channel应用案例4Copy图片
查看>>
Netty工作笔记0014---Buffer类型化和只读
查看>>
Netty工作笔记0020---Selectionkey在NIO体系
查看>>
Vue踩坑笔记 - 关于vue静态资源引入的问题
查看>>
Netty工作笔记0024---SelectionKey API
查看>>
Netty工作笔记0025---SocketChannel API
查看>>
Netty工作笔记0027---NIO 网络编程应用--群聊系统2--服务器编写2
查看>>
Netty工作笔记0034---Netty架构设计--线程模型
查看>>
Netty工作笔记0050---Netty核心模块1
查看>>
Netty工作笔记0057---Netty群聊系统服务端
查看>>
Netty工作笔记0060---Tcp长连接和短连接_Http长连接和短连接_UDP长连接和短连接
查看>>
Netty工作笔记0063---WebSocket长连接开发2
查看>>