CodeForces 173A Rock-Paper-Scissors(数论)
来源:互联网 发布:linux自动挂载 编辑:程序博客网 时间:2024/06/18 16:41
题意:两个人在玩石头剪刀布,给你一个字符串表示第一个人的顺序,给你第二个字符串表示第二个人石头剪刀布的顺序,玩n局之后,问你两个人各输多少局
思路:求一个lcm之后,然后我们暴力这个lcm里面各输多少局,然后再暴力算余数里面各数多少局。
#include<bits/stdc++.h>using namespace std;string s1;string s2;int gcd(int a,int b){if (b==0)return a;return gcd(b,a%b);}int lcm(int a,int b){return a*b/gcd(a,b);}int solve(char a,char b){if (a=='R' && b == 'P')return 1;if (a=='P' && b=='S')return 1;if (a=='S' && b=='R')return 1;return 0;}int main(){int n;scanf("%d",&n);cin >> s1 >> s2;int c = lcm(s1.size(),s2.size());int ans1 = 0;int ans2 = 0;int len1 = s1.size();int len2 = s2.size();for (int i = 0;i<c;i++){ans1+=solve(s1[i%len1],s2[i%len2]); ans2+=solve(s2[i%len2],s1[i%len1]);}ans1*=n/c;ans2*=n/c;int p = n-n/c*c;for (int i = 0;i<p;i++){ans1+=solve(s1[i%len1],s2[i%len2]);ans2+=solve(s2[i%len2],s1[i%len1]);}cout << ans1 << " " << ans2 << endl;}
0 0
- CodeForces 173A Rock-Paper-Scissors(数论)
- Rock, Scissors, Paper(模拟)
- 【水状压】#45 A. Rock-paper-scissors
- Rock-Paper-Scissors
- 【poj2339】Rock, Scissors, Paper
- Rock, Scissors, Paper
- Gym 100015A Another Rock-Paper-Scissors Problem
- poj 2339 Rock, Scissors, Paper
- POJ 2339 Rock, Scissors, Paper
- poj 3917 Rock, Paper, Scissors
- HDU2164:Rock, Paper, or Scissors?
- POJ-2339-Rock, Scissors, Paper
- poj 2339 Rock, Scissors, Paper
- POJ - 2339 Rock, Scissors, Paper
- TOJ:3254. Rock-Paper-Scissors
- Rock-paper-scissors-lizard-Spock
- Rock, Paper, or Scissors? 2164
- poj 2339 Rock, Scissors, Paper
- 链式栈
- JAVA+Selenium环境配置进行web页功能自动化的测试
- 关于mysql事件处理的方法
- JAVA中HashMap如何删除元素
- 产品经理从娃娃抓起
- CodeForces 173A Rock-Paper-Scissors(数论)
- 虚表的地址与虚继承类大小的计算
- 01_AsyncTask基本使用
- Hibernate 缓存机制详细解析
- 稳定排序之归并排序
- 【数据结构与算法01】数组
- POJ 2392 Space Elevator(多重背包)
- leetcode 2: Add Two Numbers (C#语言版)
- javascript 获取域名和页面地址