Dosth_Magic

#include using namespace std; int F[1100]; int find_(int x){ return (F[x]==x)?x:find_(F[x]); } int main() { int n,m; while(scanf("%d",&n),n!=0){ scanf("%d",&m); for(int i=1

Xor 发布时间 : 2015年10月10日 18:05   时间限制 : 1000ms   内存限制 : 32M 描述 给定一个数组A, 长度为n，求下面这段程序的值 ans = 0; for (int i = 1; i  for (int j = 1; j ans ^= A[i] + A[j]; 输入 多组测试数据，第一行一个整数T，T

Ant Time Limit: 1 Second      Memory Limit: 32768 KB There is an ant named Alice. Alice likes going hiking very much. Today, she wants to climb a cuboid. The length of cuboid's longest edge is n

Cake Time Limit: 4 Seconds      Memory Limit: 65536 KB Alice and Bob like eating cake very much. One day, Alice and Bob went to a bakery and bought many cakes. Now we know that they have bought