Submission #2698522

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const int mod=1000000007;
const ll oo=1e18;
int dx[8]={1,-1,0,0,1,-1,1,-1};
int dy[8]={0,0,1,-1,1,-1,-1,1};
const int N=102050;
bool srt(pair<int,int>a,pair<int,int>b){
    return a.first!=b.first?a.first>b.first:a.second<b.second;
}

int main(){
    int n;
    cin>>n;
    int mn=1e9;
    for(int i=1;i<=n-1;i++){
        int a=i,b=n-i;
        int s=0;
        //cout<<a<<' '<<b<<' ';
        while(a>0){
            s+=(a%10);
            a/=10;
        }
        while(b>0){
            s+=(b%10);
            b/=10;
        }
        mn=min(mn,s);
    }
    cout<<mn<<endl;
    return 0;
}

Submission Info

Judge Result