CodeChef July
Long Challenge 2020
Ada King
(ADAKING)
Problem Description
Examples
4 1 5 9 64
Solution
| X | X | X | X | X | X | X | |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |

Suppose k = 4
k--
k = 3
Solution
| . | X | X | X | X | X | X | |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |

Suppose k = 4
k--
k = 2
Solution
| . | . | X | X | X | X | X | |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |

Suppose k = 4
k--
k = 1
Solution
| . | . | . | X | X | X | X | |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |

Suppose k = 4
k--
k = 0
STOP
Solution
| . | . | . | X | X | X | X | |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |

Suppose k = 4
k--
k = 0
STOP
Solution
| . | . | . | X | X | X | X | |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |

Suppose k = 4
k--
k = 0
STOP
Solution
| . | . | . | X | X | X | X | |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |

Suppose k = 4
k--
k = 0
STOP
Solution
| . | . | . | X | X | X | X | |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |
| X | X | X | X | X | X | X | X |

Suppose k = 4
k--
k = 0
STOP
Code
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out1.txt", "w", stdout);
#endif
int t;
cin >> t;
while(t--)
{
int k;
cin >> k;
char arr[8][8];
for(int i = 0; i<8; i++)
{
for(int j = 0; j<8; j++)
{
arr[i][j] = 'X';
}
}
arr[0][0] = 'O';
k--;
for(int i =0; i<8; i++)
{
for(int j = 0; j<8; j++)
{
if(i == 0 && j == 0)
continue;
if(k == 0)
break;
arr[i][j] = '.';
k--;
}
if(k == 0)
break;
}
for(int i =0; i<8; i++)
{
for(int j = 0; j<8; j++)
{
cout << (char)arr[i][j];
}
cout << endl;
}
cout << endl;
}
return 0;
}Any Doubts
If you still have any doubts you can comment your doubts in the comment section.
If you have a better approach than this you can also comment it out.
Like, Share, Subscribe!
If you like our efforts Please Do Like this video, share it with your friends who was not able to solve this problem.
Also Do subscribe this channel because more video Editorials and coding related content is coming on this channel.
Like, Share, Subscribe!
Ada King
By gauravsahu
Ada King
- 63