Added maximum sum of digits

Author: lordlezehaf

Maximum sum of digits/code.cpp

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+#define MAX 100005
+#define pb push_back
+#define mp make_pair
+#define M 1000000007
+#define fi first
+#define se second
+#define inp(i, n, a) for(int i=0;i<n;i++) cin>>a[i];
+#define int long long
+using namespace std;
+
+int sod(int n)
+{
+	int res = 0;
+	while(n)
+	{
+		res = res + n%10;
+		n /= 10;
+	}
+	return res;
+}
+
+signed main()
+{
+// ios_base::sync_with_stdio(false);
+// cin.tie(NULL);
+
+string n;
+cin >> n;
+string num1 = "", num2 = "";
+for(int i=0; i<n.length(); i++)
+{
+	if(i==0)
+	num1 += (n[i]-1);
+	else
+	num1 += "9";
+}
+int n1 = 0, ori = 0;
+for(int i=0; i<num1.length(); i++)
+{
+	n1 = n1 * 10 + (num1[i]-'0');
+	ori = ori * 10 + (n[i]-'0');
+}
+cout << sod(n1) + sod(ori-n1);
+return 0;
+}

Maximum sum of digits/problem_statement.txt

@@ -0,0 +1,11 @@
+You are given a positive integer n.
+
+Let S(x) be sum of digits in base 10 representation of x, for example, S(123)=1 + 2 + 3 = 6, S(0) = 0.
+
+Your task is to find two integers a,b, such that 0 ≤ a,b ≤n, a + b = n and S(a) + S(b) is the largest possible among all such pairs.
+
+Input
+The only line of input contains an integer n (1 ≤ n ≤ 1012).
+
+Output
+Print largest S(a) + S(b) among all pairs of integers a, b , such that 0 ≤ a, b ≤ n and a + b = n.