2014年4月9日
HDU 4267 A Simple Problem with Integers
摘要： 题目大意：对一个长度为n（n #include using namespace std;const int MAXN=50005;int c[105][MAXN],begin[MAXN],n,m;void update(int k,int x,int val){while(x<=n)c[k][x]+=val,x+=x&-x;}int getsum(int pos){ int s=0; for(int i=1;i<=10;i++){ int k=10*(i-1)+pos%i,x=pos; while(x)s+=c[k][x],x-=x&-x; }re... 阅读全文
posted @ 2014-04-09 14:50 forever97 阅读(144) 评论(0) 推荐(0)
HDU 1757 A Simple Math Problem
摘要： /*matrix a={ {0,1,0,0,0,0,0,0,0,0}, {0,0,1,0,0,0,0,0,0,0}, {0,0,0,1,0,0,0,0,0,0}, {0,0,0,0,1,0,0,0,0,0}, {0,0,0,0,0,1,0,0,0,0}, {0,0,0,0,0,0,1,0,0,0}, {0,0,0,0,0,0,0,1,0,0},{0,0,0,0,0,0,0,0,1,0}, {0,0,0,0,0,0,0,0,0,1},{1,1,1,1,1,1,1,1,1,1}, }; */#include #include #define maxn 15#define rep(i,n) for( 阅读全文
posted @ 2014-04-09 14:15 forever97 阅读(149) 评论(0) 推荐(0)