fork download
copy 
  1. :- use_module(library(lists)).
  2.  
  3. % ----------------------------
  4. % задание 1: шелл (седжвик)
  5. % ----------------------------
  6.  
  7. % shs(+l, -s)
  8. shs(L, S) :-
  9.     length(L, N),
  10.     sg(N, Gs),
  11.     sp(Gs, L, S).
  12.  
  13. % sg(+n, -gs)
  14. sg(N, Gs) :-
  15.     ( N =< 1 -> Gs = [1]
  16.     ; sgk(N, 0, [], Rs),
  17.       reverse(Rs, Gs)
  18.     ).
  19.  
  20. sgk(N, K, A, Rs) :-
  21.     hk(K, H),
  22.     K1 is K + 1,
  23.     hk(K1, H1),
  24.     ( 3*H1 > N ->
  25.         Rs = [H|A]
  26.     ;   sgk(N, K1, [H|A], Rs)
  27.     ).
  28.  
  29. % hk(+k,-h)
  30. hk(K, H) :-
  31.     ( 0 is K mod 2 ->
  32.         P2k  is 1 << K,
  33.         K2   is K // 2,
  34.         P2k2 is 1 << K2,
  35.         H is 9*P2k - 9*P2k2 + 1
  36.     ;   P2k  is 1 << K,
  37.         K2   is (K + 1) // 2,
  38.         P2k2 is 1 << K2,
  39.         H is 8*P2k - 6*P2k2 + 1
  40.     ).
  41.  
  42. sp([], L, L).
  43. sp([G|Gs], L, S) :-
  44.     gp(G, L, L1),
  45.     sp(Gs, L1, S).
  46.  
  47. % gp(+g,+l,-s)
  48. gp(G, L, S) :-
  49.     en(L, 0, Ps),
  50.     G1 is G - 1,
  51.     findall(Ns, (between(0, G1, R), cls(Ps, G, R, Ns)), Bs),
  52.     append(Bs, All),
  53.     keysort(All, Ss),
  54.     vs(Ss, S).
  55.  
  56. cls(Ps, G, R, Ns) :-
  57.     include(pr(G, R), Ps, Cs),
  58.     iv(Cs, Vs1, Is1),
  59.     ins(Vs1, Vs2),
  60.     pi(Is1, Vs2, Ns).
  61.  
  62. pr(G, R, I-_) :- 0 is (I - R) mod G.
  63.  
  64. en([], _, []).
  65. en([X|Xs], I, [I-X|Ps]) :-
  66.     I1 is I + 1,
  67.     en(Xs, I1, Ps).
  68.  
  69. iv([], [], []).
  70. iv([I-V|T], [V|Vs], [I|Is]) :- iv(T, Vs, Is).
  71.  
  72. pi([], [], []).
  73. pi([I|Is], [V|Vs], [I-V|T]) :- pi(Is, Vs, T).
  74.  
  75. vs([], []).
  76. vs([_-V|T], [V|Vs]) :- vs(T, Vs).
  77.  
  78. % ins(+l,-s)
  79. ins([], []).
  80. ins([X|Xs], S) :- ins(Xs, S1), is1(X, S1, S).
  81.  
  82. is1(X, [], [X]).
  83. is1(X, [Y|Ys], [X,Y|Ys]) :- X =< Y, !.
  84. is1(X, [Y|Ys], [Y|Zs]) :- is1(X, Ys, Zs).
  85.  
  86. % ----------------------------
  87. % задание 2: бинарные включения
  88. % ----------------------------
  89.  
  90. % bis(+l,-s)
  91. bis(L, S) :- bis1(L, [], S).
  92.  
  93. bis1([], A, A).
  94. bis1([X|Xs], A, S) :-
  95.     bin_ins(X, A, A1),
  96.     bis1(Xs, A1, S).
  97.  
  98. % bin_ins(+x,+l,-r)
  99. bin_ins(X, L, R) :-
  100.     length(L, N),
  101.     bin_pos(X, L, 0, N, P),
  102.     sp2(P, L, A, B),
  103.     append(A, [X|B], R).
  104.  
  105. % bin_pos(+x,+l,+lo,+hi,-p)
  106. bin_pos(X, L, Lo, Hi, P) :-
  107.     ( Lo >= Hi ->
  108.         P = Lo
  109.     ; M is (Lo + Hi) // 2,
  110.       nth0(M, L, V),
  111.       ( X =< V ->
  112.           bin_pos(X, L, Lo, M, P)
  113.       ; M1 is M + 1,
  114.         bin_pos(X, L, M1, Hi, P)
  115.       )
  116.     ).
  117.  
  118. % sp2(+k,+l,-a,-b)
  119. sp2(0, L, [], L) :- !.
  120. sp2(K, [X|Xs], [X|A], B) :-
  121.     K > 0,
  122.     K1 is K - 1,
  123.     sp2(K1, Xs, A, B).
  124.  
  125. % cmp(+l,-s1,-s2,-t1,-t2)
  126. cmp(L, S1, S2, T1, T2) :-
  127.     tm(shs(L, S1), T1),
  128.     tm(bis(L, S2), T2).
  129.  
  130. tm(G, T) :-
  131.     statistics(walltime, [T0,_]),
  132.     call(G),
  133.     statistics(walltime, [T1,_]),
  134.     T is T1 - T0.
  135.  
  136. % ----------------------------
  137. % задание 3: "слово из домино" (игра)
  138. % ----------------------------
  139.  
  140. % igra(-w)
  141. igra(w(I, G, R, A)) :-
  142.     ds(Ts),
  143.     gr(Ts, 7, 42, Ti, T1), ch(Ti, I),
  144.     gr(T1, 7, 42, Tg, T2), ch(Tg, G),
  145.     gr(T2, 7, 42, Tr, T3), ch(Tr, R),
  146.     T3 = Ta, sm(Ta, 42), ch(Ta, A).
  147.  
  148. % ds(-ts)
  149. ds(Ts) :- findall(A-B, (between(0,6,A), between(A,6,B)), Ts).
  150.  
  151. % sm(+ts,-s)
  152. sm([], 0).
  153. sm([A-B|T], S) :-
  154.     sm(T, S1),
  155.     S is S1 + A + B.
  156.  
  157. % gr(+ts,+k,+s,-g,-r)
  158. gr(Ts, 0, 0, [], Ts) :- !.
  159. gr(Ts, K, S, [X|G], R) :-
  160.     K > 0, S >= 0,
  161.     select(X, Ts, T1),
  162.     X = A-B,
  163.     S1 is S - (A + B),
  164.     K1 is K - 1,
  165.     gr(T1, K1, S1, G, R).
  166.  
  167. % ch(+ts,-c)
  168. ch(Ts, C) :-
  169.     select(T, Ts, R),
  170.     or(T, A-B),
  171.     ch1(R, B, [A-B], C).
  172.  
  173. ch1([], _, A, C) :- reverse(A, C).
  174. ch1(Ts, X, A, C) :-
  175.     select(T, Ts, R),
  176.     or1(T, X-Y),
  177.     ch1(R, Y, [X-Y|A], C).
  178.  
  179. or(A-B, A-B).
  180. or(A-B, B-A).
  181.  
  182. or1(A-B, X-Y) :- (X=A, Y=B ; X=B, Y=A).
  183.  
  184. % ----------------------------
  185. % задание 4 (вариант 2): вставка подсписка с i-го элемента
  186. % ----------------------------
  187.  
  188. % ins_sub(+sub,+l,+i,-r)
  189. ins_sub(Sub, L, I, R) :-
  190.     I >= 1,
  191.     K is I - 1,
  192.     sp2(K, L, P, S),
  193.     append(P, Sub, T),
  194.     append(T, S, R).
  195.  
Success #stdin #stdout #stderr 0.03s 7024KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
ERROR: '$runtoplevel'/0: Undefined procedure: program/0
   Exception: (3) program ? EOF: exit
https://ideone.com/VaogQf
language:
Prolog (swi 7.6.4)
created:
7 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!