USACO Section1.1 Your Ride Is Here
来源:互联网 发布:什么是云计算和云服务 编辑:程序博客网 时间:2024/06/16 20:07
题目:
输入两个由大写字母组成的字符串,长度1~6,A~Z分别转换为1~26,然后将其累乘,得到的两个乘积如果mod 47后相等则输出Go,否则输出STAY 。
示例:“USACO”: 21*19*1*3*15=17955。
格式:
输入:
第1行:一个长度为1到6的大写字母串。
第2行:一个长度为1到6的大写字母串。
输出:
仅一行,包括“GO”或“STAY”。
题解:
分别定义两个整数x,y来存储字符转换后的累乘结果,然后根据x,y mod 47的结果是否相等来判断输出“GO”or “STAY” 。
代码:
/* ID: a4556762PROG: rideLANG: C++*/#include<cstdio>#include<iostream>#include<string> #include<cstring>using namespace std;int main(){ freopen("ride.in","r",stdin); freopen("ride.out","w",stdout); char a[8], b[8]; cin >> a >> b; int i,x=1,y=1; for(i=0;i<strlen(a);i++) x*=(a[i]-64); for(i=0;i<strlen(b);i++) y*=(b[i]-64); if(x%47==y%47) cout<<"GO"<<endl; else cout<<"STAY"<<endl; return 0;}
阅读全文
0 0
- USACO-Section1.1 Your Ride Is Here
- USACO-Section1.1 Your Ride Is Here
- USACO-Section1.1 Your Ride Is Here
- USACO Section1.1 Your Ride Is Here
- USACO-Section1.1 Your Ride Is Here [模拟]
- [USACO] Section1.1 Your Ride Is Here[字符串处理]
- [USACO] Section1.1 Your Ride Is Here[字符串处理]
- USACO-Section1.1 Your Ride Is Here [模拟]
- USCAO-Section1.1 Your Ride Is Here
- Your Ride Is Here-section1.1
- Section1.1-Your Ride Is Here
- USACO之Section1.1.1 Your Ride Is Here
- USACO 1.1.1 Your Ride Is Here
- [USACO 1.1.1] Your Ride Is Here
- USACO 1.1.1 Your Ride Is Here
- USACO 1.1.1 Your Ride Is Here
- USACO 1.1.1 Your Ride Is Here
- USACO 1.1.1 Your Ride Is Here
- 如何在JAVA中JTable获取某一行内容
- 反射:反射的定义
- Linux脚本攻略学习笔记14
- Keepalived之——*** WARNING
- Ubuntu安装telnet
- USACO Section1.1 Your Ride Is Here
- SonicOperator之算法优化
- vs编译COM无权限注册
- 【二分+复杂度分析】2017.5.21杂题[最大矩阵]题解
- 167. Two Sum II
- 构建链表、输出链表元素、删除链表…
- 用队列和栈的功能实现回文的判定
- WPF学习感受
- 未声明的标识符SurfFeatureDetecto…