fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. typedef long long           ll;
  5. typedef long double         ld;
  6. typedef unsigned long       ul;
  7. typedef unsigned long long  ull;
  8. typedef vector<ll>          vll;
  9. typedef vector<int>         vi;
  10. typedef pair<int,int>       pii;
  11. typedef pair<ll,ll>         pll;
  12. typedef pair<ld,ld>         pld;
  13. typedef vector< pii >       vii;
  14.  
  15. #define fastIO              ios::sync_with_stdio(false);    cin.tie(nullptr);   cout.tie(nullptr)
  16. #pragma GCC optimize("Ofast,no-stack-protector")
  17. #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  18. #pragma GCC optimize("unroll-loops")
  19. #pragma G++ optimize("Ofast,no-stack-protector")
  20. #pragma G++ target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  21. #pragma G++ optimize("unroll-loops")
  22.  
  23. #define MX                  INT_MAX
  24. #define MN                  INT_MIN
  25. #define MAX                 200005
  26. #define MOD                 1000000007
  27. #define eps                 1e-9
  28. #define INF                 0x3f3f3f3f3f3f3f3f /// 4,557,430,888,798,830,399
  29. #define inf                 0x3f3f3f3f /// 1,061,109,567
  30. #define PI                  acos(-1.0)  /// 3.1415926535897932
  31.  
  32. #define pb                  push_back
  33. #define ppb                 pop_back
  34. #define mp                  make_pair
  35. #define ff                  first
  36. #define ss                  second
  37. #define sf                  scanf
  38. #define pf                  printf
  39. #define pn                  pf("\n")
  40. #define sfi(x)              sf("%d", &x)
  41. #define sfii(x, y)          sf("%d %d", &x, &y)
  42. #define sfiii(x, y, z)      sf("%d %d %d", &x, &y, &z)
  43. #define sfl(x)              sf("%lld", &x)
  44. #define sfll(x, y)          sf("%lld %lld", &x, &y)
  45. #define sflll(x, y, z)      sf("%lld %lld %lld", &x, &y, &z)
  46. #define pfi(x)              pf("%d\n", x)
  47. #define pfii(x, y)          pf("%d %d\n", x, y)
  48. #define pfiii(x, y, z)      pf("%d %d %d\n", x, y, z)
  49. #define pfl(x)              pf("%lld\n", x)
  50. #define pfll(x, y)          pf("%lld %lld\n", x, y)
  51. #define pflll(x, y, z)      pf("%lld %lld %lld\n", x, y, z)
  52. #define gl(a)               getline(cin,a)
  53. #define pfs(a)              pf("%s\n", a)
  54. #define pfc(a)              pf("%c", a)
  55. #define yes                 pf("YES\n")
  56. #define no                  pf("NO\n")
  57. #define sqr(x)              ((x)*(x))
  58. #define loop(i, y)          for(int i=0; i<int(y); i++)
  59. #define FOR(i, x, y)        for(int i=int(x); i<=int(y); i++)
  60. #define ROF(i, x, y)        for(int i=int(x); i>=int(y); i--)
  61. #define all(c)              c.begin(), c.end()
  62. #define sz(c)               int(c.size())
  63. #define clr(x, y)           memset(x, y, sizeof(x))
  64. #define vin(v, y)           int w; for(int i=0;i<y;i++){ sf1(w); v.pb(w);}
  65. #define vout(v)             int g=v.size(); for(int i=0;i<g;i++){ pf("%d", v[i]); if(i<g-1) pf(" "); else pf("\n");}
  66. #define voutr(v)            int g=v.size(); for(int i=g-1;i>=0;i--){ pf("%d", v[i]); if(i>0) pf(" "); else pf("\n");}
  67. #define test(tt)            for(int cas=1;cas<=tt;cas++)
  68. #define max3(a,b,c)         max(max(a,b),c)
  69. #define max4(a,b,c,d)       max(max3(a,b,c),d)
  70. #define min3(a,b,c)         min(min(a,b),c)
  71. #define min4(a,b,c,d)       min(min3(a,b,c),d)
  72. #define even(n)             if(n%2==0)
  73. #define odd(n)              if(n%2==1)
  74.  
  75. template <class T> inline T bigMod(T p,T e,T M){ T ret = 1; for(; e > 0; e >>= 1){ if(e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T) ret;}
  76. template <class T> inline T modInverse(T a,T M){return bigMod(a,M-2,M);}
  77. template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
  78. template <class T> inline T lcm(T a,T b) {a=abs(a);b=abs(b); return (a/gcd(a,b))*b;}
  79. template <class T> inline bool isprime(T n){if(n<2)return false;for(ll i=2;i*i<=n;i++){if(n%i==0)return false;}return true;}
  80. #define input               freopen("input.txt","r",stdin);
  81. #define output              freopen("output.txt","w",stdout);
  82. /* //////////////////////////START\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ */
  83. int main()
  84. {
  85.     #ifdef VAMP
  86.         clock_t tStart = clock();
  87.         //input;
  88.         //output
  89.     #endif
  90. 	int t;
  91. 	sfi(t);
  92. 	while(t--){
  93. 		int a, b, c, sum=0;
  94. 		sfiii(a, b, c);
  95. 		int x=a, y=b, z=c;
  96. 		while(y>0 && z>1){
  97. 			sum+=3;
  98. 			y--;
  99. 			z-=2;
  100. 		}
  101. 		while(x>0 && y>1){
  102. 			sum+=3;
  103. 			x--;
  104. 			y-=2;
  105. 		}
  106. 		pfi(sum);
  107. 	}
  108. 	#ifdef VAMP
  109.         printf("\nRuntime:: %.10fs\n", (double)(clock()-tStart)/CLOCKS_PER_SEC);
  110.     #endif
  111.     return 0;
  112. }
  113.  
Success #stdin #stdout 0s 4452KB
comments (?)
stdin
copy 
3
3 4 5
1 0 5
5 3 2
stdout
copy 
9
0
6
https://ideone.com/P3gAlO
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!