{"text": "# A (p,q)-Steiner system on a set A is a family of subsets of A (called blocks),\n# each of size q, such that each subset of size p in A is contained ina unique\n# block.\n\nsteiner_number_test := proc(p::posint,q::posint,n::posint)\n local i,m;\n for i from 0 to p-1 do\n  m := binomial(n-i,p-i)/binomial(q-i,p-i);\n  if not(type(m,integer)) then\n   return false;\n  fi;\n od:\n return true;\nend:\n\n`is_element/steiner_systems` := (A::set) -> (p::posint,q::posint) -> proc(S)\n global reason;\n \n local P,B,CC;\n \n if not(type(S,set(set))) then\n  reason := [\"is_element/steiner_systems\",\"S is not a set of sets\",S];\n  return false;\n fi;\n\n if map(op,S) minus A <> {} then\n  reason := [\"is_element/steiner_systems\",\"S is not a set of subsets of A\",S,A];\n  return false;\n fi;\n\n if map(nops,S) <> {q} then\n  reason := [\"is_element/steiner_systems\",\"S is not a set of sets of size q\",S,q];\n  return false;\n fi;\n \n P := combinat[choose](A,p);\n\n for B in P do\n  CC := select(C -> B minus C = {},S);\n  if nops(CC) <> 1 then\n   reason := [\"is_element/steiner_systems\",\"The set B is not contained in a unique block\",B,CC];\n   return false; \n  fi;\n od:\n\n return true;\nend:\n\n`res/steiner_system` := (A::set,B::set) -> proc(S)\n local T;\n \n if B minus A <> {} then\n  error(\"B is not a subset of A\");\n fi;\n\n if nops(S[1]) + nops(B) < nops(A) then\n  error(\"B is too small\");\n fi;\n \n T := select(C -> C union B = A,S);\n T := map(C -> C intersect B,T);\n\n return T;\nend:\n\n# A (1,q)-Steiner system on A is just a partition of A into disjoint blocks of\n# size q.  There is an obvious way to make such a partition when A = {1,..,m*q}\n\n`steiner_system/congruence` := proc(q,m)\n local i,j;\n [{seq(i,i=1..q*m)},\n  {seq({seq(j,j=i*q+1..(i+1)*q)},i=0..m-1)},\n  [1,q,m*q]];\nend:\n\n# For any prime p, the lines in (Z/p)^2 give a (2,p)-Steiner system.\n\n`steiner_system/affine` := proc(p)\n local V,S,i,j,m,c;\n \n if not(isprime(p)) then\n  return FAIL;\n fi;\n\n V := {seq(seq([i,j],j=0..p-1),i=0..p-1)};\n S := {seq({seq([i,j],j=0..p-1)},i=0..p-1),\n       seq(seq({seq([i,modp(m*i+c,p)],i=0..p-1)},c=0..p-1),m=0..p-1)};\n return [V,S,[2,p,p^2]];\nend:\n\n", "meta": {"hexsha": "9512fa775cefbf82eb47529d696ceb3703cb4726", "size": 2100, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/steiner_systems.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/steiner_systems.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/steiner_systems.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.0769230769, "max_line_length": 96, "alphanum_fraction": 0.599047619, "num_tokens": 746, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9678992914310606, "lm_q2_score": 0.8705972734445508, "lm_q1q2_score": 0.8426504840887941}}
{"text": "with(simplex);\r\n\r\nConstraints := [\r\n# conservation of units at each node\r\ne13+e14 = 300, # CHI\r\ne23+e24 = 300, # DC\r\ne13+e23 = 300, # HOU\r\ne14+e24 = 300, # BOS\r\n# maximum flow on individual edges\r\n0 <= e13, e13 <= 200,\r\n0 <= e14, e14 <= 200,\r\n0 <= e23, e23 <= 280,\r\n0 <= e24, e24 <= 350\r\n];\r\n\r\nCost := 7*e13 + 6*e14 + 4*e23 + 6*e24;\r\n# Invoke linear programming to solve problem\r\nminimize (Cost, Constraints, NONNEGATIVE);\r\n", "meta": {"hexsha": "85ce38d8055eaf7bf9d8bf6a132c92f89e96c722", "size": 424, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "Figures/src/algs/chapter8/example7/Commands.mpl", "max_stars_repo_name": "konny0311/algorithms-nutshell-2ed", "max_stars_repo_head_hexsha": "760b0b8a296fb6be923c89406f61e773a48c59db", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 522, "max_stars_repo_stars_event_min_datetime": "2016-02-21T18:44:23.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-31T09:29:04.000Z", "max_issues_repo_path": "Figures/src/algs/chapter8/example7/Commands.mpl", "max_issues_repo_name": "linfachen/algorithms-nutshell-2ed", "max_issues_repo_head_hexsha": "17bd6e9cf9917727501f9eeadbfb2100f94eede0", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 3, "max_issues_repo_issues_event_min_datetime": "2020-04-09T01:52:52.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-13T08:18:55.000Z", "max_forks_repo_path": "Figures/src/algs/chapter8/example7/Commands.mpl", "max_forks_repo_name": "linfachen/algorithms-nutshell-2ed", "max_forks_repo_head_hexsha": "17bd6e9cf9917727501f9eeadbfb2100f94eede0", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 216, "max_forks_repo_forks_event_min_datetime": "2015-10-16T16:50:10.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-10T00:57:20.000Z", "avg_line_length": 22.3157894737, "max_line_length": 45, "alphanum_fraction": 0.6061320755, "num_tokens": 160, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9621075733703925, "lm_q2_score": 0.8615382094310355, "lm_q1q2_score": 0.8288924360415666}}
{"text": "est_pi := proc(num_steps::integer)\n   local step, s, x, mypi, i, start_time, stop_time:\n   printf(\"  Estimating Pi using: %1d slices\\n\", num_steps):\n   start_time := time[real]():\n   step := 1.0/num_steps:\n   s:=0:\n   for i from 1 to num_steps do \n      x:=(i-0.5)*step: \n      s:=s+(4.0/(1.0 + x*x)):  \n   end do:\n   mypi:=s*step:\n   stop_time := time[real]():\n   printf(\"Estimated value of Pi: %.16g\\n\", mypi):\n   printf(\"      Elapsed time(s): %.16g\\n\", stop_time - start_time):\n   printf(\"  Observed difference: %.16g\\n\", abs(Pi - mypi)):\n   mypi;\nend proc:\n\nnative_est_pi := proc(num_steps::integer)\n   local step, mypi, k, start_time, stop_time:\n   printf(\"  Estimating Pi using: %1d slices\\n\", num_steps):\n   start_time := time[real]():\n   mypi:=Re(sum((4/(1+(((k-0.5)/num_steps)^2))),k=1..num_steps)/num_steps):\n   stop_time := time[real]():\n   printf(\"Estimated value of Pi: %.16g\\n\", mypi):\n   printf(\"      Elapsed time(s): %.16g\\n\", stop_time - start_time):\n   printf(\"  Observed difference: %.16g\\n\", abs(Pi - mypi)):\n   mypi;   \nend proc:", "meta": {"hexsha": "8f795736d12dd018a50d245c72c98d75d9bd2b3c", "size": 1052, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "maple_pi_dir/est_pi.mpl", "max_stars_repo_name": "adrianjhpc/pi_examples", "max_stars_repo_head_hexsha": "ba624038a865e194b361d783a0e8647f2a9bb376", "max_stars_repo_licenses": ["CC0-1.0"], "max_stars_count": 19, "max_stars_repo_stars_event_min_datetime": "2016-04-13T11:39:40.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-29T19:22:06.000Z", "max_issues_repo_path": "maple_pi_dir/est_pi.mpl", "max_issues_repo_name": "adrianjhpc/pi_examples", "max_issues_repo_head_hexsha": "ba624038a865e194b361d783a0e8647f2a9bb376", "max_issues_repo_licenses": ["CC0-1.0"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2016-05-24T11:28:57.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-14T16:22:17.000Z", "max_forks_repo_path": "maple_pi_dir/est_pi.mpl", "max_forks_repo_name": "adrianjhpc/pi_examples", "max_forks_repo_head_hexsha": "ba624038a865e194b361d783a0e8647f2a9bb376", "max_forks_repo_licenses": ["CC0-1.0"], "max_forks_count": 7, "max_forks_repo_forks_event_min_datetime": "2017-10-12T15:08:45.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-25T09:35:21.000Z", "avg_line_length": 36.275862069, "max_line_length": 75, "alphanum_fraction": 0.602661597, "num_tokens": 354, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9433475810629194, "lm_q2_score": 0.8688267762381844, "lm_q1q2_score": 0.8196056377269856}}
{"text": "program sample19;\r\n\t/* Calculator program\t*/\r\n\t/*  c n : clear & set n\t*/\r\n\t/*  + n : add n\t\t\t*/\r\n\t/*  - n : subtract n\t*/\r\n\t/*  * n : multiply n\t*/\r\n\t/*  / n : divide by n\t\t*/\r\n\t/*  o : off\t\t\t\t*/\r\nprocedure gcmlcm(m, n, gc, lc : integer);\r\n\t/* gc := GCM(m,n), lc := LCM(m,n) */\r\n\t/* m and n are not changed        */\r\n var a,b,r : integer;\r\nbegin\r\n\ta := m;\r\n\tb := n;\r\n\twhile b <> 0 do begin\r\n\t\tr := a - (a div b) * b;\r\n\t\ta := b;\r\n\t\tb := r\r\n\tend;\r\n\tgc := a;\r\n\tlc := (m div gc) * n\r\nend;\r\nprocedure abs(a, b : integer);\r\nbegin\r\n  if a < 0 then b := -a  else b := a\r\nend;\r\nprocedure gcm(a, b, gc : integer);\r\n var lc, aa, bb : integer;\r\nbegin\r\n  if (a = 0) or (b = 0) then gc := 1\r\n  else begin\r\n  call abs(a,aa);  call abs(b,bb);\r\n  call gcmlcm(aa, bb, gc, lc)\r\n  end\r\nend;\r\nprocedure lcm(a, b, lc : integer);\r\n var gc, aa, bb : integer;\r\nbegin\r\n  if (a = 0) or (b = 0) then lc := 1\r\n  else begin\r\n  call abs(a,aa);  call abs(b,bb);\r\n  call gcmlcm(aa, bb, gc, lc)\r\n  end\r\nend;\r\nprocedure reduce(a1, a2 : integer);\r\n  var gc : integer;\r\nbegin\r\n  if a1 = 0 then begin a2 := 1; return end;\r\n  if a2 = 0 then begin a1 := 1; return end;\r\n  if a2 < 0 then begin a2 := -a2; a1 := -a1 end;\r\n  call gcm(a1, a2, gc);\r\n  a1 := a1 div gc;\r\n  a2 := a2 div gc\r\nend;\r\n\r\nprocedure sum(x1, x2, y1, y2 : integer);\r\n var lc, y11 : integer;\r\nbegin\r\n  call lcm(x2, y2, lc);\r\n  x1 := x1 * (lc div x2);\r\n  y11 := y1 * (lc div y2);\r\n  x1 := x1 + y11;\r\n  x2 := lc;\r\n  call reduce(x1, x2)\r\nend;\r\nprocedure sub(x1, x2, y1, y2 : integer);\r\n var lc, y11 : integer;\r\nbegin\r\n  call sum(x1, x2, -y1, y2)\r\nend;\r\nprocedure mult(x1, x2, y1, y2 : integer);\r\n var gc, y11, y22 : integer;\r\nbegin\r\n  call gcm(x1, y2, gc);\r\n  x1 := x1 div gc;\r\n  y22 := y2 div gc;\r\n  call gcm(x2, y1, gc);\r\n  x2 := x2 div gc;\r\n  y11 := y1 div gc;\r\n  x1 := x1 * y11;\r\n  x2 := x2 * y22;\r\n  call reduce(x1, x2)\r\nend;\r\nprocedure divide(x1, x2, y1, y2 : integer);\r\nbegin\r\n\tcall mult(x1, x2, y2, y1)\r\nend;\r\n\r\nprocedure printfinal(a, b : integer);\r\nbegin\r\n  if a = 0 then writeln('Final'' Result =', a)\r\n  else if b = 1 then writeln('Final Result =', a)\r\n  else writeln('Final Result =', a, '/', b)\r\nend;\r\nprocedure printtemp(a, b : integer);\r\nbegin\r\n  if a = 0 then writeln('Temporary Result =', a)\r\n  else if b = 1 then writeln('Temporary Result =', a)\r\n  else writeln('Temporary Result =', a, '/', b)\r\nend;\r\n\r\nvar\tx1, x2, y1,y2 : integer;\r\nvar\tcom :char;\r\n\tendflag : boolean;\r\nbegin\r\n\twriteln('   *** Calculator -- h for help ***');\r\n\tx1 := 0;  x2 :=1;\r\n\tendflag := false;\r\n\twhile not endflag do begin\r\n\t\twriteln(' Please input command :');\r\n\t\treadln(com, y1);  y2 := 1;\r\n\t\tif (com = 'c')  or (com = 'C') then begin x1 := y1; x2 := y2 end\r\n\t\telse if com = '+' then call sum(x1, x2, y1, y2)\r\n\t\telse if com = '-' then call sub(x1, x2, y1, y2)\r\n\t\telse if com = '*' then call mult(x1, x2, y1, y2)\r\n\t\telse if com = '/' then call divide(x1, x2, y1, y2)\r\n\t\telse if (com = 'o') or (com = 'O') then endflag := true\r\n\t\telse begin\r\n\t\t\twriteln;\r\n\t\t\twriteln('Calculator Usage:');\r\n\t\t\twriteln('  c number : clear & set it');\r\n\t\t\twriteln('  + number : add it');\r\n\t\t\twriteln('  - number : subtract it');\r\n\t\t\twriteln('  * number : multiply it');\r\n\t\t\twriteln('  / number : divide by it');\r\n\t\t\twriteln('  o        : off(terminate execution)');\r\n\t\t\twriteln\r\n\t\tend;\r\n\t\tif endflag then call printfinal(x1, x2)\r\n\t\telse call printtemp(x1, x2)\r\n\tend\r\nend.\r\n", "meta": {"hexsha": "e9232703f978dcedcd87c236daaa1d352a597371", "size": 3370, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "data/sample19.mpl", "max_stars_repo_name": "naru380/SoftwareExperience5", "max_stars_repo_head_hexsha": "89020bf73d9fc6b58f8d564c7aaed52a0e02f371", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "data/sample19.mpl", "max_issues_repo_name": "naru380/SoftwareExperience5", "max_issues_repo_head_hexsha": "89020bf73d9fc6b58f8d564c7aaed52a0e02f371", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "data/sample19.mpl", "max_forks_repo_name": "naru380/SoftwareExperience5", "max_forks_repo_head_hexsha": "89020bf73d9fc6b58f8d564c7aaed52a0e02f371", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 25.1492537313, "max_line_length": 67, "alphanum_fraction": 0.5430267062, "num_tokens": 1229, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. Yes\n2. Yes", "lm_q1_score": 0.9019206765295399, "lm_q2_score": 0.9073122282528899, "lm_q1q2_score": 0.8183236587293709}}