1.15补题

F - Yet Another Meme Problem

题意：0-9这十个数字里面的若干个数字组合出一个数，使这个数是N的倍数，求最小的这个这样的数，不存在的话输出-1。

按照数的位数BFS，从小向大枚举就可以保证构造出来的数是递增的，如果不加判断就直接搜索的话，复杂度非常高。因此需要剪枝。

优化方法：如果一个数%N0，那么这个数就是N的倍数。在没有找到的前提下，如果A%NB%N，而且A<B，那么其实我们就可以取A而不取B，因为如果在A末尾增加C可以使得AC%N0，那么BC%N也等于0，易得：如果A和B追加数之后%N0，那么最优条件下追加的数肯定相同。

因此我们只需要维护组合出来的数%N的值即可，如果在搜索的途中出现了相同的%N值，就可以直接忽略了，因为肯定没有前面的优秀。

#include
#include
#include
using namespace std;
#define N 1000020
struct node {
int pre, mod;
char c;
} q[N];
int n, m;
bool v[10010];
void print(int x) {
if (x == 0) return ;
print(q[x].pre);
putchar(q[x].c);
}
int main() {
int cas = 1, t, a[10];
bool vis[10];
while (scanf("%d%d", &n, &m) == 2) {
memset(vis, false, sizeof(vis));
for (int i=0; i<m; i++) {
scanf("%d", &t); vis[t] = true;
}
m = 0;
for (int i=0; i<10; i++) if (!vis[i]) a[m++] = i;
printf("Case %d: ", cas++);

    if (m == 0) {
        puts("-1"); continue;
    }
    memset(v, false, sizeof(v));
    int l = 1, r = 1, ans = -1;
    for (int i=0; i<m; i++) if (a[i]) {
        q[r].pre = 0;
        v[q[r].mod = a[i] % n] = true;
        q[r].c = a[i] + '0';
        if (q[r].mod == 0) { ans = r; break; }
        r++;
    }

    while (l < r && ans == -1) {
        for (int i=0; i<m; i++) {
            q[r].mod = (q[l].mod*10 + a[i])%n;
            if (!v[q[r].mod]) {
                v[q[r].mod] = true;
                q[r].pre = l;
                q[r].c = a[i] + '0';
                if (q[r].mod == 0) { ans = r; break; }
                r++;
            }
        }
        l++;
    }

    if (ans == -1) puts("-1");
    else {
        print(ans); printf("\n");
    }
}


return 0;

}

C - Fadi and LCM

题目：
Today, Osama gave Fadi an integer X, and Fadi was wondering about the minimum possible value of max(a,b) such that LCM(a,b) equals X. Both a and b should be positive integers.

LCM(a,b) is the smallest positive integer that is divisible by both a and b. For example, LCM(6,8)=24, LCM(4,12)=12, LCM(2,3)=6.

Of course, Fadi immediately knew the answer. Can you be just like Fadi and find any such pair?

Input
The first and only line contains an integer X (1≤X≤1012).

Output
Print two positive integers, a and b, such that the value of max(a,b) is minimum possible and LCM(a,b) equals X. If there are several possible such pairs, you can print any.

题意：给定一个数x，找出两个数a,b，使得LCM（a,b）= x；求满足条件并且使max(a,b)尽可能小的a和b。
这题乍一看有点懵，然后看了一下数据范围，发现可以暴力，所以写着试了一发，然后AC；
思路：
Xoxoxo首先判断x是否素数，如果是则输出1和它本身；如果不是，则进行枚举，枚举的复杂度是O(sqrt(n))。

#include
#include
#include
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
bool is_prim(ll x) {
ll m = sqrt(x);
for (ll i = 2; i <= m; i++) {
if (x % i == 0)
return false;
}
return true;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout.tie(0);
ll x; cin >> x;
if (is_prim(x))
cout << "1 " << x << endl;
else {
ll maxn = 0;
for (ll i = 1; i <= sqrt(x); i++) {
if (x % i == 0) {
if (gcd(i, x / i) == 1)
maxn = i;
}
}
if (maxn)
cout << min(x / maxn, maxn) << " " << max(x / maxn, maxn) << endl;
else
cout << "1 " << x << endl;
}
return 0;
}

E - Deadline

题目描述
There are N bugs to be repaired and some engineers whose abilities are roughly equal. And an engineer can repair a bug per day. Each bug has a deadline A[i].

Question: How many engineers can repair all bugs before those deadlines at least?

1<=n<= 1e6. 1<=a[i] <=1e9

输入描述
There are multiply test cases.

In each case, the first line is an integer N , indicates the number of bugs. The next line is n integers indicates the deadlines of those bugs.

输出描述
There are one number indicates the answer to the question in a line for each case.

输入样例
4
1 2 3 4

输出样例
1

最后期限大于1000000的可以直接忽略，从1到1000000遍历一下所需人数的最大值即可，注意：不能用cin输入，效率太低

#include"iostream"
#include"string.h"
#include

int ai;
int ji[max_zhi+20];
int main()
{
int n;
while(cin>>n)
{
memset(ji,0,sizeof(ji));
int mmax=1;
for(int i=0;i<n;i++)
{
scanf("%d",&ai);
if(ai>max_zhi+10) continue;
ji[ai]++;
}
for(int i=1;i<=max_zhi+10;i++)
{
ji[i]+=ji[i-1];
int cha=(ji[i]*1.0)/i+0.9999;
if(cha>mmax) mmax=cha;
}
cout<<mmax<<endl;
}
}