#include <iostream>
using namespace std;
 
int spiral(int m, int n, int j, int i) {
 return i ? m + spiral(n - 1, m, i - 1, m - j - 1) : j;
}
 
int main () {
 const int n = 5;
 const int m = 7;
 int a[n][m];

#include <iostream>
#include <conio.h>
#include <math.h>
using namespace std;
 
int

count=0;
while (1) {
 array[count++%n]=...;
 //...
}

count=0;
while (1) {
 array[count++]=...;
 if (count==n) count=0;
 //...
}