题目链接：zoj 3901 Ant 代码 #include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int mod = 1e9+7;ll pow_mod(ll x, int n) {ll ret = 1;while (n) {if (n&1)

题目再现链接: 点击打开链接 Parity check Time Limit: 2000MS  Memory Limit: 524288KB Submit  Statistic Problem Description Fascinated with the computer games, Gabriel even forgets to study. No