제출 #1128901

#제출 시각아이디문제언어결과실행 시간메모리
1128901ByeWorldRed-blue table (IZhO19_stones)C++20
0 / 100
20 ms1348 KiB
#include <bits/stdc++.h> #pragma GCC optimize("O3") #define int long long #define ll long long #define pb push_back #define fi first #define se second #define lf (id<<1) #define rg ((id<<1)|1) #define md ((l+r)>>1) #define ld long double using namespace std; typedef pair<int,int> pii; typedef pair<char,char> pcc; typedef pair<int,pii> ipii; typedef pair<pii,pii> ipiii; const int MAXN = 3e5+10; const int MAXA = 1e6; const int INF = 1e18+10; const int MOD = 1e9+7; const int LOG = 32; const ld EPS = 1e-12; int n, m; signed main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int T; cin >> T; while(T--){ cin >> n >> m; cout << n+(m-m/2-1) << '\n'; for(int i=1; i<=n; i++){ for(int j=1; j<=m/2+1; j++) cout << "+"; for(int j=m/2+2; j<=m; j++) cout << "-"; cout << '\n'; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...