Submission #3392517
Source Code Expand
#include "bits/stdc++.h" using namespace std; using ll = long long; using ull = unsigned long long; typedef pair< long long, long long > P; typedef pair< long long, P > PP; typedef pair< P, P > PPP; const double DINF = 5e14, eps = 1e-10; const long long MOD = 1e9 + 7, INF = 5e18; const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 }; #define fr first #define sc second #define pb push_back #define eb emplace_back #define ALL(x) (x).begin(),(x).end() int n, ans = 10000; int dig(int s) { int ret = 0; while (s) { ret += s % 10; s /= 10; } return ret; } int main() { cin >> n; for (int a = 1;a < n;a++) { ans = min(ans, dig(a) + dig(n - a)); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Digits Sum |
User | kakakakaneko |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 738 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 764 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt |
All | sample1.txt, sample2.txt, in1.txt, in10.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 5 ms | 764 KB |
in10.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 1 ms | 256 KB |
in3.txt | AC | 2 ms | 256 KB |
in4.txt | AC | 3 ms | 256 KB |
in5.txt | AC | 1 ms | 256 KB |
in6.txt | AC | 3 ms | 256 KB |
in7.txt | AC | 1 ms | 256 KB |
in8.txt | AC | 1 ms | 256 KB |
in9.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 3 ms | 256 KB |