ismdeep

def is_number(num_str):
    if len(num_str) <= 0:
        return False
    for _item_ in list(num_str):
        if _item_ not in '0123456789':
            return False
    return True


def is_ip(s):

ismdeep

from tkinter import *
from random import randint

width_size = 1920
height_size = 1080
colors = ['red', 'green', 'black', 'yellow', 'blue', 'gray', 'pink', 'purple']
distance = 300
sleep_time = 100
step_count = 1000

ismdeep

from tkinter import *
from random import randint

width_size = 800
height_size = 600

canvas = Canvas(width=width_size, height=height_size)
canvas.pack(expand=YES, fill=BOTH)

colors = ['red', 'green', 'black', 'yellow', 'blue', 'gray', 'pink', 'purple']

ismdeep

从最简单的C语言基础开始，一步一步编写一个选择排序（从小到大）的程序。

ismdeep

#!/usr/bin/env python3

import os
import sys
from prettytable import PrettyTable
from colorama import Fore, Back, Style


def show_help_msg():
    print('''Usage: proxy [on [pac]|off|status]''')

ismdeep

package main

import "sync"

type receiver struct {
	sync.WaitGroup
	data chan int
}

func newReceiver() *receiver {

ismdeep

/*
 * Building Huffman Tree
 * Author: ismdeep
 * */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct Node {
    int id;

ismdeep

// ==UserScript==
// @name         hdu helper
// @namespace    http://tampermonkey.net/
// @version      0.1
// @description  try to take over the world!
// @author       ismdeep
// @require https://code.jquery.com/jquery-2.1.4.min.js
// @match        http://acm.hdu.edu.cn/showproblem.php?pid=*
// @grant        none
// ==/UserScript==