Codeforces Round #243 (Div. 2)

A. Sereja and Mugs

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and n water mugs on it. Then all players take turns to move. During a move, a player takes a non-empty mug of water and pours all water from it into the cup. If the cup overfills, then we assume that this player lost.

As soon as Sereja's friends heard of the game, they wanted to play it. Sereja, on the other hand, wanted to find out whether his friends can play the game in such a way that there are no losers. You are given the volumes of all mugs and the cup. Also, you know that Sereja has (n - 1) friends. Determine if Sereja's friends can play the game so that nobody loses.

Input

The first line contains integers n and s (2 ≤ n ≤ 100; 1 ≤ s ≤ 1000) — the number of mugs and the volume of the cup. The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 10). Number ai means the volume of the i-th mug.

Output

In a single line, print "YES" (without the quotes) if his friends can play in the described manner, and "NO" (without the quotes) otherwise.

Examples

input

3 4
1 1 1

output

YES

input

3 4
3 1 3

output

YES

input

3 4
4 4 4

output

NO

题目大意：

选n-1个数，使得其加和小于等于s，如果存在，输出YES,否则NO

思路：

模拟一下即可。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
int a[150];
int main()
{
    int n,s;
    while(~scanf("%d%d",&n,&s))
    {
        int sum=0,flag=0;
        for(int i=1;i<=n;i++)scanf("%d",&a[i]),sum+=a[i];
        for(int i=1;i<=n;i++)
        {
            if(sum-a[i]<=s)flag=1;
        }
        if(flag==1)printf("YES\n");
        else printf("NO\n");
    }
}

B. Sereja and Mirroring

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Let's assume that we are given a matrix b of size x × y, let's determine the operation of mirroring matrix b. The mirroring of matrix b is a 2x × y matrix c which has the following properties:

• the upper half of matrix c (rows with numbers from 1 to x) exactly matches b;
• the lower half of matrix c (rows with numbers from x + 1 to 2x) is symmetric to the upper one; the symmetry line is the line that separates two halves (the line that goes in the middle, between rows x and x + 1).

Sereja has an n × m matrix a. He wants to find such matrix b, that it can be transformed into matrix a, if we'll perform on it several(possibly zero) mirrorings. What minimum number of rows can such matrix contain?

Input

The first line contains two integers, n and m (1 ≤ n, m ≤ 100). Each of the next n lines contains m integers — the elements of matrix a. The i-th line contains integers ai1, ai2, ..., aim (0 ≤ aij ≤ 1) — the i-th row of the matrix a.

Output

In the single line, print the answer to the problem — the minimum number of rows of matrix b.

Examples

input

4 3
0 0 1
1 1 0
1 1 0
0 0 1

output

2

input

3 3
0 0 0
0 0 0
0 0 0

output

3

input

8 1
0
1
1
0
0
1
1
0

output

2

Note

In the first test sample the answer is a 2 × 3 matrix b:

001
110

If we perform a mirroring operation with this matrix, we get the matrix a that is given in the input:

001
110
110
001

题目大意：

找到镜像对称的最小行数

思路：

模拟一下随便搞搞就行。= =

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
int a[150][150];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                scanf("%d",&a[i][j]);
            }
        }
        if(n%2==1)
        {
            printf("%d\n",n);
            continue;
        }
        else
        {
            for(int i=1;i<=n;i++)
            {
                if(n%i==0)
                {
                    int ok=0;
                    int tmp=i;
                    for(int j=0;;j++)
                    {
                        if(tmp==n)
                        {
                            ok=1;break;
                        }
                        if(tmp>n)
                        {
                            ok=0;
                            break;
                        }
                        tmp*=2;
                    }
                    if(ok==0)continue;
                    ok=1;
                    int x=0,y=0,flag=1;
                    for(int j=0;j<n;j++)
                    {
                        for(int k=0;k<m;k++)
                        {
                            if(a[j][k]==a[x][y])
                            {
                                if(flag==1)
                                {
                                    y++;
                                    if(y>=m)y=0,x++;
                                    if(x==i)
                                    {
                                        flag=0;
                                        x=i-1;y=0;
                                    }
                                }
                                else
                                {
                                    y++;
                                    if(y>=m)y=0,x--;
                                    if(x==-1)
                                    {
                                        flag=1;
                                        x=0;y=0;
                                    }
                                }
                            }
                            else ok=0;
                        }
                    }
                    if(ok==1)
                    {
                        printf("%d\n",i);break;
                    }
                }
            }
        }
    }
}

C. 我是萌萌哒C题题解

D.我是萌萌哒D题题解

E.我是萌萌哒E题题解