Codeforces Round #289 (Div. 2, ACM ICPC Rules)(A,B)

A. Maximum in Table

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

An n × n table a is defined as follows:

• The first row and the first column contain ones, that is: ai, 1 = a1, i = 1 for all i = 1, 2, ..., n.
• Each of the remaining numbers in the table is equal to the sum of the number above it and the number to the left of it. In other words, the remaining elements are defined by the formula ai, j = ai - 1, j + ai, j - 1.

These conditions define all the values in the table.

You are given a number n. You need to determine the maximum value in the n × n table defined by the rules above.

Input

The only line of input contains a positive integer n (1 ≤ n ≤ 10) — the number of rows and columns of the table.

Output

Print a single line containing a positive integer m — the maximum value in the table.

Sample test(s)

input

1

output

1

input

5

output

70

Note

In the second test the rows of the table look as follows:

{1, 1, 1, 1, 1},  {1, 2, 3, 4, 5},  {1, 3, 6, 10, 15},  {1, 4, 10, 20, 35},  {1, 5, 15, 35, 70}.

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>

using namespace std;
const int inf=0x3f3f3f3f;

int main()
{
    int n,i,j;
    int a[11][11];
    while(~scanf("%d",&n)){
        for(i=1;i<=n;i++){
            a[i][1]=a[1][i]=1;
        }
        for(i=2;i<=n;i++)
            for(j=2;j<=n;j++)
            a[i][j]=a[i-1][j]+a[i][j-1];
        printf("%d\n",a[n][n]);
    }
    return 0;
}

B. Painting Pebbles

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There are n piles of pebbles on the table, the i-th pile contains ai pebbles. Your task is to paint each pebble using one of the k given colors so that for each color c and any two piles i and j the difference between the number of pebbles of color c in pile i and number of pebbles of color c in pile j is at most one.

In other words, let's say that bi, c is the number of pebbles of color c in the i-th pile. Then for any 1 ≤ c ≤ k, 1 ≤ i, j ≤ n the following condition must be satisfied |bi, c - bj, c| ≤ 1. It isn't necessary to use all k colors: if color c hasn't been used in pile i, then bi, c is considered to be zero.

Input

The first line of the input contains positive integers n and k (1 ≤ n, k ≤ 100), separated by a space — the number of piles and the number of colors respectively.

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 100) denoting number of pebbles in each of the piles.

Output

If there is no way to paint the pebbles satisfying the given condition, output "NO" (without quotes) .

Otherwise in the first line output "YES" (without quotes). Then n lines should follow, the i-th of them should contain ai space-separated integers. j-th (1 ≤ j ≤ ai) of these integers should be equal to the color of the j-th pebble in the i-th pile. If there are several possible answers, you may output any of them.

Sample test(s)

input

4 4
1 2 3 4

output

YES
1
1 4
1 2 4
1 2 3 4

input

5 2
3 2 4 1 3

output

NO

input

5 4
3 2 4 3 5

output

YES
1 2 3
1 3
1 2 3 4
1 3 4
1 1 2 3 4

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>

using namespace std;
const int inf=0x3f3f3f3f;
int a[110];
int b[110];
int main()
{
    int n,m,i,j,k;
    int flag;
    int cha;
    while(~scanf("%d %d",&n,&m)) {
        k=inf;
        for(i=1; i<=n; i++) {
            scanf("%d",&a[i]);
            k=min(k,a[i]);
        }
        flag=1;
        for(i=1; i<=n; i++) {
            cha=a[i]-k;
            if(cha>m) {
                flag=0;
                break;
            }
        }
        if(flag==0) {
            printf("NO\n");
        } else {
            printf("YES\n");
            for(int i=1; i<=n; i++) {
                int b1=0;
                for(int j=1; j<=a[i]; j++) {
                    if(j>=m) {
                        if(j%m==0)
                            b[b1++]=m;
                        else
                            b[b1++]=j%m;
                    } else b[b1++]=j;
                }
                sort(b,b+b1);
                for(k=0; k<b1-1; k++)
                    printf("%d ",b[k]);
                printf("%d\n",b[k]);

            }
        }

    }
    return 0;
}