tj

建议降红

#include<iostream>
#include<vector>
#include<algorithm>
#include<unordered_map>
#include<queue>
#include<cmath>
#include<stack>
#define ll long long
#define si short int
#define INF 0xffffff
using namespace std;
string s;
int main() {
	cin>>s;
	ll sum=0,power=1;
	for(ll i=0;i<s.size()-2;i++) {
		if(s[i]=='-') continue;
		sum=(sum+(power++*(s[i]-'0')))%11;
	}
	if(sum==s[s.size()-1]-'0' || (s[s.size()-1]=='X' && sum==10)) cout<<"Right";
	else {
		s[s.size()-1]=(sum==10?'X':char(sum%11+'0'));
		cout<<s;
	}
}