An easy problem Time Limit: 8000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1697    Accepted Submission(s): 760 Problem Description One day, a useless calculator was being built by Kuros. Let's assume that…

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5475 题目大意: 给X赋初值1,然后给Q个操作,每个操作对应一个整数M: 如果操作是1则将X乘以对应的M, 如果是2则除以第M次操作对应的M',求每次操作后X的值对给定值取摸的结果. 解题思路: 第一眼看这道题,以为就是水题,直接模拟暴力呀,但是发现这样是错误的,因为这里有除法,对除法取模,就应该是逆元,但是逆元不一定存在 想了之后发现可以用线段树保存每一个要乘以的数字,对于操作一就加入数字即可,…

An easy problem Time Limit: 8000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1553    Accepted Submission(s): 697 Problem Description One day, a useless calculator was being built by Kuros. Let's assume that…

Problem Description One day, a useless calculator was being built by Kuros. Let's assume that number X is showed on the screen of calculator. At first, X = 1. This calculator only supports two types of operation. 1. multiply X with a number. 2. divid…

题目意思: 给定a*b*c*d*e*f*....,可以在某一步去掉前面的一个因子,每次回答乘积. #include <cstdio> #include <cstring> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> #include <cmath> #define LL long long using name…