原创 127 - "Accordian" Patience
#include <cstdio> #include <string> #include <stack> #include <vector> using namespace::std; int main() { char str[3]
原创 10115 - Automatic Editing
#include<stdio.h> #include<string.h> int main() { int n,i,tag=0; charfind[100][100],replace[100][100],temp[300],*s
原创 409 - Excuses, Excuses!
#include<stdio.h> #include<string.h> #include<ctype.h> #define MAXN20+5 charkeywords[MAXN][MAXN],excuses[MAXN][75]
原创 465 - Overflow
#include <stdio.h> #include <string.h> #include<malloc.h> int MaxInt[10]={2,1,4,7,4,8,3,6,4,7}; void tempAdd(int temp
原创 644 - Immediate Decodability
#include <stdio.h> #include <string.h> int main() { char codes[10][12]; char code[12]; int i,j,n=0,set=1,isprint=0; w
原创 10878 - Decode the tape
#include<stdio.h> #include<string.h> int main() { char s[15]; int i,j,temp=1,num=0; while (fgets(s
原创 133 - The Dole Queue
In a serious attempt to downsize (reduce) the dole queue, The New National Green Labour Rhinoceros Party has decided on
原创 424 - Integer Inquiry
#include <string.h> #include <stdio.h> #include <math.h> int main() { int num[110],sum[110],n=0,c=0,i,j; memset(sum,
原创 10010 - Where's Waldorf?
#include<stdio.h> #include<string.h> #include<ctype.h> char grid[55][55],words[55]; int locate(char s[],int r,int l,i
原创 401 - Palindromes
#include<stdio.h> #include<string.h> char table[2][21]= { 'A','E','H','I','J','L','M','O','S','T','U','V','W','X','Y',
原创 537 - Artificial Intelligence?
#include<stdio.h> #include<string.h> #include<ctype.h> #define MAXN100+10 chars[MAXN]; voiddecode_prefix(char s[],dou
原创 10361 - Automatic Poetry
#include<stdio.h> #include<string.h> #define MAXN100+10 chars1[MAXN],s2[MAXN]; intmain() { inti,j,n,b_i,bracket[4]; s
原创 10106 - Product
#include <string.h> #include <stdio.h> #include <math.h> void tempAdd(int temp[],int product[]) { int i,j,c=0; for(i
原创 457 - Linear Cellular Automata
#include<stdio.h> #include<string.h> intpopulation[40]={ 0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,1, 0,0,0,0,0,0,0,0,0,0
原创 112 - Tree Summing
#include<cstdio> struct node{ int value; struct node *lchild; struct node *rchild; node(int val):value(val){}; }; n