mowayao的专栏

统计最长无公共元素子串：map 搞定#include #include #include #include #include #include using namespace std;int n;vector st;map visit;void LNRS_dp_hash_impro(vector &arr, int size){ //memset(visit, -1,

水水题#include #include using namespace std;int main(){ int m,n; while(~scanf("%d%d",&m,&n)){ cout<<(n-1)*m+m-1<<endl; } return 0;}

Problem A: Modular FibonacciThe Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are defined by the recurrence:F0 = 0F1 = 1Fi = Fi-1 + Fi-2 for i>1Write a program which c

Problem B: How many Fibs?Recall the definition of the Fibonacci numbers:f1 := 1 f2 := 2 fn := fn-1 + fn-2     (n>=3)Given two numbers a and b, calculate how many Fibonacci numbers are in

Problem C: Work ReductionPaperwork is beginning to pile up on your desk, and tensions at the workplace are starting to mount. Your boss has threatened to fire you if you don't make any progress by

Beggar My Neighbour ``Beggar My Neighbour'' (sometimes known as ``Strip Jack Naked'') is a traditional card game, designed to help teach beginners something about cards and their values. A

Problem B: Ferry Loading IIIBefore bridges were common, ferries were used to transport cars across rivers. River ferries, unlike their larger cousins, run on a guide line and are powered by the rive

Problem D: Loansome Car BuyerSource file:loan.{c, cpp, java, pas}Input file:loan.inOutput file:loan.outKara Van and Lee Sabre are lonesome. A few months ago they

Problem C"Lock Manager"You are invited to be a part of the team that is developing yet another DBMS (Data Base Management System). You will be responsible for the Lock Manager.Locks control co

WordStackTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2944 Accepted: 1023DescriptionAs editor of a small-town newspaper, you know that a substantial

弱爆了，这种水题都能弹个几次。。。少了一个++k  #include #include #include #include #include using namespace std;int main(){ string st1,st2; while(cin >> st1 >> st2){ int k = 0,cnt = 0; for(int i = 0; i < s