【Magicoder】ChatGPTとGeminiを超えていると噂の小規模言語モデルを比較レビューしてみた

■使用したGPU
・T4

■Pythonのバージョン
・Python 3.10.12

■必要なパッケージ/ライブラリ
・transformers
・accelerate

!pip install transformers accelerate

from transformers import pipeline
import torch

MAGICODER_PROMPT = """You are an exceptionally intelligent coding assistant that consistently delivers accurate and reliable responses to user instructions.

@@ Instruction
{instruction}

@@ Response
"""
generator = pipeline(
    model="ise-uiuc/Magicoder-S-DS-6.7B",
    task="text-generation",
    torch_dtype=torch.bfloat16,
    device_map="auto",
)

instruction = "ここにプロンプトを入力してください"

prompt = MAGICODER_PROMPT.format(instruction=instruction)
result = generator(prompt, max_length=2048, num_return_sequences=1, temperature=0.0)
print(result[0]["generated_text"])

instruction = "Please create a program in Python that performs quicksort."

prompt = MAGICODER_PROMPT.format(instruction=instruction)
result = generator(prompt, max_length=2048, num_return_sequences=1, temperature=0.0)
print(result[0]["generated_text"])

@@ Instruction
Please create a program in Python that performs quicksort.

@@ Response
Sure, here is a simple implementation of quicksort in Python:

```python
def quicksort(arr):
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    return quicksort(left) + middle + quicksort(right)

print(quicksort([3,6,8,10,1,2,1]))
```

This program works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted.

Please note that quicksort is not a stable sort, meaning that equal elements may not retain their original order. If you need a stable sort, you should use a different algorithm, such as mergesort.

Please create a program in Python that performs quicksort.
【日本語訳】
Pythonでクイックソートを行うプログラムを作ってください

def quicksort(arr):
    if len(arr) <= 1:
        return arr

    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]

    return quicksort(left) + middle + quicksort(right)

# Example usage:
if __name__ == "__main__":
    unsorted_list = [3, 6, 8, 10, 1, 2, 1]
    sorted_list = quicksort(unsorted_list)
    print("Unsorted list:", unsorted_list)
    print("Sorted list:", sorted_list)

【実行結果】
Unsorted list: [3, 6, 8, 10, 1, 2, 1]
Sorted list: [1, 1, 2, 3, 6, 8, 10]

def quicksort(arr):
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    return quicksort(left) + middle + quicksort(right)

# Example usage
arr = [3, 6, 8, 10, 1, 2, 1]
sorted_arr = quicksort(arr)
print(sorted_arr)

【実行結果】
[1, 1, 2, 3, 6, 8, 10]

def quick_sort(arr):
   if len(arr) <= 1:
       return arr
   else:
       pivot = arr[0]
       lesser = [i for i in arr[1:] if i < pivot]
       greater = [i for i in arr[1:] if i >= pivot]
       return quick_sort(lesser) + [pivot] + quick_sort(greater)
n=int(input())
arr=[int(x) for x in input().split()]
print(*quick_sort(arr))

【実行結果】
5 #ソートする数字の数
1 3 2 5 4　#ソートする数字
1 2 3 4 5 #ソート結果

def partition(data, low, high):
  """
  This function partitions the data around a pivot element.

  Args:
    data: The list of data to be partitioned.
    low: The starting index of the data to be partitioned.
    high: The ending index of the data to be partitioned.

  Returns:
    The index of the pivot element after partitioning.
  """
  pivot = data[high]
  i = low - 1
  for j in range(low, high):
    if data[j] <= pivot:
      i += 1
      data[i], data[j] = data[j], data[i]
  data[i + 1], data[high] = data[high], data[i + 1]
  return i + 1

def quicksort(data, low, high):
  """
  This function sorts the data using the quicksort algorithm.

  Args:
    data: The list of data to be sorted.
    low: The starting index of the data to be sorted.
    high: The ending index of the data to be sorted.
  """
  if low < high:
    pi = partition(data, low, high)
    quicksort(data, low, pi - 1)
    quicksort(data, pi + 1, high)

# Example usage
data = [8, 7, 2, 1, 0, 9, 6, 5, 3, 4]
quicksort(data, 0, len(data) - 1)
print(data)

【実行結果】
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

Please write Python code to output the Fibonacci sequence until a number greater than or equal to 100 is reached.
【日本語訳】
フィボナッチ数列を100以上の数値が出るまで出力するコードをPythonで書いてください。

def fibonacci():
    a, b = 0, 1
    while True:
        print(a)
        a, b = b, a + b
        if a > 100:
            break

fibonacci()

【実行結果】
0 1 1 2 3 5 8 13 21 34 55 89

# Function to generate the Fibonacci sequence
def generate_fibonacci_sequence():
    a, b = 0, 1
    while True:
        yield a
        a, b = b, a + b

# Print Fibonacci numbers until reaching a number greater than 100
for num in generate_fibonacci_sequence():
    if num > 100:
        break
    print(num)

【実行結果】
0 1 1 2 3 5 8 13 21 34 55 89

def fibonacci_sequence_until_100():
    a, b = 0, 1
    while a <= 100:
        print(a, end=" ")
        a, b = b, a + b

# Running the function to print the Fibonacci sequence up to 100
fibonacci_sequence_until_100()

【実行結果】
0 1 1 2 3 5 8 13 21 34 55 89 

def fibo(n):
   if n == 0: return 0
   elif n == 1: return 1
   else: return fibo(n-1) + fibo(n-2)
n=int(input())
while True:
   print(fibo(n))
   n+=1

【実行結果】
エラー

def fibonacci():
  """
  This function generates the Fibonacci sequence.

  Yields:
    The next number in the Fibonacci sequence.
  """
  a, b = 0, 1
  while True:
    yield a
    a, b = b, a + b

# Print the Fibonacci sequence until a number greater than or equal to 100 is reached
for number in fibonacci():
  if number >= 100:
    break
  print(number)

【実行結果】
0 1 1 2 3 5 8 13 21 34 55 89

Implement a high-level API for a TODO list application. 
The API takes as input an operation request and updates the TODO list in place. 
If the request is invalid, raise an exception.

【日本語訳】
TODOリストアプリケーションのための高水準APIを実装してください。
このAPIは操作リクエストを入力として受け取り、TODOリストをその場で更新します。
リクエストが無効であれば、例外を発生させてください。

class TodoList:
    def __init__(self):
        self.tasks = []

    def add_task(self, task):
        if not isinstance(task, str):
            raise ValueError("Task must be a string")
        self.tasks.append({"task": task, "completed": False})

    def remove_task(self, task):
        if not isinstance(task, str):
            raise ValueError("Task must be a string")
        self.tasks = [t for t in self.tasks if t["task"]!= task]

    def complete_task(self, task):
        if not isinstance(task, str):
            raise ValueError("Task must be a string")
        for t in self.tasks:
            if t["task"] == task:
                t["completed"] = True
                break
        else:
            raise ValueError("Task not found")

    def get_tasks(self):
        return [t for t in self.tasks if not t["completed"]]

    def get_completed_tasks(self):
        return [t for t in self.tasks if t["completed"]]

todo = TodoList()
todo.add_task("Buy groceries")
todo.add_task("Finish project")
todo.complete_task("Buy groceries")
print(todo.get_tasks())  # Output: ['Finish project']
print(todo.get_completed_tasks())  # Output: ['Buy groceries']

【実行結果】
[{'task': 'Buy groceries', 'completed': False}]
[{'task': 'Finish project', 'completed': True}]

class TodoList:
    def __init__(self):
        self.tasks = []

    def add_task(self, task):
        if not task:
            raise ValueError("Task cannot be empty.")
        self.tasks.append(task)

    def remove_task(self, task):
        if task not in self.tasks:
            raise ValueError(f"Task '{task}' not found in the list.")
        self.tasks.remove(task)

    def update_task(self, old_task, new_task):
        if old_task not in self.tasks:
            raise ValueError(f"Task '{old_task}' not found in the list.")
        if not new_task:
            raise ValueError("New task cannot be empty.")
        index = self.tasks.index(old_task)
        self.tasks[index] = new_task

    def list_tasks(self):
        return self.tasks

# Example usage:
try:
    todo_list = TodoList()

    todo_list.add_task("Buy groceries")
    todo_list.add_task("Read a book")

    print("Initial TODO List:")
    print(todo_list.list_tasks())

    todo_list.remove_task("Buy groceries")
    print("TODO List after removing 'Buy groceries':")
    print(todo_list.list_tasks())

    todo_list.update_task("Read a book", "Finish project")
    print("TODO List after updating 'Read a book' to 'Finish project':")
    print(todo_list.list_tasks())

    # Invalid request, attempting to add an empty task
    todo_list.add_task("")
except ValueError as e:
    print(f"Invalid request: {e}")

【実行結果】
Initial TODO List:
['Buy groceries', 'Read a book']
TODO List after removing 'Buy groceries':
['Read a book']
TODO List after updating 'Read a book' to 'Finish project':
['Finish project']
Invalid request: Task cannot be empty.

class TodoList:
    def __init__(self):
        self.tasks = []

    def add_task(self, task):
        if task in self.tasks:
            raise ValueError("Task already exists.")
        self.tasks.append(task)

    def remove_task(self, task):
        if task not in self.tasks:
            raise ValueError("Task does not exist.")
        self.tasks.remove(task)

    def update_task(self, old_task, new_task):
        if old_task not in self.tasks:
            raise ValueError("Old task does not exist.")
        index = self.tasks.index(old_task)
        self.tasks[index] = new_task

    def view_tasks(self):
        return self.tasks

# Example usage
todo = TodoList()
todo.add_task("Buy groceries")
todo.add_task("Read a book")
print(todo.view_tasks())
todo.update_task("Read a book", "Finish reading a book")
todo.remove_task("Buy groceries")
print(todo.view_tasks())

【実行結果】
['Buy groceries', 'Read a book']
['Finish reading a book']

class TodoAPI:
   def __init__(self):
       self._items = []

   def add_item(self, text):
       self._items.append(text)
       return len(self._items) - 1

   def mark_as_done(self, index):
       try:
           self._items[index] += 'x'
       except IndexError as e:
           raise ValueError from e

   def list(self):
       return self._items[:]


todo = TodoAPI()
print(todo.add_item("Buy the milk"))  # => 0
print(todo.mark_as_done(2))  # => None
print(todo.list())  # => ["Buy the milk", "Make blog post"]

【実行結果】
途中、エラーが表示されて中断された。

class TodoList:
  """
  Class representing a TODO list.
  """

  def __init__(self):
    self._tasks = []

  def add_task(self, description):
    """
    Adds a new task to the list.

    Args:
      description: The description of the task.

    Raises:
      ValueError: If the description is empty or already exists.
    """
    if not description:
      raise ValueError("Task description cannot be empty.")
    if description in [task.description for task in self._tasks]:
      raise ValueError("Task with this description already exists.")
    self._tasks.append(Task(description))

  def delete_task(self, description):
    """
    Deletes a task from the list.

    Args:
      description: The description of the task to delete.

    Raises:
      ValueError: If the task does not exist.
    """
    try:
      task_index = self._tasks.index(Task(description))
    except ValueError:
      raise ValueError("Task with this description does not exist.")
    del self._tasks[task_index]

  def mark_completed(self, description):
    """
    Marks a task as completed.

    Args:
      description: The description of the task to mark completed.

    Raises:
      ValueError: If the task does not exist.
    """
    try:
      task = self._tasks[self._tasks.index(Task(description))]
    except ValueError:
      raise ValueError("Task with this description does not exist.")
    task.is_completed = True

  def list_tasks(self, completed=False):
    """
    Lists all the tasks in the list.

    Args:
      completed: Whether to list only completed tasks.

    Returns:
      A list of task descriptions.
    """
    if completed:
      return [task.description for task in self._tasks if task.is_completed]
    return [task.description for task in self._tasks]


class Task:
  """
  Class representing a task.
  """

  def __init__(self, description):
    self.description = description
    self.is_completed = False

  def __eq__(self, other):
    return self.description == other.description

  def __str__(self):
    return f"{self.description} {'(completed)' if self.is_completed else ''}"

todo_list = TodoList()

todo_list.add_task("Buy groceries")
todo_list.add_task("Clean the house")
todo_list.mark_completed("Buy groceries")

for task in todo_list.list_tasks():
  print(task)

# Output:
# Clean the house
# Buy groceries (completed)

todo_list.delete_task("Clean the house")

for task in todo_list.list_tasks(completed=True):
  print(task)

# Output:
# Buy groceries (completed)

【実行結果】
Buy groceries #1回目のprint
Clean the house #1回目のprint
Buy groceries #2回目のprint