Codeforces #292 （div2）

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

到达目的地的最小步数是|n|+|m| = = 那剩下的只要来回走就可以了 是2的倍数即可

AC代码如下：

//
//	A. Drazil and Date
//
//  Created by TaoSama on 2015-02-18
//  Copyright (c) 2014 TaoSama. All rights reserved.
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
#define CLR(x,y) memset(x, y, sizeof(x))

using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;

long long a, b, s;

int main() {
#ifdef LOCAL
	freopen("in.txt", "r", stdin);
//	freopen("out.txt","w",stdout);
#endif
	ios_base::sync_with_stdio(0);

	while(cin >> a >> b >> s) {
		if(s - abs(a) - abs(b) >= 0 &&
		        (s - abs(a) - abs(b)) % 2 == 0) cout << "Yes" << endl;
		else	cout << "No" << endl;
	}
	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

令gcd = n和m的最大公约数 无论男女对于 第x个人  x%gcd开心了 那么经过i天 如果i%gcd = x%gcd的话 他们都开心 这是只要遍历一遍就可以了

AC代码如下：

//
//	B. Drazil and His Happy Friends
//
//  Created by TaoSama on 2015-02-18
//  Copyright (c) 2014 TaoSama. All rights reserved.
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
#define CLR(x,y) memset(x, y, sizeof(x))

using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;

int n, m;
bool a[105];

int main() {
#ifdef LOCAL
	freopen("in.txt", "r", stdin);
//	freopen("out.txt","w",stdout);
#endif
	ios_base::sync_with_stdio(0);

	while(cin >> n >> m) {
		memset(a, 0, sizeof a);
		int gcd = __gcd(n, m);
		int t; cin >> t;
		while(t-- > 0) {
			int x; cin >> x;
			a[x % gcd] = 1;
		}
		cin >> t;
		while(t-- > 0) {
			int x; cin >> x;
			a[x % gcd] = 1;
		}
		string ans = "Yes";
		for(int i = 0; i < gcd; ++i) {
			if(!a[i]) ans = "No";
		}
		cout << ans << endl;
	}
	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

这题水题一个 - - 素数阶乘不可分解 合数的只要唯一分解的更多 那么所得的数字就会更大

AC代码如下：

//
//	C. Drazil and Factorial
//
//  Created by TaoSama on 2015-02-18
//  Copyright (c) 2014 TaoSama. All rights reserved.
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
#define CLR(x,y) memset(x, y, sizeof(x))

using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;

int n; char a[20];
map<int, int> ans;

int main() {
#ifdef LOCAL
	freopen("in.txt", "r", stdin);
//	freopen("out.txt","w",stdout);
#endif
	ios_base::sync_with_stdio(0);

	while(cin >> n >> (a + 1)) {
		ans.clear();
		for(int i = 1; i <= n; ++i) {
			if(a[i] == '2') ++ans[2];
			if(a[i] == '3') ++ans[3];
			if(a[i] == '4') ++ans[3], ans[2] += 2;
			if(a[i] == '5') ++ans[5];
			if(a[i] == '6') ++ans[5], ++ans[3];
			if(a[i] == '7') ++ans[7];
			if(a[i] == '8') ++ans[7], ans[2] += 3;
			if(a[i] == '9') ++ans[7], ++ans[2], ans[3] += 2;
		}
		for(int i = 9; i > 0; --i) {
			if(ans.count(i)) {
				int t = ans[i];
				for(int j = 1; j <= t; ++j)
					cout << i;
			}
		}
		cout << endl;
	}
	return 0;
}