{"id":34833,"date":"2016-04-04T23:57:13","date_gmt":"2016-04-05T04:57:13","guid":{"rendered":"http:\/\/valevazquezruizblog.wordpress.com\/?p=257"},"modified":"2016-04-05T00:29:40","modified_gmt":"2016-04-05T05:29:40","slug":"quiz6-euclide-algorythm","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/quiz6-euclide-algorythm\/","title":{"rendered":"QUIZ#6, Euclide algorythm"},"content":{"rendered":"
\"quiz6\"
Resumiendo las instrucciones, deber\u00edamos crear un c\u00f3digo que recibe dos n\u00fameros o par\u00e1metros por parte del usuario, a continuaci\u00f3n, en una funci\u00f3n se va a imprimir el mayor denominador que divide a ambos n\u00fameros.<\/figcaption><\/figure>\n

\"quiz6compile\"<\/p>\n

C\u00d3DIGO:<\/p>\n

 <\/p>\n

#include <iostream><\/p>\n

using namespace std;<\/p>\n

 <\/p>\n

int euclidianAlgo(int first, int second){<\/p>\n

int tem=0;<\/p>\n

int res=first%second;<\/p>\n

while(res!=0){<\/p>\n

first=second;<\/p>\n

second=res;<\/p>\n

res=first%second; }<\/p>\n

 <\/p>\n

return second; }<\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n

int main() {<\/p>\n

int first, second, val;<\/p>\n

cout<<“This program does the Euclidian Algorithm of the range of numbers you give”<<endl;<\/p>\n

cout<<“Type the lower value”<<endl;<\/p>\n

cin>>first;<\/p>\n

cout<<“Ok now type the higher value”<<endl;<\/p>\n

cin>>second;<\/p>\n

val=euclidianAlgo(first, second);<\/p>\n

cout<<“The greatest denominator of the two numbers is: “<<” “<<val<<endl; }<\/p>\n

\"\"<\/a> \"\"<\/p>\n","protected":false},"excerpt":{"rendered":"

Resumiendo las instrucciones, deber\u00edamos crear un c\u00f3digo que recibe dos n\u00fameros o par\u00e1metros por parte del usuario, a continuaci\u00f3n, en una funci\u00f3n se va a imprimir el mayor denominador que divide a ambos n\u00fameros. C\u00d3DIGO:   #include <iostream> using namespace std;   int euclidianAlgo(int first, int second){ int tem=0; int res=first%second; while(res!=0){ first=second; second=res; res=first%second; … Continue reading QUIZ#6, Euclide algorythm<\/span><\/a><\/p>\n","protected":false},"author":41,"featured_media":34864,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[223,45],"class_list":["post-34833","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-quiz6","tag-sin-categoria"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/34833","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/users\/41"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/comments?post=34833"}],"version-history":[{"count":2,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/34833\/revisions"}],"predecessor-version":[{"id":34870,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/34833\/revisions\/34870"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media\/34864"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media?parent=34833"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/categories?post=34833"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/tags?post=34833"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}