Dice Notation

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Description

... <Saika> I want to get some water from this strange lake. I have a bottle. <Keeper> OK. <Saika> Then I want to go forward to look into the parterre. <Keeper> More details? <Saika> Err..What will happen if I let some water drip on the flowers? <Keeper> ...Err...The flowers will all become super-huge monsters and it will be very dangerous. <Keeper> Ready to fight. <Saika> WHAT THE HELL??? ...

A tabletop role-playing game, or pen-and-paper role-playing game, or table-talk role-playing game is a form of role-playing game (RPG) in which the participants describe their characters' actions through speech. Participants determine the actions of their characters based on their characterization, and the actions will succeed or fail according to a formal system of rules and guidelines. Within the rules, players have the freedom to improvise. Their choices shape the direction and outcome of the game.

The outcomes of some actions are determined by the rules of the game. For example, while looking around the room, a character may or may not notice an important object or secret doorway, depending on the character's powers of perception. This usually involves rolling dice, and comparing the number rolled to their character's statistics to see whether the action was successful. Typically, the higher the character's score in a particular attribute, the higher their probability of success. Combat is resolved in a similar manner, depending on the character's combat skills and physical attributes.

From Wikipedia, by Sargoth. License: CC-by-sa 3.0.

Dice notation (also known as dice algebra, common dice notation, RPG dice notation, and several other titles) is a system to represent different combinations of dice in role-playing games using simple algebra-like notation such as "2d6 + 12".

In most role-playing games, dice rolls required by the system are given in the form of "NdX". N and X are variables, separated by the letter "d", which stands for dice. N is the number of dice to be rolled (usually omitted if 1), and X is the number of faces of each dice. For example, if a game would call for a roll of "d4" or "1d4", this would mean roll a 4-sided dice. While "3d6" would mean roll three six-sided dices. An X-sided dice can get an integer between 1 and X with equal probability.

To this basic notation, an additive modifier can be appended, yielding expressions of the form of "NdX + B". Here, B is a number to be added to the sum of the rolls. We can use a minus sign ("-") to indicate subtraction. So, "1d20 - 10" would indicate a roll of a single 20-sided dice with 10 being subtracted from the result. Further more, we can use multiplication ("*") or division ("/") to do some more compilcated calculations like "(2d6 + 5) * 10 / (12 - 3d6)".

To be specific, here is a standard BNF describes the dice notation:

<notation> ::= <term> "+" <notation>
| <term> "-" <notation>
| <term>
<term> ::= <factor> "*" <term>
| <factor> "/" <term>
| <factor>
<factor> ::= "(" <notation> ")"
| <integer>
| <dice>
<integer> ::= <digit> <integer>
| <digit>
<digit> ::= "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9"
<dice> ::= <integer> "d" <integer>
| "d" <integer>

To have a clearer result of a dice notation in a game, our poor player, Saika, decides to write a program as a dice bot. To standardize the output information, the program needs to generate a format string from user's input string. It should:

  • Expand dice notations. The <dice> field like "3d5" should be expanded to "([d5] + [d5] + [d5])". If only one dice is rolled in this field, simply replaced it with "[dX]".
  • Trim whitespaces. There should be one and only one space character existed around operators ("+" / "-" / "*" / "/"). No extra whitespaces characters (including "Tab" and "Space") are allowed in the format string.
  • End with specific content. Add " = [Result]" to the end of the format string.

However, Saika is fighting against some indescribable monsters now. She has no time to write this program by herself. Please help her to finish it.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

There is a line contains a valid dice notation. The length of the notation won't exceed 2000.

Output

For each test case, output the format string.

Sample Input

3
d6+1
((2d6) +5)*((12* 3d6))
2d10 * d100

Sample Output

[d6] + 1 = [Result]
((([d6] + [d6])) + 5) * ((12 * ([d6] + [d6] + [d6]))) = [Result]
([d10] + [d10]) * [d100] = [Result]
题解:挂了好多次。。。没想到数字可以是大数,题意很简单,就是给一个字符串,规范的表示出来,其中d的系数不是大数,但是纯数字可能是大数。。。
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<cstdlib>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = ;
char s[MAXN];
char x[MAXN];
typedef long long LL;
bool is_digit(char c){
if(c >= '' && c <= '')return true;
else return false;
}
bool is_ys(char c){
if(c == '+' || c == '-' || c == '*' || c == '/' || c == '=')
return true;
else
return false;
}
LL chenge(string num){
LL temp = ;
for(int i = ; i < num.length(); i++){
temp = temp * + num[i] - '';
}
return temp;
}
void word(char *c, int &i){
LL temp;
int tp = ;
x[] = '[';
string num;
while(is_digit(c[i]) || c[i] == ' ' || c[i] == '\t'){
if(c[i] == ' ' || c[i] == '\t'){
i++;
continue;
}
num += c[i];
i++;
}
if(c[i] == 'd'){
temp = chenge(num);
x[tp++] = 'd';
i++;
while(is_digit(c[i]) || c[i] == ' ' || c[i] == '\t'){
if(c[i] == ' ' || c[i] == '\t'){
i++;
continue;
}
x[tp++] = c[i];
i++;
}
x[tp++] = ']';
x[tp] = '\0';
if(temp == ){
printf("%s", x);return;
}
printf("(");
while(temp--){
printf("%s", x);
if(temp > )printf(" + ");
}
printf(")");
}
else{
cout << num;
}
}
void work(){
int len = strlen(s);
for(int i = ; i < len;){
if(s[i] == ' ' || s[i] == '\t'){
i++;
continue;
}
if(is_digit(s[i])){
word(s, i);
}
else if(s[i] == 'd'){
printf("[d");
i++;
while(isdigit(s[i]) || s[i] == ' ' || s[i] == '\t'){
if(s[i] == ' ' || s[i] == '\t'){
i++;
continue;
}
printf("%c", s[i]);
i++;
}
printf("]");
}
else if(is_ys(s[i])){
printf(" %c ", s[i]);
i++;
}
else{
printf("%c", s[i]);
i++;
}
}
}
int main(){
int T;
scanf("%d", &T);
getchar();
while(T--){
gets(s);
work();
printf(" = [Result]\n");
}
return ;
}

Dice Notation(模拟)的更多相关文章

  1. ZOJ - 3930 Dice Notation 【模拟】

    题目链接 http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3930 题意 给出一串字符串 如果是 '+' '-' '*' '/ ...

  2. ZOJ 3826 Hierarchical Notation 模拟

    模拟: 语法的分析 hash一切Key建设规划,对于记录在几个地点的每个节点原始的字符串开始输出. . .. 对每一个询问沿图走就能够了. .. . Hierarchical Notation Tim ...

  3. ZOJ 3930 Dice Notation

    简单模拟题.一个int写成了char,搞了4个多小时.真垃圾.. #include<stdio.h> #include<string.h> +],s[+]; +]; +]; i ...

  4. Codeforces 691C. Exponential notation 模拟题

    C. Exponential notation time limit per test: 2 seconds memory limit per test:256 megabytes input: st ...

  5. ZOJ - 3829 Known Notation(模拟+贪心)

    http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3829 给定一个字符串(只包含数字和星号)可以在字符串的任意位置添加一个数字 ...

  6. NAIPC-2016

    A. Fancy Antiques 爆搜+剪枝. #include <bits/stdc++.h> using namespace std ; typedef pair < int ...

  7. 简单介绍 Java 构造器

    导读 构造器是编程的强大组件.使用它们来释放 Java 的全部潜力. 在开源.跨平台编程领域,Java 无疑(?)是无可争议的重量级语言.尽管有许多伟大的跨平台框架,但很少有像 Java 那样统一和直 ...

  8. zoj3826 Hierarchical Notation (字符串模拟)

    Hierarchical Notation Time Limit: 2 Seconds      Memory Limit: 131072 KB In Marjar University, stude ...

  9. 贪心+模拟 ZOJ 3829 Known Notation

    题目传送门 /* 题意:一串字符串,问要最少操作数使得成为合法的后缀表达式 贪心+模拟:数字个数 >= *个数+1 所以若数字少了先补上在前面,然后把不合法的*和最后的数字交换,记录次数 岛娘的 ...

随机推荐

  1. robots.txt网站爬虫文件设置

    目录: 什么是robots.txt robots.txt使用误区 robots.txt使用技巧 什么是robots.txt? robots.txt是搜索引擎中访问网站的时候要查看的第一个文件.Robo ...

  2. Android窗口管理服务WindowManagerService对窗口的组织方式分析

    文章转载至CSDN社区罗升阳的安卓之旅,原文地址:http://blog.csdn.net/luoshengyang/article/details/8498908 我们知道,在Android系统中, ...

  3. 禁止 favicon.ico 请求

    favicon.ico 图标用于收藏夹图标和浏览器标签上的显示,如果不设置,浏览器会请求网站根目录的这个图标,如果网站根目录也没有这图标会产生 404.出于优化的考虑,要么就有这个图标,要么就禁止产生 ...

  4. asp.net MVC 学习笔记

    1.可以看出每个区域Areas里都是个mini的MVC项目,Controller.Models.Views一个都不缺,还多了一个AdminAreaRegistration类 2.MVC 将URL映射到 ...

  5. Android-现场保护

    现场保护 当一个活动进入到了停止的状态,是有可能被系统回收的,我们都学过Activity的生命周期 当活动处于onPause() ,onStop() ,onDestroy() 三种状态时程序可能会被A ...

  6. asp.net mvc 访问.html文件

    把html页面放在除Views文件夹外的任意文件夹,如Htmls--123.html,url直接访问便可,如 http://yourname/htmls/123.html 可以在路由表中排出不需要路由 ...

  7. Java Timer触发定时器

    XML: <!-- Java Timer定时 --> <!-- <bean id="shortUrlTask" class=" com.sprin ...

  8. 编译错误“The run destination My Mac 64-bit is not valid for Running the scheme '***',解决办法

    1. iOS APP Project or  Mac APP Project编译错误提示:
“The run destination My Mac 64-bit is not valid for Ru ...

  9. 课堂里学不到的C与C++那些事(一)

    首先,声明一下这是一个系列的文章.至于整个系列有多少篇,笔者也不知道,不知道有多少篇,也不知道多久会更新一篇.反正只有一个原则,写出来的文 章能见得人才会公布出来.另外,我不是叫你逃课,而是觉得听课只 ...

  10. git add和被ignore的文件

    如果有如下的目录结构: workspace tree | --------------------- |                             | hello.c           ...