godjob

这题没做，直接在网上看了别人的代码，对数字的一些问题不是很了解学习一下istringstream的用法：#include <iostream>#include <string>#include <sstream>//使用istringstream()需要调入的头文件using namespace std;string getMaxStr(){ int n=0x7fffffff; string s=""; while(n!=0) { s=(char)(n%10+'0')+s; n=n/10; } return s;}bool Read More

#include <iostream>#include <algorithm>#include <cstring>using namespace std;int mutil(char * x, char * y , char * z){ char * px = x; char * py = y; int carry =0 , temp; if(strcmp(x,"0") == 0 || strcmp(y,"0") == 0) { z[0] = 0; return 1; } int i,j; for(i = 0 ; *( Read More

水题，就是把非常大的数组进行相加#include <iostream>#include <algorithm>#include <cstring>using namespace std;char table_atoi[128];//下标字母 对应 数字int main(){ int i =0; char c = '0'; for( ; i < 10 ; ++i ,++c) { table_atoi[c] = i; } char buff[100]; char result[100] = {0}; char carry = 0; int Read More

该题有ANSI C写了一遍，通过使用二叉树的思想可以很好的解决这个问题，该题是用UVa系统测评的，发现如果用标准的C写代码的话，语法要求真的很严格，提交了几次都是语法错误，单行注释都报错，最要紧的是连内建的bool类型都没有，所以我用int型代替，下面是AC的代码#include <stdio.h>#define Nil -1char left[50], right[50], tree_index[50];char code[40];int top = 0;int tree_root = -1;char* out_buff_is = "Set %d is immediat Read More

Text-processing tools like awk and sed allow you to automatically perform a sequence of editing operations based on a script. For this problem we consider the specific case in which we want to perform a series of string replacements, within a single line of text, based on a fixed set of rules. Each Read More

Immediate DecodabilityAn encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all codes are in binary, that no two codes within a set of codes are the same, that each code has at l. Read More

Artificial Intelligence?Physics teachers in high school often think that problems given as text are more demanding than pure computations. After all, the pupils have to read and understand the problem first!So they don't state a problem like ``U=10V, I=5A, P=?" but rather like ``You have an Read More

Problem IAutomatic Poetry Input: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MB“Oh God”, Lara Croft exclaims, “it’s one of these dumb riddles again!”In Tomb Raider XIV, Lara is, as ever, gunning her way through ancient Egyptian pyramids, prehistoric caves and medival h Read More

Q10010: Where's Waldorf?給你一個m*n的字元方塊（1 <= m,n <=50），以及一些字串，請你找出這些字串在字元方塊中出現的位置。請參考Sample Output。我們在字元方塊中尋找字串的方向可以有8個：往左、往右、往上、往下、往左上、往左下、往右上、往右下。另外，請忽略字元大小寫，即 A 和 a 應被視為相同的字元。Input輸入的第一列有一個整數代表以下有幾組測試資料。每組測試資料的第1列，有2個整數m,n（1 <= m,n <=50），代表接下來的文字方塊有m列，每列有n個字元。在文字方塊之後的一列有一個整數 k，代表接下來的 Read More

PalindromesA regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when the string is read from left to right as when the string is read from right to left. A mirrored string is Read More