Twillz的博客

#include #include #include #include #include #define maxn 199999using namespace std;int num[maxn];int segtree[maxn];void plant(int node ,int l,int r){    if(l==r){segtree[nod

int cnt=0;struct Node{ int fr;//起点 int to;//终点 int l;//边权 int next;//指向上一条边}e[maxn*5];int head[maxn*5];//head[i]是起点为i的表头void add(int a,int b,int c){ e[cnt].fr=a; e[cnt].to

A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=

A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 111585 Accepted: 34748 Case Time Limit: 2000MS DescriptionYou have N integers, A1, A2, … , AN.

In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …An alternative fo

In order to prepare the “The First National ACM School Contest” (in 20??) the major of the city decided to provide all the schools with a reliable source of power. (The major is really afraid of blac

Matrix Power Series Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 23165 Accepted: 9651 DescriptionGiven a n × n matrix A and a positive integer k, find the sum S = A + A2 +

Intersection Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15600 Accepted: 4069 DescriptionYou are to write a program that has to decide whether a given line segment interse