HDU 5867 Water problem （模拟）

最新推荐文章于 2021-08-04 15:15:41 发布

姜团长

最新推荐文章于 2021-08-04 15:15:41 发布

阅读量487

点赞数

本文链接：https://blog.csdn.net/AngOn823/article/details/52248491

版权

直接模拟即可

/* ***********************************************
Author        :angon

************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define showtime fprintf(stderr,"time = %.15f\n",clock() / (double)CLOCKS_PER_SEC)
#define lld %I64d
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scanl(d) scanf("%I64d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define scannl(n,m) scanf("%I64d%I64d",&n,&m)
#define mst(a,k)  memset(a,k,sizeof(a))
#define LL long long
#define N 1005
#define mod 1000000007
inline int read(){int s=0;char ch=getchar();for(; ch<'0'||ch>'9'; ch=getchar());for(; ch>='0'&&ch<='9'; ch=getchar())s=s*10+ch-'0';return s;}

int t[]={0,3,3,5,4,4,3,5,5,4,3,6,6,8,8,7,7,9,8,8,6};
int t2[] = {0,0,6,6,5,5,5,7,6,6,7};
int f[1001];
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    f[0]=0;
    for(int n=1;n<=999;n++)
    {
        if(n<20)
        {
            f[n]=f[n-1]+t[n];
        }
        else if(n<100)
        {
            int b=n/10;
            int c=n%10;
            f[n]=f[n-1]+t2[b]+t[c];
        }
        else if(n%100==0)
        {
            f[n]=f[n-1]+ t[n/100]+7;
        }
        else
        {
            int a=n/100;
            if(n-a*100<=20)
            {
                f[n] = f[n-1] + t[a] + 10 + t[n-a*100];
                continue;
            }
            int b=n/10%10;
            int c=n%10;
            f[n] = f[n-1] +t[a] + 10 + t2[b] + t[c];
        }
    }
    f[1000]=f[999]+11;
    int n,t;
    scan(t);
    while(t--)
    {
        scan(n);
        printf("%d\n",f[n]);
    }


    return 0;
}