Clarke and minecraft

最新推荐文章于 2024-10-10 23:35:20 发布

BEconfidence

最新推荐文章于 2024-10-10 23:35:20 发布

阅读量459

点赞数

分类专栏： Bestcoder

本文链接：https://blog.youkuaiyun.com/a197p/article/details/48579389

版权

Bestcoder 专栏收录该内容

11 篇文章

订阅专栏

#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int a[600];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        int n;
        scanf("%d",&n);
        memset(a,0,sizeof(a));
        while(n--){
            int x,y;
            scanf("%d%d",&x,&y);
            a[x]+=y;
        }
        int p1=0,p2=0;
        for(int i=1;i<=500;i++)
        {
            p1 = a[i]/64 + (a[i]%64!=0);
//            printf("%d\n",p1);
            p2 += p1;

        }
//        printf("%d\n",p2);
        printf("%d\n",p2/36 + (p2%36!=0) );
    }
    return 0;
}