Search found 1 match

Go to advanced search

by platipino
Fri Aug 13, 2010 9:07 am
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 320772

The 3n + 1 problem

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=29&page=show_problem&problem=36

here is what id did for the problem

#include <iostream>

using namespace std;

int kChains (long long number ,int counter )
{
if (number == 1 )
return ++counter;
else if (number % 2 ...

Go to advanced search