Counterfeit Dollar
http://poj.org/problem?id=1013
#include<stdio.h>
#include<string.h>
#include<math.h>
const int INF=<<;
int main()
{
char rw[][],lw[][],vis[][];
int ans[],t;
scanf("%d",&t);
while(t--)
{
memset(ans,,sizeof(ans));
for (int i = ; i < ; i ++)
{
scanf("%s %s %s",lw[i],rw[i],vis[i]);
}
for (int i = ; i < ; i ++)
{
if(vis[i][]=='e')
{
for (int j = ; lw[i][j]!='\0'; j ++)
{
ans[lw[i][j]-'A'] = INF;
ans[rw[i][j]-'A'] = INF;
}
}
}
for (int i = ; i < ; i ++)
{ for (int j = ; lw[i][j]!='\0'; j ++)
{
if (vis[i][]=='u')
{ if(ans[lw[i][j]-'A'] != INF)
{
ans[lw[i][j]-'A']++;
}
if(ans[rw[i][j]-'A'] != INF)
{
ans[rw[i][j]-'A']--;
}
} else if (vis[i][]=='d')
{ if(ans[lw[i][j]-'A'] != INF)
{
ans[lw[i][j]-'A']--;
}
if(ans[rw[i][j]-'A'] != INF)
{
ans[rw[i][j]-'A']++;
}
}
else
break;
}
}
int max = ,pos;
for (int i = ; i <= 'L'-'A'; i ++)
{
if (ans[i]!=INF)
{
if(fabs(ans[i]) > max)
{
max = fabs(ans[i]);
pos = i;
}
}
}
if(ans[pos] <= )
printf("%c is the counterfeit coin and it is light.\n",pos+'A');
else
printf("%c is the counterfeit coin and it is heavy.\n",pos+'A');
}
return ; }
Counterfeit Dollar的更多相关文章
- Counterfeit Dollar -----判断12枚钱币中的一个假币
Counterfeit Dollar Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u ...
- POJ 1013 Counterfeit Dollar
Counterfeit Dollar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 36206 Accepted: 11 ...
- poj1013.Counterfeit Dollar(枚举)
Counterfeit Dollar Time Limit: 1 Sec Memory Limit: 64 MB Submit: 415 Solved: 237 Description Sally ...
- Counterfeit Dollar 分类: POJ 2015-06-12 15:28 19人阅读 评论(0) 收藏
Counterfeit Dollar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 41559 Accepted: 13 ...
- Poj 1013 Counterfeit Dollar / OpenJudge 1013(2692) 假币问题
1.链接地址: http://poj.org/problem?id=1013 http://bailian.openjudge.cn/practice/2692 http://bailian.open ...
- POJ1013 Counterfeit Dollar
题目来源:http://poj.org/problem?id=1013 题目大意:有12枚硬币,其中有一枚假币.所有钱币的外表都一样,所有真币的重量都一样,假币的重量与真币不同,但我们不知道假币的重量 ...
- POJ 1013:Counterfeit Dollar
Counterfeit Dollar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 42028 Accepted: 13 ...
- 【poj1013】 Counterfeit Dollar
http://poj.org/problem?id=1013 (题目链接) 题意 12个硬币中有1个是假的,给出3次称重结果,判断哪个硬币是假币,并且判断假币是比真币中还是比真币轻. Solution ...
- POJ 1013 Counterfeit Dollar 集合上的位运算
Description Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are t ...
- D - Counterfeit Dollar(第二季水)
Description Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are t ...
随机推荐
- Flask上下文流程图
如图:
- 阿里云安装nodejs
cd进入root目录下: cd /root 下载node.js安装包 wget https://nodejs.org/dist/v8.11.2/node-v8.11.2-linux-x64.tar.x ...
- unigui的ini文件读写【6】
procedure THeaderFooterForm.writerParas; var IniFile : TIniFile; begin try IniFile:=TIniFile.Create( ...
- RNN and Language modeling in TensorFlow
RNNs and Language modeling in TensorFlow From feed-forward to Recurrent Neural Networks (RNNs) In th ...
- nyoj 93 汉诺塔(三)(stack)
汉诺塔(三) 时间限制:3000 ms | 内存限制:65535 KB 难度:3 描述 在印度,有这么一个古老的传说:在世界中心贝拿勒斯(在印度北部)的圣庙里,一块黄铜板上插着三根宝石针.印度 ...
- New Barns
New Barns 时间限制: 1 Sec 内存限制: 128 MB 题目描述 Farmer John notices that his cows tend to get into argument ...
- Nginx源码分析:3张图看懂启动及进程工作原理
编者按:高可用架构分享及传播在架构领域具有典型意义的文章,本文由陈科在高可用架构群分享.转载请注明来自高可用架构公众号「ArchNotes」. 导读:很多工程师及架构师都希望了解及掌握高性能服务器 ...
- 大家好 这个事我的BLOG 站点 欢迎大家 訪问和公布文章技术的 和评论 交流技术使用
地址 http://microlmj.gotoip3.com/blog/article!showAllArticleForPageTest.action ssh+mysql+java+tomcat+b ...
- OpenFlashChart的图片导出
http://www.cnblogs.com/mcmurphy/archive/2012/10/15/2724894.html http://teethgrinder.co.uk/open-flash ...
- 【CV论文阅读】Network in Network
目的: 通过用Mlpconv层来替代传统的conv层,可以学习到更加抽象的特征.传统卷积层通过将前一层进行了线性组合,然后经过非线性激活得到(GLM),作者认为传统卷积层的假设是基于特征的线性可分.而 ...