Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
Codeforces Round #386 (Div. 2), problem: (A) Compote Solution in C/C++
#include<stdio.h> int main() { int a,b,c,i; scanf("%d%d%d",&a,&b,&c); for(i=a;i>=1;i--) if(b>=2*i&&c>=4*i) break; printf("%d",7*i); }
📦 Looking for Codeforces Round 386 Div Problem Compote? Check the best deals on Amazon.
🛒 Shop Codeforces Round 386 Div Problem Compote on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.
, problem: (A) Compote Solution in C/C++. Codeforces Round #386 (Div. 2), problem: (A) Compote Solution in C/C++){kind=link}