【HDU5867】Water problem(模拟)

记录一个菜逼的成长。。

直接打表。。也可以加上处理前缀和。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
#include <cctype>
#include <bitset>
#include <cmath>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define cl(a) memset(a,0,sizeof(a))
#define bp __builtin_popcount
#define pb push_back
#define fin freopen("D://in.txt","r",stdin)
#define fout freopen("D://out.txt","w",stdout)
#define lson t<<1,l,mid
#define rson t<<1|1,mid+1,r
#define seglen (node[t].r-node[t].l+1)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef vector<PII> VPII;
const int INF = 0x3f3f3f3f;
const LL MOD = 1000000000 +10;
template <typename T>
inline void read(T &x){
    T ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    x = ans;
}
inline bool DBread(double &num)
{
    char in;double Dec=0.1;
    bool IsN=false,IsD=false;
    in=getchar();
    if(in==EOF) return false;
    while(in!='-'&&in!='.'&&(in<'0'||in>'9'))
        in=getchar();
    if(in=='-'){IsN=true;num=0;}
    else if(in=='.'){IsD=true;num=0;}
    else num=in-'0';
    if(!IsD){
        while(in=getchar(),in>='0'&&in<='9'){
            num*=10;num+=in-'0';}
    }
    if(in!='.'){
        if(IsN) num=-num;
            return true;
    }else{
        while(in=getchar(),in>='0'&&in<='9'){
                num+=Dec*(in-'0');Dec*=0.1;
        }
    }
    if(IsN) num=-num;
    return true;
}
template <typename T>
inline void write(T a) {
    if(a < 0) { putchar('-'); a = -a; }
    if(a >= 10) write(a / 10);
    putchar(a % 10 + '0');
}
/******************head***********************/
int f[]={0,3,3,5,4,4,3,5,5,4,3,6,6,8,8,7,7,9,8,8,6,9,9,11,10,10,9,11,11,10,6,9,9,11,10,10,9,11,11,10,5,8,8,10,9,9,8,10,10,9,5,8,8,10,9,9,8,10,10,9,5,8,8,10,9,9,8,10,10,9,7,10,10,12,11,11,10,12,12,11,6,9,9,11,10,10,9,11,11,10,6,9,9,11,10,10,9,11,11,10,10,16,16,18,17,17,16,18,18,17,16,19,19,21,21,20,20,22,21,21,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,18,21,21,23,22,22,21,23,23,22,18,21,21,23,22,22,21,23,23,22,18,21,21,23,22,22,21,23,23,22,20,23,23,25,24,24,23,25,25,24,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,10,16,16,18,17,17,16,18,18,17,16,19,19,21,21,20,20,22,21,21,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,18,21,21,23,22,22,21,23,23,22,18,21,21,23,22,22,21,23,23,22,18,21,21,23,22,22,21,23,23,22,20,23,23,25,24,24,23,25,25,24,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,12,18,18,20,19,19,18,20,20,19,18,21,21,23,23,22,22,24,23,23,21,24,24,26,25,25,24,26,26,25,21,24,24,26,25,25,24,26,26,25,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,22,25,25,27,26,26,25,27,27,26,21,24,24,26,25,25,24,26,26,25,21,24,24,26,25,25,24,26,26,25,11,17,17,19,18,18,17,19,19,18,17,20,20,22,22,21,21,23,22,22,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,21,24,24,26,25,25,24,26,26,25,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,11,17,17,19,18,18,17,19,19,18,17,20,20,22,22,21,21,23,22,22,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,21,24,24,26,25,25,24,26,26,25,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,10,16,16,18,17,17,16,18,18,17,16,19,19,21,21,20,20,22,21,21,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,18,21,21,23,22,22,21,23,23,22,18,21,21,23,22,22,21,23,23,22,18,21,21,23,22,22,21,23,23,22,20,23,23,25,24,24,23,25,25,24,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,12,18,18,20,19,19,18,20,20,19,18,21,21,23,23,22,22,24,23,23,21,24,24,26,25,25,24,26,26,25,21,24,24,26,25,25,24,26,26,25,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,22,25,25,27,26,26,25,27,27,26,21,24,24,26,25,25,24,26,26,25,21,24,24,26,25,25,24,26,26,25,12,18,18,20,19,19,18,20,20,19,18,21,21,23,23,22,22,24,23,23,21,24,24,26,25,25,24,26,26,25,21,24,24,26,25,25,24,26,26,25,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,22,25,25,27,26,26,25,27,27,26,21,24,24,26,25,25,24,26,26,25,21,24,24,26,25,25,24,26,26,25,11,17,17,19,18,18,17,19,19,18,17,20,20,22,22,21,21,23,22,22,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,19,22,22,24,23,23,22,24,24,23,21,24,24,26,25,25,24,26,26,25,20,23,23,25,24,24,23,25,25,24,20,23,23,25,24,24,23,25,25,24,11};
int main()
{
    //fin;
    //fout;
    int T;read(T);
    while(T--){
        int ans = 0,x;
        scanf("%d",&x);
        for( int i = 1; i <= x; i++ )
            ans += f[i];
        write(ans);
        puts("");
    }
    return 0;
}