谢庆皇的专栏

#include #include const int MAX=50021; int hash [50022][7],sel[50022],a[100001][7]; int main() { int N,i,j,sum,o1,o3,k; memset(hash,0,sizeof(hash)); memset(sel,0,sizeof(sel)); scanf(

/*Crawling in process... Crawling failed Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description Given an integer N(0 ≤ N ≤ 10000), your task is to