fork download
copy 
  1. #include<bits/stdc++.h>
  2. #define all(v) (v).begin(),(v).end()
  3. #define pb push_back
  4. #define ppb pop_back
  5. #define mp make_pair
  6. #define ri(x) scanf("%d",&(x))
  7. #define ri2(x,y) scanf("%d %d",&(x),&(y))
  8. #define ri3(x,y,z) scanf("%d %d %d",&(x),&(y),&(z))
  9. #define rll(x) scanf("%lld",&(x))
  10. #define rll2(x,y) scanf("%lld %lld",&(x),&(y))
  11. #define rll3(x,y,z) scanf("%lld %lld %lld",&(x),&(y),&(z))
  12. #define gc(x) ((x) = getchar())
  13. using namespace::std;
  14.  
  15. const long double PI = acos(-1);
  16. const long long MOD = 1000000000 +7;
  17.  
  18. typedef long long ll;
  19. typedef pair<ll,ll> pll;
  20. typedef pair<ll,pll> tll;
  21. typedef pair<int,int> ii;
  22. typedef pair<int,ii> iii;
  23. typedef vector<int> vi;
  24. typedef vector<ii> vii;
  25. typedef vector<iii> viii;
  26. typedef vector<ll> vll;
  27. typedef vector<pll> vpll;
  28. typedef vector<tll> vtll;
  29. typedef vector<string> vs;
  30. typedef set<int> si;
  31. typedef set<ii> sii;
  32. typedef set<iii> siii;
  33.  
  34. ll gcd(ll a, ll b){ return b==0?a:gcd(b,a%b);}
  35.  
  36. ll add(ll a, ll b, ll m = MOD){
  37. 	if(a >= m) a %= m;
  38. 	if(b >= m) b %= m;
  39. 	if(a < 0) a += m;
  40. 	if(b < 0) b += m;
  41. 	ll res = a+b;
  42. 	if(res >= m or res <= -m) res %= m;
  43. 	if(res < 0) res += m;
  44. 	return res;
  45. }
  46.  
  47. ll mul(ll a, ll b, ll m = MOD){
  48. 	if(a >= m) a %= m;
  49. 	if(b >= m) b %= m;
  50. 	if(a < 0) a += m;
  51. 	if(b < 0) b += m;
  52. 	ll res = a*b;
  53. 	if(res >= m or res <= -m) res %= m;
  54. 	if(res < 0) res += m;
  55. 	return res;
  56. }
  57.  
  58. ll pow_mod(ll a, ll b, ll m = MOD){
  59. 	ll res = 1LL;
  60. 	a = a%m;
  61. 	while(b){
  62. 		if(b&1) res = mul(res,a,m);
  63. 		b >>= 1;
  64. 		a = mul(a,a,m);
  65. 	}
  66. 	return res;
  67. }
  68.  
  69. ll fastexp(ll a, ll b){
  70. 	ll res = 1LL;
  71. 	while(b){
  72. 		if(b&1) res = res*a;
  73. 		b >>= 1;
  74. 		a *= a;
  75. 	}
  76. 	return res;
  77. }
  78.  
  79. int gcdExtendido(int a, int b, int *x, int *y){
  80. 	if(a == 0){
  81. 		*x = 0;
  82. 		*y = 1;
  83. 		return b;
  84. 	}
  85. 	int x1, y1;
  86. 	int gcd = gcdExtendido(b%a,a,&x1,&y1);
  87.  
  88. 	*x = y1-(b/a)*x1;
  89. 	*y = x1;
  90. 	return gcd;
  91. }
  92.  
  93. int modInverso(int a, int m){
  94. 	int x, y;
  95. 	int g = gcdExtendido(a,m,&x,&y);
  96. 	if(g!=1) return -1;
  97. 	else return (x%m + m)%m;
  98. }
  99.  
  100. /****************************************
  101. *************P*L*A*N*T*I*L*L*A************
  102. *****************************************/
  103.  
  104. mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); // Mt19937 random seed
  105.  
  106. long long random(long long l, long long r){
  107. 	return uniform_int_distribution<long long>(l,r)(rng); // Random generator
  108. }
  109.  
  110. int main(int argc, char* argv[]){
  111. 	long long n = random(-2000000000LL,2000000000LL); // Give the limits of the values, this case is [-2.10^9,2.10^9]
  112. 	cout << n << endl;
  113. 	return 0;
  114. }
Success #stdin #stdout 0s 4420KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
272883625
https://ideone.com/kTyfDE
language:
C++14 (gcc 8.3)
created:
4 years ago
visibility:
secret

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!