阿里 4.11 笔试真题 - AI研发岗

def solve(k, m):
    seen = set()
    a = 1
    while a not in seen:
        seen.add(a)
        a = a * k % m
    return len(seen)

k, m = map(int, input().split())
print(solve(k, m))

import sys
input = sys.stdin.readline

T = int(input())
out = []
for _ in range(T):
    n, d = map(int, input().split())
    b = list(map(int, input().split()))

    a = [b[0]]
    for j in range(1, n):
        # b[j] 无法被 b[j-1] 直接保留，需要插入被跳过的值
        if b[j - 1] + d > b[j]:
            a.append(1)
        a.append(b[j])

    out.append(str(len(a)))
    out.append(' '.join(map(str, a)))

print('\n'.join(out))

import sys
input = sys.stdin.readline

def solve():
    n, m = map(int, input().split())
    grid = [input().strip() for _ in range(n)]

    # 计算初始 B-S 差值
    diff = sum(1 if c == 'B' else -1 for row in grid for c in row)
    if diff == 0:
        print(0)
        return

    MAX_D = n * m
    SIZE = 2 * MAX_D + 1
    OFFSET = MAX_D
    INF = float('inf')

    dp = [INF] * SIZE
    dp[OFFSET] = 0
    lo, hi = OFFSET, OFFSET

    for i in range(n):
        # 计算该行每种修正值 delta 所需的最小移除数 k
        first_hit = {0: 0}
        prefix = 0
        for k in range(1, m + 1):
            prefix += 1 if grid[i][k - 1] == 'B' else -1
            if prefix not in first_hit:
                first_hit[prefix] = k

        row_lo = min(first_hit)
        row_hi = max(first_hit)
        new_lo = max(0, lo + row_lo)
        new_hi = min(SIZE - 1, hi + row_hi)

        new_dp = [INF] * SIZE
        for delta, cost in first_hit.items():
            src_lo = max(lo, -delta) if delta < 0 else lo
            src_hi = min(hi, SIZE - 1 - delta) if delta > 0 else hi
            src_lo = max(src_lo, 0)
            src_hi = min(src_hi, SIZE - 1)
            for d in range(src_lo, src_hi + 1):
                nd = d + delta
                if 0 <= nd < SIZE and dp[d] < INF:
                    nc = dp[d] + cost
                    if nc < new_dp[nd]:
                        new_dp[nd] = nc

        dp = new_dp
        lo, hi = new_lo, new_hi

    target = OFFSET + diff
    ans = dp[target] if 0 <= target < SIZE and dp[target] < INF else -1
    print(ans)

T = int(input())
for _ in range(T):
    solve()