{"id":34835,"date":"2016-04-04T23:41:58","date_gmt":"2016-04-05T04:41:58","guid":{"rendered":"http:\/\/valevazquezruizblog.wordpress.com\/?p=240"},"modified":"2016-04-05T00:30:21","modified_gmt":"2016-04-05T05:30:21","slug":"quiz5-palindromos-ydivisiones-de-numeros-multiplos-de-3","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/quiz5-palindromos-ydivisiones-de-numeros-multiplos-de-3\/","title":{"rendered":"QUIZ#5, Palindromos ydivisiones de numeros multiplos de 3"},"content":{"rendered":"
\"quiz5\"
EJERCICIO NO.1 DEL QUIZ: se trata de hacer palindromos, trata de hacer un programa, donde al escribir cualquier palabra pueda decirnos si esta se lee de la misma forma al derecho y al rev\u00e9z, lo cual quiere decir que una palabra palindroma, es aquella que la lees de izquiera a derecha y se lee de una manera y al leerla de derecha a izquierda, se lle exactamente igual<\/figcaption><\/figure>\n
\"compilequiz5\"
la palaba arroz, no es palindroma. como bien lo dice el programa.<\/figcaption><\/figure>\n
\"compilequiz55\"
Como podemos ver la palabra oso si es palindroma, pues se lee igual de derecha a izquierda, que al rev\u00e9s.<\/figcaption><\/figure>\n
\"quiz5ej2\"
Este programa. nos sirve para dar una cantidad de n\u00fameros (especificandolos) y desu\u00e9s solo se sumar\u00e1n los que sean m\u00faltiplos de 3 y te dar\u00e1 un total.<\/figcaption><\/figure>\n

\"compilequiz5ej2\"<\/p>\n

C\u00d3DIGO 1.<\/p>\n

#include <iostream>
\nusing namespace std;
\nbool palindrome(string word){
\nint c=1;
\nstring invert=string(word.rbegin(), word.rend());
\nint z=word.size();
\nfor(int i=0; i<z; i=i+1){
\nif (word[i]==invert[i]) {
\nreturn true; }
\nelse {
\nreturn false; }
\nreturn 0; } }
\nint main(){
\nstring word;
\ncout<<“This program calculate if a single word is a palondrome or not”;
\ncout<<“Give the word to prove if its a palindrome or not”<<endl;
\ncin>>word;
\nif(palindrome(word)==false) {
\ncout<<word<<” “<<“Its NOT palindrome”<<endl; }
\nelse{
\ncout<<word<<” “<<“It\u00b4s a Palindrome”<<endl; }
\nreturn 0;
\n}<\/p>\n

C\u00d3DIGO 2.<\/p>\n

#include <iostream>
\nusing namespace std;<\/p>\n

int threesAdd(int range[], int numOfNum) {
\nint total=0;
\nint divi=0;
\nint val;
\nfor(int i=0; i<numOfNum; i=i+1){
\nval=range[i];
\nif(val%3==0){
\ncout<<val<<” “<<“Is divisible so it goes to the addition”<<endl;
\ndivi=divi+1;
\ntotal=total+val;}
\nelse { } }
\ncout<<“The total divisble numbers:”<<” “<<divi<<” “;
\nreturn total; }<\/p>\n

int main() {
\nint values;
\ncout<<“This program evaluates a range of numbers and make a total addition”<<endl;
\ncout<<“But it only add the ones which are divisibles by 3″<<endl;
\ncout<<“How many values you will type?”<<” “;
\ncin>>values;
\nint range[values];
\nfor(int <\/p>\n

\"\"<\/div>\n
\"\"<\/div>\n

i<values; i=i+1){
\ncout<<“Type the”<<” “<<i+1<<” “<<“number”<<endl;
\ncin>>range[i]; }
\ncout<<“The total addition of the no.3 divisibles is:”<<” “<<threesAdd(range, values)<<endl;
\nreturn 0;
\n}<\/p>\n

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

EJERCICIO NO.1 DEL QUIZ: se trata de hacer palindromos, trata de hacer un programa, donde al escribir cualquier palabra pueda decirnos si esta se lee de la misma forma al derecho y al rev\u00e9z, lo cual quiere decir que una palabra palindroma, es aquella que la lees de izquiera a derecha y se lee de … Continue reading QUIZ#5, Palindromos ydivisiones de numeros multiplos de 3<\/span><\/a><\/p>\n","protected":false},"author":41,"featured_media":34871,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[209,45],"class_list":["post-34835","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-quiz5","tag-sin-categoria"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/34835","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=34835"}],"version-history":[{"count":2,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/34835\/revisions"}],"predecessor-version":[{"id":34883,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/34835\/revisions\/34883"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media\/34871"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media?parent=34835"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/categories?post=34835"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/tags?post=34835"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}