Move History

Rooted by: Numbers Divided by 2
Fork Selected
  • Code 
    unsigned long long div2(unsigned long long a){
  unsigned long long ans = 0, i;
  for (i = 1; i <= a; i++) {
    if (i % 2 != 0){
      continue;
    } else {
      ans++;
    }
  }
  return ans;
}
     Test Cases 
    // TODO: Replace examples and use TDD by writing your own tests

Describe(d2)
{
    It(under10)
    {
        Assert::That(div2(10), Equals(5));
        Assert::That(div2(0), Equals(0));
        Assert::That(div2(3), Equals(1));
    }
    It(huge_numbers)
    {
        Assert::That(div2(65536), Equals(32768));
        Assert::That(div2(6553665535), Equals(3276832767));
        Assert::That(div2(1234567890), Equals(617283945));
    }
};
    View Run Output
  • Code
    • unsigned long long div2(unsigned long long a){
    • unsigned long long ans = 0, i;
    • for (i = 1; i <= a; i++) {
    • if (i % 2){
    • if (i % 2 != 0){
    • continue;
    • } else {
    • ans++;
    • }
    • }
    • return ans;
    • }