Submission #1567373
Source Code Expand
#define _USE_MATH_DEFINES #include <iostream> #include <algorithm> #include <cmath> #include <string> #include <utility> #include <climits> #include <vector> #include <map> using namespace std; #define ll long long const int MOD = 1000000007;//10^9+7 int max(int a, int b) { if (a > b)return a; else return b; } //aとbの大きい方 int min(int a, int b) { if (a < b)return a; else return b; } //aとbの小さい方 int avd_i(int a, int b) { if (a > b)return a - b; else return b - a; } double avd_d(double a, double b) { double re; if (a > b)re = a - b; else re = b - a; return re; } //aとbの差の絶対値 ll powsur(ll a, ll b, ll p) { if (b == 0) { return 1; } else if (b % 2 == 0) { ll d = powsur(a, b / 2, p); return ((d%p)*(d%p)) % p; } else { return ((a%p)*powsur(a, b - 1, p) % p) % p; } } //pは素数,aのb乗をpで割った余り ll CMOD(ll n, ll r, ll p) { ll a = 1, b = 1, c = 1, re; for (int i = 1; i <= n; i++) { a *= i; a = a%p; } for (int i = 1; i <= r; i++) { b *= i; b = b%p; } for (int i = 1; i <= n - r; i++) { c *= i; c = c%p; } b = powsur(b, p - 2, p); c = powsur(c, p - 2, p); re = ((a%p)*(b%p)) % p; re = ((re%p)*c%p) % p; return re; } //pは素数,(nCr)%p int main() { int X; cin >> X; cout << X / 10 + X % 10 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 加算王 |
User | pelno |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1462 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt |
All | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 1 ms | 256 KB |
subtask0-sample02.txt | AC | 1 ms | 256 KB |
subtask0-sample03.txt | AC | 1 ms | 256 KB |
subtask1-01.txt | AC | 1 ms | 256 KB |
subtask1-02.txt | AC | 1 ms | 256 KB |
subtask1-03.txt | AC | 1 ms | 256 KB |
subtask1-04.txt | AC | 1 ms | 256 KB |
subtask1-05.txt | AC | 1 ms | 256 KB |
subtask1-06.txt | AC | 1 ms | 256 KB |
subtask1-07.txt | AC | 1 ms | 256 KB |
subtask1-08.txt | AC | 1 ms | 256 KB |
subtask1-09.txt | AC | 1 ms | 256 KB |
subtask1-10.txt | AC | 1 ms | 256 KB |
subtask1-11.txt | AC | 1 ms | 256 KB |
subtask1-12.txt | AC | 1 ms | 256 KB |