Submission #1079499


Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
 
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  int a, b;
  scanf("%d %d", &a, &b);
  
  int append = 0;
  append = max(append, 900 - a/100*100);
  append = max(append, 90 - a%100/10*10);
  append = max(append, 9 - a%10);
  append = max(append, b/100*100 - 100);
  append = max(append, b%100/10*10);
  append = max(append, b%10);
  printf("%d\n", a - b + append);
 
  return 0;
}

Submission Info

Submission Time
Task A - A - B problem
User tspcx
Language C++14 (Clang++ 3.4)
Score 100
Code Size 1259 Byte
Status AC
Exec Time 18 ms
Memory 928 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 42
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, 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 17 ms 840 KB
ansneg_1.txt AC 17 ms 924 KB
ansneg_2.txt AC 16 ms 800 KB
ansneg_3.txt AC 18 ms 928 KB
ansneg_4.txt AC 18 ms 672 KB
ansneg_5.txt AC 17 ms 796 KB
ansneg_6.txt AC 17 ms 796 KB
ansneg_7.txt AC 16 ms 796 KB
ansneg_8.txt AC 17 ms 920 KB
ansneg_9.txt AC 18 ms 924 KB
handmade_0.txt AC 18 ms 800 KB
handmade_1.txt AC 18 ms 800 KB
random_0.txt AC 18 ms 672 KB
random_1.txt AC 18 ms 924 KB
random_2.txt AC 18 ms 924 KB
random_3.txt AC 18 ms 672 KB
random_4.txt AC 18 ms 844 KB
random_5.txt AC 18 ms 672 KB
random_6.txt AC 16 ms 928 KB
random_7.txt AC 17 ms 924 KB
random_8.txt AC 18 ms 796 KB
random_9.txt AC 17 ms 788 KB
sample_0.txt AC 18 ms 800 KB
sample_1.txt AC 17 ms 800 KB
sample_2.txt AC 17 ms 800 KB
top2fixed_0.txt AC 18 ms 928 KB
top2fixed_1.txt AC 18 ms 672 KB
top2fixed_2.txt AC 18 ms 924 KB
top2fixed_3.txt AC 18 ms 924 KB
top2fixed_4.txt AC 18 ms 796 KB
top2fixed_5.txt AC 16 ms 920 KB
top2fixed_6.txt AC 18 ms 800 KB
top2fixed_7.txt AC 18 ms 800 KB
top2fixed_8.txt AC 18 ms 924 KB
top2fixed_9.txt AC 17 ms 800 KB
topfixed_0.txt AC 18 ms 836 KB
topfixed_1.txt AC 16 ms 920 KB
topfixed_2.txt AC 16 ms 800 KB
topfixed_3.txt AC 18 ms 928 KB
topfixed_4.txt AC 18 ms 800 KB
topfixed_5.txt AC 18 ms 924 KB
topfixed_6.txt AC 16 ms 800 KB
topfixed_7.txt AC 18 ms 800 KB
topfixed_8.txt AC 16 ms 928 KB
topfixed_9.txt AC 16 ms 924 KB