模式空间

多重加稳定排序#include#include#include#includestruct StrInfo{ std::string num; std::string name; int score;};StrInfo info[100005];std::vector vec;std::string t_num,t_name;int t_sco;in

常规解法，结果悲剧超时了#include#includeint n,d;std::list chairs;typedef std::list::iterator litr;litr itr;int pos1,pos2;int main(){ while (std::cin>>n>>d&&n&&d){ for(int i=0;i!=n;i++){ chairs.pu

题解：http://blog.youkuaiyun.com/jiahui524/article/details/6620997#include #define N 55int n;long long f[N];int main(){ f[1]=3; f[2]=6; f[3]=6; for(int i=4;i!=51;i++){ f[i]=f[i-1]+2*f[i-2]; }

#include#include#include #include#include #include#include#define N 200005int n,m;struct node{ int w; int p;};std::vector nodes;node tmp;long long sum;std::priority_queue , st

#include#include#includestruct num_t{ int flag; std::string str;};int conv(char c){ if(c>='0'&&c<='9'){ return c-'0'; }else{ return c-'A'+10; }}char r_conv(int n){ if(n<10){ ret

#include#include#include#include int n;std::map peo;typedef std::map ::iterator m_itr;std::string str1,str2;m_itr itr;std::string win;int w_n;int main(){ //std::fstream fin("1.txt"); wh

#include #define N 1005int n;int nar[N];int ar[N];int out[N];int tmp;int idx;int main(){ while (std::cin>>n&&n){ for(int i=0;i!=n;i++){ std::cin>>tmp; nar[i]=tmp; ar[tmp]=1; }

#include#include#includeint ar[27][2];int m,n;std::string str;//int depth;int dfs(int n,int r,int d){ d++; if(n==27||n==0){ return 0; } if(ar[n][0]==r||ar[n][1]==r){ return d; } int

#include#include#includestd::string str;std::map num_map;int a,b;int idx;int main(){ num_map.insert(std::make_pair("zero",0)); num_map.insert(std::make_pair("one",1)); num_map.insert(std::

#include#include#include#include#define N 150int n,g,s,c,m;int tmp,ht,mt,st;struct play{ int idx; int n; int t;};play plays[N];int idx;bool cmp(const play& l,const play& r){ if(l.

#includeint m,n;int main(){ while (std::cin>>m>>n){ if(m%(n+1)==0){ std::cout<<"none"<<std::endl; }else{ if(m<=n){ std::cout<<m; for(int i=m+1;i!=n+1;i++){ std::cout<<" "<<

#include#includestd::string str;std::string cmp("~!@#$%^");int ar[4];int idx;int m;int main(){ while (std::cin>>m){ for(int i=0;i!=m;i++){ std::cin>>str; for(int i=0;i!=str.size();i+

TLE超时用scanf神奇的解决了。。。用set超内存，囧，二分解决了果然ACM好变态，老老实实用最原始的方法#include#include#include#include#include#define N 1000005int m,n;int tmp;int ja[N];int nsell;bool serach(int v){ int st=0,ed=

STL最大堆算法http://blog.youkuaiyun.com/fdl19881/article/details/6685744#include#include#include#include#includeint n,m;std::vector men; int in;int main(){ while (std::cin>>n>>m&&(m!=0||n!=0)){

#include#includestd::vector mys;int n;int tmp;char ar[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";int main(){ while (std::cin>>n){ for(int i=0;i!=n;i++){ std::cin>>tmp; mys.push_back(tmp); }

#include#includeint n;int rn;int idx;int tmp;std::vector trans;int main(){ while (std::cin>>n){ trans.push_back(n); while (true){ tmp=n; while (tmp!=0){ rn*=10; rn+=tmp%10;

组合+错排#include int c,m,n;long long f[21];long long C(int n,int m){ long long sum=1; int j=1; for(int i=n;i>=n-m+1;i--){ sum=sum*i/j; j++; } return sum;}int main(){ f[1]=0; f[2]=

#include#include#include#include#include std::vector A,B,C;int m,n;int tmp;int size;int main(){ while (std::cin>>n>>m){ for(int i=0;i!=n;i++){ std::cin>>tmp; A.push_back(tmp); }

烂尾之作，思路应该是对的，就是横向和纵向扫描，什么时候想起来再填吧。。。#include#include#include //#include //1175#define M 1005#define N 1005int m,n,q;int map[M][N];int x1_,y1_,x2_,y2_;bool res;int m_

#include#include #define MAX_ 15//#define N 0//#define S 1//#define E 2//#define W 3char gird[MAX_][MAX_];unsigned int is_vis[MAX_][MAX_];int n,m,st;int pos_x,pos_y;bool flag;bool cir

超水题一枚，仅以此纪念我的第一次java ACM,WA了8次才过。。。import java.io.*;import java.util.*;public class Main { static public void main(String str[]) { Scanner cin = new Scanner(System.in); int a, b, t; int s

找规律，太疼了，这题，常规算法超时，另外注意ab取值范围#includelong long a,b;long long ar[4];int main(){ while (std::cin>>a>>b){ ar[0]=a%10; ar[1]=(ar[0]*a)%10; ar[2]=(ar[1]*a)%10; ar[3]=(ar[2]*a)%10; b=b%4;

筛选法，类似于素数的筛子法则，另一种就是暴利算法参考http://blog.sina.com.cn/s/blog_71ded6bf0100skxf.html#include#define M 500001int ar[M];int t,n;int main(){ for(int i=1;i!=M;i++){ ar[i]=1; } for(int i=2;

#include#include#includeint n,t,m,p;int wt_num;struct PEB{ friend bool operator<(const PEB& l,const PEB& r); int start; int mem; int st_m; int ed_m; int time; int cpu_time;};bool ope

#include#include#include#define N 105int n,m;unsigned short ar[N];int n_set;int tmp;unsigned short set[10000000];unsigned short set_;int idx;int idx_n;void creat_set(int dep){ if(dep>

链表模拟 ，优先队列，链表合并，加上恶心的WA....#include #include #include #include #include #include #include struct passger{ friend bool operator<(const passger& l,const passger& r); std::string name; int

#include int t; struct Time{ int h; int m; int s; Time():h(0),m(0),s(0){}};Time a,b,c;Time add_Time(const Time& l,const Time& r){ int carry(0); Time c; if((c.s=l.s+r.s)>59){ c.s=c.s

第一次使用bitset ,结果竟然超时了，不管了#include #include std::bitset ar;int n,m,tmp;int idx;int main(){ while (std::cin>>n>>m){ for(int i=0;i!=n;i++){ std::cin>>tmp; ar[tmp+500000]=1; } f

#include #include int t,m;char hash[27];std::string str1,str2;char a,b;int pos1,pos2;int idx;int main(){ while (std::cin>>t){ for(int i=0;i!=t;i++){ std::cin>>str1>>str2; std::cin>>

#includeint n;long long f[52];int main(){ f[1]=1; f[2]=2; for(int i=3;i!=51;i++){ f[i]=f[i-1]+f[i-2]; } while (std::cin>>n){ std::cout<<f[n]<<std::endl; }}

#include#include#includeint n;std::string str;std::string str1,str2,strcmp1,strcmp2;class btree{ struct node { node():v(0),left(NULL),right(NULL){} int v; node* left; node* right; };