Codeforces/Combination Lock.cpp at master · Shuvro-d/Codeforces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <bits\stdc++.h>
using namespace std;
int main()
{
    int n,i,count=0,move=0;
    string ara_1, ara_2;
    cin >> n >> ara_1 >> ara_2;
    for(i=0; i<n; i++)
    {
        if(ara_1[i]<=5)
        {
            if(ara_1[i]<ara_2[i])
            {
                if(ara_2[i]<=(ara_1[i]+5))
                {
                    count=ara_2[i]-ara_1[i];
                    move=move+count;
                }
                else
                {
                    count=10-(ara_2[i]-ara_1[i]);
                    move=move+count;
                }
            }
            else
            {
                if(ara_2[i]<=(ara_1[i]-5))
                {
                    count=10-(ara_1[i]-ara_2[i]);
                    move=move+count;
                }
                else
                {
                    count=ara_1[i]-ara_2[i];
                    move=move+count;
                }
            }
        }
        else
        {
            if(ara_1[i]<ara_2[i])
            {
                if(ara_2[i]<=(ara_1[i]+5))
                {
                    count=ara_2[i]-ara_1[i];
                    move=move+count;
                }
                else
                {
                    count=10-(ara_2[i]-ara_1[i]);
                    move=move+count;
                }
            }
            else
            {
                if(ara_2[i]<=(ara_1[i]-5))
                {
                   count=10-(ara_1[i]-ara_2[i]);
                    move=move+count;
                }
                else
                {

                     count=ara_1[i]-ara_2[i];
                    move=move+count;
                }
            }
        }
       count=0;
    }
    printf("%d",move);
    return 0;
}