Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //be back in ~1hour you lil bitch follow direction and theres no dupes but still msg me if it doesnt work
- //ADD THIS FUNCTION ABOVE MAIN
- int dup1(int a[0][0][5][5], int p, int c, int d)
- {
- int i, j;
- for (i = 0; i < 5; i++)
- {
- for (j = 0; j<5; j++)
- {
- if (a[p][c][i][j] == d)
- {
- return 1;
- }
- }
- }
- return 0;
- }
- // REPLACE ALL THAT SHIT WITH THIS
- int num = (int)rand() % 75 + 1;
- int dup = dup1(bingoBoard, a, b, num);
- while (dup != 0)
- {
- num = ((rand() % 75) + 1);
- dup = dup1(bingoBoard, a, b, num);
- }
- bingoBoard[z][x][i][j] = num;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement