mmciel

#include <bits/stdc++.h>using namespace std;int main(){ int a[4]; for(int i = 192;i<333;i++) { int num_flag[10][2]={0,0,1,0,2,0,3,0,4,0,5,0,6,0,7,0,8,0,9,0}; ...

 /*通过map初始化一个字典获取每行的数据遍历获得的字符串如果在字典中有值，就存储字典，否则存储原字符*/#include <bits/stdc++.h>using namespace std;map<char,char> book;void init(){ book['A'] = 'I'; book['W'] = 'I'; ...

/*把每一行头部最为一个标记存入字符串head根据标记不同，后面跟字符串："--+" " |"循环次数由n m控制*/#include <bits/stdc++.h>using namespace std;const string x="--+";const string y=" |";string init(int n){ string head ...

#include <bits/stdc++.h>using namespace std;int m[20000] = {0};int main(){ int a,b,c; int n,t=0; cin>>n>>a>>b>>c; while(t!=n){ m[a*t] = 1; ...

#include <bits/stdc++.h>using namespace std;int main(){ vector<int> a; int n,m; cin>>n>>m; for(int i=1;i<=n;i++) a.push_back(i); int t = 1; ...

#include <bits/stdc++.h>using namespace std;map<int,int> a;bool cmp(const pair<int,int> a,const pair<int, int> b){ return a.second < b.second;}int main(){ int n...

#include <bits/stdc++.h>using namespace std;int main(){ for(int i = 3; i<66; i++){ for(int j = i+1; j<=100; j++){ for(int k = j+1;k<=100;k++){ ...

#include <bits/stdc++.h>using namespace std;map<int,int> a;bool cmp(const pair<int,int> a,const pair<int, int> b){ return a.second < b.second;}int main(){ int n...

#include <bits/stdc++.h>using namespace std;set <int> a,b;set <int>::iterator it ;int main(){ int n1,n2,num; while(scanf("%d%d", &n1,&n2), n1!=0 && n2!=0){ ...

#include <bits/stdc++.h>using namespace std;vector< pair <int, int> > a;vector< pair <int, int> >::iterator it ;int main(){ int n; scanf("%d", &n); pair&lt

#include<bits/stdc++.h>using namespace std;int main(){ string a; cin>>a; int len = a.size()-1; int flag,ling_1=0; flag = (a[0]=='-') ? -1 : 1; for(int i=len;a[i]...

#include <bits/stdc++.h>using namespace std;int main(){ int p1=-1,p2=-1,f=0; string a; cin>>a; for(int i = a.size()-1;i>=0;--i){ if(a[i]!='0'&&i>...

#include<bits/stdc++.h>using namespace std;int main(){ string a,b; while (cin>>a>>b){ if (a.size() < b.size()) printf("no\n"); else{ a=a+...

#include <bits/stdc++.h>using namespace std;int main(){ int n,x; scanf("%d", &n); static int* a = (int*)malloc(sizeof(int)*n); for(int i=0;i<n;++i) scanf("%d",&amp...

#include <bits/stdc++.h>using namespace std;int b[10001];int main(){ int t; scanf("%d", &t); while(t--){ int L,M,sum=0; memset(b,-1,sizeof(b)); scan...

#include <bits/stdc++.h>using namespace std;const int N = 10001;int main(){ int t; scanf("%d", &t); while(t--){ int n,amax=0; scanf("%d", &n); int a[N]...

#include <bits/stdc++.h>using namespace std;const int N=100001;int a[N];int found(int a[], int len, int x);int main(){ int n,m; scanf("%d", &n); for(int i=0;i<n;++i)...

#include <bits/stdc++.h>using namespace std;const int N = 1001;int main(){ int n; scanf("%d", &n); while(n--){ int k = 0; string a,b,c(N,'0'); cin >>...

混乱代码大赛中的看不懂先放这里#include <stdlib.h> #include <stdio.h> const int len = 2800; const int D = 10000;long e,g; long b=len,c=len;long f[len]; int main() { for(int i = 0;i&...