fork download
copy 
  1. #include<bits/stdc++.h>
  2. #define fi first
  3. #define se second
  4. #define ll long long
  5. #define el cout<<"\n"
  6. #define sz(x) (int)(x).size()
  7. #define all(x) (x).begin(),(x).end()
  8. #define f0(i,n) for(int i=0;i<n;i++)
  9. #define f1(i,n) for(int i=1;i<=n;i++)
  10. #define fz(i,a,n,z) for(int i=a;i<n;i+=z)
  11. #define rep(i,a,n,z) for(int i=a;i>n;i-=z)
  12. #define faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  13. #define file(name) freopen(name".inp","r",stdin);freopen(name".out","w",stdout);
  14. using namespace std;
  15. const int maxn = 200010;
  16. const int N = 2e5 + 5;
  17. map<__int128, int> mp;
  18. void aoput(__int128 n) {
  19. 	ll MOD = 1e18;
  20. 	ll L = n / MOD, R = n % MOD;
  21. 	if (n <= MOD) {
  22. 		cout << L;
  23. 	}
  24. 	else {
  25. 		cout << L << setfill('0') << setw(18) << R;
  26. 	}
  27. }
  28. int main()
  29. {
  30. 	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  31. 	// ll n = 1e18, n1 = 1e9, MOD = 1e18;
  32. 	// ll b,c,d,e;
  33. 	// cin>>b>>c>>d>>e;
  34. 	// __int128 a = (__int128)b + (__int128)c + (__int128)d + (__int128)e;
  35.  
  36. 	// ll high = a / MOD;               // Phần nguyên
  37. 	// ll low = a % MOD;                // Phần dư
  38. 	// if(a <= MOD) {cout<<low; return 0;}
  39. 	// cout << high << setfill('0') << setw(18) << low << '\n';
  40.  
  41. 	int n;
  42. 	cin >> n;
  43. 	ll MOD = 1e18;
  44. 	__int128 pre[n + 1];
  45. 	pre[0] = 0;
  46. 	ll x, maxElement = 0;
  47. 	f1(i, n) {
  48. 		cin >> x;
  49. 		pre[i] = pre[i - 1] + (__int128)x;
  50. 		maxElement = max(maxElement, x);
  51. 		mp[pre[i]] = i;
  52. 	}
  53. 	f1(i, n) {
  54. 		if (pre[i] < maxElement) {
  55. 			continue;
  56. 		}
  57. 		if (pre[n] % pre[i] == 0) {
  58. 			int j = i, pos = 0;
  59. 			bool check = true;
  60. 			while (j != n) {
  61. 				__int128 motcaigiday = (__int128)pre[j] + (__int128)pre[i];
  62. 				pos = mp[motcaigiday];
  63. 				if (pos != 0) {
  64. 					j = pos;
  65. 				}
  66. 				else {
  67. 					check = false;
  68. 					break;
  69. 				}
  70. 			}
  71. 			if (check) {
  72. 				ll lefthand = pre[i] / MOD, righthand = pre[i] % MOD;
  73. 				if (pre[i] <= MOD) cout << righthand << endl;
  74. 				else {
  75. 					cout << lefthand << setfill('0') << setw(18) << righthand << endl;
  76. 				}
  77. 				return 0;
  78. 			}
  79. 		}
  80. 	}
  81.  
  82.  
  83. 	return 0;
  84. }
  85.  
  86.  
  87.  
Success #stdin #stdout 0.01s 5280KB
comments (?)
stdin
copy 
4
385934100000007441 
1859310000000087125 
885123100000007525 
1859310000000787525

123 000089123456789111
mod = 1e18
stdout
copy 
4989677200000889616
https://ideone.com/nSWiZw
__int128
language:
C++14 (gcc 8.3)
created:
1 day 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!