其他

Problem I23 Out of 5Input:standard inputOutput:standard outputTime Limit: 1 secondMemory Limit:32 MBYour task is to write a program that can decide whether you can find an arithmetic expression consisting of five given numbers(1<=i<=5) that

 Problem BCode RefactoringTime Limit: 2 seconds "Harry, my dream is a code waiting to bebroken. Break the code, solve the crime." Agent Cooper Several algorithms in modern cryptography are based on the fact that factoring large numbers is difficult.

#include<stdio.h>#include<stdlib.h>typedef int elemtype;typedef struct node{ elemtype data; struct node *next;}node;struct node *head;int n;void bulid1()//尾插法{ struct node *p,*q; q=head; int i; for (i=1;i<=n;i++) { p=(struct

  ClockHands The medieval interest in mechanical contrivances is well illustrated by the development of the mechanical clock, the oldest of which is driven by weights and controlled by a verge, an oscillating arm engaging with a gear wheel. It dates

1195 Mobile phones 樹狀數組                                                   題解1455 Crazy tea party1521 Entropy huffman                                                               題解1703 Find them, Catch them 並查集1785 Binary Search Heap Construction179

最後一道壓軸題：當時困死了想了半小時題目才做出來小明和小強都是張老師的學生，張老師的生日是某月某日，2人都不知道張老師的生日。　　生日是下列10組中一天：　　3月4日 3月5日 3月8日 6月4日 6月7日 9月1日 9月5日 12月1日 12月2日

Problem GHow many zeros and how many digits?Input: standard inputOutput: standard output Given a decimal integer number you will have to find out how many trailing zeros will be there in its factorial in a given number system and also you will have

實驗一  線性表的順序表示與實現#include <stdio.h>#include <stdlib.h>#include <iostream>#define OVERFLOW -2#define OK 1#define ERROR 0#define LIST_INIT_SIZE 1000#define Elemtype int// typedef int Elemtypetypedef struct{ Elemtype *elem; int

  Coin Change Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money.For example, if we have 11 cents, then we can make changes with one 10-cent coin

【題目連結】http://acm.hdu.edu.cn/showproblem.php?pid=4115【題目大意】Bob和Alice玩剪刀石頭布，一個玩n輪，Alice已經知道了Bob每次要出什麼，1代表剪刀，2代表石頭，3代表布，然後Bob對Alice作出了一些限制：給m行，每行是a b

  487-3279 Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialing the memorable TUT-GLOP.

【題目連結】http://poj.org/problem?id=3678【題目大意】有一個有向圖G（V，E），每條邊e（a,b）上有一個位元運算符op（AND， OR或XOR）和一個值c（0或1）。問能不能在這個圖上的每個點分配一個值X（0或1），使得每一條邊e(a,b)滿足  Xa op Xb =  c【思路】每一個點上只能取0或者1，顯然是2-SAT模型。關鍵是怎樣建邊。對於兩個點a和 b，   a有兩個值a1=0，a2=1， b也有兩個值 b1=0,

                   二維數組的最大連續和問題，核心思想就是轉化為一維數組，一個所要求的矩形，有一下幾個元素構成，起始行，結束行，起始列，結束列，枚舉起始行和結束行，linesum[i]儲存的是從起始行到結束行間第i列的和。最內層的for迴圈就是以為數組連續最大和的求法（不斷更新最大值）。     第二段代碼是動規，感覺在理解了第一種方法後再理解這段代碼就很容易了，

 The Cat in the Hat Background(An homage to Theodore Seuss Geisel) The Cat in the Hat is a nasty creature,But the striped hat he is wearing has a rather nifty feature. With one flick of his wrist he pops his top off. Do you know what's inside that

【題目連結】http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3656【題目大意】假設已經知道一個數組a[N]，那麼用一下函數產生一個矩陣b：void calculate(int a[N], int b[N][N]) {for (int i = 0; i < N; ++i) {for (int j = 0; j < N; ++j) {if (i == j) b[i][j] = 0;else if (i % 2 =

【題目連結】http://poj.org/problem?id=3207【題目大意】一個圓圈上有N個數：0，1，2……N-1。 然後有m條線兩兩串連這些點，這些線可以在圓圈裡面，也可以在圓圈外面。問有沒有一種方式，使得這些線都不相交。【思路】以線為單位，每條線要麼在圓圈裡面，要麼在圓圈外面，典型的2-SAT模型。【代碼】#include<iostream> #include<cstdio>#include<cstring>using namespace

  How Many Points of Intersection? We have two rows. There are a dots on the top row andb dots on the bottom row. We draw line segments connecting every dot on the top row with every dot on the bottom row. The dots are arranged in such a way that

【題目連結】http://poj.org/problem?id=3905【思路】2-SAT簡單的判斷題【代碼】#include<iostream>#include<queue>#include<cstdio>#include<cstring>using namespace std;const int MAXN = 1010;const int VN = MAXN*2;const int EN = VN*VN*2;int n, m;

文章目錄 Sample InputOutput for Sample Input Problem D: XYZZYADVENT: /ad�vent/, n.The prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an attempt at computer-refereed

       今天偶然看到了大三學姐的部落格，她一直是我的榜樣，我也是在猶豫競賽和學習成績，該怎麼維持平衡，確實是，競賽中好多還是要書本知識來大基礎的，所以不要落下任何一個，只要合理安排好時間，都是可以做到的，最近因為刷題老是接觸新東西，腦子又笨，很慢，又有點懈怠。。。。。。。         如果覺得每走一步都很艱難，那是在爬坡，是在進步的過程中，只有爬過山坡，才算得上是勝利。