\n

#WSQ12<\/a> #TC1017<\/a> #GCD<\/a><\/p>\n

For this program I had to calculate the greatest common divisor of two possitive integers, to do this we implemented Euclidean Algorithm, if you want to know more about this you can check this link: http:\/<\/wbr>\/<\/wbr>es.wikipedia.org\/<\/wbr>wiki\/<\/wbr>Algoritmo_de_Euclides<\/a><\/p>\n

I think that this program is really simple, because you only need to evaluate each case and apply the formula.<\/p>\n

For this program I think that is useful to know something about functions, because you can implement them and have a program more organized.<\/p>\n

Here you can see my code and the program working.<\/p>\n

<\/p>\n

<\/p>\n

Also you can find my code here:<\/p>\n

GitHub: https:\/<\/wbr>\/<\/wbr>github.com\/<\/wbr>taniaprogram\/<\/wbr>SolvingProblemsWithProgramming\/<\/wbr>blob\/<\/wbr>master\/<\/wbr>gcd.cpp<\/a><\/p>\n

Google Drive: https:\/<\/wbr>\/<\/wbr>drive.google.com\/<\/wbr>file\/<\/wbr>d\/<\/wbr>0B-NM4ghaDXBvYk1MT2dwWGhKQXc\/<\/wbr>view?usp=sharing<\/a><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

#WSQ12 #TC1017 #GCDFor this program I had to calculate the greatest common divisor of two possitive integers, to do this we implemented Euclidean Algorithm, if you want to know more about this you can check this link: http:\/\/es.wikipedia.org\/w… Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":107,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4,3,26],"tags":[410,40,356],"class_list":["post-10507","post","type-post","status-publish","format-standard","hentry","category-blogs","category-syndicated","category-tc1017blogs","tag-gcd","tag-tc1017","tag-wsq12"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2015\/wp-json\/wp\/v2\/posts\/10507","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101winter2015\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101winter2015\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2015\/wp-json\/wp\/v2\/users\/107"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2015\/wp-json\/wp\/v2\/comments?post=10507"}],"version-history":[{"count":1,"href":"https:\/\/kenscourses.com\/tc101winter2015\/wp-json\/wp\/v2\/posts\/10507\/revisions"}],"predecessor-version":[{"id":10508,"href":"https:\/\/kenscourses.com\/tc101winter2015\/wp-json\/wp\/v2\/posts\/10507\/revisions\/10508"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2015\/wp-json\/wp\/v2\/media?parent=10507"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2015\/wp-json\/wp\/v2\/categories?post=10507"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2015\/wp-json\/wp\/v2\/tags?post=10507"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}