Submission #64026974

---

Source Code Expand

//#pragma GCC optimize("O3,unroll-loops")
#include <random>
#include <complex>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((x).size())
typedef long long ll;
using ull = unsigned long long;
using namespace std;
mt19937 rnd(348502);
ll mod1 = 998244353;
ll mod = 1e9 + 7;
const ll N = 1000030;


void solve()
{
    int n, i;
    cin >> n;
    if (n % 2 == 1)
    {
        for ( i = 0; i < n / 2; i++)
        {
            cout << "-";
        }
        cout << "=";
        for ( i = 0; i < n / 2; i++)
        {
            cout << "-";
        }
    }
    else
    {
        for (i = 0; i < (n - 2) / 2; i++)
        {
            cout << "-";
        }
        cout << "==";
        for ( i = 0; i < (n - 2) / 2; i++)
        {
            cout << "-";
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result