HASH
文章平均质量分 70
LeeBooL
这个作者很懒,什么都没留下…
展开
-
HDU1496
#include #include const int N=1000000; int hash[2*N+1],a,b,c,d,ans; int main(){ int i,j; while (scanf("%d %d %d %d",&a,&b,&c,&d)!=EOF){ if ((a>0 && b>0 && c>0 && d原创 2014-05-21 20:42:46 · 435 阅读 · 0 评论 -
POJ1200
#include #include #include #include using namespace std; #define MAX 16000005 char s[MAX]; int ascii[256]; int hash[MAX]; int main() { //freopen("acm.txt","r",stdin)原创 2014-05-21 23:26:10 · 423 阅读 · 0 评论 -
POJ1850
#include #include #include using namespace std; #define mod 1313 struct node { int d; struct node*next; }; node *pt[mod + 10]; int a,b,c,d,e; int x,y,z,n,m;原创 2014-06-11 13:36:19 · 382 阅读 · 0 评论 -
hrbust1287
数字去重和排序II Time Limit: 4000 MS Memory Limit: 65536 K Total Submit: 555(131 users) Total Accepted: 234(116 users) Rating: Special Judge: No Description原创 2014-06-10 23:50:08 · 433 阅读 · 0 评论 -
POJ3349
#include #include #include #include #include #define mod 1313 using namespace std; struct node { int len[10]; }; bool cmp(node &a,node &b) { int start[6],i,j,num原创 2014-06-12 12:41:27 · 382 阅读 · 0 评论 -
HDU 1496
Consider equations having the following form: a*x1^2+b*x2^2+c*x3^2+d*x4^2=0 a, b, c, d are integers from the interval [-50,50] and any of them cannot be 0. It is consider a solution a system原创 2014-11-02 19:21:04 · 304 阅读 · 0 评论 -
HDU 1800
#include #include #include #include #include #include using namespace std; int lev[10000]; map ma; int main() { int n; while(scanf("%d",&n)==1) { ma.clear()原创 2014-11-02 18:20:11 · 359 阅读 · 0 评论 -
UVA 10125
#include #include #include #include #include #include #include using namespace std; int ans; struct node{ int data1, data2; int next; }; node hash1[1000005]; int index1[100007]; int a[1005],原创 2014-11-03 21:53:47 · 352 阅读 · 0 评论