AtCoder Beginner Contest 103

Posted 2020-12-25 8023spz

https://beta.atcoder.jp/contests/abc103

A - Task Scheduling Problem

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : $100100$ points

Problem Statement

You have three tasks, all of which need to be completed.

First, you can complete any one task at cost $00$.

Then, just after completing the $\mathrm{ii}$-th task, you can complete the $\mathrm{jj}$-th task at cost $|Aj-Ai||Aj-Ai|$.

Here, $|x||x|$ denotes the absolute value of $\mathrm{xx}$.

Find the minimum total cost required to complete all the task.

Constraints

• All values in input are integers.
• $\mathrm{1\le A1,A2,A3\le 1001\le A1,A2,A3\le 100}$

---

Input

Input is given from Standard Input in the following format:

${\mathrm{A1A1}}^{}$ ${\mathrm{A2A2}}^{}$ ${\mathrm{A3A3}}^{}$

Output

Print the minimum total cost required to complete all the task.

---

Sample Input 1 Copy

Copy

1 6 3

Sample Output 1 Copy

Copy

5

When the tasks are completed in the following order, the total cost will be $55$, which is the minimum:

• Complete the first task at cost $00$.
• Complete the third task at cost $22$.
• Complete the second task at cost $33$.

---

Sample Input 2 Copy

Copy

11 5 5

Sample Output 2 Copy

Copy

6

---

Sample Input 3 Copy

Copy

100 100 100

Sample Output 3 Copy

Copy

0

import java.util.Arrays;
import java.util.Scanner;
import static java.lang.Math.*;
public class Main {
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int [] a = new int[3];
        for(int i = 0;i < 3;i ++) {
            a[i] = in.nextInt();
        }
        Arrays.sort(a);
        System.out.println(a[2] - a[0]);
    }
}

 B - String Rotation

---

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : $200200$ points

Problem Statement

You are given string $\mathrm{SS}$ and $\mathrm{TT}$ consisting of lowercase English letters.

Determine if $\mathrm{SS}$ equals $\mathrm{TT}$ after rotation.

That is, determine if $\mathrm{SS}$ equals $\mathrm{TT}$ after the following operation is performed some number of times:

Operation: Let $\mathrm{S=S1S2...S|S|S=S1S2...S|S|}$. Change $\mathrm{SS}$ to ${\mathrm{S|S|S1S2...S|S|-1S|S|S1S2...S|S|-1}}^{}$.

Here, $|X||X|$ denotes the length of the string $\mathrm{XX}$.

Constraints

• $\mathrm{2\le |S|\le 1002\le |S|\le 100}$
• $|S|=|T||S|=|T|$
• $\mathrm{SS}$ and $\mathrm{TT}$ consist of lowercase English letters.

---

Input

Input is given from Standard Input in the following format:

$\mathrm{SS}$
$\mathrm{TT}$

Output

If $\mathrm{SS}$ equals $\mathrm{TT}$ after rotation, print Yes; if it does not, print No.

---

Sample Input 1 Copy

Copy

kyoto
tokyo

Sample Output 1 Copy

Copy

Yes

• In the first operation, kyoto becomes okyot.
• In the second operation, okyot becomes tokyo.

---

Sample Input 2 Copy

Copy

abc
arc

Sample Output 2 Copy

Copy

No

abc does not equal arc after any number of operations.

---

Sample Input 3 Copy

Copy

aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab

Sample Output 3 Copy

Copy

Yes

import java.util.Arrays;
import java.util.Scanner;
import static java.lang.Math.*;
public class Main {
    static boolean check(String a,String b) {
        if(a.length() != b.length())return false;
        for(int i = 0;i < a.length();i ++) {
            if(a.charAt(i) == b.charAt(0) && (a.substring(i, a.length()) + a.substring(0, i)).equals(b)) {
                return true;
            }
        }
        return false;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String a = in.nextLine();
        String b = in.nextLine();
        System.out.println(check(a,b) ? "Yes" : "No");
    }
}