摘要： #include <stdio.h>#include <string.h>#include <stdlib.h>struct node{ int y, v, next;}T[1000];int size;int adj[1000];void add_edge(int i, int j, int v){ T[size].v = v; T[size].y = j; T[size].next = adj[i]; adj[i] = size++;} int main( ){ int N, M, i, j, a, b, c; while (scanf("%d 阅读全文

摘要： Burn the Linked CampTime Limit: 1 Second Memory Limit: 32768 KBIt is well known that, in the period of The Three Empires, Liu Bei, the emperor of the Shu Empire, was defeated by Lu Xun, a general of the Wu Empire. The defeat was due to Liu Bei's wrong decision that he divided his large troops in 阅读全文

摘要： 1566: 碰撞检测Time Limit: 1 SecMemory Limit: 128 MBSubmit: 52Solved: 11[Submit][Status][Web Board]Description小毛在做计算几何题时，遇到一个问题：在3D空间里有一个球体和一个长方体，判断它们是否会发生碰撞（collision）。小毛想了半天都没想出来，只有靠你去解决它了。Input第一行一个整数T，表示案例数。每个案例两行，第一行24个整数，分别为X1,Y1,Z1,X2,Y2,Z2...X8,Y8,Z8,表示一个长方体的8个顶点的空间位置，（注意：输入保证每个长方体的各边平行于坐标轴）。第二行4 阅读全文

摘要： #include <stdio.h>#include <deque>#include <string.h>using namespace std; deque<int>q;int dp[4000000];int floor[110000];int visit[1100]; int main( ){ int N, i, t, v,s ,e, flag; while (scanf("%d",&N), N){ flag = 0; q.clear(); scanf("%d%d",&s,&e) 阅读全文

摘要： 1574: 组合问题Time Limit: 1 SecMemory Limit: 128 MBSubmit: 78Solved: 23[Submit][Status][Web Board]Description有n 种颜色的球，每种颜色的球的个数有任意多个，从中取m个，问有多少种取法Input每行2个正整数 n,m(<=31) ，n=0,m=0结束. Output输出有多少种取法Sample Input2 23 30 0Sample Output310#include<stdio.h>long long m1[40],m2[40],n,m;void gf( ){ for( l 阅读全文