Submission #1481727


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <climits>
#include <cmath>
#include <vector>
#include <string>

#define REP(i, n) for (int i=0;i<(n);i++)
#define FOR(i, a, b) for (int i=(a);i<(b);i++)

using namespace std;

int main() {
    int A, B;
    scanf("%d %d", &A, &B);
    int d;
    d = abs(A-B);
    if(d%10==0) printf("%d\n", d/10);
    else if(d%10==1) printf("%d\n", d/10+1);
    else if(d%10==2) printf("%d\n", d/10+2);
    else if(d%10==3) printf("%d\n", d/10+3);
    else if(d%10==4) printf("%d\n", d/10+2);
    else if(d%10==5) printf("%d\n", d/10+1);
    else if(d%10==6) printf("%d\n", d/10+2);
    else if(d%10==7) printf("%d\n", d/10+3);
    else if(d%10==8) printf("%d\n", d/10+3);
    else if(d%10==9) printf("%d\n", d/10+2);
    return 0;
}

Submission Info

Submission Time
Task B - リモコン
User solighta
Language C++14 (GCC 5.4.1)
Score 100
Code Size 794 Byte
Status AC
Exec Time 0 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &A, &B);
                           ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 35
Set Name Test Cases
All 00_maxdiff.txt, 00_maxret.txt, 00_sample1.txt, 00_sample2.txt, 00_sample3.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 01_rnd_20.txt, 01_rnd_21.txt, 01_rnd_22.txt, 01_rnd_23.txt, 01_rnd_24.txt, 01_rnd_25.txt, 01_rnd_26.txt, 01_rnd_27.txt, 01_rnd_28.txt, 01_rnd_29.txt
Case Name Status Exec Time Memory
00_maxdiff.txt AC 0 ms 128 KB
00_maxret.txt AC 0 ms 128 KB
00_sample1.txt AC 0 ms 128 KB
00_sample2.txt AC 0 ms 128 KB
00_sample3.txt AC 0 ms 128 KB
01_rnd_00.txt AC 0 ms 128 KB
01_rnd_01.txt AC 0 ms 128 KB
01_rnd_02.txt AC 0 ms 128 KB
01_rnd_03.txt AC 0 ms 128 KB
01_rnd_04.txt AC 0 ms 128 KB
01_rnd_05.txt AC 0 ms 128 KB
01_rnd_06.txt AC 0 ms 128 KB
01_rnd_07.txt AC 0 ms 128 KB
01_rnd_08.txt AC 0 ms 128 KB
01_rnd_09.txt AC 0 ms 128 KB
01_rnd_10.txt AC 0 ms 128 KB
01_rnd_11.txt AC 0 ms 128 KB
01_rnd_12.txt AC 0 ms 128 KB
01_rnd_13.txt AC 0 ms 128 KB
01_rnd_14.txt AC 0 ms 128 KB
01_rnd_15.txt AC 0 ms 128 KB
01_rnd_16.txt AC 0 ms 128 KB
01_rnd_17.txt AC 0 ms 128 KB
01_rnd_18.txt AC 0 ms 128 KB
01_rnd_19.txt AC 0 ms 128 KB
01_rnd_20.txt AC 0 ms 128 KB
01_rnd_21.txt AC 0 ms 128 KB
01_rnd_22.txt AC 0 ms 128 KB
01_rnd_23.txt AC 0 ms 128 KB
01_rnd_24.txt AC 0 ms 128 KB
01_rnd_25.txt AC 0 ms 128 KB
01_rnd_26.txt AC 0 ms 128 KB
01_rnd_27.txt AC 0 ms 128 KB
01_rnd_28.txt AC 0 ms 128 KB
01_rnd_29.txt AC 0 ms 128 KB