132002025-01-07 02:01:14ubormaciKiváló Számokcpp17Elfogadva 100/10048ms1332 KiB
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <fstream>
using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

set lower bound/upper bound:
 	// . . . m1 . . . d . . . . m2
    auto m1_it = b.lower_bound(d);
    advance(m1_it, -1);
    m1 = *m1_it;
	m2 = *b.upper_bound(d);

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

constexpr auto lcm(auto x, auto... xs)
{
	return ((x = std::lcm(x, xs)), ...);
}

std::gcd(int a, int b)

*/

typedef long long ll;

void solve() {
    ll n;
    cin >> n;

    if(n == 1) {
        cout << "-1";
        return;
    }

    if(n % 3 == 0) {
        for(ll i = 0; i < n; i++) {
            cout << 1;
        }
        return;
    }
    if(n % 2 == 0) {
        for(ll i = 0; i < n / 2; i++) {
            cout << 15;
        }
        return;
    }

    n -= 3;
    cout << "111";
    for(ll i = 0; i < n / 2; i++) {
        cout << 15;
    }
    

}

int main()
{
	std::ios_base::sync_with_stdio(false);

	solve();

	return 0;
}
RészfeladatÖsszpontTesztVerdiktIdőMemória
subtask10/0
1Elfogadva1ms316 KiB
subtask233/33
2Elfogadva1ms316 KiB
3Elfogadva1ms316 KiB
4Elfogadva1ms316 KiB
5Elfogadva1ms316 KiB
6Elfogadva1ms316 KiB
7Elfogadva1ms316 KiB
8Elfogadva1ms316 KiB
subtask333/33
9Elfogadva12ms564 KiB
10Elfogadva14ms800 KiB
11Elfogadva29ms908 KiB
12Elfogadva13ms820 KiB
13Elfogadva14ms896 KiB
14Elfogadva8ms756 KiB
15Elfogadva4ms316 KiB
16Elfogadva10ms600 KiB
17Elfogadva18ms684 KiB
18Elfogadva14ms820 KiB
19Elfogadva6ms564 KiB
20Elfogadva18ms1076 KiB
subtask434/34
21Elfogadva25ms1328 KiB
22Elfogadva4ms564 KiB
23Elfogadva26ms1332 KiB
24Elfogadva48ms1332 KiB
25Elfogadva35ms1076 KiB
26Elfogadva19ms584 KiB
27Elfogadva20ms1076 KiB
28Elfogadva17ms1088 KiB
29Elfogadva4ms316 KiB
30Elfogadva14ms860 KiB
31Elfogadva16ms924 KiB
32Elfogadva1ms316 KiB
33Elfogadva4ms316 KiB