Codeforces Round #622 (Div. 2) A. Fast Food Restaurant_tired of boring office work, denis decided to open-优快云博客

本文链接：https://blog.youkuaiyun.com/qq_43563669/article/details/104465256

本文探讨了在有限的食物种类和数量下，如何为顾客提供多样化的配餐方案，以达到服务最大数量顾客的目标。通过设定规则限制每种食物的使用次数，并确保每位顾客的餐品组合不重复，提出了一种基于暴力搜索的算法解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A. Fast Food Restaurant
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Tired of boring office work, Denis decided to open a fast food restaurant.

On the first day he made a portions of dumplings, b portions of cranberry juice and c pancakes with condensed milk.

The peculiarity of Denis’s restaurant is the procedure of ordering food. For each visitor Denis himself chooses a set of dishes that this visitor will receive. When doing so, Denis is guided by the following rules:

every visitor should receive at least one dish (dumplings, cranberry juice, pancakes with condensed milk are all considered to be dishes);
each visitor should receive no more than one portion of dumplings, no more than one portion of cranberry juice and no more than one pancake with condensed milk;
all visitors should receive different sets of dishes.
What is the maximum number of visitors Denis can feed?

Input
The first line contains an integer t (1≤t≤500) — the number of test cases to solve.

Each of the remaining t lines contains integers a, b and c (0≤a,b,c≤10) — the number of portions of dumplings, the number of portions of cranberry juice and the number of condensed milk pancakes Denis made.

Output
For each test case print a single integer — the maximum number of visitors Denis can feed.

Example
inputCopy
7
1 2 1
0 0 0
9 1 7
2 2 3
2 3 2
3 2 2
4 4 4
outputCopy
3
0
4
5
5
5
7
Note
In the first test case of the example, Denis can feed the first visitor with dumplings, give the second a portion of cranberry juice, and give the third visitor a portion of cranberry juice and a pancake with a condensed milk.

In the second test case of the example, the restaurant Denis is not very promising: he can serve no customers.

In the third test case of the example, Denise can serve four visitors. The first guest will receive a full lunch of dumplings, a portion of cranberry juice and a pancake with condensed milk. The second visitor will get only dumplings. The third guest will receive a pancake with condensed milk, and the fourth guest will receive a pancake and a portion of dumplings. Please note that Denis hasn’t used all of the prepared products, but is unable to serve more visitors.

题意：给了a、b、c三种食物，你可以为客人做饭，每种食物的使用个数不超过1个
并且客人的搭配不能重复

思路：其实就是每种有或者没有暴力就好

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define me(a,x) memset(a,x,sizeof a)
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define all(x) (x).begin(), (x).end()
#define pb(a) push_back(a)
#define pa pair<int,int>
#define pali pair<ll,int>
#define pail pair<int,ll>
#define pall pair<ll,ll>
#define fi first
#define se second
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int a[3];
        cin>>a[0]>>a[1]>>a[2];
        sort(a,a+3);
        int ans=0;
        if(a[2]) ans++,a[2]--;
        if(a[1]) ans++,a[1]--;
        if(a[0]) ans++,a[0]--;
        if(a[2]&&a[1]) ans++,a[2]--,a[1]--;
        if(a[2]&&a[0]) ans++,a[2]--,a[0]--;
        if(a[1]&&a[0]) ans++,a[1]--,a[0]--;
        if(a[2]&&a[1]&&a[0]) ans++,a[2]--,a[1]--,a[0]--;
        cout<<ans<<endl;
    }
    return 0;
}