[Codeforces Round #628]1325

1325A - EhAb AnD gCd[思维]
1325B - CopyCopyCopyCopyCopy[思维]
1325C - Ehab and Path-etic MEXs[思维][图]
1325D - Ehab the Xorcist[思维+异或]
1325E - Ehab’s REAL Number Theory Problem[思维+最小环$dfs$]
1325F - Ehab’s Last Theorem[$dfs$树+独立集]

---

1325A - EhAb AnD gCd[思维]

time limit per test	memory limit per test	input	output
1 seconds	256 megabytes	standard input	standard output

Description:

You are given a positive integer $x$. Find any such $2$ positive integers $a$ and $b$ such that $GCD(a,b)+LCM(a,b)=x$.
As a reminder, $GCD(a,b)$ is the greatest integer that divides both $a$ and $b$. Similarly, $LCM(a,b)$ is the smallest integer such that both $a$ and $b$ divide it.
It’s guaranteed that the solution always exists. If there are several such pairs $(a,b)$, you can output any of them.

Input

The first line contains a single integer $t(1\le t\le 100)$ — the number of testcases.
Each testcase consists of one line containing a single integer, $x(2\le x\le 10^9)$.

Output

For each testcase, output a pair of positive integers $a$ and $b$ $(1\le a,b\le 10^9)$ such that $GCD(a,b)+LCM(a,b)=x$. It’s guaranteed that the solution always exists. If there are several such pairs $(a,b)$, you can output any of them.

---

Example input

2
2
14

Example output

1 1
6 4

---

分析：
题意：
求$a,b$使得$gcd(a,b)+lcm(a,b)=n$
做法：
其实，$gcd(n,1)=1,lcm(n,1)=n$
因此，答案就是$1$和$n-1$

Code:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100 + 5;

int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        int n;
        scanf("%d", &n);
        printf("%d %d\n", 1, n-1);
    }
    return 0;
}

---

1325B - CopyCopyCopyCopyCopy[思维]

time limit per test	memory limit per test	input	output
1 seconds	256 megabytes	standard input	standard output

Description:

Ehab has an array a of length $n$. He has just enough free time to make a new array consisting of $n$ copies of the old array, written back-to-back. What will be the length of the new array’s longest increasing subsequence?
A sequence a is a subsequence of an array $b$ if a can be obtained from b by deletion of several (possibly, zero or all) elements. The longest increasing subsequence of an array is the longest subsequence such that its elements are ordered in strictly increasing order.

Input

The first line contains an integer $t$ — the number of test cases you need to solve. The description of the test cases follows.
The first line of each test case contains an integer $n(1\le n\le 10^5)$ — the number of elements in the array $a$.
The second line contains n space-separated integers $a_1,a_2,\dots ,a_n(1\le a_i\le 10^9)$ — the elements of the array $a$.

Output

For each testcase, output the length of the longest increasing subsequence of $a$ if you concatenate it to itself $n$ times.

---

Example input

2
3
3 2 1
6
3 1 4 1 5 9

Example output

3
5

---

分析：
题意：
给一个长度为$n$的数组$a$，数组$a$可以整个长度$n$一起复制一遍，问最后可以得到的最长递增序列长度为多少
做法：
只要统计出现的不同数字的个数

Code:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100 + 5;

map<int, int> mp;

int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        int n, x;
        scanf("%d", &n);
        mp.clear();
        for(int i = 1; i <= n; ++i) {
            scanf("%d", &x);
            mp[x] = 1;
        }
        printf("%d\n", mp.size());
    }
    return 0;
}

---