ABC013B - 錠
問題:B - 錠
#include <algorithm> #include <cmath> #include <cstdio> #include <iostream> using namespace std; int main(void) { int a, b; scanf ("%d", &a); scanf ("%d", &b); printf ("%d\n", min(abs(b - a), 10 - abs(b - a))); return 0; }
問題:B - 錠
#include <algorithm> #include <cmath> #include <cstdio> #include <iostream> using namespace std; int main(void) { int a, b; scanf ("%d", &a); scanf ("%d", &b); printf ("%d\n", min(abs(b - a), 10 - abs(b - a))); return 0; }