ＡＴＯＤ

D - T9 Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u SubmitStatusDescriptionBackground A while ago it was quite cumbersome to create a message for the Short Message Ser

void insert(char s[],int val) { if(val==0) return ; int now=0; for (int i=0;i<strlen(s);i++) { int x=s[i]-'a'; int tt=t[now].son[x]; if (tt==0) t[now].son[x]=++

The xor-longest PathTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 5242 Accepted: 1140 DescriptionIn an edge-weighted tree, the xor-length of a path p is defined as the xor sum of the w

Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26448 Accepted: 7972DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no numb

Chip Factory Time Limit: 18000/9000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1270 Accepted Submission(s): 580Problem Description John is a manager of a