Summer的Blog

思路：找规律吧

#includeint main(void){ //freopen("input.txt","r",stdin); int c, q = 1; while((c = getchar()) != EOF) { if(c == '"') { printf("%s", q ? "``" : "''"); q = !q; }else{ printf("%c", c);

MasterMind is a game for two players. One of them, Designer, selects a secret code. The other, Breaker, tries to break it. A code is no more than a row of colored dots. At the beginning of a game, t

For a positive integer N , the digit-sum of N is defined as the sum of N itself and its digits. When M is the digitsum of N , we call N a generator of M .For example, the digit-sum of 245 is 256 (

Some DNA sequences exist in circular forms as in the following figure, which shows a circular sequence ``CGAGTCAGCT", that is, the last symbol ``T" in ``CGAGTCAGCT" is connected to the first symbol ``

#includeint main(void){ //freopen("input.txt","r",stdin); char s[] = "`1234567890-=QWERTYUIOP[]\\ASDFGHJKL;'ZXCVBNM,./"; int i; char c; while((c = getchar()) != EOF) { for(i = 0; s[i] && s[i]

#include int isPrime(int x,int KnowPrimes[],int numberOfKnowPrimes);int main(){ const int number=100; int prime[number]={2}; int count=1; int i=3; while(count<number){ if(isPrime(i ,prime,

最简单的递推。

#include #include using namespace std;int main(){ //freopen("in.txt","r",stdin); int n,m; while(scanf("%d%d",&n,&m)!=EOF) { int a[100]; int i; for (i = 0; n > 0 ; ++i) { a[i]=n%m;

最简单的递归会爆炸，稍微改进一下，

占坑明天写。

简单的枚举规律：

思路：简单的素数判断，对效率yao'q

题目地址：HDU 2027主要是因为忘了清除缓冲区的换行符还WA了一发#include #include #include #include #include #include #include #include using namespace std;#define read() freopen("in.txt", "r", stdin)#define write