I am using I-Ching/Mayan(Tzolkin) calendar ,on this calendar each day the entire set up get changed for example from two sixty days today is the first day and tomorrow will be second and so on. Tzolkin is designed by 260(13X20) days and each day has its own specialty. If I randomly choose 1-64(the I-Ching) ,add two at one time and get a particular 4 of 260 to locate on on I-Ching meanings.
I am standing where right now:
#include <iostream>
usingnamespace std;
main ()
{
for(int c=0;c<65;)
{
if (a<10,b<17)
{
for(a,b;a<10,b<17;a+=4,b+=4)
{
c++;
return a, b;//so the current date is being added to
}
}
else
{
c++;
return a+=4-13, b+=4-20;
}
cout << c=1 << c=17 << c=33 << c=49;//I know this doesn't work
}
}
What I need is to take date of Tzolkin with continuously adding to the Tones(1-13) 4 and Signs(1-20) until it approaches 65 various combinations of Tone Sign. Once I get them all I only want to get the total or c, when it approaches as 1/17/33/49.Something like a, b come back in case of c=x for each example of a, b in case of c = 1-65. I am reading this code: https://www.theengineeringprojects.com/2020/01/form-validation-in-asp-net-core.html
Visual studio screw fails to assemble as set more than 128.