目录

• 「杂题乱写」AGC 003
  • A | Wanna go back home
  • B | Simplified mahjong
  • C | BBuBBBlesort!
  • D | Anticube
  • E | Sequential operations on Sequence
  • F | Fraction of Fractal

如在黑夜中被熄灭了星空　荒原上看不到尽头
只有这一路相随的孤独　是我黑暗中唯一的盟友
如在寒风中被浇灭了篝火　残余的温度也被夺走
已不能分清颤抖着的身体和心哪个更冰冷　视线渐渐模糊

一路上我都在追逐什么　这些渴望哪个真属于我
他人的期待不过是我的枷锁
一路上我都在为何拼搏　这些目标哪个真适合我
从今以后只做属于我的选择

走吧　放下
走吧　放下

背靠着大地用全力深呼吸　手臂不由自主地上举
一定是对跌落的不甘心　不甘心刚到这里就放弃
面朝向天际重新起身站立　心也以脉搏给出回应
踏出的步伐向远方的黎明有力并始终坚信　日出的光明

一边走一边看四周风景　才发现被忽略过的美丽
所有的感受都将被铭记在心　不必劳烦群星指引
第一道曙光已划破天际　也知晓黑夜会再次光临
如今我已学会在黑夜中前行　已经无所畏惧

走吧　走吧
走吧　再出发

跟随风放飞脑海中的梦想　回应地以坚定的步伐
拥抱海拍打在身上的浪花　让心再次重燃出发
待到再迷茫时回头望　所有脚印会发出光芒
能为你照亮黑夜中专属于你的前行方向

走吧　走吧
走吧　走吧

const ll N = 1e5 + 10;
namespace SOLVE {
	ll n, a[N], b[N], vis[N], ans;
	std::vector <ll> prime;
	std::map <ll, ll> mp;
	inline ll rnt () {
		ll x = 0, w = 1; char c = getchar ();
		while (!isdigit (c)) { if (c == '-') w = -1; c = getchar (); }
		while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
		return x * w;
	}
	inline void Pre () {
		_for (i, 2, 2160) {
			if (!vis[i]) prime.push_back (i);
			far (j, prime) {
				if (i * j > 2160) break;
				vis[i * j] = 1;
				if (!(i % j)) break;
			}
		}
		return;
	}
	inline void In () {
		n = rnt ();
		_for (i, 1, n) a[i] = rnt ();
		return;
	}
	inline void Solve () {
		Pre ();
		_for (i, 1, n) {
			far (j, prime) {
				ll x = j * j * j;
				while (!(a[i] % x)) a[i] /= x;
			}
			ll qwq = a[i]; ++mp[a[i]], b[i] = 1;
			far (j, prime) {
				if (qwq % j) continue;
				if (!(qwq % (j * j))) b[i] *= j;
				else b[i] *= j * j;
				while (!(qwq % j)) qwq /= j;
			}
			ll s = (ll)(sqrt (qwq));
			if (s * s == qwq) b[i] *= s;
			else b[i] *= a[i] * a[i];
		}
		_for (i, 1, n) {
			if (a[i] == 1) continue;
			ans += std::max (mp[a[i]], mp[b[i]]);
			mp[a[i]] = mp[b[i]] = 0;
		}
		return;
	}
	inline void Out () {
		printf ("%lld\n", ans + (bool)(mp[1]));
		return;
	}
}

const ll N = 1e5 + 10;
namespace SOLVE {
	ll n, m, t, q[N], c[N], d[N];
	inline ll rnt () {
		ll x = 0, w = 1; char c = getchar ();
		while (!isdigit (c)) { if (c == '-') w = -1; c = getchar (); }
		while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
		return x * w;
	}
	inline void F (ll l, ll add) {
		ll p = std::lowb (q, t, l) - 1;
		if (!p) d[1] += add, d[l + 1] -= add;
		else c[p] += l / q[p] * add, F (l % q[p], add);
		return;
	}
	inline void In () {
		q[++t] = n = rnt (), m = rnt ();
		_for (i, 1, m) {
			ll x = rnt ();
			while (t && x < q[t]) --t;
			q[++t] = x;
		}
		return;
	}
	inline void Solve () {
		c[t] = 1;
		for_ (i, t, 2) {
			c[i - 1] += q[i] / q[i - 1] * c[i];
			F (q[i] % q[i - 1], c[i]);
		}
		d[1] += c[1], d[q[1] + 1] -= c[1];
		_for (i, 2, n) d[i] += d[i - 1];
		return;
	}
	inline void Out () {
		_for (i, 1, n) printf ("%lld\n", d[i]);
		return;
	}
}