Submission #1365675
Source Code Expand
#include<iostream> #include<vector> #include<string> #include<algorithm> using namespace std; int itti(int a, int b) { string sa = to_string(a), sb = to_string(b); int res = 0; for (int i = 0; i < 3; i++) { if (sa[i] == sb[i])res++; } return res; } vector<int>ak, bk; int main() { int a, b; cin >> a >> b; for (int i = 100; i < 1000; i++) { if (itti(i, a) > 1) { ak.push_back(i); } if (itti(i, b) > 1) { bk.push_back(i); } } int ans = -1e9; for (int i = 0; i < ak.size(); i++) { ans = max(ans, ak[i] - b); } for (int i = 0; i <bk.size(); i++) { ans = max(ans, a - bk[i]); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - A - B problem |
User | Rho17 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 668 Byte |
Status | AC |
Exec Time | 2 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 | 2 ms | 256 KB |
ansneg_1.txt | AC | 2 ms | 256 KB |
ansneg_2.txt | AC | 2 ms | 256 KB |
ansneg_3.txt | AC | 2 ms | 256 KB |
ansneg_4.txt | AC | 2 ms | 256 KB |
ansneg_5.txt | AC | 2 ms | 256 KB |
ansneg_6.txt | AC | 2 ms | 256 KB |
ansneg_7.txt | AC | 2 ms | 256 KB |
ansneg_8.txt | AC | 2 ms | 256 KB |
ansneg_9.txt | AC | 2 ms | 256 KB |
handmade_0.txt | AC | 2 ms | 256 KB |
handmade_1.txt | AC | 2 ms | 256 KB |
random_0.txt | AC | 2 ms | 256 KB |
random_1.txt | AC | 2 ms | 256 KB |
random_2.txt | AC | 2 ms | 256 KB |
random_3.txt | AC | 2 ms | 256 KB |
random_4.txt | AC | 2 ms | 256 KB |
random_5.txt | AC | 2 ms | 256 KB |
random_6.txt | AC | 2 ms | 256 KB |
random_7.txt | AC | 2 ms | 256 KB |
random_8.txt | AC | 2 ms | 256 KB |
random_9.txt | AC | 2 ms | 256 KB |
sample_0.txt | AC | 2 ms | 256 KB |
sample_1.txt | AC | 2 ms | 256 KB |
sample_2.txt | AC | 2 ms | 256 KB |
top2fixed_0.txt | AC | 2 ms | 256 KB |
top2fixed_1.txt | AC | 2 ms | 256 KB |
top2fixed_2.txt | AC | 2 ms | 256 KB |
top2fixed_3.txt | AC | 2 ms | 256 KB |
top2fixed_4.txt | AC | 2 ms | 256 KB |
top2fixed_5.txt | AC | 2 ms | 256 KB |
top2fixed_6.txt | AC | 2 ms | 256 KB |
top2fixed_7.txt | AC | 2 ms | 256 KB |
top2fixed_8.txt | AC | 2 ms | 256 KB |
top2fixed_9.txt | AC | 2 ms | 256 KB |
topfixed_0.txt | AC | 2 ms | 256 KB |
topfixed_1.txt | AC | 2 ms | 256 KB |
topfixed_2.txt | AC | 2 ms | 256 KB |
topfixed_3.txt | AC | 2 ms | 256 KB |
topfixed_4.txt | AC | 2 ms | 256 KB |
topfixed_5.txt | AC | 2 ms | 256 KB |
topfixed_6.txt | AC | 2 ms | 256 KB |
topfixed_7.txt | AC | 2 ms | 256 KB |
topfixed_8.txt | AC | 2 ms | 256 KB |
topfixed_9.txt | AC | 2 ms | 256 KB |