제출 #1105571

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1105571		ElayV13	Red-blue table (IZhO19_stones)	C++17	0 / 100	50 ms	1464 KiB

stones

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define int long long
#define ld long double
#define FOR(T) for(int i = 1;i <= T;i++) solve();
#define READ(a) for(int i = 0;i < a.size();i++) cin >> a[i];
#define NTL ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const int INF = 1e18;
const int sz = 1e6 + 5;
const int mod = 1e9 + 7;

void solve(){
   int n , m;
   cin >> n >> m;
   char a[n][m];
   for(int i = 0;i < n;i++){
      for(int j = 0;j < m;j++){
         a[i][j] = '+';
      }
   }
   a[0][m / 2] = '_';
   for(int i = 0;i < n;i++)
   {
      for(int j = 0;j < m;j++)
      {
         cout << a[i][j];
      }
      cout << endl;
   }
}

signed main(){
  NTL;
  int T = 1;
  cin >> T;
  FOR(T);
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31