class Solution:def generateTheString(self, n: int) -> str:if n % 2 == 0:return "a"+"b"*(n-1)return "a"*n

        class Solution {public:int numTimesAllBlue(vector<int>& light) {int res = 0, maxx = 0;for (int i = 0, sz = light.size(); i < sz; ++i) {maxx = max(maxx, light[i]);if (maxx == i + 1) res++;}return res;}
};

        class Solution {public:static const int MAXN = 50010;int bit[MAXN];int numTimesAllBlue(vector<int>& light) {memset(bit, 0, sizeof bit);int maxx = 0, res = 0;for (int i = 0, sz = light.size(); i < sz; ++i) {add(light[i], 1);maxx = max(maxx, light[i]);if (sum(maxx) == maxx) res++;}return res;}int lowbit(int x) {return x&(-x);}void add(int i, int x) {while (i < MAXN) {bit[i] += x;i += lowbit(i);}}void sub(int i, int x) {while (i < MAXN) {bit[i] -= x;i += lowbit(i);}}int sum(int i) {int s = 0;while (i > 0) {s += bit[i];i -= lowbit(i);}return s;}
};

        class Solution {public:static const int N = 100010;vector<int> G[N];int numOfMinutes(int n, int headID, vector<int>& manager, vector<int>& informTime) {for (int i = 0; i < n; ++i) {if (manager[i] != -1) {G[manager[i]].push_back(i);}}return f(headID, informTime);}int f(int headID, vector<int>& informTime) {if (!informTime[headID]) return 0;int maxx = 0;for (int i = 0, sz = G[headID].size(); i < sz; ++i) {maxx = max(maxx, f(G[headID][i], informTime));}return maxx+informTime[headID];}
};

        class Solution {public:double frogPosition(int n, vector<vector<int>>& edges, int t, int target) {if (n == 1) return 1.0;vector<vector<int>> G(110);for (int i = 0; i < n-1; ++i) {int u = edges[i][0], v = edges[i][1];G[u].push_back(v);G[v].push_back(u);}return dfs(1, 0, t, target, G);}double dfs(int u, int fa, int t, int target, vector<vector<int>>& G) {int sz = G[u].size();if (!t || (fa && sz == 1)) {if (u == target) return 1;else return 0;}   double p = 1.0 / (fa ? sz-1 : sz), maxx = 0;for (int i = 0, sz = G[u].size(); i < sz; ++i) {int v = G[u][i];if (v == fa) continue;maxx = max(maxx, dfs(v, u, t-1, target, G));}return p*maxx;}
};