/* //1476 两个数的最小距离 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ long long j=0,k=0,n=0,s=0,min=1000; cin>>n; long long a[1000]; for(int i=1;i<=n;i++){ cin>>a[i]; } min=abs(a[2]-a[1]); for(int i=1;i<=n;i++){ for(j=i+1;j<=n;j++){ s=abs(a[j]-a[i]); if(s<min){ min=s; } } } cout<<min; return 0; } //1477 两个数的最小距离II #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ long long j=0,k=0,n=0,s=0,min=1000,m_a=1,m_b=2; cin>>n; long long a[1000]; for(int i=1;i<=n;i++){ cin>>a[i]; } min=abs(a[2]-a[1]); for(int i=1;i<=n;i++){ for(j=i+1;j<=n;j++){ s=abs(a[j]-a[i]); if(s<min){ min=s; m_a=i; m_b=j; } } } cout<<m_a<<" "<<m_b; return 0; } //1439 字符串拼接 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ char a[1001],b[1001]; int n; cin>>a>>b>>n; strcat(a,b); cout<<a[n-1]; return 0; } //1440 字符串相等判断 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ char a[1001],b[1001]; int n=0; cin>>a>>b; n=strcmp(a,b); if(n==0){ cout<<"yes"; } else { cout<<"no"; } return 0; }*/ //1441 字符串中最大的数字 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ char n[1001],max,l=0; cin>>n; l=strlen(n); for(int i=0;i<l;i++){ if(n[i]>max){ max=n[i]; } } cout<<max; return 0; }