记录这个麻烦的数论题
用的是中国剩余定理(一个数除以Xi的余数为Yi(i >= 0)得到最小值 )
中国剩余定理
//n个方程: x = a[i](mod m[i]) (0 <= i < n)
ll china(int n, int *a, int *m) {
ll M = 1, d, y, x = 0;
for (int i = 1; i <= n; i++)
M *= m[i];
for (int i = 1; i <= n; i++) {
ll w = M / m[i];
exgcd(m[i], w, d, d, y); //因为变量x下面需要用到,而变量d用不到所以这里是用d代替了x。
x = (x + y * w * a[i]) % M;
}
return (x + M) % M;
}
说说题意,要求求一个正整数N,N会满足C个条件,C个条件都是:**N除以X的余数有k个,余数分别表示为Y1,Y2,Y3 … Yk。**所有条件中的X都互质,找出S个N(从最小的那个升序输出)。
思路:
用二维数组存下除以X的余数(Y[X][i] | 1 <= i <= k)。用中国剩余定理算出N放入数组中,从小到大找出所求的N,(如果找完后没有找够S个,那就加M( M为中国剩余定理中的m[i]乘积 )继续找,找完为止),但是中国剩余定理有个缺陷,就是当你每个条件中的k都很大时,花费的时间非常长,很容易TLE,所以我们设定当k的乘积超过一个限度的时候,用暴力枚举的方法找出我们想要的S个答案。暴力枚举:我们先找到k/x最小的那一组(命名为bc),然后将除了bc组以外的每一组的余数放入set中,然后我们枚举bc组的每一个余数y找n(n = x * t + y[i] ( t >= 0 )),然后枚举除bc外的每一组,看n除以每一组的X的余数是否存在。
代码:
#include <bits/stdc++.h>
//#include <iostream>
//#include <cstdio>
//#include <map>
//#include <cmath>
//#include <algorithm>
//#include <cstring>
#define ll long long
using namespace std;
const int N = 4e6 + 10;
const ll mod = 1e9 + 7;
int C;
int X[15], k[15], Y[15][110];
int LIMIT = 10000;
set<int> v[15];
void exgcd(ll a, ll b, ll &d, ll &x, ll &y) {
if (!b) {
d = a;
x = 1;
y = 0;
} else {
exgcd(b, a % b, d, y, x);
y -= x * (a / b);
}
}
ll china(int n, int *a, int *m) {
ll M = 1, d, y, x = 0;
for (int i = 1; i <= n; i++)
M *= m[i];
for (int i = 1; i <= n; i++) {
ll w = M / m[i];
exgcd(m[i], w, d, d, y);
x = (x + y * w * a[i]) % M;
}
return (x + M) % M;
}
void solve_enum(int S, int bc) {
for (int c = 1; c <= C; c++) {
if (c != bc) {
v[c].clear();
for (int i = 1; i <= k[c]; i++)
v[c].insert(Y[c][i]);
}
}
for (int t = 0; S != 0; t++) {
for (int i = 1; i <= k[bc]; i++) {
ll n = (ll) X[bc] * t + Y[bc][i];
if (n == 0)
continue;
int flag = 1;
for (int c = 1; c <= C; c++) {
if (c != bc) {
if (!v[c].count(n % X[c])) {
flag = 0;
break;
}
}
}
if (flag) {
printf("%lld\n", n);
if (--S == 0)
break;
}
}
}
}
int a[15];
vector<ll> sol;
void dfs(int dep) {
if (dep == C + 1)
sol.push_back(china(C, a, X));
else {
for (int i = 1; i <= k[dep]; i++) {
a[dep] = Y[dep][i];
dfs(dep + 1);
}
}
}
void solve_china(int S) {
sol.clear();
dfs(1);
sort(sol.begin(), sol.end());
ll M = 1;
for (int c = 1; c <= C; c++)
M *= X[c];
// vector<ll> ans;
for (int i = 0; S != 0; i++) {
for (int j = 0; j < sol.size(); j++) {
ll n = M * i + sol[j];
if (n == 0)
continue;
if (n > 0) {
printf("%lld\n", n);
if (--S == 0) {
break;
}
}
}
}
}
int main() {
int S;
while (scanf("%d%d", &C, &S) == 2 && C) {
ll tot = 1;
int bc = 1;
for (int c = 1; c <= C; c++) {
scanf("%d%d", &X[c], &k[c]);
tot *= k[c];
for (int i = 1; i <= k[c]; i++)
scanf("%d", &Y[c][i]);
sort(Y[c] + 1, Y[c] + k[c] + 1);
if (k[c] * X[bc] < k[bc] * X[c])
bc = c;
}
if (tot > LIMIT)
solve_enum(S, bc);
else
solve_china(S);
printf("\n");
}
return 0;
}