Codeforces Round #292 (Div. 2)(A,B,C)

A. Drazil and Date

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Someday, Drazil wanted to go on date with Varda. Drazil and Varda live on Cartesian plane. Drazil's home is located in point (0, 0) and Varda's home is located in point (a, b). In each step, he can move in a unit distance in horizontal or vertical direction. In other words, from position (x, y) he can go to positions (x + 1, y), (x - 1, y), (x, y + 1) or (x, y - 1).

Unfortunately, Drazil doesn't have sense of direction. So he randomly chooses the direction he will go to in each step. He may accidentally return back to his house during his travel. Drazil may even not notice that he has arrived to (a, b) and continue travelling.

Luckily, Drazil arrived to the position (a, b) successfully. Drazil said to Varda: "It took me exactly s steps to travel from my house to yours". But Varda is confused about his words, she is not sure that it is possible to get from (0, 0) to (a, b) in exactly s steps. Can you find out if it is possible for Varda?

Input

You are given three integers a, b, and s ( - 109 ≤ a, b ≤ 109, 1 ≤ s ≤ 2·109) in a single line.

Output

If you think Drazil made a mistake and it is impossible to take exactly s steps and get from his home to Varda's home, print "No" (without quotes).

Otherwise, print "Yes".

Sample test(s)

input

5 5 11

output

No

input

10 15 25

output

Yes

input

0 5 1

output

No

input

0 0 2

output

Yes

Note

In fourth sample case one possible route is: .

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

using namespace std;
const int inf=0x3f3f3f3f;
int map[40][40];
int g[40];
int n,res;
int main()
{
    int x,y;
    int step;
    while(~scanf("%d %d %d",&x,&y,&step)){
        if(abs(x)+abs(y)>step)
            printf("No\n");
        else{
            if((abs(x)+abs(y)-step)%2==0)
                printf("Yes\n");
            else
                printf("No\n");
        }
    }
    return 0;
}

B. Drazil and His Happy Friends

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.

There are n boys and m girls among his friends. Let's number them from 0 to n - 1 and 0 to m - 1 separately. In i-th day, Drazil invites -th boy and -th girl to have dinner together (as Drazil is programmer, i starts from 0). If one of those two people is happy, the other one will also become happy. Otherwise, those two people remain in their states. Once a person becomes happy (or if he/she was happy originally), he stays happy forever.

Drazil wants to know whether he can use this plan to make all his friends become happy at some moment.

Input

The first line contains two integer n and m (1 ≤ n, m ≤ 100).

The second line contains integer b (0 ≤ b ≤ n), denoting the number of happy boys among friends of Drazil, and then follow b distinct integers x1, x2, ..., xb (0 ≤ xi < n), denoting the list of indices of happy boys.

The third line conatins integer g (0 ≤ g ≤ m), denoting the number of happy girls among friends of Drazil, and then follow g distinct integers y1, y2, ... , yg (0 ≤ yj < m), denoting the list of indices of happy girls.

It is guaranteed that there is at least one person that is unhappy among his friends.

Output

If Drazil can make all his friends become happy by this plan, print "Yes". Otherwise, print "No".

Sample test(s)

input

2 3
0
1 0

output

Yes

input

2 4
1 0
1 2

output

No

input

2 3
1 0
1 1

output

Yes

Note

By  we define the remainder of integer division of i by k.

In first sample case:

• On the 0-th day, Drazil invites 0-th boy and 0-th girl. Because 0-th girl is happy at the beginning, 0-th boy become happy at this day.
• On the 1-st day, Drazil invites 1-st boy and 1-st girl. They are both unhappy, so nothing changes at this day.
• On the 2-nd day, Drazil invites 0-th boy and 2-nd girl. Because 0-th boy is already happy he makes 2-nd girl become happy at this day.
• On the 3-rd day, Drazil invites 1-st boy and 0-th girl. 0-th girl is happy, so she makes 1-st boy happy.
• On the 4-th day, Drazil invites 0-th boy and 1-st girl. 0-th boy is happy, so he makes the 1-st girl happy. So, all friends become happy at this moment.

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

using namespace std;
const int inf=0x3f3f3f3f;
int b[110],g[110];
int main()
{
    int n,m,i;
    int nb,mg;
    int boy,girl;
    memset(b,0,sizeof(b));
    memset(g,0,sizeof(g));
    scanf("%d %d",&n,&m);
    scanf("%d",&nb);
    while(nb--){
        scanf("%d",&boy);
        b[boy]=1;
    }
    scanf("%d",&mg);
    while(mg--){
        scanf("%d",&girl);
        g[girl]=1;
    }
    for(i=0;i<10010;i++){
        if(b[i%n]||g[i%m])
            b[i%n]=g[i%m]=1;
    }
    int flag=0;
    for(i=0;i<n;i++){
        if(!b[i]){
            flag=1;
            break;
        }
    }
    for(i=0;i<m;i++){
        if(!g[i]){
            flag=1;
            break;
        }
    }
    if(flag)
        printf("No\n");
    else
        printf("Yes\n");
    return 0;
}

C. Drazil and Factorial

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Drazil is playing a math game with Varda.

Let's define  for positive integer x as a product of factorials of its digits. For example, .

First, they choose a decimal number a consisting of n digits that contains at least one digit larger than 1. This number may possibly start with leading zeroes. Then they should find maximum positive number x satisfying following two conditions:

1. x doesn't contain neither digit 0 nor digit 1.

2.  = .

Help friends find such number.

Input

The first line contains an integer n (1 ≤ n ≤ 15) — the number of digits in a.

The second line contains n digits of a. There is at least one digit in a that is larger than 1. Number a may possibly contain leading zeroes.

Output

Output a maximum possible integer satisfying the conditions above. There should be no zeroes and ones in this number decimal representation.

Sample test(s)

input

4
1234

output

33222

input

3
555

output

555

Note

In the first case, 

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

using namespace std;
char a[20][20]={"", "", "2", "3", "322", "5", "53", "7", "7222", "7332"};
char str[20];
char res[110];
int cmp(char a,char b)
{
    return (a-'0')>(b-'0');
}
int main()
{
    int n,i,j;
    int t;
    while(~scanf("%d",&n)){
        scanf("%s",str);
        t=0;
        memset(res,0,sizeof(res));
        for(i=0;i<n;i++){
            int len=strlen(a[str[i]-'0']);
            for(j=0;j<len;j++){
                res[t]=a[str[i]-'0'][j];
                t++;
            }
        }
        sort(res,res+t,cmp);
        for(i=0;i<t;i++)
            printf("%c",res[i]);
            printf("\n");
    }
    return 0;
}