oj.hterobot.com的题解

zyc_2024 · 2022-11-25 14:48:20 · 题解

Count: ||

https://oj.hterobot.com/#/

欢迎大家提供题解！

100014

a=input().split(" ")
print(int(a[1])+int(a[0]))

100019

print("Hello,World!")

105345

a=input().split(" ")
print(int(a[1])*int(a[0]))

108799

print(input())
#你干嘛~

105346

print(input().upper())

105348

#include<bits/stdc++.h>
#define _ fixed
#define __ setprecision(3)
using namespace std;
int main(){
    long double a;
    int b;
    cin>>a>>b;
    cout<<_<<__<<a/b;
    cout<<endl;
    cout<<2*b;
    return 0;
}

108801

print("{:.5f}".format(5*(eval(input())-32)/9))

108802

#include<bits/stdc++.h>
using namespace std;int main(){char n;cin>>n;cout<<(int)n;}

108859

#include<bits/stdc++.h>
using namespace std;int main(){int a[3];cin>>a[0]>>a[1]>>a[2];sort(a,a+3);cout<<a[0]<<" "<<a[1]<<" "<<a[2];}

100015

#include<bits/stdc++.h>
using namespace std;
bool N[25][25];long long s[25][25];
int main(){
    s[1][1]=1;int n,m,x,y;cin>>n>>m>>x>>y;
    n++;m++;x++;y++;N[x][y]=1;
    N[x-2][y-1]=1;N[x-2][y+1]=1;
    N[x+2][y-1]=1;N[x+2][y+1]=1;
    N[x-1][y+2]=1;N[x-1][y-2]=1;
    N[x+1][y+2]=1;N[x+1][y-2]=1;
    for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
    if((i!=1||j!=1)&&!N[i][j]){
    s[i][j]=s[i-1][j]+s[i][j-1];}
    }}cout<<s[n][m];return 0;
}

100022

//Na2S2O3?
#include<bits/stdc++.h>
using namespace std;
int main(){
    int a,b,c;
    cin>>a>>b>>c;
    cout<<setw(8)<<a;
    cout<<" ";
    cout<<setw(8)<<b;
    cout<<" ";
    cout<<setw(8)<<c;
    return 0;
}

100024

#include<bits/stdc++.h>
using namespace std;
int main(){
    double a,b,x,y;
    cin>>x>>a>>y>>b;
    cout<<fixed<<setprecision(2)<<(double)((x*a-y*b)/(a-b));
    return 0;
}

100046

print(input()[::-1])

100047

#include<bits/stdc++.h>
using namespace std;
const double pi=3.14;
int main(){
    int n,m;
    cin>>n>>m;
    double t=m*m*pi*n;
    cout<<ceil(20000/t);
    return 0;
}

100069

#include<bits/stdc++.h>
using namespace std;int main(){int n,k=1;cin>>n;while(n>k){n=n-k;k++;}if(k%2==0)cout<<n<<"/"<<(k+1-n);else cout<<k+1-n<<"/"<<n;return 0;}

100107

#include<bits/stdc++.h>
using namespace std;
string mod="0123456789X"; 
int main() {
    string a;
    cin>>a;

    int j=1,temp=0;
    for(int i=0;i<12;i++){
        if(a[i]=='-'){
            continue;
        }
        temp+=(a[i]-'0')*j++;
    }
    temp%=11;

    if(mod[temp]==a[12]){
        cout<<"Right";
    }else{
        a[12]=mod[temp]; 
        cout<<a;
    }
    return 0;
}