Submission #213482


Source Code Expand

Copy
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <climits>
#include <cassert>
using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> pii;
typedef long long ll;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define fi first
#define se second

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  FOR(i,0,n)
#define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int dx[] = {-1,1,0,0};
const int dy[] = {0,0,1,-1};

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int a, b;

int main(){
    cin >> a >> b;
    cout << min(min(a + 10 - b, abs(a - b)), b + 10 - a) << endl;
    return 0;
}

Submission Info

Submission Time
Task B - 錠
User satashun
Language C++ (G++ 4.6.4)
Score 100
Code Size 2257 Byte
Status AC
Exec Time 24 ms
Memory 928 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 21 ms 928 KB
0_2.txt AC 21 ms 928 KB
0_3.txt AC 21 ms 796 KB
0_4.txt AC 21 ms 804 KB
0_5.txt AC 21 ms 796 KB
0_6.txt AC 20 ms 800 KB
0_7.txt AC 22 ms 916 KB
0_8.txt AC 21 ms 804 KB
0_9.txt AC 21 ms 800 KB
1_0.txt AC 19 ms 800 KB
1_2.txt AC 21 ms 800 KB
1_3.txt AC 20 ms 924 KB
1_4.txt AC 21 ms 800 KB
1_5.txt AC 21 ms 676 KB
1_6.txt AC 20 ms 924 KB
1_7.txt AC 21 ms 800 KB
1_8.txt AC 21 ms 796 KB
1_9.txt AC 21 ms 800 KB
2_0.txt AC 19 ms 672 KB
2_1.txt AC 20 ms 668 KB
2_3.txt AC 21 ms 788 KB
2_4.txt AC 21 ms 672 KB
2_5.txt AC 22 ms 800 KB
2_6.txt AC 22 ms 800 KB
2_7.txt AC 21 ms 916 KB
2_8.txt AC 21 ms 792 KB
2_9.txt AC 21 ms 800 KB
3_0.txt AC 20 ms 800 KB
3_1.txt AC 21 ms 788 KB
3_2.txt AC 21 ms 920 KB
3_4.txt AC 21 ms 800 KB
3_5.txt AC 20 ms 924 KB
3_6.txt AC 20 ms 928 KB
3_7.txt AC 20 ms 796 KB
3_8.txt AC 21 ms 800 KB
3_9.txt AC 21 ms 800 KB
4_0.txt AC 21 ms 924 KB
4_1.txt AC 23 ms 804 KB
4_2.txt AC 21 ms 800 KB
4_3.txt AC 21 ms 736 KB
4_5.txt AC 20 ms 796 KB
4_6.txt AC 21 ms 672 KB
4_7.txt AC 20 ms 800 KB
4_8.txt AC 21 ms 672 KB
4_9.txt AC 23 ms 808 KB
5_0.txt AC 21 ms 796 KB
5_1.txt AC 20 ms 924 KB
5_2.txt AC 20 ms 924 KB
5_3.txt AC 22 ms 800 KB
5_4.txt AC 21 ms 928 KB
5_6.txt AC 24 ms 788 KB
5_7.txt AC 20 ms 672 KB
5_8.txt AC 21 ms 800 KB
5_9.txt AC 21 ms 804 KB
6_0.txt AC 19 ms 796 KB
6_1.txt AC 20 ms 800 KB
6_2.txt AC 22 ms 800 KB
6_3.txt AC 22 ms 800 KB
6_4.txt AC 24 ms 800 KB
6_5.txt AC 20 ms 796 KB
6_7.txt AC 21 ms 760 KB
6_8.txt AC 24 ms 800 KB
6_9.txt AC 22 ms 836 KB
7_0.txt AC 19 ms 924 KB
7_1.txt AC 21 ms 672 KB
7_2.txt AC 22 ms 676 KB
7_3.txt AC 22 ms 800 KB
7_4.txt AC 21 ms 796 KB
7_5.txt AC 21 ms 796 KB
7_6.txt AC 21 ms 668 KB
7_8.txt AC 22 ms 800 KB
7_9.txt AC 21 ms 796 KB
8_0.txt AC 19 ms 800 KB
8_1.txt AC 21 ms 796 KB
8_2.txt AC 20 ms 800 KB
8_3.txt AC 20 ms 916 KB
8_4.txt AC 21 ms 704 KB
8_5.txt AC 19 ms 796 KB
8_6.txt AC 21 ms 920 KB
8_7.txt AC 20 ms 920 KB
8_9.txt AC 20 ms 800 KB
9_0.txt AC 21 ms 928 KB
9_1.txt AC 20 ms 804 KB
9_2.txt AC 21 ms 800 KB
9_3.txt AC 21 ms 924 KB
9_4.txt AC 21 ms 800 KB
9_5.txt AC 20 ms 672 KB
9_6.txt AC 20 ms 796 KB
9_7.txt AC 21 ms 748 KB
9_8.txt AC 21 ms 924 KB