제출 #157885

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
157885		mrboorger	Red-blue table (IZhO19_stones)	C++14	컴파일 에러	0 ms	0 KiB

stones

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define F first
#define S second
#define ll long long
#define ld long double#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define F first
#define S second
#define ll long long
#define ld long double
#define sqr(x) (x) * (x)
//#define all(a) a.begin(), a.end()

using namespace std;
using namespace __gnu_pbds;

//typedef tree<
//pair <int, int>,
//null_type,
//greater<pair <int, int>>,
//rb_tree_tag,
//tree_order_statistics_node_update>
//ordered_set;

const int maxn = 1002;
char a[maxn][maxn];

int main()
{
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    for(int ii = 0; ii < t; ++ii)
    {
        int n, m;
        cin >> n >> m;
        if (n >= m)
        {
            int ans = 0;
            for(int i = 0; i < n; ++i)
            {
                ++ans;
                for(int j = 0; j < m / 2 + (m + 1) % 2; ++j)
                    a[i][j] = '+';
            }
            for(int j = m / 2 + (m + 1) % 2; j < m; ++j)
            {
                ++ans;
                for(int i = 0; i < n; ++i)
                    a[i][j] = '-';
            }
            cout << ans << '\n';
            for(int i = 0; i < n; ++i)
            {
                for(int j = 0; j < m; ++j)
                    cout << a[i][j];
                cout << '\n';
            }
        }
        else
        {
            int ans = 0;
            for(int j = 0; j < m; ++j)
            {
                ++ans;
                for(int i = 0; i < n / 2 + (n + 1) % 2; ++i)
                    a[i][j] = '-';
            }
            for(int i = n / 2 + (n + 1) % 2; i < n; ++i)
            {
                ++ans;
                for(int j = 0; j < m; ++j)
                    a[i][j] = '+';
            }
            cout << ans << '\n';
            for(int i = 0; i < n; ++i)
            {
                for(int j = 0; j < m; ++j)
                    cout << a[i][j];
                cout << '\n';
            }
        }
    }
    return 0;
}

#define sqr(x) (x) * (x)
//#define all(a) a.begin(), a.end()

using namespace std;
using namespace __gnu_pbds;

//typedef tree<
//pair <int, int>,
//null_type,
//greater<pair <int, int>>,
//rb_tree_tag,
//tree_order_statistics_node_update>
//ordered_set;

const int maxn = 1002;
char a[maxn][maxn];

int main()
{
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    for(int ii = 0; ii < t; ++ii)
    {
        int n, m;
        cin >> n >> m;
        if (n >= m)
        {
            int ans = 0;
            for(int i = 0; i < n; ++i)
            {
                ++ans;
                for(int j = 0; j < m / 2 + m % 2; ++j)
                    a[i][j] = '+';
            }
            for(int j = m / 2 + m % 2; j < m; ++j)
            {
                ++ans;
                for(int i = 0; i < n; ++i)
                    a[i][j] = '-';
            }
            cout << ans << '\n';
            for(int i = 0; i < n; ++i)
            {
                for(int j = 0; j < m; ++j)
                    cout << a[i][j];
                cout << '\n';
            }
        }
        else
        {
            int ans = 0;
            for(int j = 0; j < m; ++j)
            {
                ++ans;
                for(int i = 0; i < n / 2 + n % 2; ++i)
                    a[i][j] = '-';
            }
            for(int i = n / 2 + n % 2; i < n; ++i)
            {
                ++ans;
                for(int j = 0; j < m; ++j)
                    a[i][j] = '+';
            }
            cout << ans << '\n';
            for(int i = 0; i < n; ++i)
            {
                for(int j = 0; j < m; ++j)
                    cout << a[i][j];
                cout << '\n';
            }
        }
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

stones.cpp:17:0: warning: "ld" redefined
 #define ld long double
 
stones.cpp:9:0: note: this is the location of the previous definition
 #define ld long double#include <bits/stdc++.h>
 
stones.cpp:114:11: error: redefinition of 'const int maxn'
 const int maxn = 1002;
           ^~~~
stones.cpp:32:11: note: 'const int maxn' previously defined here
 const int maxn = 1002;
           ^~~~
stones.cpp:115:18: error: redefinition of 'char a [1002][1002]'
 char a[maxn][maxn];
                  ^
stones.cpp:33:6: note: 'char a [1002][1002]' previously declared here
 char a[maxn][maxn];
      ^
stones.cpp: In function 'int main()':
stones.cpp:117:5: error: redefinition of 'int main()'
 int main()
     ^~~~
stones.cpp:35:5: note: 'int main()' previously defined here
 int main()
     ^~~~