codeforces 1060 A

最新推荐文章于 2024-06-13 14:59:46 发布

不二的王大可

最新推荐文章于 2024-06-13 14:59:46 发布

阅读量261

点赞数

本文链接：https://blog.csdn.net/qq_41194925/article/details/82948392

版权

https://codeforces.com/contest/1060/problem/A

题意：电话号码是以8开头的11位数，给你n 个数问最多可以有多少个电话号码

题解：min（8的个数，n/11）

代码如下：

#include <map>
#include <set>
#include <cmath>
#include <ctime>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <bitset>
#include <string>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#define PI acos(-1)
#define eps 1e-8
#define fuck(x) cout<<#x<<" = "<<x<<endl;
#define FIN freopen("input.txt","r",stdin);
#define FOUT freopen("output.txt","w+",stdout);
//#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int maxn = 1e5+5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
LL gcd(LL a,LL b){return b?gcd(b,a%b):a;}
LL lcm(LL a,LL b){return a/gcd(a,b)*b;}
LL powmod(LL a,LL b,LL MOD){LL ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
double dpow(double a,LL b){double ans=1.0;while(b){if(b%2)ans=ans*a;a=a*a;b/=2;}return ans;}

int main(){
#ifndef ONLINE_JUDGE
    FIN
#endif
    int n;
    string str;
    cin>>n>>str;
    int k=n/11;
    int ans=0;
    for(int i=0;i<n;i++){
        if(str[i]=='8'){
            ans++;
        }
    }
    cout<<min(ans,k)<<endl;
}