Add tasks for all the new languages

This commit is contained in:
Tina Müller 2016-12-05 23:44:36 +01:00
parent 9dc3c2bb62
commit bba7bfd280
13208 changed files with 134745 additions and 0 deletions

View file

@ -0,0 +1,76 @@
PROGRAM RESISTENCE_MESH
!$BASE=1
!$DYNAMIC
DIM A[0,0]
BEGIN
N=10
NN=N*N
!$DIM A[NN,NN+1]
PRINT(CHR$(12);) !CLS
! generate matrix data
NODE=0
FOR ROW=1 TO N DO
FOR COL=1 TO N DO
NODE=NODE+1
IF ROW>1 THEN
A[NODE,NODE]=A[NODE,NODE]+1
A[NODE,NODE-N]=-1
END IF
IF ROW<N THEN
A[NODE,NODE]=A[NODE,NODE]+1
A[NODE,NODE+N]=-1
END IF
IF COL>1 THEN
A[NODE,NODE]=A[NODE,NODE]+1
A[NODE,NODE-1]=-1
END IF
IF COL<N THEN
A[NODE,NODE]=A[NODE,NODE]+1
A[NODE,NODE+1]=-1
END IF
END FOR
END FOR
AR=2 AC=2 A=AC+N*(AR-1)
BR=7 BC=8 B=BC+N*(BR-1)
A[A,NN+1]=-1
A[B,NN+1]=1
PRINT("Nodes ";A,B)
! solve linear system
! using Gauss-Seidel method
! with pivoting
R=NN
FOR J=1 TO R DO
FOR I=J TO R DO
EXIT IF A[I,J]<>0
END FOR
IF I=R+1 THEN
PRINT("No solution!")
!$STOP
END IF
FOR K=1 TO R+1 DO
SWAP(A[J,K],A[I,K])
END FOR
Y=1/A[J,J]
FOR K=1 TO R+1 DO
A[J,K]=Y*A[J,K]
END FOR
FOR I=1 TO R DO
IF I<>J THEN
Y=-A[I,J]
FOR K=1 TO R+1 DO
A[I,K]=A[I,K]+Y*A[J,K]
END FOR
END IF
END FOR
END FOR
PRINT("Resistence=";ABS(A[A,NN+1]-A[B,NN+1]))
END PROGRAM

View file

@ -0,0 +1,52 @@
var (w, h) = (10, 10)
var v = h.of { w.of(0) } # voltage
var f = h.of { w.of(0) } # fixed condition
var d = h.of { w.of(0) } # diff
var n = [] # neighbors
for i in ^h {
for j in (1 ..^ w ) { n[i][j] := [] << [i, j-1] }
for j in (0 ..^ w-1) { n[i][j] := [] << [i, j+1] }
}
for j in ^w {
for i in (1 ..^ h ) { n[i][j] := [] << [i-1, j] }
for i in (0 ..^ h-1) { n[i][j] := [] << [i+1, j] }
}
func set_boundary {
f[1][1] = 1; f[6][7] = -1;
v[1][1] = 1; v[6][7] = -1;
}
func calc_diff {
var total_diff = 0
for i,j in (^h ~X ^w) {
var p = n[i][j]
var w = 0
p.each { |a| w += v.dig(a...) }
d[i][j] = (w = (v[i][j] - w/p.len))
f[i][j] || (total_diff += w*w)
}
total_diff
}
func iter {
var diff = 1
while (diff > 1e-24) {
set_boundary()
diff = calc_diff()
for i,j in (^h ~X ^w) {
v[i][j] -= d[i][j]
}
}
var current = 3.of(0)
for i,j in (^h ~X ^w) {
current[ f[i][j] ] += (d[i][j] * n[i][j].len)
}
(current[1] - current[-1]) / 2
}
say "R = #{2 / iter()}"