Algorithms

Chris Maunder wrote:

- One. He gives it to four programmers, thereby simplifying the problem to a previous question.

Chris Maunder wrote:

tell me how the trees helped?"

"Certainly", say the snakes. "We're adders, so we need logs to multiply

int start = 1;
int divisor = 10;
while (divisor >= 2)
{
    if (start % divisor == divisor - 1)
    {
        divisor--;
    }
    else
    {
        start++;
        divisor = 10;
    }
}

Judah Himango wrote:

I kind of cheated.

Tech, life, family, faith: Give me a visit.
I'm currently blogging about: Messianic Instrumentals (with audio)
The apostle Paul, modernly speaking: Epistles of Paul

Judah Himango

#include <iostream>
using namespace std;

int main()
{
  int start = 1;
  int divisor = 10;
  while ( start <1000000 )  // Or whatevery you want in signed 32-bit range
  {
          while (divisor >= 2)
          {
                  if (start % divisor == divisor - 1)
                  {
                        divisor--;
                  }
                  else
                  {
                        start++;
                        divisor = 10;
                  }
           }

        cout<<start<<endl;
        divisor=10;
        start++;
  }

  return 0;
}

leppie wrote:

I wonder if its some kind of series...

Tech, life, family, faith: Give me a visit.
I'm currently blogging about: Messianic Instrumentals (with audio)
The apostle Paul, modernly speaking: Epistles of Paul

Judah Himango

Judah Himango wrote:

It appears to be every 2520.

leppie wrote:

So there are more than one of these. I wonder if its some kind of series...

Judah Himango wrote:

I kind of cheated though