# |
Author |
Problem |
Lang |
Verdict |
Time |
Memory |
Sent |
Judged |
|
125827023 |
Practice:
jaioff02 |
352A
- 21
|
C++14 (GCC 6-32)
|
Wrong answer on test 2
|
0 ms
|
3636 KB
|
2021-08-14 10:52:02 |
2021-08-14 10:52:02 |
|
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define cint const int
#define fo(number1, number2, number3) for (int number1 = number2; number1 < number3; ++number1)
#define rfo(number1, number2, number3) for (int number1 = number2 - 1; number1 >= number3; --number1)
#define pi pair<int, int>
#define vLL vector<ll>
#define vi vector<int>
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define lbd lower_bound
#define ubd upper_bound
#define mp make_pair
#define cps CLOCKS_PER_SEC
#define decimal(k) fixed << setprecision(k)
#define PI 3.14159265359
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ff first
#define ss second
#define all(V) (V).begin(), (V).end()
#define alla(a, n) a, a + n
#define sz(v) (ll) v.size()
#define SORT(v) sort(all(v))
#define REV reverse
#define SUM(v) accumulate(v.begin(), v.end(), 0)
#define MAX max_element
#define MIN min_element
#define UNIQUE(v) \
SORT(v); \
v.erase(unique(v.begin(), v.end()), v.end())
#define UNIQUEA(a, n) unique(a, a + n) - a
#define MAXA(a, n) max_element(a, a + n)
#define MINA(a, n) min_element(a, a + n)
#define SORTA(a, n) sort(alla(a, n))
#define REVA(a, n) reverse(alla(a, n))
#define mem1(a) memset(a, -1, sizeof(a));
#define mem0(a) memset(a, 0, sizeof(a));
#define mymax 1000000000000000100
#define mymin -1000000001
#define bitcount __builtin_popcount
#define gcd __gcd
#define MOD (ll)1000000007
#define TEST(t) \
int tc; \
cin >> tc; \
fo(t, 1, tc)
#define VECT(v, n) \
ll n; \
cin >> n; \
vLL v(n); \
fo(i, 0, n - 1) cin >> v[i];
#define NUM(n) \
ll n; \
cin >> n;
#define STRING(s) \
string s; \
cin >> s;
#define TS to_string
#define len(s) (s).length()
#define line cout << "\n";
#define el "\n"
#define clkstart auto start = high_resolution_clock::now();
#define clkend \
auto stop = high_resolution_clock::now(); \
auto duration = duration_cast<microseconds>(stop - start);
#define TIME \
line; \
line; \
cout << "Time taken by function: " << duration.count() / 1e6 << " seconds" << endl;
#define open {
#define close }
#define goog(tno) cout << "Case #" << tno << ": "
#define deb(x) cout << #x << " = " << x << el;
#define deb2(x, y) cout << #x << " = " << x << " : " << #y << " = " << y << el;
// #ifndef SEGMENTTREE_H
#define SEGMENTTREE_H
#define left(i) (2 * i + 1)
#define right(i) (2 * i + 2)
#define parent(i) ((i - 1) / 2)
using namespace std;
int main(){
ll m;
cin >> m;
vLL v;
for (int i = 0; i < m; i++)
{
ll ele;
cin >> ele;
v.pb(ele);
}
ll count=0;
for (int i = 0; i < m; i++)
{
if(v[i]==0)
count++;
}
if(count==0)
cout<<"-1";
else{
sort(v.begin(), v.end(),greater<int>());
ll sum;
do
{
ll i = 0;
ll sum = 0;
do
{
sum += v[i];
if (i != v.size() - 1)
sum = sum * 10;
i++;
} while (i != v.size());
if (v.size() == 1)
{
cout << "0";
break;
}
else{
ll j=0;
v.erase(v.begin()+j);
}
} while (sum % 90 != 0);
cout << sum;}
return 0;
}
Click to see test details