MCES10 commited on
Commit
2201486
·
verified ·
1 Parent(s): 5b74d21

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +38 -1
README.md CHANGED
@@ -7,4 +7,41 @@ base_model:
7
  pipeline_tag: text-generation
8
  tags:
9
  - code,
10
- ---
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
7
  pipeline_tag: text-generation
8
  tags:
9
  - code,
10
+ ---
11
+
12
+ # Code Generation and Problem Solving
13
+
14
+ ## Google's Gemma 2 2b it
15
+ ## Fine Tuned on Kaggle Dataset https://www.kaggle.com/datasets/thedevastator/coding-questions-with-solutions
16
+ ## Text Generation
17
+ Example:
18
+
19
+ Input:
20
+ ==========
21
+ Question: If Mikhail goes from the point $(x1, y1)$ to the point $(x2, y2)$ in one move, and $x1 \ne x2$ and $y1 \ne y2$, then such a move is called a diagonal move. Mikhail has $q$ queries. For the $i$-th query Mikhail's target is to go to the point $(n_i, m_i)$ from the point $(0, 0)$ in exactly $k_i$ moves. Among all possible movements he want to choose one with the maximum number of diagonal moves. Your task is to find the maximum number of diagonal moves or find that it is impossible to go from the point $(0, 0)$ to the point $(n_i, m_i)$ in $k_i$ moves. Note that Mikhail can visit any point any number of times (even the destination point!).
22
+
23
+ Output:
24
+ ==========
25
+ Let's break down this problem step-by-step.
26
+
27
+ **Understanding the Problem**
28
+
29
+ * **Mikhail's Moves:** Mikhail can move diagonally, meaning he can move in a way that forms a diagonal line between two points.
30
+ * **Queries:** Mikhail has a set of queries, each representing a target point.
31
+ * **Target Point:** The target point is the point Mikhail wants to reach.
32
+ * **Moves:** The number of moves Mikhail needs to make to reach the target point.
33
+ * **Diagonal Moves:** The maximum number of diagonal moves Mikhail can make.
34
+
35
+ **Analyzing the Problem**
36
+
37
+ The problem is about finding the maximum number of diagonal moves Mikhail can make to reach a target point.
38
+
39
+ **Key Concepts**
40
+
41
+ * **Diagonal Movement:** Mikhail can move diagonally, meaning he can move in a way that forms a diagonal line between two points.
42
+ * **Distance:** The distance between two points is important to determine the number of moves.
43
+ ...
44
+ ==========
45
+ Prompt: 149 tokens, 386.395 tokens-per-sec
46
+ Generation: 460 tokens, 24.677 tokens-per-sec
47
+ Peak memory: 5.358 GB