Submission #2489259
Source Code Expand
#include <iostream> #include <cstdio> #include <iomanip> #include <cmath> #include <string> #include <cstring> #include <algorithm> #include <vector> #include <sstream> #include <set> #include <queue> #include <stack> #include <cctype> #include <map> #include <climits> #include <bitset> using namespace std; #define MATH_PI 3.14159265358979323846 int main(){ ios::sync_with_stdio(false); int n, m, iAns = -100000, x, y; cin >> n >> m; x = n; y = m; iAns = max(iAns, (x % 100 + 900 - y)); iAns = max(iAns, ((x / 100) * 100 + x % 10 + 90) - y); iAns = max(iAns, x + 9 - x % 10 - y); iAns = max(iAns, x - (y % 100 + 100)); iAns = max(iAns, x - ((y / 100) * 100 + y % 10)); iAns = max(iAns, x - (y - y % 10)); cout << iAns << endl; endapp: //system("pause > nul"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A - B problem |
User | luogu_bot2 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 787 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 | sample_0.txt, sample_1.txt, sample_2.txt |
All | ansneg_0.txt, ansneg_1.txt, ansneg_2.txt, ansneg_3.txt, ansneg_4.txt, ansneg_5.txt, ansneg_6.txt, ansneg_7.txt, ansneg_8.txt, ansneg_9.txt, handmade_0.txt, handmade_1.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_0.txt, sample_1.txt, sample_2.txt, top2fixed_0.txt, top2fixed_1.txt, top2fixed_2.txt, top2fixed_3.txt, top2fixed_4.txt, top2fixed_5.txt, top2fixed_6.txt, top2fixed_7.txt, top2fixed_8.txt, top2fixed_9.txt, topfixed_0.txt, topfixed_1.txt, topfixed_2.txt, topfixed_3.txt, topfixed_4.txt, topfixed_5.txt, topfixed_6.txt, topfixed_7.txt, topfixed_8.txt, topfixed_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
ansneg_0.txt | AC | 1 ms | 256 KB |
ansneg_1.txt | AC | 1 ms | 256 KB |
ansneg_2.txt | AC | 1 ms | 256 KB |
ansneg_3.txt | AC | 1 ms | 256 KB |
ansneg_4.txt | AC | 1 ms | 256 KB |
ansneg_5.txt | AC | 1 ms | 256 KB |
ansneg_6.txt | AC | 1 ms | 256 KB |
ansneg_7.txt | AC | 1 ms | 256 KB |
ansneg_8.txt | AC | 1 ms | 256 KB |
ansneg_9.txt | AC | 1 ms | 256 KB |
handmade_0.txt | AC | 1 ms | 256 KB |
handmade_1.txt | AC | 1 ms | 256 KB |
random_0.txt | AC | 1 ms | 256 KB |
random_1.txt | AC | 1 ms | 256 KB |
random_2.txt | AC | 1 ms | 256 KB |
random_3.txt | AC | 1 ms | 256 KB |
random_4.txt | AC | 1 ms | 256 KB |
random_5.txt | AC | 1 ms | 256 KB |
random_6.txt | AC | 1 ms | 256 KB |
random_7.txt | AC | 1 ms | 256 KB |
random_8.txt | AC | 1 ms | 256 KB |
random_9.txt | AC | 1 ms | 256 KB |
sample_0.txt | AC | 1 ms | 256 KB |
sample_1.txt | AC | 1 ms | 256 KB |
sample_2.txt | AC | 1 ms | 256 KB |
top2fixed_0.txt | AC | 1 ms | 256 KB |
top2fixed_1.txt | AC | 1 ms | 256 KB |
top2fixed_2.txt | AC | 1 ms | 256 KB |
top2fixed_3.txt | AC | 1 ms | 256 KB |
top2fixed_4.txt | AC | 1 ms | 256 KB |
top2fixed_5.txt | AC | 1 ms | 256 KB |
top2fixed_6.txt | AC | 1 ms | 256 KB |
top2fixed_7.txt | AC | 1 ms | 256 KB |
top2fixed_8.txt | AC | 1 ms | 256 KB |
top2fixed_9.txt | AC | 1 ms | 256 KB |
topfixed_0.txt | AC | 1 ms | 256 KB |
topfixed_1.txt | AC | 1 ms | 256 KB |
topfixed_2.txt | AC | 1 ms | 256 KB |
topfixed_3.txt | AC | 1 ms | 256 KB |
topfixed_4.txt | AC | 1 ms | 256 KB |
topfixed_5.txt | AC | 1 ms | 256 KB |
topfixed_6.txt | AC | 1 ms | 256 KB |
topfixed_7.txt | AC | 1 ms | 256 KB |
topfixed_8.txt | AC | 1 ms | 256 KB |
topfixed_9.txt | AC | 1 ms | 256 KB |