Submission #213476


Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <string>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
using namespace std;
typedef long long ll;

int main(void) {
  int a, b;
  scanf("%d%d", &a, &b);
  int res = min(abs(a-b), 10-a+b);
  
  printf("%d\n", res);

  return 0;
}

Submission Info

Submission Time
Task B - 錠
User ush
Language C++ (G++ 4.6.4)
Score 0
Code Size 548 Byte
Status WA
Exec Time 25 ms
Memory 928 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 80
WA × 10
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 23 ms 676 KB
0_2.txt AC 21 ms 800 KB
0_3.txt AC 21 ms 804 KB
0_4.txt AC 21 ms 796 KB
0_5.txt AC 21 ms 924 KB
0_6.txt WA 21 ms 928 KB
0_7.txt WA 20 ms 924 KB
0_8.txt WA 21 ms 928 KB
0_9.txt WA 22 ms 920 KB
1_0.txt AC 24 ms 804 KB
1_2.txt AC 22 ms 924 KB
1_3.txt AC 24 ms 796 KB
1_4.txt AC 22 ms 796 KB
1_5.txt AC 22 ms 804 KB
1_6.txt AC 22 ms 676 KB
1_7.txt WA 23 ms 916 KB
1_8.txt WA 22 ms 792 KB
1_9.txt WA 23 ms 796 KB
2_0.txt AC 22 ms 800 KB
2_1.txt AC 23 ms 788 KB
2_3.txt AC 22 ms 800 KB
2_4.txt AC 22 ms 804 KB
2_5.txt AC 21 ms 800 KB
2_6.txt AC 21 ms 800 KB
2_7.txt AC 23 ms 676 KB
2_8.txt WA 23 ms 808 KB
2_9.txt WA 23 ms 788 KB
3_0.txt AC 20 ms 808 KB
3_1.txt AC 21 ms 800 KB
3_2.txt AC 22 ms 924 KB
3_4.txt AC 21 ms 676 KB
3_5.txt AC 22 ms 804 KB
3_6.txt AC 21 ms 796 KB
3_7.txt AC 22 ms 792 KB
3_8.txt AC 22 ms 928 KB
3_9.txt WA 22 ms 800 KB
4_0.txt AC 19 ms 924 KB
4_1.txt AC 21 ms 796 KB
4_2.txt AC 22 ms 804 KB
4_3.txt AC 25 ms 808 KB
4_5.txt AC 25 ms 800 KB
4_6.txt AC 24 ms 800 KB
4_7.txt AC 23 ms 800 KB
4_8.txt AC 23 ms 800 KB
4_9.txt AC 22 ms 676 KB
5_0.txt AC 21 ms 800 KB
5_1.txt AC 21 ms 668 KB
5_2.txt AC 20 ms 796 KB
5_3.txt AC 22 ms 736 KB
5_4.txt AC 21 ms 916 KB
5_6.txt AC 21 ms 796 KB
5_7.txt AC 21 ms 732 KB
5_8.txt AC 23 ms 916 KB
5_9.txt AC 21 ms 800 KB
6_0.txt AC 22 ms 796 KB
6_1.txt AC 21 ms 800 KB
6_2.txt AC 20 ms 792 KB
6_3.txt AC 20 ms 924 KB
6_4.txt AC 21 ms 792 KB
6_5.txt AC 22 ms 808 KB
6_7.txt AC 22 ms 804 KB
6_8.txt AC 21 ms 924 KB
6_9.txt AC 22 ms 804 KB
7_0.txt AC 21 ms 800 KB
7_1.txt AC 21 ms 924 KB
7_2.txt AC 22 ms 924 KB
7_3.txt AC 21 ms 796 KB
7_4.txt AC 20 ms 800 KB
7_5.txt AC 21 ms 676 KB
7_6.txt AC 21 ms 800 KB
7_8.txt AC 22 ms 924 KB
7_9.txt AC 21 ms 796 KB
8_0.txt AC 20 ms 800 KB
8_1.txt AC 20 ms 672 KB
8_2.txt AC 20 ms 924 KB
8_3.txt AC 21 ms 796 KB
8_4.txt AC 23 ms 916 KB
8_5.txt AC 20 ms 924 KB
8_6.txt AC 22 ms 796 KB
8_7.txt AC 21 ms 800 KB
8_9.txt AC 21 ms 920 KB
9_0.txt AC 20 ms 924 KB
9_1.txt AC 22 ms 920 KB
9_2.txt AC 23 ms 800 KB
9_3.txt AC 21 ms 736 KB
9_4.txt AC 21 ms 804 KB
9_5.txt AC 22 ms 840 KB
9_6.txt AC 21 ms 924 KB
9_7.txt AC 23 ms 704 KB
9_8.txt AC 23 ms 800 KB