fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29. int gcdi(int a, int b){
  30. 	while(b){
  31. 		//* modding 
  32. 		a %= b;
  33.  
  34. 		//* And swapping 
  35. 		swap(a,b);
  36. 	}
  37. 	return a;
  38. }
  39.  
  40. int gcd(int a, int b){
  41. 	if(b==0) return a;
  42.  
  43. 	//* Swapping and modding at same time
  44. 	return gcd(b, a%b);
  45. }
  46.  
  47.  
  48.  
  49. void consistency(int x, int y){
  50.  
  51. 	cout << gcdi(x, y) << " => " << gcd(x, y) << endl;
  52.  
  53. }
  54.  
  55.  
  56.  
  57. void solve() {
  58.  
  59.     int x, y;
  60.     cin>> x >> y;
  61.  
  62.     consistency(x, y);
  63.  
  64.  
  65. }
  66.  
  67.  
  68.  
  69.  
  70.  
  71. int32_t main() {
  72.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  73.  
  74.     int t = 1;
  75.     // cin >> t;
  76.     while (t--) {
  77.         solve();
  78.     }
  79.  
  80.     return 0;
  81. }
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
20 68
stdout
copy 
4 => 4
https://ideone.com/zBam4a
language:
C++14 (gcc 8.3)
created:
13 hours 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!