我被给了这个问题。 n = 77
n = p*q
p and q is a prime number
用蛮力做p和q的发现者。 我迄今为止代码： public class If {
public static void main(String[] args) {
int p = 3, q = 3;
int n = 77;
int tem
我想写一个蛮力算法，尽量减少一群奶牛的旅程，受条件在文档字符串。 def brute_force_cow_transport(cows,limit=10):
"""
Finds the allocation of cows that minimizes the number of spaceship trips
via brute force. The brute f