0分求解

#include<bits/stdc++.h>
using namespace std;
int n;
int main(){
    cin >> n;
    int a[1001];
    int maxn = 0;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        int s = 0;
        while(a[i] > 0){
            s  = a[i] % 10;
            a[i] /= 10;
        }
        if(maxn < s){
            maxn = s;
        }
    }
    cout << maxn;
}