Submission #1306320


Source Code Expand

#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const int inf = 999999999;
const double pi = acos(-1);

#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define mod(i) ((i)%(ll)(1e9 + 7))
#define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5))))
#define rsort(a,b,c) sort(a, b, greater<c>())

ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;}

///////////////////////////////////////////////////////////////////////////

int main(){
	int a,b;
	cin >> a >> b;

    if(a > b)swap(a,b);
    
	cout << min(b-a,10+a-b ) << endl;
	return 0;
}

Submission Info

Submission Time
Task B - 錠
User hirata0517masato
Language C++14 (GCC 5.4.1)
Score 100
Code Size 763 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 90
Set Name Test Cases
all 0_1.txt, 0_2.txt, 0_3.txt, 0_4.txt, 0_5.txt, 0_6.txt, 0_7.txt, 0_8.txt, 0_9.txt, 1_0.txt, 1_2.txt, 1_3.txt, 1_4.txt, 1_5.txt, 1_6.txt, 1_7.txt, 1_8.txt, 1_9.txt, 2_0.txt, 2_1.txt, 2_3.txt, 2_4.txt, 2_5.txt, 2_6.txt, 2_7.txt, 2_8.txt, 2_9.txt, 3_0.txt, 3_1.txt, 3_2.txt, 3_4.txt, 3_5.txt, 3_6.txt, 3_7.txt, 3_8.txt, 3_9.txt, 4_0.txt, 4_1.txt, 4_2.txt, 4_3.txt, 4_5.txt, 4_6.txt, 4_7.txt, 4_8.txt, 4_9.txt, 5_0.txt, 5_1.txt, 5_2.txt, 5_3.txt, 5_4.txt, 5_6.txt, 5_7.txt, 5_8.txt, 5_9.txt, 6_0.txt, 6_1.txt, 6_2.txt, 6_3.txt, 6_4.txt, 6_5.txt, 6_7.txt, 6_8.txt, 6_9.txt, 7_0.txt, 7_1.txt, 7_2.txt, 7_3.txt, 7_4.txt, 7_5.txt, 7_6.txt, 7_8.txt, 7_9.txt, 8_0.txt, 8_1.txt, 8_2.txt, 8_3.txt, 8_4.txt, 8_5.txt, 8_6.txt, 8_7.txt, 8_9.txt, 9_0.txt, 9_1.txt, 9_2.txt, 9_3.txt, 9_4.txt, 9_5.txt, 9_6.txt, 9_7.txt, 9_8.txt
Case Name Status Exec Time Memory
0_1.txt AC 1 ms 256 KB
0_2.txt AC 1 ms 256 KB
0_3.txt AC 1 ms 256 KB
0_4.txt AC 1 ms 256 KB
0_5.txt AC 1 ms 256 KB
0_6.txt AC 1 ms 256 KB
0_7.txt AC 1 ms 256 KB
0_8.txt AC 1 ms 256 KB
0_9.txt AC 1 ms 256 KB
1_0.txt AC 1 ms 256 KB
1_2.txt AC 1 ms 256 KB
1_3.txt AC 1 ms 256 KB
1_4.txt AC 1 ms 256 KB
1_5.txt AC 1 ms 256 KB
1_6.txt AC 1 ms 256 KB
1_7.txt AC 1 ms 256 KB
1_8.txt AC 1 ms 256 KB
1_9.txt AC 1 ms 256 KB
2_0.txt AC 1 ms 256 KB
2_1.txt AC 1 ms 256 KB
2_3.txt AC 1 ms 256 KB
2_4.txt AC 1 ms 256 KB
2_5.txt AC 1 ms 256 KB
2_6.txt AC 1 ms 256 KB
2_7.txt AC 1 ms 256 KB
2_8.txt AC 1 ms 256 KB
2_9.txt AC 1 ms 256 KB
3_0.txt AC 1 ms 256 KB
3_1.txt AC 1 ms 256 KB
3_2.txt AC 1 ms 256 KB
3_4.txt AC 1 ms 256 KB
3_5.txt AC 1 ms 256 KB
3_6.txt AC 1 ms 256 KB
3_7.txt AC 1 ms 256 KB
3_8.txt AC 1 ms 256 KB
3_9.txt AC 1 ms 256 KB
4_0.txt AC 1 ms 256 KB
4_1.txt AC 1 ms 256 KB
4_2.txt AC 1 ms 256 KB
4_3.txt AC 1 ms 256 KB
4_5.txt AC 1 ms 256 KB
4_6.txt AC 1 ms 256 KB
4_7.txt AC 1 ms 256 KB
4_8.txt AC 1 ms 256 KB
4_9.txt AC 1 ms 256 KB
5_0.txt AC 1 ms 256 KB
5_1.txt AC 1 ms 256 KB
5_2.txt AC 1 ms 256 KB
5_3.txt AC 1 ms 256 KB
5_4.txt AC 1 ms 256 KB
5_6.txt AC 1 ms 256 KB
5_7.txt AC 1 ms 256 KB
5_8.txt AC 1 ms 256 KB
5_9.txt AC 1 ms 256 KB
6_0.txt AC 1 ms 256 KB
6_1.txt AC 1 ms 256 KB
6_2.txt AC 1 ms 256 KB
6_3.txt AC 1 ms 256 KB
6_4.txt AC 1 ms 256 KB
6_5.txt AC 1 ms 256 KB
6_7.txt AC 1 ms 256 KB
6_8.txt AC 1 ms 256 KB
6_9.txt AC 1 ms 256 KB
7_0.txt AC 1 ms 256 KB
7_1.txt AC 1 ms 256 KB
7_2.txt AC 1 ms 256 KB
7_3.txt AC 1 ms 256 KB
7_4.txt AC 1 ms 256 KB
7_5.txt AC 1 ms 256 KB
7_6.txt AC 1 ms 256 KB
7_8.txt AC 1 ms 256 KB
7_9.txt AC 1 ms 256 KB
8_0.txt AC 1 ms 256 KB
8_1.txt AC 1 ms 256 KB
8_2.txt AC 1 ms 256 KB
8_3.txt AC 1 ms 256 KB
8_4.txt AC 1 ms 256 KB
8_5.txt AC 1 ms 256 KB
8_6.txt AC 1 ms 256 KB
8_7.txt AC 1 ms 256 KB
8_9.txt AC 1 ms 256 KB
9_0.txt AC 1 ms 256 KB
9_1.txt AC 1 ms 256 KB
9_2.txt AC 1 ms 256 KB
9_3.txt AC 1 ms 256 KB
9_4.txt AC 1 ms 256 KB
9_5.txt AC 1 ms 256 KB
9_6.txt AC 1 ms 256 KB
9_7.txt AC 1 ms 256 KB
9_8.txt AC 1 ms 256 KB