Welcome to ZOJ
FAQ
User Statistics - ZOJ Problem Set

FZU_067 (FZU_T067)        AC Ratio: 5/23

Plan:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
#define ll __int64
ll P,a[80005],tree[80005][5];
int N,M;
ll ans[5];
ll in2,in6,in24;
inline void update(int k,int i,ll v)
{
    for(;k<=N;k+=k&-k)tree

Solved Problems:
1484 3413 3416 3631 3632