Stool_Monster的专栏

#include #include #include #include #include #include #include #include #include using namespace std;#define LL long long#define ULL unsigned long long#define del(a,b) memset(a,b,sizeof(a)

#include #include #include using namespace std;#define ULL unsigned long long#define LL long longLL N,M;int T,K;LL Prime[12],B[12];LL power(LL a,LL b,LL p){ LL res=1; while(b!=0){

Problem : 5417 ( Victor and Machine )     Judge Status : AcceptedRunId : 14606690    Language : G++    Author : Stool_MonsterCode Render Status : Rendered By HDOJ G++ Code Render Version 0.01

#include#include#includeusing namespace std;int main(){vector s1(1000);vector s2(1000);int m[1000];for(int n;cin>>n;){if(n==0)break; int k=0,flag=0;m[0]=1;cin>>s2[0];s1[0]=s2[0

首先是一个递归问题，我以后za#includeusing namespace std;long long hehe(int n){if(n==1)return(0);if(n==2)return(1);else return((n-1)*(hehe(n-1)+hehe(n-2)));}int main(){for(int n;cin>>n&&n>0&&nco

#include#includeusing namespace std;int main(){ int n,m,a; set aa; while(scanf("%d%d",&n,&m)!=EOF){ //此处要加上！=EOF，否则否出现Time Limit Exceeded aa.clear(); for(int i=1;i<=n;i++){ scanf("%d"

#include #include #include #include using namespace std;struct node{ int t,n;}nn;int T,N,ans;vector V;int main(){ scanf("%d",&T); while(T--) { V.clear();ans=0;

#include #include #include using namespace std;struct node{ int x; int n;}pp[42000];int T,N,ans,tmp;int P[42000];int quick_pow(int x,int n){ if(n==0) return 1; int cn