Square numbers modulo thirteen

n2mod13.cpp

// Copy and paste into http://www.compileonline.com/compile_cpp11_online.php to run.
#include <iostream>

using namespace std;

int main()
{
    int n2Mod13;
    for (int n=0; n<100; n++) {
        n2Mod13 = (n*n) % 13;
        for (int count=0; count<n2Mod13; count++)
            cout << "*"; // This happends as many times as the inner for-loop runs.  Note that you don't need curly braces for just one statement.
        cout << endl;
    }

    return 0;
}