include<stdio.h>

include<math.h>

include<string.h>

include <stdbool.h>

define ll long long

#define For(i,a,b) \
int i; \
for(i=a;i<b;i++)
bool isPrime(int n){
if(n<2) return false;
For(i,2,sqrt(n)){
if(n%i==0) return false;
}
return true;
}
ll giaithua(ll n){
ll count=1;
n++;
while(n--){
count=n==0?1:n;
}
// printf("%lld\n",count);
return count;
}
void solve(){
// double n,m;
ll n,m,k=0;
// char n[10];
ll a[4],b=0,c;
scanf("%lld %lld %lld",&a[0],&a[1],&a[2]);
For(i,0,3){
For(j,i,3)
if(a[i]>a[j]){
int cmp=a[i];
a[i]=a[j];
a[j]=cmp;
}
}
// m=n;
// printf("%lld\n",n);
printf("%lld\n",a[2]-a[1]+2(a[1]-a[0]));
// printf("%lld\n",a);
}
int main(){
// int t;
// scanf("%d",&t);
// while(t--)
solve();
}

noob
that's it 😀

Helooo everyone

𝓬𝓱𝓸 𝓪𝓷𝓱 𝓶𝓸̣̂𝓽 𝓬𝓱𝓾́𝓽 𝓱𝓲 𝓿𝓸̣𝓷𝓰 𝓭𝓾̛𝓸̛̣𝓬 𝓴𝓱𝓸̂𝓷𝓰𝓰 :>>

include <bits/stdc++.h>

using namespace std;
void solve(){
string s;cin>>s;
bool ans = true;
int t = s.size();
for (int i = 0;i < k/2();i++){
if(s[i] != s[t - i -1])
ans = false;
break;
if (ans) {cout << "YES\n"; return;}
s += s[0];
ans = true;
k = s.size();
for (int i = 0; i < t/2; i++) {
if (s[i] != s[t-i-1]) {
ans = false;
break;
}
}
if (ans) cout << "YES\n";
else cout << "NO\n";
}

int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t; cin >> t;
while (t--) solve();
}

}

\(I don't understand, I don't remember anything!^\)