ilosc = int(input())
tab = []
d = 0
wynik = 0
for i in range(ilosc):
a = input()
b = input()
tab.append([])
tab[-1].append(a[0])
tab[-1].append(a[1])
tab[-1].append(b[0])
tab[-1].append(b[1])
print(tab)
for i in range(ilosc):
for y in range(i+1,ilosc):
# print(i, y)
# if (tab[i][0] == tab[y][2] and tab[i][1] == tab[y+d][3]) \
# or (tab[i][1] == tab[y][0] and tab[i][3] == tab[y][2])\
# or (tab[i][2] == tab[y][0] and tab[i][3] == tab[y][1])\
# or (tab[i][0] == tab[y][1] and tab[i][2] == tab[y][3]):
# wynik += 1
#
if tab[i][0] == tab[y][2] and tab[i][1] == tab[y+d][3]:
wynik += 1
else:
if tab[i][1] == tab[y][0] and tab[i][3] == tab[y][2]:
wynik += 1
else:
if tab[i][2] == tab[y][0] and tab[i][3] == tab[y][1]:
wynik += 1
else:
if tab[i][0] == tab[y][1] and tab[i][2] == tab[y][3]:
wynik += 1
print(wynik)
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
2912 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
2912 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1073 ms |
43216 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
2900 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
2900 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |