#include<iostream>#include<bits/stdc++.h>#include<unordered_map>#define int long long#define mk make_pair#define gcd __gcdusingnamespace std;constdouble eps =1e-10;constint mod =10007;constint N =2e5+7;int n,m,k,t =1,cas =1;int a[N],b[N];int c;signedmain(){
cin>>t;while(t--){
cin>>n;for(int i =0; i < n ; i ++) cin>>a[i];//sort(a,a+n);int res =0;for(int i =1; i < n ; i ++){int minn =min(a[i],a[i-1]);int maxx =max(a[i],a[i-1]);while(minn*2< maxx){
minn *=2;
res++;}}
cout<<res<<endl;}return0;}
#include<iostream>#include<bits/stdc++.h>#include<unordered_map>#define int long long#define mk make_pair#define gcd __gcdusingnamespace std;constdouble eps =1e-10;constint mod =10007;constint N =2e5+7;int n,m,k,t =1,cas =1;int a[N],b[N];int c;signedmain(){
cin>>t;while(t--){
cin>>n;int cnt[3]={0};int num = n/3;for(int i =0; i < n ; i ++){
cin>>a[i];
cnt[a[i]%3]++;}//cout<<cnt[0]<<" "<<cnt[1]<<" "<<cnt[2]<<endl;int res =0;if(cnt[0]> num){
res += cnt[0]-num;
cnt[1]+= cnt[0]-num;if(cnt[1]> num){
res += cnt[1]-num;}else{
res +=2*(cnt[2]-num);}}elseif(cnt[1]> num){
res += cnt[1]-num;
cnt[2]+= cnt[1]-num;if(cnt[2]> num){
res += cnt[2]-num;}else{
res +=2*(cnt[0]-num);}}elseif(cnt[2]> num){
res += cnt[2]-num;
cnt[0]+= cnt[2]-num;if(cnt[0]> num){
res += cnt[0]-num;}else{
res +=2*(cnt[1]-num);}}
cout<<res<<endl;}return0;}
#include<iostream>#include<bits/stdc++.h>#include<unordered_map>#define int long long#define mk make_pair#define gcd __gcdusingnamespace std;constdouble eps =1e-10;constint mod =10007;constint N =2e5+7;int n,m,k,t =1,cas =1;int a[N],b[N];int c;
map<int,int> mp;signedmain(){
cin>>t;for(int i =1; i <=10000; i ++){
mp[i*i*i]=1;}while(t--){
cin>>n;int res =0;for(int i =1; i*i*i < n ; i ++){if(mp[n-i*i*i]){
res =1;break;}}puts(res ?"YES":"NO");}return0;}
#include<iostream>#include<bits/stdc++.h>#include<unordered_map>#define int long long#define mk make_pair#define gcd __gcdusingnamespace std;constdouble eps =1e-10;constint mod =10007;constint N =2e5+7;int n,m,k,t =1,cas =1;int a[N],b[N];int c;int dep;int res[N];voiddfs(int l,int r,int depp){if(l >= r)return;int maxi = l;for(int i = l; i < r ; i ++){if(a[i]> a[maxi]) maxi = i;}
res[maxi]= depp;dfs(l,maxi,depp+1);dfs(maxi+1,r,depp+1);}signedmain(){
cin>>t;while(t--){
cin>>n;for(int i =0; i < n ; i ++) cin>>a[i];dfs(0,n,0);for(int i =0; i < n ; i ++){
cout<<res[i]<<" ";}
cout<<endl;}return0;}
#include<iostream>#include<bits/stdc++.h>#include<unordered_map>#define int long long#define mk make_pair#define gcd __gcdusingnamespace std;constdouble eps =1e-10;constint mod =10007;constint N =2e5+7;int n,m,k,t =1,cas =1;//int a[N],b[N];int c;int dep;int sum[N];struct node{int id,x;}a[N];boolcmp(node a1,node a2){if(a1.x == a2.x)return a1.id < a2.id;return a1.x < a2.x;}
map<int,int> mp;signedmain(){
cin>>t;while(t--){
mp.clear();
cin>>n;for(int i =0; i < n ; i ++){
cin>>a[i].x;
a[i].id = i;}sort(a,a+n,cmp);
sum[0]= a[0].x;for(int i =1; i < n ; i ++){
sum[i]= a[i].x+sum[i-1];}
a[n].x =0;for(int i = n-1; i >=0; i --){if(sum[i]< a[i+1].x){break;}
mp[a[i].id]=1;}
vector<int> res;for(int i =0; i < n ; i ++){if(mp[i]){
res.push_back(i+1);}}
cout<<res.size()<<endl;for(auto i : res){
cout<<i<<" ";}
cout<<endl;}return0;}
#include<iostream>#include<bits/stdc++.h>#include<unordered_map>#define int long long#define mk make_pair#define gcd __gcdusingnamespace std;constdouble eps =1e-10;constint mod =10007;constint N =2e5+7;int n,m,k,t =1,cas =1;//int a[N],b[N];int c;int dep;int sum[N];int a[N];
map<int,int> mp;
vector<int> vt;int b[N];signedmain(){
cin>>t;while(t--){
mp.clear();
vt.clear();
cin>>n;for(int i =0; i < n ; i ++){
cin>>a[i];if(mp[a[i]]==0){
vt.push_back(a[i]);}
mp[a[i]]++;}
m = vt.size();for(int i =0; i < m ; i ++){
b[i]= mp[vt[i]];}sort(b,b+m);reverse(b,b+m);int res =0;for(int i =0; i < m ; i ++){
res =max(b[i]*(i+1),res);}
cout<<n-res<<endl;}return0;}