Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define ll long long
- #define ull unsigned long long
- #define pi 3.141592654
- #define NUM 1e18
- #define Mod 1'000'000'007
- #define fixed(n) fixed<<setprecision(n)
- #define cin(v) for(auto &i:v) cin >> i ;
- #define cout(v) for(auto &i:v) cout << i <<" ";
- #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
- #define small(x) (x>=97&&x<=122)
- #define capital(x) (x>=65&&x<=90)
- #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
- #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
- #define all(v) ((v).begin()), ((v).end())
- #define allr(v) ((v).rbegin()), ((v).rend())
- #define updmax(a,b) a=max(a,b)
- #define updmin(a,b) a=min(a,b)
- #define ceil(a,b) ((a/b)+(a%b?1:0))
- /* asc -> 1 2 3 ,des -> 3 2 1 */
- /***********************************************************************************/
- using namespace std;
- void Rofyda_Elghadban(){
- #ifndef ONLINE_JUDGE
- freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
- #endif
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- }
- void solve(){
- int t;
- cin>>t;
- while(t--){
- char arr[10][10];
- int ans=0,c1=0,c2=0,c3=0,c4=0,c5=0;
- for(int i=0;i<10;i++){
- for(int j=0;j<10;j++){
- cin>>arr[i][j];
- }
- }
- for(int i=0;i<10;i++){
- for(int j=0;j<10;j++){
- if(arr[1-1][1-1]=='X'||arr[1-1][2-1]=='X'||arr[1-1][3-1]=='X'||arr[1-1][4-1]=='X'||arr[1-1][5-1]=='X'
- ||arr[1-1][6-1]=='X'||arr[1-1][7-1]=='X'||arr[1-1][8-1]=='X'||arr[1-1][9-1]=='X'||arr[1-1][10-1]=='X'
- ||arr[2-1][1-1]=='X'||arr[3-1][1-1]=='X'||arr[4-1][1-1]=='X'||arr[5-1][1-1]=='X'||arr[6-1][1-1]=='X'
- ||arr[7-1][1-1]=='X'||arr[8-1][1-1]=='X'||arr[9-1][1-1]=='X'||arr[10-1][1-1]=='X'||arr[10-1][2-1]=='X'
- ||arr[10-1][3-1]=='X'||arr[10-1][4-1]=='X'||arr[10-1][5-1]=='X'||arr[10-1][6-1]=='X'||arr[10-1][7-1]=='X'
- ||arr[10-1][8-1]=='X'||arr[10-1][9-1]=='X'||arr[10-1][10-1]=='X'||arr[2-1][10-1]=='X'||arr[3-1][10-1]=='X'
- ||arr[4-1][10-1]=='X'||arr[5-1][10-1]=='X'||arr[6-1][10-1]=='X'||arr[7-1][10-1]=='X'||arr[8-1][10-1]=='X'
- ||arr[9-1][10-1]=='X'){
- c1++;
- }
- else if(arr[2-1][2-1]=='X'||arr[2-1][3-1]=='X'||arr[2-1][4-1]=='X'||arr[2-1][5-1]=='X'
- ||arr[2-1][6-1]=='X'||arr[2-1][7-1]=='X'||arr[2-1][8-1]=='X'||arr[2-1][9-1]=='X'||arr[3-1][2-1]=='X'
- ||arr[4-1][2-1]=='X'||arr[5-1][2-1]=='X'||arr[6-1][2-1]=='X'||arr[7-1][2-1]=='X'||arr[8-1][2-1]=='X'
- ||arr[9-1][2-1]=='X'||arr[9-1][3-1]=='X'||arr[9-1][4-1]=='X'||arr[9-1][5-1]=='X'||arr[9-1][6-1]=='X'
- ||arr[9-1][7-1]=='X'||arr[9-1][8-1]=='X'||arr[9-1][9-1]=='X'||arr[3-1][9-1]=='X'||arr[4-1][9-1]=='X'
- ||arr[5-1][9-1]=='X'||arr[6-1][9-1]=='X'||arr[7-1][9-1]=='X'||arr[8-1][9-1]=='X'){
- c2++;
- }
- else if(arr[3-1][3-1]=='X'||arr[3-1][4-1]=='X'||arr[3-1][5-1]=='X'||arr[3-1][6-1]=='X'
- ||arr[3-1][7-1]=='X'||arr[3-1][8-1]=='X'||arr[4-1][3-1]=='X'||arr[5-1][3-1]=='X'
- ||arr[6-1][3-1]=='X'||arr[7-1][3-1]=='X'||arr[8-1][3-1]=='X'||arr[8-1][4-1]=='X'
- ||arr[8-1][5-1]=='X'||arr[8-1][6-1]=='X'||arr[8-1][7-1]=='X'||arr[8-1][8-1]=='X'
- ||arr[4-1][8-1]=='X'||arr[5-1][8-1]=='X'||arr[6-1][8-1]=='X'||arr[7-1][8-1]=='X'){
- c3++;
- }
- else if(arr[4-1][4-1]=='X'||arr[4-1][5-1]=='X'||arr[4-1][6-1]=='X'||arr[4-1][7-1]=='X'
- ||arr[5-1][4-1]=='X'||arr[6-1][4-1]=='X'||arr[7-1][4-1]=='X'||arr[7-1][5-1]=='X'
- ||arr[7-1][6-1]=='X'||arr[7-1][7-1]=='X'||arr[5-1][7-1]=='X'||arr[6-1][7-1]=='X'){
- c4++;
- }
- else if(arr[5-1][5-1]=='X'||arr[5-1][6-1]=='X'||arr[6-1][5-1]=='X'||arr[6-1][6-1]=='X'){
- c5++;
- }
- }
- }
- ans=(c1*1)+(c2*2)+(c3*3)+(c4*4)+(c5*5);
- cout<<c1<<" "<<c2<<" "<<c3<<" "<<c4<<" "<<c5<<" "<<ans<<"\n";
- }
- }
- int main(){
- Rofyda_Elghadban();
- solve();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement