Submission #3041198

---

Source Code Expand

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<deque>
#include<map>
#include<queue>
using namespace std;
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
static const ll maxLL = (ll)1 << 62;
const int mod=1000000007;
int dy[]={-1,0,1,0};
int dx[]={0,1,0,-1};

int solve(int a){
    int res=0;
    while(a){
        res+=a%10;
        a/=10;
    }
    return res;
}

//#define int ll
signed main(){
    int n;
    cin>>n;
    int ans=1<<30;
    rep(i,1,n){
        int x=solve(i)+solve(n-i);
        ans=min(ans,x);
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result