凉肝的题解

A. Mezo Playing Zoma

Today, Mezo is playing a game. Zoma, a character in that game, is initially at position x=0. Mezo starts sending n commands to Zoma. There are two possible commands:

• ‘L’ (Left) sets the position x:=x−1;
• ‘R’ (Right) sets the position x:=x+1.

Unfortunately, Mezo’s controller malfunctions sometimes. Some commands are sent successfully and some are ignored. If the command is ignored then the position x doesn’t change and Mezo simply proceeds to the next command.
For example, if Mezo sends commands “LRLR”, then here are some possible outcomes (underlined commands are sent successfully):

• “LRLR” — Zoma moves to the left, to the right, to the left again and to the right for the final time, ending up at position 0;
• “LRLR” — Zoma recieves no commands, doesn’t move at all and ends up at position 0 as well;
• “LRLR” — Zoma moves to the left, then to the left again and ends up in position −2.

Mezo doesn’t know which commands will be sent successfully beforehand. Thus, he wants to know how many different positions may Zoma end up at.

Input

The first line contains n (1≤n≤$10^5$) — the number of commands Mezo sends.

The second line contains a string s of n commands, each either ‘L’ (Left) or ‘R’ (Right).

Output

Print one integer — the number of different positions Zoma may end up at.

Example

Input
4
LRLR
Output
5

Note

In the example, Zoma may end up anywhere between −2 and 2.

题解

相当于对字串里的字符进行任意的组合,取得的结果可能性范围是所有的$R$加起来以及所有的$L$加起来所形成的区间长度.

#pragma comment(linker, "/STACK:102400000,102400000")
#include 
using namespace std;
const int MAXN = 1e5 + 10;
const double pi = acos(-1.0);
const int inf = __LONG_MAX__;
const int enf = LONG_MIN;
const long long INF = LLONG_MAX;
const long long ENF = LLONG_MIN;
const double eps = 1e-12;

int main()
{
    string s;
    int len = 0;
    cin >> len >> s;
    int cnt = 0, _cnt = 0;
    for (int i = 0; i < len; i++)
        if (s[i] == 'L')
            cnt++;
        else
            _cnt++;
    cout << (cnt + _cnt + 1) << endl;
    return 0;
}

B. Just Eat It!

Today, Yasser and Adel are at the shop buying cupcakes. There are n cupcake types, arranged from 1 to n on the shelf, and there are infinitely many of each type. The tastiness of a cupcake of type i is an integer ai. There are both tasty and nasty cupcakes, so the tastiness can be positive, zero or negative.

Yasser, of course, wants to try them all, so he will buy exactly one cupcake of each type.

On the other hand, Adel will choose some segment [l,r] ($1\le l\le r\le n$) that does not include all of cupcakes (he can’t choose [l,r]=[1,n]) and buy exactly one cupcake of each of types $l,l+1,\dots ,r.$

After that they will compare the total tastiness of the cupcakes each of them have bought. Yasser will be happy if the total tastiness of cupcakes he buys is strictly greater than the total tastiness of cupcakes Adel buys regardless of Adel’s choice.

For example, let the tastinesses of the cupcakes be [7,4,−1]. Yasser will buy all of them, the total tastiness will be 7+4−1=10. Adel can choose segments [7],[4],[−1],[7,4] or [4,−1], their total tastinesses are 7,4,−1,11 and 3, respectively. Adel can choose segment with tastiness 11, and as 10 is not strictly greater than 11, Yasser won’t be happy

Find out if Yasser will be happy after visiting the shop.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤10⁴). The description of the test cases follows.

The first line of each test case contains n (2≤n≤10⁵).

The second line of each test case contains n integers a1,a2,…,an (−10⁹≤$a_i$≤10⁹), where ai represents the tastiness of the $i_{th}$ type of cupcake.

It is guaranteed that the sum of n over all test cases doesn’t exceed $10^5$.

Output

For each test case, print “YES”, if the total tastiness of cupcakes Yasser buys will always be strictly greater than the total tastiness of cupcakes Adel buys regardless of Adel’s choice. Otherwise, print “NO”.

Example

Input
3
4
1 2 3 4
3
7 4 -1
3
5 -5 5
Output
YES
NO
NO

Note

In the first example, the total tastiness of any segment Adel can choose is less than the total tastiness of all cupcakes.

In the second example, Adel will choose the segment [1,2] with total tastiness 11, which is not less than the total tastiness of all cupcakes, which is 10.

In the third example, Adel can choose the segment [3,3] with total tastiness of 5. Note that Yasser’s cupcakes’ total tastiness is also 5, so in that case, the total tastiness of Yasser’s cupcakes isn’t strictly greater than the total tastiness of Adel’s cupcakes.

题解

如果,这个序列存在一个非正的前缀和或者后缀和,我们删除它,这样,我们可以选出一个子串使得其和大于总和.
而对于其他的情况,我们可以知道,不存在能够让子串大于总和的情况了.

#pragma comment(linker, "/STACK:102400000,102400000")
#include 
using namespace std;
const int MAXN = 1e5 + 10;
const double pi = acos(-1.0);
const int inf = __LONG_MAX__;
const int enf = LONG_MIN;
const long long INF = LLONG_MAX;
const long long ENF = LLONG_MIN;
const double eps = 1e-12;

int a[MAXN];
long long sum[MAXN], _sum[MAXN];
int main()
{

    int t;
    cin >> t;
    while (t--) {
        memset(sum, 0, sizeof(sum));
        memset(_sum, 0, sizeof(_sum));
        int n;
        cin >> n;
        bool f = 0;
        long long ans = 0;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
            ans += a[i];
        }
        for (int i = 1; i <= n; i++) {
            sum[i] = sum[i - 1] + a[i];
            if (sum[i] <= 0)
                f = 1;
        }
        for (int i = n; i >= 1; i--) {
            _sum[i] = _sum[i + 1] + a[i];
            if (_sum[i] <= 0)
                f = 1;
        }
        if (f)
            cout << "NO" << endl;
        else
            cout << "YES" << endl;
    }
    return 0;
}

C. Fadi and LCM

Today, Osama gave Fadi an integer $X$, and Fadi was wondering about the minimum possible value of $max(a,b)$ such that $LCM(a,b)$ equals $X$. Both $a$ and $b$ should be positive integers.

$LCM(a,b)$ is the smallest positive integer that is divisible by both $a$ and $b$. For example, $LCM(6,8)=24,LCM(4,12)=12,LCM(2,3)=6$.

Of course, Fadi immediately knew the answer. Can you be just like Fadi and find any such pair?

Input

The first and only line contains an integer $X(1\le X\le 10^{12}$).

Output

Print two positive integers, $a$ and $b$, such that the value of $max(a,b)$ is minimum possible and $LCM(a,b)$ equals $X$. If there are several possible such pairs, you can print any.

Examples

Input
2
Output
1 2
Input
6
Output
2 3
Input
4
Output
1 4
Input
1
Output
1 1

题解

这个题目,就是给一个最小公倍数$n$,求两个数$a,b$.
还要求求出的两个数的最大值最小.
自然想到在给定数的因子里寻找$a$.
再判断$b=\frac{n}{a}$,$a,b$的最小公倍数是否为$n$即可.

#pragma comment(linker, "/STACK:102400000,102400000")
#include 
using namespace std;
const int MAXN = 1e5 + 10;
const double pi = acos(-1.0);
const int inf = __LONG_MAX__;
const int enf = LONG_MIN;
const long long INF = LLONG_MAX;
const long long ENF = LLONG_MIN;
const double eps = 1e-12;

typedef long long ll;
ll gcd(ll a, ll b)
{
    return (b == 0 ? a : gcd(b, a % b));
}
int main()
{
    ll n;
    cin >> n;
    ll a = sqrt(n);
    for (ll i = a; i >= 1; i--)
        if (n % i == 0) {
            ll b = n / i;
            ll g = gcd(i, b);
            if (i / g * b == n) {
                a = i;
                break;
            }
        }
    cout << a << ' ' << n / a << endl;
    return 0;
}

D. Dr. Evil Underscores

Today, as a friendship gift, Bakry gave Badawy $n$ integers $a_1,a_2,\dots ,a_n$ and challenged him to choose an integer $X$ such that the value $\underset{1\le i\le n}{\max }(a_i\oplus X)$ is minimum possible, where $\oplus$ denotes the bitwise $XOR$ operation.

As always, Badawy is too lazy, so you decided to help him and find the minimum possible value of $\underset{1\le i\le n}{\max }(a_i\oplus X)$.

Input

The first line contains integer $n(1\le n\le 10^5)$.

The second line contains n integers $a_1,a_2,\dots ,a_n(0\le a_i\le 2^{30-1})$.

Output

Print one integer — the minimum possible value of $\underset{1\le i\le n}{\max }(ai\oplus X)$.

Examples

Input
3
1 2 3
Output
2
Input
2
1 5
Output
4

Note

In the first sample, we can choose X=3.

In the second sample, we can choose X=5.

题解

按位递归.

• 如果该为有$1$也有$0$,我们将其分成两组,分别递归,因为两者都有的话,无论怎么$XOR$,所得结果在该位都有$1$,于是$ans=ans+2^k$
• 如果只有$1$或者只有$0$,直接递归,因为可以避免该位$XOR$为$1$

依次递归,求得结果

#pragma comment(linker, "/STACK:102400000,102400000")
#include 
using namespace std;
const int MAXN = 1e5 + 10;
const double pi = acos(-1.0);
const int inf = __LONG_MAX__;
const int enf = LONG_MIN;
const long long INF = LLONG_MAX;
const long long ENF = LLONG_MIN;
const double eps = 1e-12;

int dfs(vector<int> v, int bit)
{
    if (bit < 0)
        return 0;
    vector<int> zero, one;
    for (auto it = v.begin(); it != v.end(); it++)
        if (1 << bit & (*it))
            one.push_back(*it);
        else
            zero.push_back(*it);
    if (one.size() == 0)
        return dfs(zero, bit - 1);
    else if (zero.size() == 0)
        return dfs(one, bit - 1);
    else
        return min(dfs(one, bit - 1), dfs(zero, bit - 1)) + (1 << bit);
}
int main()
{
    int n;
    cin >> n;
    vector<int> v;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        v.push_back(x);
    }
    cout << dfs(v, 30);
    return 0;
}

E. Deadline

Adilbek was assigned to a special project. For Adilbek it means that he has n days to run a special program and provide its results. But there is a problem: the program needs to run for d days to calculate the results.

Fortunately, Adilbek can optimize the program. If he spends $x$ ($x$ is a non-negative integer) days optimizing the program, he will make the program run in $\lceil \frac{d}{x+1}\rceil$ days ($\lceil a\rceil$ is the ceiling function: $\lceil 2.4\rceil =3,\lceil 2\rceil =2$). The program cannot be run and optimized simultaneously, so the total number of days he will spend is equal to $x+\lceil \frac{d}{x+1}\rceil$.

Will Adilbek be able to provide the generated results in no more than $n$ days?

Input

The first line contains a single integer $T(1\le T\le 50)$ — the number of test cases.

The next $T$ lines contain test cases – one per line. Each line contains two integers $n$ and $d(1\le n\le 10^9,1\le d\le 10^9)$ — the number of days before the deadline and the number of days the program runs.

Output

Print T answers — one per test case. For each test case print YES (case insensitive) if Adilbek can fit in n days or NO (case insensitive) otherwise.

Example

Input
3
1 1
4 5
5 11
Output
YES
YES
NO

Note

In the first test case, Adilbek decides not to optimize the program at all, since $d\le n$.

In the second test case, Adilbek can spend 1 day optimizing the program and it will run $\lceil \frac{5}{2}\rceil$=3 days. In total, he will spend 4 days and will fit in the limit.

In the third test case, it’s impossible to fit in the limit. For example, if Adilbek will optimize the program 2 days, it’ll still work $\lceil \frac{11}{2+1}\rceil$=4 days.

题解

给一个天数$n$,以及工作需要时间$d$,以及一个优化时间的方式,将$d$转变为$x+\lceil \frac{d}{x+1}\rceil$.
也就是判断$d$是否小于$n$,最小的$x+\lceil \frac{d}{x+1}\rceil$能否小于$n$.
对于$x+\frac{d}{x+1}$,我们转换为$x+1+\frac{d}{x+1}-1$
我们根据均值不等式可知,当$x+1=\frac{d}{x+1}$时,可以得到上式得最小值
即$x=\sqrt{d}-1$时

#pragma comment(linker, "/STACK:102400000,102400000")
#include 
using namespace std;
const int MAXN = 1e5 + 10;
const double pi = acos(-1.0);
const int inf = __LONG_MAX__;
const int enf = LONG_MIN;
const long long INF = LLONG_MAX;
const long long ENF = LLONG_MIN;
const double eps = 1e-12;

typedef long long ll;

int main()
{
    int t;
    cin >> t;
    while (t--) {
        int n, d;
        cin >> n >> d;
        int x = sqrt(d);
        int minn = d;
        for (int i = max(x - 2,1); i <= x + 1; i++) {
            int temp = i + d / (i + 1) + (d % (i + 1) != 0);
            minn = min(temp, minn);
        }
        if (minn <= n)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}

F. Yet Another Meme Problem

Try guessing the statement from this picture http://tiny.cc/ogyoiz.
You are given two integers $A$ and $B$, calculate the number of pairs $(a,b)$ such that $1\le a\le A,1\le b\le B$, and the equation $a\cdot b+a+b=conc(a,b)$ is true; $conc(a,b)$ is the concatenation of $a$ and $b$ (for example, $conc(12,23)=1223,conc(100,11)=10011$). $a$ and $b$ should not contain leading zeroes.

Input

The first line contains $t(1\le t\le 100)$ — the number of test cases.
Each test case contains two integers $A$ and $B(1\le A,B\le 10^9)$.

Output

Print one integer — the number of pairs $(a,b)$ such that $1\le a\le A,1\le b\le B$, and the equation $a\cdot b+a+b=conc(a,b)$ is true.

Example

Input
3
1 11
4 2
191 31415926
Output
1
0
1337

题解

我们考虑这个$conc(a,b)$,其值就相当于$a\cdot 10^n+b$
那么对于$a\cdot b+a+b=a\cdot 10^n+b$
化简就得到了$a(b+1)=a\cdot 10^n$
我们可以得到$b=10^n-1$
而$a$得取值便为$A$得范围,$b$得取值为$9,99,999...$

#pragma comment(linker, "/STACK:102400000,102400000")
#include 
using namespace std;
const int MAXN = 1e5 + 10;
const double pi = acos(-1.0);
const int inf = __LONG_MAX__;
const int enf = LONG_MIN;
const long long INF = LLONG_MAX;
const long long ENF = LLONG_MIN;
const double eps = 1e-12;

typedef long long ll;

int main()
{
    int t;
    cin >> t;
    while (t--) {
        long long A, B;
        cin >> A >> B;
        long long cnt = 0, ans = 0;
        while (cnt <= B) {
            cnt = cnt*10+9;
            ans++;
        }
        ans--;
        cout << A * ans << endl;
    }
    return 0;
}

G. HQ9+

HQ9+ is a joke programming language which has only four one-character instructions:

• “H” prints “Hello, World!”,
• “Q” prints the source code of the program itself,
• “9” prints the lyrics of “99 Bottles of Beer” song,
• “+” increments the value stored in the internal accumulator.

Instructions “H” and “Q” are case-sensitive and must be uppercase. The characters of the program which are not instructions are ignored.
You are given a program written in HQ9+. You have to figure out whether executing this program will produce any output.

Input

The input will consist of a single line p which will give a program in HQ9+. String p will contain between 1 and 100 characters, inclusive. ASCII-code of each character of p will be between 33 (exclamation mark) and 126 (tilde), inclusive.

Output

Output “YES”, if executing the program will produce any output, and “NO” otherwise.

Examples

Input
Hi!
Output
YES
Input
Codeforces
Output
NO

Note

In the first case the program contains only one instruction — “H”, which prints “Hello, World!”.
In the second case none of the program characters are language instructions.

题解

如题所述,包含’H’,‘Q’,和9得时候就输出YES

#pragma comment(linker, "/STACK:102400000,102400000")
#include 
using namespace std;
const int MAXN = 1e5 + 10;
const double pi = acos(-1.0);
const int inf = __LONG_MAX__;
const int enf = LONG_MIN;
const long long INF = LLONG_MAX;
const long long ENF = LLONG_MIN;
const double eps = 1e-12;
typedef long long ll;
char s[110];
int main()
{
	cin >> s;
	int len = strlen(s);
	for(int i=0;i<len;i++)
		if (s[i] == 'H' || s[i] == 'Q' || s[i] == '9') {
			cout << "YES" << endl;
			return 0;
		}
	cout << "NO" << endl;
	return 0;
}

H. Rolling The Polygon

Bahiyyah has a convex polygon with $n$ vertices $P_0,P_1,\cdots ,P_{n-1}$ in the counterclockwise order. Two vertices with consecutive indexes are adjacent, and besides, $P_0$ and $P_{n-1}$ are adjacent. She also assigns a point $Q$ inside the polygon which may appear on the border.

Now, Bahiyyah decides to roll the polygon along a straight line and calculate the length of the trajectory (or track) of point $Q$.

To help clarify, we suppose $P_n=P_0,P_{n+1}=P_1$ and assume the edge between $P_0$ and $P_1$ is lying on the line at first. At that point when the edge between $P_{i-1}$ and $P_i$ lies on the line, Bahiyyah rolls the polygon forward rotating the polygon along the vertex $P_i$ until the next edge (which is between $P_i$ and $P_{i+1}$) meets the line. She will stop the rolling when the edge between $P_n$ and $P_{n+1}$ (which is same as the edge between $P_0$ and $P_1$) meets the line again.

Input

The input contains several test cases, and the first line is a positive integer $T$ indicating the number of test cases which is up to 50.

For each test case, the first line contains an integer $n(3\le n\le 50)$ indicating the number of vertices of the given convex polygon. Following n lines describe vertices of the polygon in the counterclockwise order. The i-th line of them contains two integers $x_{i-1}$ and $y_{i-1}$, which are the coordinates of point $P_{i-1}$. The last line contains two integers $x_Q$ and $y_Q$, which are the coordinates of point $Q$.

We guarantee that all coordinates are in the range of $-10^3$ to $10^3$, and point $Q$ is located inside the polygon or lies on its border.

Output

For each test case, output a line containing Case #x: y, where x is the test case number starting from 1, and y is the length of the trajectory of the point Q rounded to 3 places. We guarantee that 4-th place after the decimal point in the precise answer would not be 4 or 5.

Example

Input
4
4
0 0
2 0
2 2
0 2
1 1
3
0 0
2 1
1 2
1 1
5
0 0
1 0
2 2
1 3
-1 2
0 0
6
0 0
3 0
4 1
2 2
1 2
-1 1
1 0
Output
Case #1: 8.886
Case #2: 7.318
Case #3: 12.102
Case #4: 14.537

题解

这个题的意思就是给一个凸包,凸包里面有个点,我们滚动这个凸包,问这个点它走过的路径是多少

拿这个图说吧,就是$AB$转到了$NB$的位置,$BC$转到了$BI$的位置
我们可以知道$\angle ABN=\angle CBI=\angle HB{H}^{\prime }$,毕竟旋转的角度是一样的啊
然后咧,我们求$\stackrel{⌢}{H{H}^{\prime }}$的长度,就相当于求圆弧嘛.
以$B$为圆点,$\angle HB{H}^{\prime }$的角所对应嘛
然后求$\angle HB{H}^{\prime }$相当于求$\angle ABN$相当于求$\pi -\angle NBI$
然后就结束了

#pragma comment(linker, "/STACK:102400000,102400000")
#include 
using namespace std;
const int MAXN = 1e5 + 10;
const double pi = acos(-1.0);
const int inf = __LONG_MAX__;
const int enf = LONG_MIN;
const long long INF = LLONG_MAX;
const long long ENF = LLONG_MIN;
const double eps = 1e-12;

typedef struct point vec;
struct point { //点的基本数据结构
    double x, y;
    double poe;
    point(double _x = 0, double _y = 0)
        : x(_x)
        , y(_y)
    {
    }
    double len() //模长
    {
        return sqrt(x * x + y * y);
    }
    vec chuizhi()
    {
        return vec(-y, x);
    }
    double operator*(const point& i_T) const //点积
    {
        return x * i_T.x + y * i_T.y;
    }
    double operator^(const point& i_T) const //叉积
    {
        return x * i_T.y - y * i_T.x;
    }
    point operator*(double u) const
    {
        return point(x * u, y * u);
    }
    bool operator==(const point& i_T) const
    {
        return fabs(x - i_T.x) < eps && fabs(y - i_T.y) < eps;
    }
    point operator/(double u) const
    {
        return point(x / u, y / u);
    }
    point operator+(const point& i_T)
    {
        return point(x + i_T.x, y + i_T.y);
    }
    point operator-(const point& i_T)
    {
        return point(x - i_T.x, y - i_T.y);
    }
    friend bool operator<(point a, point b)
    {
        return fabs(a.y - b.y) < eps ? a.x < b.x : a.y < b.y;
    }
    void atn2()
    {
        poe = atan2(y, x);
    }
    friend ostream& operator<<(ostream& out, point& a)
    {
        //cout << a.x << ' ' << a.y;
        printf("%.8f %.8f", a.x, a.y);
        return out;
    }
    friend istream& operator>>(istream& in, point& a)
    {
        scanf("%lf%lf", &a.x, &a.y);
        return in;
    }
} p[100];

double jiajiao(vec a, vec b)
{
    return pi - acos(a * b / (a.len() * b.len()));
}
double d[100];
int main()
{
    point p0;
    int n, t, cas = 1;
    scanf("%d", &t);
    for (int k = 1; k <= t; k++) {
        scanf("%d", &n);
        for (int i = 1; i <= n; i++)
            cin >> p[i];
        cin >> p0;
        for (int i = 1; i <= n; i++)
            d[i] = (p0 - p[i]).len();
        p[0] = p[n], p[n + 1] = p[1];
        double ans = 0;
        for (int i = 1; i <= n; i++)
            ans += d[i] * jiajiao(p[i - 1] - p[i], p[i + 1] - p[i]);
        printf("Case #%d: %.3f\n", k, ans);
    }
    return 0;
}