{"id":293,"date":"2012-06-17T08:48:58","date_gmt":"2012-06-17T15:48:58","guid":{"rendered":"http:\/\/www.gdjogos.com.br\/blog\/?p=293"},"modified":"2021-06-18T15:58:58","modified_gmt":"2021-06-18T18:58:58","slug":"exercicios-em-3-linguagens","status":"publish","type":"post","link":"http:\/\/www.galirows.com.br\/meublog\/programacao\/exercicios-em-3-linguagens\/","title":{"rendered":"Exerc\u00edcios em 3 linguagens"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\">Nesse post \u00e9 mostrada a solu\u00e7\u00e3o de 2 exerc\u00edcios em 3 linguagens de programa\u00e7\u00e3o diferentes: C++, Python e Matlab. Al\u00e9m disso, s\u00e3o criadas solu\u00e7\u00f5es diferentes dentro da mesma linguagem.<\/p>\n\n\n\n<!--more-->\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Exerc\u00edcio 1:<\/strong> criar uma matriz identidade de tamanho NxN,&nbsp;onde N \u00e9 informado pelo usu\u00e1rio. Criar uma segunda matriz que \u00e9 o dobro da primeira.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o no C++<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><iframe loading=\"lazy\" src=\"\/\/www.youtube.com\/embed\/eyLVhGaB2P4?rel=0\" allowfullscreen=\"allowfullscreen\" width=\"640\" height=\"400\" frameborder=\"0\"><\/iframe><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o em C++ sem fun\u00e7\u00e3o<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code brush:cpp\"><code lang=\"cpp\" class=\"language-cpp\">int main(){\n    int n;\n    cout &lt;&lt; \"Dimens\u00e3o da matriz: \";\n    cin &gt;&gt; n;\n    int mat[100][100], int mat2[100][100];\n    for (int i=0;i&lt;n;i++) {\n        for (int j=0;j&lt;n;j++) {\n            if (i == j) {\n                mat[i][j] = 1;\n            } else {\n                mat[i][j] = 0;\n            }\n        }\n    }\n    for (int i=0;i&lt;n;i++) {\n        for (int j=0;j&lt;n;j++) {\n            mat2[i][j] = mat[i][j] * 2;\n        }\n    }\n    for (int i=0;i&lt;n;i++) {\n        for (int j=0;j&lt;n;j++) {\n            cout &lt;&lt; mat[i][j] &lt;&lt; \" \";\n        }\n        cout &lt;&lt; endl;\n    }\n    cout &lt;&lt; \"n\";\n    for (int i=0;i&lt;n;i++) {\n        for (int j=0;j&lt;n;j++) {\n            cout &lt;&lt; mat2[i][j] &lt;&lt; \" \";\n        }\n        cout &lt;&lt; endl;\n    }\n}<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o em C++ com fun\u00e7\u00e3o<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code brush:cpp\"><code lang=\"cpp\" class=\"language-cpp\">void matrizEye(int mat[100][100], int n) {\n    for (int i=0;i&lt;n;i++) {\n        for (int j=0;j&lt;n;j++) {\n            if (i == j) {\n                mat[i][j] = 1;\n            } else {\n                mat[i][j] = 0;\n            }\n        }\n    }\n}\n\nvoid mostraMatriz(int mat[100][100], int linhas, int colunas) {\n    for (int i=0;i&lt;linhas;i++) {\n        for (int j=0;j&lt;colunas;j++) {\n            cout &lt;&lt; mat[i][j] &lt;&lt; \" \";\n        }\n        cout &lt;&lt; endl;\n    }\n    cout &lt;&lt; endl;\n}\n\nvoid matrizMultiplica(int matFim[100][100], int matOriginal[100][100], int linhas, int colunas, int multiplicador) {\n    for (int i=0; i&lt;linhas;i++) {\n        for (int j=0; j&lt;colunas;j++) {\n            matFim[i][j] = matOriginal[i][j] * multiplicador;\n        }\n    }\n}\n\nint main() {\n    int mat1[100][100], mat2[100][100], n;\n    cout &lt;&lt; \"Dimens\u00e3o da matriz: \";\n    cin &gt;&gt; n;\n\n    matrizEye(mat1,n);\n    matrizMultiplica(mat2, mat1, n, n, 2);\n    mostraMatriz(mat1, n, n);\n    mostraMatriz(mat2, n, n);\n}<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o no Python<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><iframe loading=\"lazy\" src=\"\/\/www.youtube.com\/embed\/iGZMVbD9FSQ?rel=0\" allowfullscreen=\"allowfullscreen\" width=\"640\" height=\"400\" frameborder=\"0\"><\/iframe><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o em Python sem fun\u00e7\u00e3o<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code brush:py\"><code lang=\"python\" class=\"language-python\">n = input('Dimens\u00e3o da matriz: ')\nmat = [0]*n\nfor i in range(n):\n    mat[i] = [0]*n\n\nmat2 = [0]*n\nfor i in range(n):\n    mat2[i] = [0]*n\n\nfor i in range(n):\n    for j in range(n):\n        if i == j:\n            mat[i][j] = 1\n        else:\n            mat[i][j] = 0\n\nfor i in range(n):\n    print mat[i][:]\nprint 'n'\n\nfor i in range(n):\n    for j in range(n):\n        mat2[i][j] = mat[i][j] * 2\n\nfor i in range(n):\n    print mat2[i][:]<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o em Python com fun\u00e7\u00e3o<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code brush:py\"><code lang=\"python\" class=\"language-python\">def criaMatriz(n,m):\n    mat = [0]*n\n    for i in range(m):\n        mat[i] = [0]*n\n    return mat\n\ndef criaMatrizEye(n):\n    mat = criaMatriz(n,n)\n    for i in range(n):\n        mat[i][i] = 1 \n    return mat\n\ndef mostraMatriz(mat,n):\n    for i in range(n):\n        print mat[i][:]\n    print 'n'\n\nn = input('Dimens\u00e3o da matriz: ')\nmat1 = criaMatrizEye(n)\nmat2 = criaMatriz(n,n)\n\nmostraMatriz(mat1,n)\nmostraMatriz(mat2,n)\n\nfor i in range(n):\n    for j in range(n):\n        mat2[i][j] = mat1[i][j] * 2\n\nmostraMatriz(mat2,n)<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o no Matlab<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><iframe loading=\"lazy\" src=\"\/\/www.youtube.com\/embed\/oLefmQKMA1I?rel=0\" allowfullscreen=\"allowfullscreen\" width=\"640\" height=\"400\" frameborder=\"0\"><\/iframe><\/p>\n\n\n\n<pre class=\"wp-block-code brush:py\"><code lang=\"matlab\" class=\"language-matlab\">n = input('Dimens\u00e3o da matriz: ');\nmat = eye(n);\nmat2 = mat * 2;\nmat2<\/code><\/pre>\n\n\n\n<hr class=\"wp-block-separator\"\/>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Exerc\u00edcio 2:<\/strong> Criar um vetor com 100 posi\u00e7\u00f5es com valores entre 10 e 50. Encontrar o maior, quantas vezes aparece e uma posi\u00e7\u00e3o onde ele pode ser encontrado.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o no C++<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><iframe loading=\"lazy\" src=\"\/\/www.youtube.com\/embed\/mCBaQoYAqrE?rel=0\" allowfullscreen=\"allowfullscreen\" width=\"640\" height=\"400\" frameborder=\"0\"><\/iframe><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o em C++ sem fun\u00e7\u00e3o<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code brush:cpp\"><code lang=\"cpp\" class=\"language-cpp\">int main() {\n    srand(time(NULL));\n    int vetor[100], maior, vezes, posicao;\n\n    for (int i = 0; i &lt; 100; i++) {\n        vetor[i] = rand() % 40 + 10;\n        cout &lt;&lt; vetor[i] &lt;&lt; \" \";\n    }\n\n    maior = vetor[0];\n    vezes = 1;\n    posicao = 0;\n    for (int i = 1; i &lt; 100; i++) {\n        if (vetor[i] &gt; maior) {\n            maior = vetor[i];\n            posicao = i;\n            vezes = 1;\n        } else if (vetor[i] == maior) {\n            vezes++;\n        }\n    }\n\n    cout &lt;&lt; \"nMaior valor: \" &lt;&lt; maior;\n    cout &lt;&lt; \"nAparece \" &lt;&lt; vezes &lt;&lt; \" vezes\";\n    cout &lt;&lt; \"n\u00cdndice: \" &lt;&lt; posicao;\n}<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o em C++ com fun\u00e7\u00e3o<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code brush:cpp\"><code lang=\"cpp\" class=\"language-cpp\">#include &lt;iostream&gt;\n#include &lt;stdlib.h&gt;\n\nusing namespace std;\n\n#define TAM 5\n\nvoid preencheVetor(int vet[], int tam, int min, int max) {\n    for (int i = 0; i &lt; tam; i++) {\n        vet[i] = rand() % (max-min+1) + min;\n    }\n}\n\nvoid mostraVetor(int vet[], int tam) {\n    for (int i = 0; i &lt; tam; i++) {\n        cout &lt;&lt; vet[i] &lt;&lt; \" \";\n    }\n}\n\nint encontraMaior(int vet[], int tam) {\n    int maior = vet[0];\n    for (int i = 1; i &lt; tam; i++) {\n        if (vet[i] &gt; maior) {\n            maior = vet[i];\n        }\n    }\n    return maior;\n}\n\nint contaVezes(int vet[], int tam, int num) {\n    int vezes = 0;\n    for (int i = 1; i &lt; tam; i++) {\n        if (vet[i] == num) {\n            vezes++;\n        }\n    }\n    return vezes;\n}\n\nint encontraPosicao(int vet[], int tam, int num) {\n    for (int i = 0; i &lt; tam; i++) {\n        if (vet[i] == num) {\n            return i;\n        }\n    }\n    return -1;\n}\n\nusing namespace std;\n\nint main() {\n    srand(time(NULL));\n    int vetor[TAM], maior;\n    preencheVetor(vetor, TAM, 10, 50);\n    mostraVetor(vetor, TAM);\n\n    maior = encontraMaior(vetor, TAM);\n    cout &lt;&lt; \"nMaior valor: \" &lt;&lt; maior;\n    cout &lt;&lt; \"nAparece \" &lt;&lt; contaVezes(vetor, TAM, maior) &lt;&lt; \" vezes\";\n    cout &lt;&lt; \"nIndice: \" &lt;&lt; encontraPosicao(vetor, TAM, maior);\n}<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o no Python<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><iframe loading=\"lazy\" src=\"\/\/www.youtube.com\/embed\/7W8fpFDva4w?rel=0\" allowfullscreen=\"allowfullscreen\" width=\"640\" height=\"400\" frameborder=\"0\"><\/iframe><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o em Python sem fun\u00e7\u00e3o<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code brush:py\"><code lang=\"python\" class=\"language-python\">import random\n\nTAM = 5\n\nvet = [0]*TAM\n\nfor i in range(TAM):\n    vet[i] = random.randint(10,50)\nprint vet\n\nmaior = max(vet)\nprint 'O maior valor do vetor \u00e9: ', maior\n\nvezes = 0\nfor i in range(TAM):\n    if vet[i] == maior:\n        vezes = vezes + 1\n        posicao = i\n\nprint vezes\nprint 'Encontrado no \u00edndice ', posicao, ' do vetor'<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o em Python com fun\u00e7\u00e3o<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code brush:py\"><code lang=\"python\" class=\"language-python\">def criaVetor(tamanho, valorMin, valorMax):\n    import random\n\n    vet = [0]*tamanho\n\n    for i in range(tamanho):\n        vet[i] = random.randint(valorMin,valorMax) \n\n    return vet\n\nvetor = criaVetor(10, 10, 50)\nprint vetor\n\nmaior = max(vetor)\n\nprint 'nMaior valor: ', maior\nprint 'O maior valor aparece ', vetor.count(maior), ' vezes'\nprint 'Um \u00edndice desse valor \u00e9: ', vetor.index(maior)<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Solu\u00e7\u00e3o no Matlab<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><iframe loading=\"lazy\" src=\"\/\/www.youtube.com\/embed\/zZwT4gM_muM?rel=0\" allowfullscreen=\"allowfullscreen\" width=\"640\" height=\"400\" frameborder=\"0\"><\/iframe><\/p>\n\n\n\n<pre class=\"wp-block-code brush:py\"><code lang=\"matlab\" class=\"language-matlab\">TAM = 5;\nvet = round( rand(1,TAM) * 40 + 10 )\nmaior = max(vet)\nvezes = 0;\n\nfor i = 1:TAM\n\tif vet(i) == maior\n\t\tvezes = vezes + 1;\n\t\tposicao = i;\n\tendif\nendfor\n\nprintf('N\u00famero de vezes: %in', vezes)\nprintf('Posi\u00e7\u00e3o: %in', i)<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Nesse post \u00e9 mostrada a solu\u00e7\u00e3o de 2 exerc\u00edcios em 3 linguagens de programa\u00e7\u00e3o diferentes: C++, Python e Matlab. Al\u00e9m disso, s\u00e3o criadas solu\u00e7\u00f5es diferentes dentro da mesma linguagem.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[3,5,4],"tags":[13,8],"class_list":["post-293","post","type-post","status-publish","format-standard","hentry","category-c","category-python","category-videos","tag-matriz","tag-modularizacao-funcoes"],"aioseo_notices":[],"amp_enabled":true,"_links":{"self":[{"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/posts\/293","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/comments?post=293"}],"version-history":[{"count":9,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/posts\/293\/revisions"}],"predecessor-version":[{"id":1098,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/posts\/293\/revisions\/1098"}],"wp:attachment":[{"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/media?parent=293"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/categories?post=293"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/tags?post=293"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}