{"id":23980,"date":"2012-12-24T16:50:40","date_gmt":"2012-12-24T13:50:40","guid":{"rendered":"http:\/\/studentpmr.ru\/?p=23980"},"modified":"2012-12-24T16:51:55","modified_gmt":"2012-12-24T13:51:55","slug":"%d0%b4%d0%b5%d1%80%d0%b5%d0%b2%d1%8c%d1%8f-%d0%bf%d1%80%d0%be%d0%bb%d0%be%d0%b3","status":"publish","type":"post","link":"https:\/\/studentpmr.ru\/?p=23980","title":{"rendered":"\u0414\u0435\u0440\u0435\u0432\u044c\u044f &#8212; \u043f\u0440\u043e\u043b\u043e\u0433"},"content":{"rendered":"<p>\u041b\u0430\u0431\u043e\u0440\u0430\u0442\u043e\u0440\u043d\u0430\u044f \u0440\u0430\u0431\u043e\u0442\u0430 \u2116 5<br \/>\n\u0414\u0415\u0420\u0415\u0412\u042c\u042f<\/p>\n<p>\u2116 9.\u041f\u043e\u0434\u0441\u0447\u0438\u0442\u0430\u0442\u044c \u0447\u0438\u0441\u043b\u043e \u0432\u0435\u0440\u0448\u0438\u043d \u0434\u0435\u0440\u0435\u0432\u0430, \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u044f \u043a\u043e\u0442\u043e\u0440\u044b\u0445 \u043b\u0435\u0436\u0430\u0442 \u0432 \u043e\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u043d\u043e\u043c \u0437\u0430\u0434\u0430\u0432\u0430\u0435\u043c\u043e\u043c \u0434\u0438\u0430\u043f\u0430\u0437\u043e\u043d\u0435.<\/p>\n<p>domains<br \/>\n\t treetype = tree (integer, treetype, treetype); empty ()<br \/>\n<!--more--><br \/>\n\tpredicates<br \/>\n        print(treetype,integer)<br \/>\n\tclauses<br \/>\n\t print(empty,0).<br \/>\n\t print(tree(X, Z, Y),COUNT):-<br \/>\n\t   X>0,X<50,\n\t   COUNT1=COUNT+1,\n\t   write(COUNT,\"- \u0432\u0435\u0440\u0448\u0438\u043d \"),\n\t   write(X), nl,\t\n\t   print(Z,COUNT1),   \n\t   print(Y,COUNT1).    \n\tgoal\n\t  write(\"\u0414\u0438\u0430\u043f\u043e\u0437\u043e\u043d 0...50:\"),nl,\n\t  print(tree (25,tree (5,tree (1,tree (5,tree (8, empty, empty), tree(11, empty, empty)), empty), empty),tree(70,tree(67,empty,empty),tree (122, empty, empty))),1),nl,fail;true.\n\n\ndomains\n  inttree = tree(integer,inttree,inttree); end\n\npredicates\n  nondeterm do(inttree) \n  action(integer,inttree,inttree) \n  create_tree(inttree,inttree) \n  insert(integer,inttree,inttree)\n  write_tree(inttree) \n  sumtree(inttree,integer)\n  nondeterm repeat \nclauses\n\n  do(Tree):-\n\trepeat,nl,\n\twrite(\"*******************************************************\"),nl,\n\twrite(\"\u0412\u0432\u0435\u0434\u0438\u0442\u0435 1 \u0434\u043b\u044f \u0438\u0437\u043c\u0435\u043d\u0435\u043d\u0438\u044f \u0434\u0435\u0440\u0435\u0432\u0430\\n\"),\n\twrite(\"\u0412\u0432\u0435\u0434\u0438\u0442\u0435 2 \u0434\u043b\u044f \u0432\u044b\u0432\u043e\u0434\u0430 \u0434\u0435\u0440\u0435\u0432\u0430\\n\"),\n\twrite(\"\u0412\u0432\u0435\u0434\u0438\u0442\u0435 3 \u0434\u043b\u044f \u0432\u044b\u0432\u043e\u0434\u0430 \u0441\u0443\u043c\u043c\u044b\\n\"),\n\twrite(\"\u0412\u0432\u0435\u0434\u0438\u0442\u0435 999 \u0434\u043b\u044f \u0432\u044b\u0445\u043e\u0434\u0430 \u0438\u0437 \u043f\u0440\u043e\u0433\u0440\u0430\u043c\u043c\u044b\\n\"),\n\twrite(\"*******************************************************\"),nl,\n\twrite(\"Enter number - \"),\n\treadint(X),nl,\n\taction(X, Tree, NewTree),\n\tdo(NewTree).\n\n  action(1,Tree,NewTree):-\n\twrite(\"\u0412\u0432\u0435\u0434\u0438\u0442\u0435 999 \u0434\u043b\u044f \u043e\u043a\u043e\u043d\u0447\u0430\u043d\u0438\u044f \u0432\u0432\u043e\u0434\u0430\\n\"),\n\tcreate_Tree(Tree, NewTree).\n  action(2,Tree,Tree):-\n\twrite_Tree(Tree),\n\twrite(\"\\nPress a key to continue\"),\n\treadint(_),nl.\n  action(3,Tree,Tree):-\n\tsumtree(Tree, Sum),\n\twrite(\"\u0421\u0443\u043c\u043c\u0430 \u0432\u0435\u0440\u0448\u0438\u043d \u0434\u0435\u0440\u0435\u0432\u0430 \u0440\u0430\u0432\u043d\u0430 \", Sum, \"\\n\"),\n\twrite(\"\\nPress a key to continue\").\n\t\n  action(999, _, end):-\n\texit.\n\n  create_Tree(Tree, NewTree):-\n\treadint(C),\n\tC<>999,!,<br \/>\n\tinsert(C, Tree, TempTree),<br \/>\n\tcreate_Tree(TempTree, NewTree).<br \/>\n\tcreate_Tree(Tree, Tree).<\/p>\n<p>  insert(New,end,tree(New,end,end)):-!.<br \/>\n  insert(New,tree(Element,Left,Right),tree(Element,NewLeft,Right)):-<br \/>\n\tNew<Element,!,\n\tinsert(New,Left,NewLeft).\n  insert(New,tree(Element,Left,Right),tree(Element,Left,NewRight)):-\n\tinsert(New,Right,NewRight).\n\n  write_Tree(end).\n  write_Tree(tree(Item,Left,Right)):-\n\twrite_Tree(Left),\n\twrite(Item, \" \"),\n\twrite_Tree(Right).\n\n  repeat.\n  repeat:-repeat.\n\n  sumtree(end,Sum):-Sum=0.\n  sumtree(tree(Element, Left, Right), Sum):- \n  sumtree(Left,Sum1),\n  sumtree(Right,Sum2),\n  Sum=Sum1+Sum2+Element.\ngoal\n  write(\"*************** \u041e\u0442\u0441\u043e\u0440\u0442\u0438\u0440\u043e\u0432\u0430\u043d\u043d\u043e\u0435 \u0434\u0435\u0440\u0435\u0432\u043e *******************\"),nl,\n  do(end).\n\n\n\n\n\n\tdomains\n\t treetype = tree (integer, treetype, treetype); empty ()\n\n\tpredicates\n        print(treetype,integer)\n\tclauses\n\t print(empty,0).   \n\t print(tree(X, Z, Y),COUNT):-\n\t   X>0,X<50,\n\t   COUNT1=COUNT+1,\n\t   write(COUNT,\"- \u0432\u0435\u0440\u0448\u0438\u043d \"),\n\t   write(X), nl,\t\n\t   print(Z,COUNT1),   \n\t   print(Y,COUNT1).    \n\tgoal\n\t  write(\"\u0414\u0438\u0430\u043f\u043e\u0437\u043e\u043d 0...50:\"),nl,\n\t  print(tree (25,tree (5,tree (1,tree (5,tree (8, empty, empty), tree(11, empty, empty)), empty), empty),tree(70,tree(67,empty,empty),tree (122, empty, empty))),1),nl,fail;true.\n\n<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u041b\u0430\u0431\u043e\u0440\u0430\u0442\u043e\u0440\u043d\u0430\u044f \u0440\u0430\u0431\u043e\u0442\u0430 \u2116 5 \u0414\u0415\u0420\u0415\u0412\u042c\u042f \u2116 9.\u041f\u043e\u0434\u0441\u0447\u0438\u0442\u0430\u0442\u044c \u0447\u0438\u0441\u043b\u043e \u0432\u0435\u0440\u0448\u0438\u043d \u0434\u0435\u0440\u0435\u0432\u0430, \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u044f \u043a\u043e\u0442\u043e\u0440\u044b\u0445 \u043b\u0435\u0436\u0430\u0442 \u0432 \u043e\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u043d\u043e\u043c \u0437\u0430\u0434\u0430\u0432\u0430\u0435\u043c\u043e\u043c \u0434\u0438\u0430\u043f\u0430\u0437\u043e\u043d\u0435. domains treetype = tree (integer, treetype, treetype); empty ()<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[36],"tags":[],"_links":{"self":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/23980"}],"collection":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=23980"}],"version-history":[{"count":2,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/23980\/revisions"}],"predecessor-version":[{"id":23982,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/23980\/revisions\/23982"}],"wp:attachment":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=23980"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=23980"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=23980"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}