Codeforces Round #620 (Div. 2) A~~D

#include<bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;

int main(){
	int t;
	cin>>t;
	while(t--){
		ll a,b;
		ll x,y;
		cin>>x>>y>>a>>b; 
		ll len = y - x;
		int flag = 0;
		int ans = len/(a+b);
		if(ans * (a+b) == len){
			flag = 1;
			cout<<ans<<endl;
		}
		if(!flag){
			cout<<-1<<endl;
		}
		 
	} 
	return 0;
} 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

string s[105];
string ss[105];
string ans,mmp;
string flag;

map<string,int> st;

int main()
{
	ios::sync_with_stdio(0);
	int n, m;
	cin>>n>>m;
	ans = mmp = ""; //等于空串 
	
	for(int i=1;i<=n;i++)
		cin >> s[i];
		
	for(int i=1;i<=n;i++){
		flag = s[i];
		
		reverse(flag.begin(),flag.end());//将串反转 
		
		if (flag == s[i]){//如果自身时回文串，那么选择一个最大的放中间 
			if (flag.size() > mmp.size()) 
			mmp = flag, ss[i] = "1";//对应位置搞个东西替代 
		} 
		else{
		  ss[i] = flag;//否则就把反转串放入字符串数组 
		}
	}
	
	for(int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			if (s[i] ==ss[j] && st[s[i]] == 0){//原来的串跟反转串相等 
				ans += s[i];//说明存在互为回文的两个串 
				
				flag = s[i];
				st[flag] = 1;//置为1 
				
				reverse(flag.begin(), flag.end());
				st[flag] = 1;//对应的另一个也要，好让不重复加 
			}
			
	if(ans == "" && mmp == ""){
		cout<<0<<endl;
	}
	 
	else{
		flag = ans;//得到另半个的串 
		
		reverse(flag.begin(), flag.end());
		
		int len = ans.size()+mmp.size()+flag.size();
		
		cout<<len<<endl;
		
		cout<<ans<<mmp<<flag<<endl;
	}
	return 0;
}

#include<bits/stdc++.h>
#define maxn 205

using namespace std;
typedef long long ll;

ll t;
ll n,m;

struct node
{
	ll t;
	ll l;
	ll h;
}a[maxn];

int cmpp(node x,node y){
	return x.t < y.t;
}

int main(){
	cin>>t;
	while(t--)
    {
		cin>>n>>m;
		ll minn=m;
		ll maxx=m;
		int  flag=0;
		
		a[0].t=0;
		
		for(int i=1;i<=n;i++){
			cin>>a[i].t>>a[i].l>>a[i].h;
		}
		
		sort(a+1,a+n+1,cmpp);
		
		for(int i=1;i<=n;i++)
		{
			
			ll res=a[i].t-a[i-1].t;
			
			ll temp1=minn-res;//下界 
			
			ll temp2=maxx+res;//上届 
			
			if(temp1>a[i].h || temp2<a[i].l){
				flag = 1;
				break;
			} 
			   
			minn = max(temp1,a[i].l);
			maxx = min(temp2,a[i].h);
		}
		if(flag) 
           cout<<"NO"<<endl;
		else 
            cout<<"YES"<<endl;
	}
	
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
string s;
int n,t;
void Codeforce()
{
    scanf("%d",&n);
    cin >> s;
    int total = 0, ans = n;
    for(int i=0;i<=n-2;i++){
        if (s[i] == '<')
            total++;
        else{
            for(int i=ans-total;i<=ans;i++)
            cout << i << " ";
            ans = ans - total - 1;
            total = 0;
        }
    }
    for (int i = ans - total ; i <= ans && i >= 1 ; i ++)
    cout << i << " ";
    cout << '\n';
    total = 0;
    ans = 1;
    for(int i=0;i<=n-2;i++){
        if (s[i] == '>')
            total++;
        if (s[i] == '<'){
            for(int i=ans+total;i>=ans;i--)
                cout << i << " ";
            ans = ans + total + 1;
            total = 0;
        }
    }
    for (int i = ans + total; i >= ans && i <= n; i--)
        cout << i << " ";
    puts("");
}
int main()
{
	scanf("%d",&t);
	while (t--)
	{
		Codeforce();
	}
	return 0;
}