Submission #405453


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;

int main(){
	int A, B;
	cin >> A >> B;
	int makkusu = -10098;
	for ( int i = 0; i < 3; i++ )
	{
		int p = pow(10, i);
		int x = ( A / p ) % 10;
		makkusu = max(makkusu, ( 9 - x )*p);
	}
	for ( int i = 0; i < 3; i++ )
	{
		int p = pow(10, i);
		int x = ( B / p ) % 10;
		if ( i != 2 )
			makkusu = max(makkusu, ( x - 0 ) *p);
		else
			makkusu = max(makkusu, ( x - 1 ) *p);
	}
	cout << A - B + makkusu << endl;
	return 0;
}

Submission Info

Submission Time
Task A - A - B problem
User toikage
Language C++14 (Clang++ 3.4)
Score 100
Code Size 548 Byte
Status AC
Exec Time 37 ms
Memory 928 KiB

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 25 ms 924 KiB
ansneg_1.txt AC 26 ms 804 KiB
ansneg_2.txt AC 25 ms 928 KiB
ansneg_3.txt AC 26 ms 776 KiB
ansneg_4.txt AC 24 ms 800 KiB
ansneg_5.txt AC 26 ms 800 KiB
ansneg_6.txt AC 24 ms 672 KiB
ansneg_7.txt AC 25 ms 804 KiB
ansneg_8.txt AC 24 ms 672 KiB
ansneg_9.txt AC 24 ms 800 KiB
handmade_0.txt AC 24 ms 800 KiB
handmade_1.txt AC 24 ms 804 KiB
random_0.txt AC 24 ms 700 KiB
random_1.txt AC 25 ms 676 KiB
random_2.txt AC 26 ms 752 KiB
random_3.txt AC 26 ms 796 KiB
random_4.txt AC 26 ms 804 KiB
random_5.txt AC 24 ms 800 KiB
random_6.txt AC 26 ms 676 KiB
random_7.txt AC 25 ms 800 KiB
random_8.txt AC 24 ms 804 KiB
random_9.txt AC 26 ms 804 KiB
sample_0.txt AC 25 ms 796 KiB
sample_1.txt AC 25 ms 804 KiB
sample_2.txt AC 26 ms 796 KiB
top2fixed_0.txt AC 25 ms 924 KiB
top2fixed_1.txt AC 25 ms 800 KiB
top2fixed_2.txt AC 25 ms 804 KiB
top2fixed_3.txt AC 24 ms 800 KiB
top2fixed_4.txt AC 24 ms 924 KiB
top2fixed_5.txt AC 28 ms 748 KiB
top2fixed_6.txt AC 27 ms 772 KiB
top2fixed_7.txt AC 23 ms 916 KiB
top2fixed_8.txt AC 24 ms 792 KiB
top2fixed_9.txt AC 23 ms 792 KiB
topfixed_0.txt AC 25 ms 924 KiB
topfixed_1.txt AC 37 ms 920 KiB
topfixed_2.txt AC 26 ms 676 KiB
topfixed_3.txt AC 25 ms 800 KiB
topfixed_4.txt AC 25 ms 800 KiB
topfixed_5.txt AC 26 ms 916 KiB
topfixed_6.txt AC 26 ms 796 KiB
topfixed_7.txt AC 26 ms 796 KiB
topfixed_8.txt AC 27 ms 796 KiB
topfixed_9.txt AC 27 ms 808 KiB