func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 3e5 + 100, mod = 998244353;   int n, c[N], s[N];   int qpow(int x, int y) {     int res = 1;     while (y) {       if (y & 1) res = 1ll * res * x % mod;       x = 1ll * x * x % mod, y >>= 1;     }     return res;   }   int main() {     scanf( %d , &n);     for (int i = 1; i <= n; ++i) scanf( %d , &c[i]);     sort(c + 1, c + n + 1), reverse(c + 1, c + n + 1);     for (int i = 1; i <= n; ++i) s[i] = (s[i - 1] + c[i]) % mod;     int iv = qpow(n, mod - 2);     for (int i = 1; i <= n; ++i) {       int ans = 0;       for (int j = i + 1; j <= n; j += i)         ans = (ans + 1ll * (s[min(n, j + i - 1)] - s[j - 1] + mod) *                          ((j - 1) / i) % mod) %               mod;       printf( %lld  , 1ll * ans * iv % mod);     }     return 0;   }   