fork download 
  1. #include <bits/stdc++.h>
  2. #define ll long long
  3. #define Shity ios_base::sync_with_stdio(0);
  4. #define Code cin.tie(0), cout.tie(0);
  5. #define TOO     \
  6.     int t = 1; \
  7.     cin >> t;
  8. #define nulll0   \
  9.     while (t--)  \
  10.     {            \
  11.         solve(); \
  12.     }
  13. #define all(x) begin(x), end(x)
  14. #define rall(x) rbegin(x), rend(x)
  15. #define TO int t = 1;
  16. #define sz(s) (int)s.size()
  17.  
  18. using namespace std;
  19. /*==============================================*/
  20. // EReN yEaGeR :)
  21. /*==============================================*/
  22. bool isprime(ll n){
  23.     if(n<2)return false;
  24.     for(ll i=2;i*i<=n;i++){
  25.         if(n%i==0)return false;
  26.     }
  27.     return true;
  28. }
  29. /*==============================================*/
  30. vector<ll>divisors(ll n){
  31.     vector<ll>ans;
  32.     for(ll i=1;i*i<=n;i++){
  33.         if(n%i==0){
  34.             ans.push_back(i);
  35.             if(i*i!=n)ans.push_back(n/i);
  36.         }
  37.     }
  38.     sort(all(ans));
  39.     return ans;
  40. }
  41. /*==============================================*/
  42. ll __lcm(ll a,ll b){
  43.  return (a*b)/__gcd(a,b);   
  44. }
  45. /*==============================================*/
  46. // void solve() {
  47. //     string s;
  48. //     cin >> s;
  49. //     ll n = s.size();
  50. //     ll mid = n / 2;
  51. //     string k = s.substr(0, mid);
  52. //     string t = s.substr(mid);
  53. //     while (!t.empty() && t[0] == '0') {
  54. //         k += '0';
  55. //         t.erase(0, 1);
  56. //     }
  57. //     if (k > t && !k.empty()) {
  58. //         t = k.back() + t;
  59. //         k.pop_back();
  60. //          while (!t.empty() && t[0] == '0') {
  61. //         k += '0';
  62. //         t.erase(0, 1);
  63. //          }
  64. //     }
  65. //     if (t.empty()||k==t) {
  66. //         cout << -1 << '\n';
  67. //         return;
  68. //     }
  69. //     cout << k << ' ' << t << '\n';
  70. // }
  71. void solve() {
  72.     string ab;
  73.     cin >> ab;
  74.     ll n = sz(ab);
  75.     for (int i = 1; i < n; i++) {
  76.         string a = ab.substr(0, i);
  77.         string b = ab.substr(i);
  78.  
  79.         if (b[0] != '0' && stoll(a) < stoll(b)) {
  80.             return void(cout << a << ' ' << b << '\n');
  81.         }
  82.     }
  83.     cout << -1 << '\n';
  84. }
  85. /*==============================================*/
  86. signed main()
  87. {
  88.     if (fopen("input.txt", "r"))
  89.     {
  90.         freopen("input.txt", "r", stdin);
  91.         freopen("output.txt", "w", stdout);
  92.     }
  93.     Shity Code TOO nulll0
  94.     //Shity Code TO nulll0
  95. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin 
5
20002001
391125
200200
2001000
12
stdout 
2000 2001
3 91125
-1
200 1000
1 2
https://ideone.com/y2k8sh
language:
C++ (gcc 8.3)
created:
13 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!