随笔分类 - 水题
摘要：#include<iostream> #include<algorithm> #include<cstring> using namespace std; struct node{ char result[305][55]; int len; }; node r[305]; char a[105][
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; #define maxn 16000005 bool has[maxn]; int num[300]; char a[maxn]; int main(){ int n,nc; scan
阅读全文
摘要：#include<iostream> using namespace std; int n,m,c; int main(){ while(scanf("%d%d%d",&n,&m,&c)==3&&n){ int result = 0; int i = n; while(i>=8){ int j =
阅读全文
摘要：#include<iostream> using namespace std; #include<algorithm> #include<cstring> int main(){ char data[55]; while(scanf("%s",data)==1&&strcmp(data,"#")!=
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; struct Node{ int v,b; }node[25]; bool cmp(Node n1,Node n2){ return n1.v<n
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; struct Node{ char c; char d[5]; }node[30]; int main(){ char data[30][5] = {
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; char data[10005][20],t[20],ans[10005][20]; int cnt_ans,count; void cmp(){ i
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int t,ansa,ansb,data[5],target[5]; char a[5],b[5]; scanf("%d",&t); while(t--){ an
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int data[110]; int main(){ int k,n,i,j,p,pos,count; scanf("%d",&k); while(k
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ int len,i,j; double sum; char data[80]; while(s
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main(){ int l,n,i,j,len; bool flag1,flag2,flag3; char a[5] = {'a','e','
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cmath> #include<cstdio> using namespace std; struct Node{ int x,y; }*node; bool cmp(Node n1,Node n2){
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ char s[260],t[20],*p,old; while(scanf("%s",s)==1){ while(scanf(
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int data[105][105],count,m,n; bool dfs(int direction,int i,int j){ //defini
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main(){ int i,j,col,data[30],ans[30][305],pos[305]; char a[4][100]; mem
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int n,ans[4],t,i,j; char a[35]; scanf("%d",&n); while(n--){ sca
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> #include<cstring> using namespace std; int main(){ char a[105][105]; int i,j,k,n,m; while(scan
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int a,b,c,d; scanf("%d%d%d%d",&a,&b,&c,&d); printf("5*(5-(1/5))\n"); return 0; }
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; struct Node{ int data[1005]; int n; Node(){ n = 1; memset(data,0,sizeof dat
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main(){ int i,j,len; char data[1005],ans[1005]; while(gets(data)){ len
阅读全文
