#include<bits/stdc++.h>usingnamespace std;#define int long longconstint mod =998244353;
vector<int>a((int)2e6);signedmain(){int n;
cin >> n;for(int i =0; i < n; i++){
cin >> a[i];int num = a[i];int sum =0;while(1){while(num){
sum += num %10;
num /=10;}if(sum <10)break;
num = sum;
sum =0;}
a[i]= sum;}int ans[11]={0};
ans[0]=1;for(int i =0; i < n; i++){
vector<int>ve(11,0);for(int j =0; j <=9; j++){int u = a[i]+ j;if(u>9) u = u%10+u/10;
ve[u]= ans[j];
ve[u]%= mod;}
ve[a[i]]++;for(int j =0; j <=9; j++){
ans[j]+= ve[j];
ans[j]%= mod;}}for(int i =1; i <=9; i++){
cout << ans[i]<<" ";}}
#include<bits/stdc++.h>usingnamespace std;
vector<int>a((int)2e6),sum((int)2e6,0);intmain(){int t;
cin >> t;while(t--){
stack<int> q;int n, m;
cin >> n >> m;for(int i =1; i <= n; i++){
cin >> a[i];if(a[i]< m)
a[i]=-1;else
a[i]=1;
sum[i]= a[i]+ sum[i -1];}int ff =1;int res =0;for(int i =1; i <= n; i++){
res += a[i];if(res >0){
q.push(res);
res =0;}else{while(!q.empty()){int sum = q.top();
q.pop();
res += sum;if(res >0){
q.push(res);
res =0;break;}}}}if(q.empty()) cout<<-1<<endl;else cout<<q.size()<<endl;}}
#include<bits/stdc++.h>usingnamespace std;#define int long long#define endl "\n"constint mod =1e9+7;intksm(int a,int b){int ans =1;for(; b; b >>=(int)1){if(b &1)
ans = ans * a % mod;
a = a * a % mod;}return ans;}intinv(int x){returnksm(x,mod-2);}signedmain(){int t,n,m;
cin>>t;while(t--){
cin>>n>>m;int k =ksm(2,n);
cout<<(((m*((k-2+mod)%mod))%mod)*inv(k))%mod<<endl;}}
#include<bits/stdc++.h>usingnamespace std;
vector<pair<int,int>>a((int)2e6);intmain(){int t;
cin >> t;while(t--){int A, B, n;
cin >> A >> B >> n;for(int i =1; i <= A + B;++i){
cin >> a[i].first;if(i <= A)
a[i].second =1;//安静else
a[i].second =0;//闹腾}int ff =1;int cou2 =min(n /2, B);sort(a.begin()+1, a.begin()+1+ A + B);int res =0;int cou =0;for(int i = A + B; i >=1; i--){if(a[i].second ==1){
res += a[i].first;
cou++;}else{if(cou2 >0){
res += a[i].first;
cou++;
cou2--;}}if(cou==n)break;}if(cou==n) cout<<res<<endl;else cout<<-1<<endl;}}