# 我自己

## A. 345245245245

# Background

Special for beginners, ^_^

# Description624372367623745672364572367562387657236987563

Given two integers x and y, print the sum.
2
45
23
4523
54
234
5

# Format

24523452345235
43255
2

## Input

2542345235442353245

2234Two5 integers x and y, satisfying $0\leq x,y\leq 327522367$ .
45235
235

## Output

One integer, the sum of x and y.

# Samples

```input1
123 500
```

```output1
623
```

# Limitation

1145145
s, 1145145KiB for each test case.



---

## B. 3734

# Background
Special for beginners, ^_^

# Description
Given two integers x and y, print the sum.

# Format

## Input
Two integers x and y, satisfying $0\leq x,y\leq 32767$ .

## Output
One integer, the sum of x and y.

# Samples

```input1
123 500
```

```output1
623
```

# Limitation
1s, 1024KiB for each test case.

---

## C. 3的倍数

# Background

轩轩今天学习了3的倍数特征，回家后他要复习一下今天学习的知识，于是他想用编程来复习

# Format

## Input

输入一个三位数n，判断它是否是3的倍数

## Output

如果它是3的倍数，输出"Yes",如果它不是3的倍数，输出"No"

# Samples

```input1
567
```

```output1
Yes
```

# Limitation

1s, 1024KiB for each test case.



---

## D. 3

# Background
Special for beginners, ^_^

# Description
Given two integers x and y, print the sum.

# Format

## Input
Two integers x and y, satisfying $0\leq x,y\leq 32767$ .

## Output
One integer, the sum of x and y.

# Samples

```input1
123 500
```

```output1
623
```

# Limitation
1s, 1024KiB for each test case.

---

## E. 123

# Background
Special for beginners, ^_^

# Description
Given two integers x and y, print the sum.

# Format

## Input
Two integers x and y, satisfying $0\leq x,y\leq 32767$ .

## Output
One integer, the sum of x and y.

# Samples

```input1
123 500
```

```output1
623
```

# Limitation
1s, 1024KiB for each test case.

---

## F. 土拨鼠比沙雕

# Background

n只沙雕又愚蠢的土拨鼠，他们要比谁最沙雕

# Description

给出n只土拨鼠的沙雕程度，输出最沙雕的土拨鼠的编号

# Format

## Input

第一行一个整数，n

后面n行，每行一个整数，表示第i个土拨鼠的沙雕程度。

## Output

一个整数，表示最沙雕土拨鼠的编号，沙雕土拨鼠们的沙雕程度互不相同。

# Samples

```input1
5
78
87
98
35
10
```

```output1
3
```

# Limitation

n<=1000
每只土拨鼠最多能有多沙雕呢？答：最沙雕的土拨鼠的沙雕程度大于long long long的范围，但也不会超过10^1000次方，输入的数字没有前导零



---

## G. 被绿的李夕夕

# Background

众所周知，李夕夕已经谈了9999个男朋友了，但是应为李夕夕太变态了，所以每个男朋友都不过1个小时就把李夕夕给绿了，终于，李夕夕忍不了了，直接化身多种形态，例如：彻底疯狂，以雷霆击碎黑暗，妲己陪你玩......

# Description


# Format

## Input

Two integers x and y, satisfying $0\leq x,y\leq 32767$ .

## Output

One integer, the sum of x and y.

# Samples

```input1
123 500
```

```output1
623
```

# Limitation

1s, 1024KiB for each test case.



---