Revision history of "Solução: Problema do número binariamente contido (Filipe Teles)"

From AdonaiMedrado.Pro.Br
Jump to: navigation, search

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • (cur | prev) 14:00, 29 April 2009‎ 200.17.147.2 (Talk)‎ . . (375 bytes) (+375)‎ . . (New page: <code lang="c"> #include <stdio.h> int main() { int n, m, k, direita; scanf("%d", &n); scanf("%d", &m); scanf("%d", &k); //((1 << k) -1) == k bits à direita com 1 direita = (...)
Retrieved from "https://www.adonaimedrado.pro.br/wiki/index.php/Solução:_Problema_do_número_binariamente_contido_(Filipe_Teles)"