as easy problem
來源：程序員人生 發(fā)布時間：2015-06-27 08:25:13 閱讀次數(shù)：2414次
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16297 Accepted Submission(s): 10937
Problem Description
we define f(A) = 1, f(a) = ⑴, f(B) = 2, f(b) = ⑵, ... f(Z) = 26, f(z) = ⑵6;
Give you a letter x and a number y , you should output the result of y+f(x).
Input
On the first line, contains a number T.then T lines follow, each line is a case.each case contains a letter and a number.
Output
for each case, you should the result of y+f(x) on a line.
Sample Input
6
R 1
P 2
G 3
r 1
p 2
g 3
Sample Output
#include<stdio.h>
main()
{
char c;
int a,b,d,s,n,w,i,q;
scanf("%d",&q);
getchar();
//while(n--)
for(i=0;i<q;i++)
{
scanf("%c%d",&c,&s);
if(c>='A'&&c<='Z')
{a=c-'0'⑴6;
w=a+s;
//printf("%d
",w);
}
//continue;
if(c>='a'&&c<='z')
{b=c-'0';
b=b⑷8;
a=-b;
w=a+s;
//printf("%d
",w);
//continue;
}
printf("%d
",w);
getchar();
}
return 0;
}
生活不易，碼農(nóng)辛苦
如果您覺得本網(wǎng)站對您的學習有所幫助,可以手機掃描二維碼進行捐贈
