yuda110

...

<p-field-group :label="name"
               :invalid-text="nameInvalidText"
               :invalid="!nameValidator.valid"
               :required="true"
>

...

yuda110

Project Title

One Paragraph of project description goes here

Getting Started

These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.

Prerequisites

yuda110

# Not all systems have this so conditionally define parser
try:
    import dateutil.parser as parser
except:
    pass
  
#####

from dateutil import parser
# Not all systems have this so conditionally define parser

yuda110

import sqlite3
import time
import ssl
import urllib.request, urllib.parse, urllib.error
from urllib.parse import urljoin
from urllib.parse import urlparse
import re
from datetime import datetime, timedelta

###

yuda110

def fino(n):
	a = b
	for i in range(n):
		yield a
		a, b = b, a+b
		
for x in fibo(100000):
	print(x)

yuda110

def foo(*args):
	for arg in args:
		print(arg)
		
foo(1, 2, 3, 4)

yuda110

let editor = $('.CodeMirror')[0].CodeMirror;
// 혹은 let editor = CodeMirror.fromTextArea(document.getElementById('code'));

// readonly 부분 정하기
let readOnlyLines = [0, 1];
editor.on('beforeChange', function (cm, change) {
	if (~readOnlyLines.indexOf(change.from.line)){
		change.cancel();
	}
});

yuda110

def calc_googol(a_to, b_to):
    max_sum = 0
    for a in range(1, a_to):
        for b in range(1, b_to):
            num = a**b
            sum_of_digits = sum(int(x) for x in str(num))
            if sum_of_digits > max_sum:
                max_sum = sum_of_digits
    return max_sum

yuda110

import string

text = open('./41-50/words.txt', 'r', encoding='utf-8')

def get_nth_triangle_num(n):
    triangle_num = int(0.5*n*(n+1))
    return triangle_num

def if_alp_triangle_num(alp_string):
    triangle_num, cnt = 0, 1

yuda110

import itertools
from primesieve import generate_primes

def get_biggest_decimal_pandigital(n):
    max_pan = 0
    permu_obj = itertools.permutations(range(1, n+1))
    for pan in permu_obj:
        each_pan = int(''.join(map(str,pan)))
        if len(generate_primes(each_pan, each_pan)) > 0  and each_pan > max_pan:
            max_pan = each_pan