Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <math.h>
- #include <iostream>
- int Mining(int* Miner, int Dimension, int** Mine)
- {
- int Score = *Miner;
- for (int i = 1; i < Dimension; i++)
- {
- int BestMove = 0;
- for (int j = 0; j < Dimension; j++)
- {
- int Top = Mine[i+1][j-1];
- int Middle = Mine[i + 1][j];
- int Bottom = Mine[i + 1][j + 1];
- if(BestMove<Top)
- {
- BestMove = Top;
- }
- if (BestMove < Middle)
- {
- BestMove = Middle;
- }
- if (BestMove < Bottom)
- {
- BestMove = Bottom;
- }
- Score += BestMove;
- }
- }
- printf("%d", Score);
- return Score;
- }
- int main()
- {
- //Variables
- int Normal = 2;
- int Dimension = 1;
- int MostDiamonds = 0;
- int* Miner=0;
- int Score;
- //Check
- do {
- scanf_s("%d", &Dimension);
- } while (1 >= Dimension >= 100);
- int** Mine=(int**)malloc(Dimension * sizeof(int));;
- //Array Allocation
- for (int i = 0; i < Dimension; i++)
- {
- Mine[i] = (int*)malloc(Dimension * sizeof(int));
- }
- //Fill Up
- for (int i = 0; i < Dimension; i++)
- {
- for (int j = 0; j < Dimension; j++)
- {
- int m=0;
- scanf_s("%d", &m);
- Mine[i][j] = m;
- }
- }
- //Printing the results
- for (int i = 0; i < Dimension; i++)
- {
- for (int j = 0; j < Dimension; j++)
- {
- printf("%d", Mine[i][j]);
- }
- }
- //Starting point
- for (int i = 0; i < Dimension; i++)
- {
- if (MostDiamonds < (int)Mine[0][i])
- {
- MostDiamonds = Mine[0][i];
- }
- if (MostDiamonds == Mine[0][i])
- {
- Miner = &Mine[0][i];
- }
- }
- printf("\n%p", Miner);
- printf("\n%i", *Miner);
- Score = Mining(Miner, Dimension, Mine);
- printf("\n%d", Score);
- return 0;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement