u013570474的专栏

hash表版 #include #include #include #include using namespace std; #define mod 100007 #define N 100010 struct node {     char que[25];     char ans[85];     int next; };

//基础的HASH，根据题意  #include #include #include #include using namespace std; int a[3000]; int num[11111]; int main() {     int n, m;     while(scanf("%d %d",&n, &m) != EOF)

WA了无数次因为什么呢，找到一个之后还一直再找。没有认真去写代码

#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()

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