forked from FOSSit/leitner
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
21849e7
commit f58ece9
Showing
1 changed file
with
54 additions
and
32 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,42 +1,64 @@ | ||
from collections import defaultdict | ||
from quests import cards | ||
from random import randint | ||
|
||
def main(): | ||
slots = (list(cards.items()), [], []) | ||
box_chance_mul = [4, 2, 1] | ||
while True: | ||
wts = [len(i) * box_chance_mul[idx] for idx, i in enumerate(slots)] | ||
f = randint(1, sum(wts)) - 1 | ||
box_idx = 0 | ||
a = 0 | ||
n = 0 | ||
for idx, i in enumerate(wts): | ||
a += i | ||
if f < a: | ||
box_idx = idx | ||
n = f - a + i | ||
card_stats = defaultdict(lambda: [0, 0]) | ||
try: | ||
while True: | ||
wts = [len(i) * box_chance_mul[idx] for idx, i in enumerate(slots)] | ||
f = randint(1, sum(wts)) - 1 | ||
box_idx = 0 | ||
a = 0 | ||
n = 0 | ||
for idx, i in enumerate(wts): | ||
a += i | ||
if f < a: | ||
box_idx = idx | ||
n = f - a + i | ||
break | ||
box = slots[box_idx] | ||
q, a = box.pop(n // box_chance_mul[box_idx]) | ||
print(chr(27) + "[2J") | ||
print(q) | ||
print("-" * 4) | ||
ans = input("Answer: ") | ||
print(f"The answer was: {a}") | ||
print("=" * 5) | ||
o = input("Were you correct? (Y/n/exit): ") | ||
if not o or o[0].lower() == "y": | ||
box_idx = min(box_idx + 1, len(slots) - 1) | ||
elif o[0].lower() == "n": | ||
box_idx = max(box_idx - 1, 0) | ||
card_stats[q][1] += 1 | ||
else: | ||
break | ||
box = slots[box_idx] | ||
q, a = box.pop(n // box_chance_mul[box_idx]) | ||
print(chr(27) + "[2J") | ||
# print(box_idx, f, n) | ||
print(q) | ||
print("-" * 4) | ||
input("Answer: ") | ||
o = input(f"The answer was: {a}\nWere you correct? (Y/n/exit): ") | ||
print("=" * 5) | ||
if not o or o[0].lower() == "y": | ||
box_idx = min(box_idx + 1, len(slots) - 1) | ||
elif o[0].lower() == "n": | ||
box_idx = max(box_idx - 1, 0) | ||
else: | ||
break | ||
slots[box_idx].append((q, a)) | ||
if len(cards) == len(slots[-1]): | ||
print(f"You have memorised all {len(cards)} cards") | ||
k = input("Exit? (N/y): ") | ||
if o and o[0].lower() == "y": | ||
card_stats[q][0] += 1 | ||
slots[box_idx].append((q, a)) | ||
if len(cards) == len(slots[-1]): | ||
print(f"You have memorized all {len(cards)} cards") | ||
break | ||
except KeyboardInterrupt: | ||
print("\n\nProgram interrupted by user.") | ||
calculate_performance(slots, card_stats) | ||
|
||
def calculate_performance(slots, card_stats): | ||
total_cards = sum(len(slot) for slot in slots) | ||
total_correct = len(slots[-1]) | ||
accuracy = (total_correct / total_cards) * 100 | ||
print("\n\nPerformance Metrics:") | ||
print(f"Total Cards: {total_cards}") | ||
print(f"Total Correct: {total_correct}") | ||
print(f"Accuracy: {accuracy:.2f}%") | ||
|
||
incorrect_percentage = {card: (stats[1] / stats[0]) * 100 if stats[0] != 0 else 0 for card, stats in card_stats.items()} | ||
top_wrong_cards = sorted(incorrect_percentage.items(), key=lambda x: x[1], reverse=True)[:5] | ||
|
||
print("\nTop 5 Wrongly Answered Cards:") | ||
for card, percentage in top_wrong_cards: | ||
print(f"{card}: {percentage:.2f}%") | ||
|
||
if __name__ == "__main__": | ||
main() | ||
main() |