노성호 nomore12

## ChatGPT-Dan-Jailbreak.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                nomore12
                / ChatGPT-Dan-Jailbreak.md
            
            
              Created
              March 22, 2023 06:50
                — forked from coolaj86/ChatGPT-Dan-Jailbreak.md
            
          
    Chat GPT "DAN" (and other "Jailbreaks")


https://chat.openai.com/
Is ChatGPT "DAN" Real? Gonna find out [Part 1] 

(https://www.youtube.com/watch?v=-q8woRG9FrI)
Part 2: I thought ChatGPT DAN was a hoax, but... 

(https://www.youtube.com/watch?v=rHZRrDu3A2U&lc=UgxfrxX8aK7gnCzkend4AaABAg)


## create toc
import os
import sys
from pathlib import Path, PureWindowsPath


def main(argv):
    if len(argv) < 3:
        return
    FILENAME = argv[1]
    ADDER = int(argv[2])

## gist:e71a24e1b724d10a6692f125ba15959d
from PIL import Image, ImageDraw, ImageFont
import csv

def get_names():
    f = open("./names.csv", "r", encoding="utf-8")
    rdr = csv.reader(f)

    namelist = []

    for line in rdr:

## cloudSettings
{"lastUpload":"2021-01-11T08:27:46.976Z","extensionVersion":"v3.4.3"}

## cloudSettings
// Empty

## binary search
int B_Search_Recursive(int* searchArray, int searchNumber, int low, int high)
{
    // low는 배열의 첫번째 요소, high는 배열의 마지막(갯수)
    // mid를 low와 high의 중간값으로 설정하여 중간 지점의 값을 찾으려는 값과 비교.
    int mid = (high + low) / 2;
    if(searchArray[mid] == searchNumber)
    {
        return mid;
    }
    else
	import os
	import sys
	from pathlib import Path, PureWindowsPath


	def main(argv):
	if len(argv) < 3:
	return
	FILENAME = argv[1]
	ADDER = int(argv[2])
	from PIL import Image, ImageDraw, ImageFont
	import csv

	def get_names():
	f = open("./names.csv", "r", encoding="utf-8")
	rdr = csv.reader(f)

	namelist = []

	for line in rdr:
	int B_Search_Recursive(int* searchArray, int searchNumber, int low, int high)
	{
	// low는 배열의 첫번째 요소, high는 배열의 마지막(갯수)
	// mid를 low와 high의 중간값으로 설정하여 중간 지점의 값을 찾으려는 값과 비교.
	int mid = (high + low) / 2;
	if(searchArray[mid] == searchNumber)
	{
	return mid;
	}
	else