tfindbestsq.cpp

/*************************************************************************************
 * MechSys - A C++ library to simulate (Continuum) Mechanical Systems                *
 * Copyright (C) 2005 Dorival de Moraes Pedroso <dorival.pedroso at gmail.com>       *
 * Copyright (C) 2005 Raul Dario Durand Farfan  <raul.durand at gmail.com>           *
 *                                                                                   *
 * This file is part of MechSys.                                                     *
 *                                                                                   *
 * MechSys is free software; you can redistribute it and/or modify it under the      *
 * terms of the GNU General Public License as published by the Free Software         *
 * Foundation; either version 2 of the License, or (at your option) any later        *
 * version.                                                                          *
 *                                                                                   *
 * MechSys is distributed in the hope that it will be useful, but WITHOUT ANY        *
 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A   *
 * PARTICULAR PURPOSE. See the GNU General Public License for more details.          *
 *                                                                                   *
 * You should have received a copy of the GNU General Public License along with      *
 * MechSys; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, *
 * Fifth Floor, Boston, MA 02110-1301, USA                                           *
 *************************************************************************************/

// STL
#include <iostream>

// MechSys
#include "util/util.h"
#include "util/numstreams.h"

using std::cout;
using std::endl;
using Util::_4;

int main(int argc, char **argv)
{
    // Find best squared grid
    const int MAX_SIZE = 100;
    for (int i=1; i<=MAX_SIZE; ++i)
    {
        int nrow = -1;
        int ncol = -1;
        Util::FindBestSquare(i, nrow,ncol);
        cout << _4()<< nrow << _4()<< ncol << _4()<< nrow*ncol << endl;
    }

    return 0;
}

---