Algorithm

C. Gourmet Cat
time limit per test
1 second
memory limit per test
256 megabytes
problem link- https://codeforces.com/contest/1154/problem/C
input
standard input
output
standard output

Polycarp has a cat and his cat is a real gourmet! Dependent on a day of the week he eats certain type of food:

  • on Mondays, Thursdays and Sundays he eats fish food;
  • on Tuesdays and Saturdays he eats rabbit stew;
  • on other days of week he eats chicken stake.

Polycarp plans to go on a trip and already packed his backpack. His backpack contains:

  • a� daily rations of fish food;
  • b� daily rations of rabbit stew;
  • c� daily rations of chicken stakes.

Polycarp has to choose such day of the week to start his trip that his cat can eat without additional food purchases as long as possible. Print the maximum number of days the cat can eat in a trip without additional food purchases, if Polycarp chooses the day of the week to start his trip optimally.

Input

The first line of the input contains three positive integers a�, b� and c� (1≤a,b,c≤7⋅1081≤�,�,�≤7⋅108) — the number of daily rations of fish food, rabbit stew and chicken stakes in Polycarps backpack correspondingly.

Output

Print the maximum number of days the cat can eat in a trip without additional food purchases, if Polycarp chooses the day of the week to start his trip optimally.

Examples
input
Copy
2 1 1
output
Copy
4
input
Copy
3 2 2
output
Copy
7
input
Copy
1 100 1
output
Copy
3
input
Copy
30 20 10
output
Copy
39
Note

In the first example the best day for start of the trip is Sunday. In this case, during Sunday and Monday the cat will eat fish food, during Tuesday — rabbit stew and during Wednesday — chicken stake. So, after four days of the trip all food will be eaten.

In the second example Polycarp can start his trip in any day of the week. In any case there are food supplies only for one week in Polycarps backpack.

In the third example Polycarp can start his trip in any day, excluding Wednesday, Saturday and Sunday. In this case, the cat will eat three different dishes in three days. Nevertheless that after three days of a trip there will be 9999 portions of rabbit stew in a backpack, can cannot eat anything in fourth day of a trip.

 



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

long long a, b, c;



bool can(long long str, long long mid) {
  long long days[8] = {0};
  for(int i = str; i <= 7; ++i)
    days[i] = 1;
  mid -= (7 - str + 1);
  long long weeks = mid / 7;
  for(int i = 1; i <= 7; ++i)
    days[i] += weeks;
  long long rem = mid % 7;
  for(int i = 1; i <= rem; ++i)
    days[i] += 1;
  
  if(days[2] + days[3] + days[6] <= a && days[1] + days[4] <= b && days[5] + days[7] <= c)
    return true;
  return false;
}

int main() {
  scanf("%lld %lld %lld", &a, &b, &c);

  long long best = 0;
  for(int i = 1; i <= 7; ++i) {
    long long l = 0, r = 1e15, mid, res = -1;
    while(l <= r) {
      mid = (l + r) >> 1;
      if(can(i, mid))
        l = mid + 1, res = mid;
      else
        r = mid - 1;
    }
    best = max(best, res);
  }

  printf("%lld\n", best);

  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
2 1 1

Output

x
–
+
cmd
4
Advertisements

Demonstration

Codeforcess SOlution-Gourmet Cat C. Gourmet Cat--Solution in C, C++, Java, Python ,Codeforcess SOlution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+