Learning: 2021

2021年8月6日星期五

uploadfile php

<?php echo $_FILES["fup"]["name"]; ?>

<?php echo $_FILES["fup"]["size"]; ?>

<?php echo $_FILES["fup"]["type"]; ?>

<?php echo $_FILES["fup"]["tmp_name"];

move_uploaded_file($_FILES["fup"]["tmp_name"],"updown/a2.png");

還真容易！

還真容易錯！

1、有updown子目錄？

2、有png檔？

3、move_uploaded_file 不要拼錯

4、$_FILES[]..不是 $_POST[]

5、$_FILES["fup"].,fup外面要加""

6、html與 php中的參數名稱及目錄名稱要一致，updown, upfile, upload都可以，但不可以前後

不一樣

7、updown 與 /updown差一個斜線，會讓你頭大

8、要有目的位置檔案名稱

9、還要去php.ini改upload_max_filesize=5M

10、錯在哪裡？

11、反覆試的耐心

12、找錯誤的細心

13、google 下關鍵字的技巧

14、基本功: 編輯能力、網站概念、網頁概念、程式概念...

15、背景知識：#xamp #php #相對目錄 #網頁間資料傳送

...

有空再補充！...

複製貼上一秒就可以用，恭喜你！

但複製貼上後，又改了10次才成功，恭喜你！有了解決問題的能力！

uploadfile html

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">

<head>

<title>無標題文件</title>

</head>

<body>

</form>

</body>

</html>

LIS 、LCS VB.Net

Public Class Form1

Private Sub Form1_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load

'in 9 15 7 6 11 12 4 out 9 11 12 ,輸出要求，和最大的LIS

Dim ins = "9 15 7 6 11 12 4"

Dim data1 = ins.Split(separator:=" ", options:=System.StringSplitOptions.RemoveEmptyEntries)

Dim n = UBound(data1)

Dim d(n) As Int16

For i = 0 To n

d(i) = data1(i)

Dim d1(n) As Int16

d.CopyTo(d1, 0)

Array.Sort(d1)

Dim c(n, n)

Dim cf(n, n)

For i = 0 To n

c(i, 0) = 0

c(0, i) = 0

Next i

Dim path As New ArrayList

For i = 1 To n

For j = 1 To n

If d(i) = d1(j) Then

c(i, j) = c(i - 1, j - 1) + 1

cf(i, j) = 3

path.Add(d(i))

Else

c(i, j) = Math.Max(c(i, j - 1), c(i - 1, j))

If c(i, j) = c(i, j - 1) Then cf(i, j) = 2

If c(i, j) = c(i - 1, j) Then cf(i, j) = 1

End If

MsgBox(c(n, n))

Dim ss = ""

For i = 0 To n

For j = 0 To n

ss = ss & c(i, j)

ss = ss & vbNewLine

MsgBox(ss)

Dim pathArray = path.ToArray

lcs(pathArray, cf, n, n)

MsgBox(sss)

End Sub

Dim sss = ""

Sub lcs(ByVal pathArray, ByVal cf, ByVal i, ByVal j)

If i = 0 Or j = 0 Then

Return

ElseIf cf(i, j) = 3 Then

lcs(pathArray, cf, i - 1, j - 1)

sss = sss & pathArray(i - 1) & " "

ElseIf cf(i, j) = 1 Then

lcs(pathArray, cf, i - 1, j)

Else

lcs(pathArray, cf, i, j - 1)

End If

End Sub

End Class

2021年8月3日星期二

羅馬數字 VB.Net

Public Class Form1

Private Sub Form1_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load

Dim rd1 = "I(1)V(5)X(10)L(50)C(100)D(500)M(1000)"

Dim sep = {"(", ")"}

Dim rd = rd1.Split(sep, StringSplitOptions.RemoveEmptyEntries)

Dim d1 As New Dictionary(Of String, Integer)

For i = 0 To 12 Step 2

d1.Add(rd(i), CInt(rd(i + 1)))

Dim d2 As New Dictionary(Of String, Integer)

d2.Add("IV", 4)

d2.Add("IX", 9)

d2.Add("XC", 90)

d2.Add("XL", 40)

d2.Add("CD", 400)

d2.Add("CM", 900)

Dim tstr = "IXCDM"

Dim s = 0

While tstr.Length > 0

For Each ds In d2.Keys

If InStr(tstr, ds) > 0 Then

s = s + d2(ds)

tstr = tstr.Substring(2)

End If

For Each ds In d1.Keys

If InStr(tstr, ds) > 0 Then

s = s + d1(ds)

tstr = tstr.Substring(1)

End If

End While

MsgBox(s)

End

End Sub

End Class

TreeView TreeNode VB.Net

Public Class Form1

Private Sub Form1_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load

Dim t(100) As TreeNode

Dim namedata = {"", "公司", "部門一", "部門二", "分部一", "分部二", "分部一", "分部二", "人員一", "人員二", "人員一", "人員二", "人員一", "人員二"}

Dim rr(100) As String

For dist = 0 To 40 Step 20

For i = 1 + dist To 12 + dist

rr(i) = namedata(i - dist)

rr(1) = "公司一"

rr(21) = "公司二"

rr(41) = "公司三"

For dist = 0 To 40 Step 20

t(1 + dist) = TreeView1.Nodes.Add(rr(1 + dist))

For i = 2 To 12

t(i + dist) = t(i \ 2 + dist).Nodes.Add(rr(i + dist))

TreeView1.ExpandAll()

End Sub

End Class

LCS VB.Net

Public Class Form1

Private Sub Form1_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load

Dim s1 = {0, 2, 5, 7, 9, 3, 1, 2} ' s1(0) 與s2(0) 未算入

Dim s2 = {0, 3, 5, 1, 3, 2, 8}

Dim n = UBound(s1)

Dim m = UBound(s2)

Dim t(n, m) As Integer

For i = 1 To n

t(i, 0) = 0

For i = 1 To m

t(0, i) = 0

For i = 1 To n

For j = 1 To m

If s1(i) = s2(j) Then

t(i, j) = t(i - 1, j - 1) + 1

Else

t(i, j) = Math.Max(t(i - 1, j), t(i, j - 1))

End If

MsgBox(t(n, m))

End Sub

End Class

LIS VB.Net

Public Class Form1

Dim s = {1, 6, 3, 4, 8, 5, 2, 7, 9}

Dim ll(8) As Integer

Sub lis()

For i = 0 To UBound(s) 'Ubound = length -1

ll(i) = 1

For i = 0 To UBound(s)

For j = i + 1 To UBound(s)

If s(i) < s(j) Then

ll(j) = Math.Max(ll(j), ll(i) + 1)

End If

End Sub

Private Sub Form1_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load

lis()

MsgBox(ll.Max)

End Sub

End Class

BFS VB.Net

Public Class Form1

Private Sub Form1_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load

Dim fileContents As String

fileContents = My.Computer.FileSystem.ReadAllText(Application.StartupPath & "\dfs.txt")

Dim lines = fileContents.Trim().Split(vbNewLine)

Dim gdict As New Dictionary(Of String, Array)

For i = 0 To lines.Length - 1

Dim cols = lines(i).Split(":")

Dim sep = {Chr(34), Chr(39), " ", "[", "]", ","}

Dim nod = cols(0).Trim().Split(sep, StringSplitOptions.RemoveEmptyEntries)

Dim cnod = cols(1).Split(sep, StringSplitOptions.RemoveEmptyEntries)

gdict.Add(nod(0), cnod)

bfs(visited, gdict, "5")

MsgBox(ss)

End Sub

Dim visited As New ArrayList

Dim ss = ""

Sub bfs(ByRef visited, ByRef graph, ByVal nod)

Dim q As New Queue

q.Enqueue(nod)

While q.Count > 0

Dim s = q.Dequeue()

ss = ss & s & " "

For Each neighbor In graph(s)

If Not visited.contains(neighbor) Then

visited.add(neighbor)

q.Enqueue(neighbor)

End If

End While

End Sub

End Class

DFS VB.Net sample

Public Class Form1

Private Sub Form1_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load

Dim fileContents As String

fileContents = My.Computer.FileSystem.ReadAllText(Application.StartupPath & "\dfs.txt")

Dim lines = fileContents.Trim().Split(vbNewLine)

Dim gdict As New Dictionary(Of String, Array)

For i = 0 To lines.Length - 1

Dim cols = lines(i).Split(":")

Dim sep = {Chr(34), Chr(39), " ", "[", "]", ","}

Dim nod = cols(0).Trim().Split(sep, StringSplitOptions.RemoveEmptyEntries)

Dim cnod = cols(1).Split(sep, StringSplitOptions.RemoveEmptyEntries)

gdict.Add(nod(0), cnod)

dfs(visited, gdict, "5")

MsgBox(ss)

End Sub

Dim visited As New ArrayList

Dim ss = ""

Sub dfs(ByRef visited, ByRef graph, ByVal nod)

If Not visited.contains(nod) Then

ss = ss & nod & " "

visited.add(nod)

For Each neighbor In graph(nod)

dfs(visited, graph, neighbor)

End If

End Sub

End Class

dfs.txt

'5' : ['3','7'],

'3' : ['2', '4'],

'7' : ['8'],

'2' : [],

'4' : ['8'],

'8' : [],

2021年8月1日星期日

VB.Net TreeView TreeNode

Private Sub Form1_Activated(ByVal sender As Object, ByVal e As System.EventArgs) Handles Me.Activated

Dim t(13) As TreeNode

Dim r = "0,1,2,3,4,5,6,7,8,9,10,11,12".Split(",")

Dim rr = {"", "公司", "部門一", "部門二", "分部一", "分部二", "分部一", "分部二", "人員一", "人員二", "人員一", "人員二", "十二"}

t(r(1)) = TreeView2.Nodes.Add(rr(1))

For i = 2 To 12

t(i) = t(i \ 2).Nodes.Add(rr(i))

TreeView2.ExpandAll()

End Sub

2021年6月2日星期三

樸克牌模擬 python

import random

ds = 'A23456789TJQK'

fs = 'SHDC'

r = []

for i in ds:

    for j in fs:

        r.append(j+i)

sd = {}

n = 1000000

for j in range(n):

    ud = []

    for i in range(5):

        u = random.randint(0,51)

        ud.append(r[u])

    print(j,ud,end=' ')

    sameCheck = [i[1] for i in ud]

    sameCheck1 = [sameCheck.count(i) for i in sameCheck]

    nSame = int(sameCheck1.count(2)/2)

    nSame3 = sameCheck1.count(3)

    msg = ''

    if nSame3 ==1 : msg = 'Three of a kind'

    elif nSame ==2 : msg = 'Two Pair'

    elif nSame == 1:msg = 'One Pair'

    checkFlag = [fs.find(i[0]) for i in ud]

    checkFlag.sort()  

    if checkFlag[0] == checkFlag[1] == checkFlag[2] == checkFlag[3] == checkFlag[4]:

        msg = 'Flush'

    checkSame = [ds.find(i[1]) for i in ud]

    checkSame.sort()

    if (checkSame[0] == checkSame[1] == checkSame[2] == checkSame[3]

    or  checkSame[1] == checkSame[2] == checkSame[3] == checkSame[4]):

        msg = 'Four of a kind' 

    if (checkSame[0] == checkSame[1] and checkSame[1] == checkSame[2] and checkSame[3] == checkSame[4]

    or checkSame[0] == checkSame[1] and checkSame[2] == checkSame[3] and checkSame[3] == checkSame[4]):

        msg = 'FullHouse'  

    if checkSame[0] == checkSame[1]-1 and checkSame[1] == checkSame[2]-1  and checkSame[2] == checkSame[3]-1 and checkSame[3] == checkSame[4]-1:

        msg = 'Straight'  

    if (checkFlag[0] == checkFlag[1] == checkFlag[2] == checkFlag[3] == checkFlag[4]

       and checkSame[0] == checkSame[1]-1 and checkSame[1] == checkSame[2]-1  and checkSame[2] == checkSame[3]-1 and checkSame[3] == checkSame[4]-1):

        msg = 'Straight Flush' 

    print(nSame,msg)

    if msg in sd: sd[msg]+=1

    else        : sd[msg]=1 

print(n, 'times :')

for k,v in sd.items():

    if k=='':print('%-20s : %d'%('No...',v))

    else:    print('%-20s : %d'%(k,v))

1000000 times : No... : 457108 Two Pair : 68882 One Pair : 460935 Four of a kind : 2114 Straight : 2852 Flush : 3894 FullHouse : 4201 Straight Flush : 14

2021年5月27日星期四

分組累積例 python list

s = [int(i) for i in input().split()]

start = 0

end = 0

while end<len(s):

acc =0

while s[start]*s[end]>0 or s[start]==0 and s[end]==0:

acc+=s[end]

end+=1

if end >=len(s): break

end = end -1

if acc>0: print(start+1,end+1,end-start+1,acc)

start = end+1

end = end+1

acc = 0

2021年5月26日星期三

dict and multi key list sorting

s = input().lower()

s =s.replace('.','').replace(',','').split()

d = {}

for i in s:

if i in d:

d[i]+=1

else :

d[i]=1

list1 = []

for k,v in d.items():

t = [k,v]

list1.append(t)

for i in range(len(list1)):

for j in range(i+1,len(list1)):

if list1[i][1]<list1[j][1]: list1[i],list1[j]=list1[j],list1[i]

elif list1[i][1]==list1[j][1] and list1[i][0]>list1[j][0]: list1[i],list1[j]=list1[j],list1[i]

for i in list1:

print(i[0],i[1])

2021年5月18日星期二

Graph in Dict structure

d ='''A -> B

A -> C

B -> C

B -> D

C -> D

D -> C

E -> F

F -> C'''

e = [i.strip() for i in d.split('\n')]

v = set()

for i in e:

for j in i:

if j>='A':

v.add(j)

v = list(v)

v.sort()

print(e)

print(v)

g = {}

for i in v:

t = []

for j in e:

if i in j:

for k in j:

if k>='A' and k<='Z':

if k not in i:

t.append(k)

g[i]=t

print(g)

2021年5月13日星期四

dfs bfs python code

def dfs(visited,graph,node):

if node not in visited:

global d

d+=1

print(node,end='->')

visited.add(node)

for neighbor in graph[node]:

dfs(visited,graph,neighbor)

def bfs(visited,graph,node):

visited.append(node)

queue.append(node)

while queue:

s = queue.pop(0)

print(s,end='->')

for neighbor in graph[s]:

if neighbor not in visited:

visited.append(neighbor)

queue.append(neighbor)

a = '''8

0 1

0 2

0 3

7 0

1 4

1 5

3 6'''

# create graph

a = a.split('\n')

a.pop(0)

v =set()

e = []

for i in a:

t = i.split(' ')

print(t)

e.append(t)

for j in t:

v.add(j)

print()

v = list(v)

v.sort()

g ={}

for i in v:

t =set()

for j in e:

if i in j:

for k in j:

if k!= i:

t.add(k)

g[i] = t

for x,y in g.items():

print(x,y)

print()

# dfs

d = 0

for node in v:

visited=set()

d = 0

dfs(visited,g,node)

print(':',d)

print()

# bfs

for node in v:

queue = []

visited = []

bfs(visited,g,node)

print()

# = = = = =

Output:

['0', '1']

['0', '2']

['0', '3']

['7', '0']

['1', '4']

['1', '5']

['3', '6']

0 {'3', '2', '7', '1'}

1 {'0', '5', '4'}

2 {'0'}

3 {'0', '6'}

4 {'1'}

5 {'1'}

6 {'3'}

7 {'0'}

0->3->6->2->7->1->5->4->: 8

1->0->3->6->2->7->5->4->: 8

2->0->3->6->7->1->5->4->: 8

3->0->2->7->1->5->4->6->: 8

4->1->0->3->6->2->7->5->: 8

5->1->0->3->6->2->7->4->: 8

6->3->0->2->7->1->5->4->: 8

7->0->3->6->2->1->5->4->: 8

0->3->2->7->1->6->5->4->

1->0->5->4->3->2->7->6->

2->0->3->7->1->6->5->4->

3->0->6->2->7->1->5->4->

4->1->0->5->3->2->7->6->

5->1->0->4->3->2->7->6->

6->3->0->2->7->1->5->4->

7->0->3->2->1->6->5->4->

dfs Sample

def dfs(visited,graph,node):

if node not in visited:

global d

d+=1

print(node,end='->')

visited.add(node)

for neighbor in graph[node]:

dfs(visited,graph,neighbor)

a = '''8

0 1

0 2

0 3

7 0

1 4

1 5

3 6'''

# create graph

a = a.split('\n')

a.pop(0)

v =set()

e = []

for i in a:

t = i.split(' ')

print(t)

e.append(t)

for j in t:

v.add(j)

print()

v = list(v)

v.sort()

g ={}

for i in v:

t =set()

for j in e:

if i in j:

for k in j:

if k!= i:

t.add(k)

g[i] = t

for x,y in g.items():

print(x,y)

print()

# each node process

d = 0

for node in v:

visited=set()

d = 0

dfs(visited,g,node)

print(':',d)

# ====

Output:

['0', '1']

['0', '2']

['0', '3']

['7', '0']

['1', '4']

['1', '5']

['3', '6']

0 {'1', '3', '7', '2'}

1 {'5', '4', '0'}

2 {'0'}

3 {'0', '6'}

4 {'1'}

5 {'1'}

6 {'3'}

7 {'0'}

0->1->5->4->3->6->7->2->: 8

1->5->4->0->3->6->7->2->: 8

2->0->1->5->4->3->6->7->: 8

3->0->1->5->4->7->2->6->: 8

4->1->5->0->3->6->7->2->: 8

5->1->4->0->3->6->7->2->: 8

6->3->0->1->5->4->7->2->: 8

7->0->1->5->4->3->6->2->: 8

2021年5月8日星期六

前n個質數

def p(n):

c = 0

for i in range(1,n+1):

if n%i==0: c+=1

if c==2:

return True

else:

return False

n = 10

i = 2

c = 0

while c < n:

if p(i):

print(c+1,':',i)

c+=1

i+=1

print()

c=0

for i in range(1,100):

if p(i) :

print(c+1,':',i)

c+=1

if c>=10:

break

python list comprehension & dict

a = '''

Tomorrow Will Be Better

The Holdup

At first he was sly

He was opening doors

Making sure that you know you're adored

Making out in his Honda Accord

You never felt this way before

But things change since the first date

Think back on when he was great

So sad 'cause he's always late

Lose time not pounds when you're overwaiting

You're overdating

Think man is satan

Growing impatient

You're done participating

You think you lost him

But never had him

I'm sorry that you think you're permanently damaged

I promise it gets better if you wait so

Don't give up on that boy who's got a halo

You opened up your heart to have it broken

Don't let it scar you so bad you can't leave it open

The bar will always be there when you need it

But taking shots won't help erase how you were treated

I promise it gets better if…

'''

# a = a.replace("'","")

ab = a

#sol 1

a = [i.lower() for i in a.split() if "'" not in i]

s = list(set(a))

s.sort()

for i in s:

print(str(i)+':'+str(a.count(i)))

print()

#sol 2

wCounts = {}

for w in a:

if w.lower() in wCounts:

wCounts[w.lower()] += 1

else:

wCounts[w.lower()]=1

k_list = list(wCounts.keys())

k_list.sort()

for k in k_list:

print(k,':',wCounts[k])

output ----------------------------------

a:1

accord:1

adored:1

always:2

at:1

back:1

bad:1

bar:1

be:2

before:1

better:3

boy:1

broken:1

but:3

change:1

damaged:1

date:1

done:1

doors:1

erase:1

felt:1

first:2

gets:2

give:1

got:1

great:1

growing:1

had:1

halo:1

have:1

he:3

heart:1

help:1

him:2

his:1

holdup:1

honda:1

how:1

i:2

if:1

if…:1

impatient:1

in:1

is:1

it:6

know:1

late:1

leave:1

let:1

lose:1

lost:1

making:2

man:1

need:1

never:2

not:1

on:2

open:1

opened:1

opening:1

out:1

overdating:1

overwaiting:1

participating:1

permanently:1

pounds:1

promise:2

sad:1

satan:1

scar:1

shots:1

since:1

sly:1

so:3

sorry:1

sure:1

taking:1

that:3

the:3

there:1

things:1

think:4

this:1

time:1

to:1

tomorrow:1

treated:1

up:2

wait:1

was:3

way:1

were:1

when:3

will:2

you:11

your:1

python dict & list comprehension sample

a = '''

Tomorrow Will Be Better

The Holdup

At first he was sly

He was opening doors

Making sure that you know you're adored

Making out in his Honda Accord

You never felt this way before

But things change since the first date

Think back on when he was great

So sad 'cause he's always late

Lose time not pounds when you're overwaiting

You're overdating

Think man is satan

Growing impatient

You're done participating

You think you lost him

But never had him

I'm sorry that you think you're permanently damaged

I promise it gets better if you wait so

Don't give up on that boy who's got a halo

You opened up your heart to have it broken

Don't let it scar you so bad you can't leave it open

The bar will always be there when you need it

But taking shots won't help erase how you were treated

I promise it gets better if…

'''

#sol 1

ab = a

a = [i.lower() for i in a if i.lower()>='a' and i.lower() <='z' ]

s = list(set(a))

s.sort()

for i in s:

print(str(i)+':'+str(a.count(i)))

print()

#sol 2

ab = [i.lower() for i in ab if i.lower() >= 'a' and i.lower()<='z' ]

charCounts = {}

for char in ab:

if char.lower() in charCounts:

charCounts[char.lower()] += 1

else:

charCounts[char.lower()]=1

key_list = list(charCounts.keys())

key_list.sort()

for key in key_list:

print(key,':',charCounts[key])

2021年4月18日星期日

python data type Test

import sys

a = True

print(a)

stype =str(type(a)).strip('<class ').strip('>')[1:-1]

print(stype+':'+str(sys.getsizeof(a)))

print()

a = 'a'

print(a)

stype =str(type(a)).strip('<class ').strip('>')[1:-1]

print(stype+':'+str(sys.getsizeof(a)))

print()

a = "a"

print(a)

stype =str(type(a)).strip('<class ').strip('>')[1:-1]

print(stype+':'+str(sys.getsizeof(a)))

print()

a = chr(65)

print(a)

stype =str(type(a)).strip('<class ').strip('>')[1:-1]

print(stype+':'+str(sys.getsizeof(a)))

print()

a = 65

print(a)

stype =str(type(a)).strip('<class ').strip('>')[1:-1]

print(stype+':'+str(sys.getsizeof(a)))

print()

a = 6.5

print(a)

stype =str(type(a)).strip('<class ').strip('>')[1:-1]

print(stype+':'+str(sys.getsizeof(a)))

print()

a =(1/3)

print('%.30g'%a)

stype =str(type(a)).strip('<class ').strip('>')[1:-1]

print(stype+':'+str(sys.getsizeof(a)))

print()

2021年3月25日星期四

PHP Example III

<?php

// //test

// $s = '3 1 2 3';

// echo $s;

// echo ' ';

// $a = explode(' ',$s);

// echo $a[0];

// print_r($a);

// echo " ";

// echo count($a);

// echo " ";

// for ($i=count($a)-1;$i>=1;$i--)

// echo $a[$i] . ' ';

<?php

//b001

$s = '3 1 2 3';

$a = explode(' ',$s);

for ($i=count($a)-1;$i>=1;$i--)

echo $a[$i] . ' ';

echo " ";

<?php

//b002

$s = '5 444 888 555 777 999';

$a = explode(' ',$s);

$m = $a[1];

for ($i=2;$i<count($a);$i++)

if ($a[$i]>$m)

$m = $a[$i];

echo $m;

echo " ";

<?php

//b003

$s = '5 5 4 3 2 1 4';

$a = explode(' ',$s);

$c = count($a);

$k = $a[$c-1];

$small = 0;

$big = 0;

for ($i=1;$i<$c-1;$i++)

{

if ($a[$i]>$k)

$big++;

if ($a[$i]<$k)

$small++;

}

echo $big . " " . $small;

echo " ";

<?php

//b004

// $s = '5 3 5 3 1';

$s = '10 4 5 3 1 7';

$a = explode(' ',$s);

$c = count($a);

$n = $a[0];

$e = array_slice($a,2,$a[1]);

for ($i=1;$i<=$a[0];$i++)

{

if (!in_array($i,$e))

echo $i." ";

}

echo " ";

<?php

//b005

$s = '6 55 33 44 33 22 33';

$a = explode(' ',$s);

$c = count($a);

$n = $a[0];

$e = array_slice($a,1,$a[1]);

$r = array_count_values($e);

$ma = max($r);

foreach ($r as $key => $value)

{

if ($value==$ma)

// echo 'key=' . $key . ', value=' . $value . ' ';

echo $key . ' ' . $value . ' ';

}

echo " ";

PHP Example II

// Q31

// <?php

// $a = $_GET['a'];

// $b = $_GET['b'];

// echo $a + $b;

// ?>

// Q32

// <?php

// //網址列 +: %2b

// $s = $_GET['s'];

// if (stripos($s,"+") !== false)

// {

// list($a,$b) = explode('+',$s);

// echo $a+$b;

// }

// if (stripos($s,"-") !== false)

// {

// list($a,$b) = explode('-',$s);

// echo $a-$b;

// }

// if (stripos($s,"*") !== false)

// {

// list($a,$b) = explode('*',$s);

// echo $a*$b;

// }

// ?>

// Q33

// <?php

// //網址列 +: %2

// $s = $_GET['s'];

// if ($s>=10000)

// {

// $s = $s % 10000;

// if ($s>=1000)

// echo '|____'.$s.'|';

// else if ($s>=100)

// echo '|____0'.$s.'|';

// else if ($s>=10)

// echo '|____00'.$s.'|';

// else

// echo '|____000'.$s.'|';

// }

// else

// {

// if ($s>=1000)

// echo '|____'.$s.'|';

// else if ($s>=100)

// echo '|_____'.$s.'|';

// else if ($s>=10)

// echo '|______'.$s.'|';

// else

// echo '|_______'.$s.'|';

// }

// ?>

// Q34

// <?php

// $x1 = $_GET['x1'];

// $y1 = $_GET['y1'];

// $x2 = $_GET['x2'];

// $y2 = $_GET['y2'];

// $d = sqrt(($x1-$x2)*($x1-$x2)+($y1-$y2)*($y1-$y2));

// $d = round($d,3);

// echo $d;

// ?>

// Q35

// <?php

// $a = $_GET['a'];

// $b = $_GET['b'];

// $d = log10($a**$b);

// echo ceil($d);

// ?>

// Q36

// <?php

// $a = $_GET['a'];

// $b = $_GET['b'];

// if ($a>$b)

// echo 'A' ." ". ($a-$b);

// else

// echo 'B' ." ". ($b-$a);

// ?>

// Q37

// 略

// Q38

// 略

// Q39

// 略

// Q40

// 略

// Q41

// <?php

// $n=$_GET['n'];

// $c = $n;

// while ($n>=5)

// {

// $c = $c + floor($n/5);

// $r = floor($n/5)+$n%5;

// $n = $r;

// }

// echo $c;

// ?>

// Q42

// <?php

// $n=$_GET['n'];

// $r = 1;

// for ($i=0;$i<$n;$i++)

// {

// $r = $r * 13 % 100;

// }

// echo floor($r/10);

// ?>

// Q43

// <?php

// $a=$_GET['a'];

// $b=$_GET['b'];

// while ($a!=$b)

// {

// if ($a>$b)

// $a -= $b;

// else

// $b -= $a;

// }

// echo $a;

// ?>

// // Q44

// <?php

// $n=$_GET['n'];

// // $b=$_GET['b'];

// $s = 0;

// for ($i = 1 ; $i<$n; $i++)

// {

// if ($n%$i==0)

// $s += $i;

// }

// if ($s > $n)

// echo 'Abundant';

// elseif ($s < $n)

// echo 'Deficient';

// else

// echo 'Perfect';

// ?>

// // Q45

// <?php

// $n=$_GET['n'];

// $c = 0;

// for ($i = 2; $i<$n; $i++)

// {

// if ($n%$i==0)

// $c++;

// }

// if ($c==0)

// echo 'YES';

// else

// echo 'NO';

// ?>

// // Q46

// <?php

// $w=$_GET['w'];

// $h=$_GET['h'];

// $ss = "";

// for ($i = 0; $i<$h; $i++)

// {

// for ($j = 0; $j<$w; $j++)

// {

// $ss = $ss . "#";

// }

// $ss = $ss . " ";

// }

// echo $ss;

// ?>

// // Q47

// <?php

// $n=$_GET['n'];

// $ss = "";

// for ($i = 1; $i<=$n; $i++)

// {

// for ($j = 1; $j<=$i; $j++)

// {

// $ss = $ss . $i;

// }

// $ss = $ss . " ";

// }

// echo $ss;

// ?>

// // Q48

// <?php

// $n=$_GET['n'];

// $ss = "";

// for ($i = 1; $i<=$n; $i++)

// {

// for ($k = 1; $k<=$n-$i; $k++)

// {

// $ss = $ss . '_';

// }for ($j = 1; $j<=$i*2-1; $j++)

// {

// $ss = $ss . $i;

// }

// $ss = $ss . " ";

// }

// echo $ss;

// ?>

// // Q49

// <?php

// $n=$_GET['n'];

// $ss = "";

// for ($i = 0; $i<$n; $i++)

// {

// for ($j = $n-1; $j>=0; $j--)

// {

// if (($i+$j+1)%3==0)

// $ss = $ss . '@';

// else

// $ss = $ss . '-';

// }

// $ss = $ss . " ";

// }

// echo $ss;

// ?>

// Q50

<?php

$n=$_GET['n'];

echo "<table>";

for ($i = 1; $i<=$n; $i++)

{

echo "<tr>";

for ($j =1; $j<=$n; $j++)

{

echo "<td>";

echo $j .'*'. $i . '=' . $i*$j . "　　" ;

echo "</td>";

}

echo "</tr>";

}

echo "<table>";

2021年3月23日星期二

Php Exercise Sample

// Q1

// <?php

// echo "Hello";

// ?>

//

// Q2

// <?PHP

// ECHO "THIS IS A BOOK. ";

// ECHO "THAT IS A PEN. ";

// ECHO "I AM A STUDENT.";

// ?>

// Q3

// <?php

// echo "^_^ ";

// echo "\"o\" ";

// echo "\\^o^/ ";

// ?>

// Q4

// <?php

// $n = $_GET["n"];

// echo $n+1911;

// ?>

// Q5

// <?php

// $h = $_GET['h'];

// $w = $_GET['w'];

// echo $h*$w;

// ?>

// Q6

// <?php

// $h=$_GET['h'];

// $m=$_GET['m'];

// echo $h*60+$m;

// ?>

// Q7

// <?php

// $m = $_GET['m'];

// echo floor($m/60) . ' ' . $m%60;

// ?>

// Q8

// <?php

// $c = $_GET['c'];

// echo $c*9.0/5+32;

// ?>

// Q9

// <?php

// $n = $_GET['n'];

// echo floor($n/11)*1000+($n%11)*100;

// ?>

// Q10

// <?php

// $g = $_GET['g'];

// $G = $g+3;

// $b = $g *2 - 5;

// $p = floor($b/10)*10+$G%10;

// echo $p;

// ?>

// Q11

// <?php

// $n = $_GET['n'];

// if ($n>=60)

// echo 'PASS';

// else

// echo "FAIL";

// ?>

// Q12

// <?php

// $n = $_GET['n'];

// if ($n%2==0)

// echo 'EVEN';

// else

// echo "ODD";

// ?>

// Q13

// <?php

// $n = $_GET['n'];

// if ($n>=75 and $n<=90)

// echo 'YES';

// else

// echo "NO";

// ?>

// Q14

// <?php

// $a = $_GET['a'];

// $b = $_GET['b'];

// $c = $_GET['c'];

// if ($a<=$b and $a<=$c)

// echo $a;

// else if ($b<=$c and $b<=$a)

// echo $b;

// else

// echo $c;

// ?>

// Q15

// <?php

// $a = $_GET['a'];

// $b = $_GET['b'];

// if ($a>$b)

// echo $a . ">" . $b;

// else if ($a<$b)

// echo $a . "<" . $b;

// else

// echo $a . "=" . $c;

// ?>

// Q16

// <?php

// $n = $_GET['n'];

// $s = "NO";

// if ($n%4==0)

// $s = "YES";

// if ($n%100==0)

// $s = "NO";

// if ($n%400==0)

// $s = "YES";

// echo $s;

// ?>

// Q17

// <?php

// $n = $_GET['n'];

// $s = "E";

// if ($n>=60)

// $s = "D";

// if ($n>=70)

// $s = "C";

// if ($n>=80)

// $s = "B";

// if ($n>=90)

// $s = "A";

// echo $s;

// ?>

// Q18

// <?php

// $h = $_GET['h'];

// $m = $_GET['m'];

// $s = "NO";

// if ($h==15)

// $s = "YES";

// if ($h==14 and $m>=20)

// $s = "YES";

// if ($h==16 and $m<=40)

// $s = "YES";

// echo $s;

// ?>

// Q19

// <?php

// $a = $_GET['a'];

// $b = $_GET['b'];

// $s = 0;

// if ($b==2 or $b==5 or $b==8)

// $s=200;

// else if ($a%2==1)

// $s=100;

// else if ($a==$b)

// $s = 50;

// echo $s;

// ?>

// Q20

// <?php

// $a = $_GET['a'];

// $b = $_GET['b'];

// $s = 0;

// if ($b==2 or $b==5 or $b==8)

// $s+=200;

// if ($a%2==1)

// $s+=100;

// if ($a==$b)

// $s += 50;

// echo $s;

// ?>

// Q21

// <?php

// $n = $_GET['n'];

// while ($n%2==0)

// $n = $n/2;

// echo $n;

// ?>

// Q22

// <?php

// $n = $_GET['n'];

// $m = $_GET['m'];

// $c=0;

// while ($n<=$m)

// {

// $n = $n * 3;

// $c++;

// }

// echo $c;

// ?>

// Q23

// <?php

// $n = $_GET['n'];

// $c=1;

// while ($n>1)

// {

// $c++;

// if ($n%2!=0)

// $n = 3*$n+1;

// else

// $n = $n/2;

// }

// echo $c;

// ?>

// Q24

// <?php

// $n = $_GET['n'];

// $s=0;

// while ($n>=1)

// {

// $s=$s+$n%10;

// $n=floor($n /10);

// }

// echo $s;

// ?>

// Q25

// <?php

// $n = $_GET['n'];

// while ($n>=1)

// {

// echo $n%10;

// $n=floor($n /10);

// }

// ?>

// Q26

// <?php

// $n = $_GET['n'];

// while ($n>0)

// {

// echo "I love you. ";

// $n--;

// }

// ?>

// Q27

// <?php

// $n = $_GET['n'];

// while ($n>=0)

// {

// echo $n . " ";

// $n--;

// }

// ?>

// Q28

// <?php

// $n = $_GET['n'];

// $r = $_GET['r'];

// $s=$n;

// $i=1;

// while ($i<=($r-1))

// {

// $s =$s * ($n-$i);

// $i++;

// }

// echo $s;

// ?>

// Q29

// <?php

// $n = $_GET['n'];

// $s = 0;

// $ss = "";

// for ($i=1;$i<=$n;$i++)

// {

// $s = $s + $i;

// if ($i==$n)

// $ss = $ss . $i . "=";

// else

// $ss = $ss . $i . "+";

// }

// echo $ss . " " . $s;

// ?>

// Q29A

// <?php

// $a = $_GET['a'];

// $b = $_GET['b'];

// $s = 0;

// $ss = "";

// for ($i=$a;$i<=$b;$i++)

// {

// $s = $s + $i;

// if ($i==$b)

// $ss = $ss . $i . "=";

// else

// $ss = $ss . $i . "+";

// }

// echo $ss . " " . $s;

// ?>

Q30

<?php

$a = $_GET['a'];

$b = $_GET['b'];

$s = 0;

$ss = "";

if ($a<$b)

{

for ($i=$a;$i<=$b;$i++)

{

$s = $s + $i;

if ($i==$b)

$ss = $ss . $i . "=";

else

$ss = $ss . $i . "+";

}

else

{

for ($i=$a;$i>=$b;$i--)

{

$s = $s + $i;

if ($i==$b)

$ss = $ss . $i . "=";

else

$ss = $ss . $i . "+";

}

echo $ss . " " . $s;

訂閱：文章 (Atom)

標籤雲

2021年8月6日 星期五

2021年8月3日 星期二

2021年8月1日 星期日

2021年6月2日 星期三

2021年5月27日 星期四

2021年5月26日 星期三

2021年5月18日 星期二

2021年5月13日 星期四

2021年5月8日 星期六

2021年4月18日 星期日

2021年3月25日 星期四

2021年3月23日 星期二

■Inspirational Quotes

搜尋此網誌

■分類

■最新回應

■blog 存檔

■常逛的地方

總網頁瀏覽量

訪客計數

2021年8月6日星期五

2021年8月3日星期二

2021年8月1日星期日

2021年6月2日星期三

2021年5月27日星期四

2021年5月26日星期三

2021年5月18日星期二

2021年5月13日星期四

2021年5月8日星期六

2021年4月18日星期日

2021年3月25日星期四

2021年3月23日星期二