summaryrefslogtreecommitdiff
path: root/prolog/problems/clp_fd/gcd_3
diff options
context:
space:
mode:
authorAleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>2015-12-15 10:45:30 +0100
committerAleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>2015-12-15 10:46:19 +0100
commit2a4a1d39bfcfb8b258be96c180dde09a12345295 (patch)
treedac9e6080fac3adf0fe0b5d93a65ea0259a5b2e6 /prolog/problems/clp_fd/gcd_3
parentf22468b134a88fcd7acb1415c9997f578f1abe7b (diff)
Add Slovenian translations for Prolog.{clp_fd,dcg}
Diffstat (limited to 'prolog/problems/clp_fd/gcd_3')
-rw-r--r--prolog/problems/clp_fd/gcd_3/sl.py14
1 files changed, 14 insertions, 0 deletions
diff --git a/prolog/problems/clp_fd/gcd_3/sl.py b/prolog/problems/clp_fd/gcd_3/sl.py
new file mode 100644
index 0000000..9ef1a87
--- /dev/null
+++ b/prolog/problems/clp_fd/gcd_3/sl.py
@@ -0,0 +1,14 @@
+# coding=utf-8
+
+name = 'gcd/3'
+slug = 'Največji skupni delitelj'
+
+description = '''\
+<p><code>gcd(X, Y, GCD)</code>: <code>GCD</code> je največji skupni delitelj števil <code>X</code> in <code>Y</code>. Implementiraj ta predikat z uporabo omejitev.</p>
+<p>Namig: poskusi najprej napisati predikat, ki poišče <em>vse</em> skupne delitelje dveh števil.</p>
+<pre>
+ ?- gcd(36, 84, GCD).
+ GCD = 12.
+</pre>'''
+
+hint = {}