Aden的专栏

#include int main() { int a,b; while (scanf("%d %d",&a, &b) != EOF) { printf("%d\n",a+b); } return 0;}

#include #include  int main(){    int M ,N ;    while(scanf("%d %d",&M,&N) && M != 0){        int a[M][N], b[M][N],cnt=0;        for(int i=0;i<M;i++)            for(int j=0;j<N;j++)         

#include #include double mx(double a,double b){    if(a>b)        return a;    else        return b;}  int main(){    double P,T,G1,G2,G3,GJ;    double ans;    while(scanf("%lf %lf %lf %

#include #include  int Trans(char A[]){    int a=0,len = strlen(A);    for(int i=0;i<len;i++){        if(A[i]>='0' && A[i]<='9')            a=a*10+A[i]-'0';    }    if(A[0] == '-')        a=

#include #include  int main(){    int N,M;    while(scanf("%d",&N) != EOF){        int A[N];        for(int i=0;i<N;i++)            scanf("%d",&A[i]);        scanf("%d",&M);        int B[M]

#include #include char s[1001];int main(){        int a,b,c;        char *p;        while(scanf("%s",s)!=EOF){                if(!strcmp(s,"zoj")){printf("Accepted\n");continue;}   //条件一    

#include #include #include #include const int MaxNum = 40005;typedef struct{    int index;    int Ge,Gi,Gf;    int choices[5];    int rank;    int school; }NodeType;NodeType Nodes[MaxNum]

#include #include #include #include #include using namespace std;//#include//#includestruct cou{    int ID, gold, prize, rank[4];    double gold_pop, prize_pop;}; bool cmp(const cou & A,

#include "iostream"#include "stdio.h"#include #include #include #include #include #include #include #include #include using namespace std;const int INF=0x7ffffff;struct E{    int nt,d,p;

#include #include #include #include #include #include #include #include #include #include using namespace std;//1009struct node{    node *l;    node *r;    int d;};node* Insert(node *

#include #include  char number[10][6] = {        "zero",        "one",        "two",        "three",        "four",        "five",        "six",        "seven",        "eight",        "ni

#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;//1011int d[10010];int k,s,e,mx;int

#include #include #include #include #include #include #include #include #include #include using namespace std;//1012int n,m;int Tree[1000];int findRoot(int x){    if(Tree[x]==x) return

#include#include#includeusing namespace std;struct Man{    char id[17];    char arr[9];    char lea[9];};bool cmp1(Man a,Man b){    int x = strcmp(a.arr,b.arr);    return x < 0;}bool cmp2

#include#include#include#include#includeusing namespace std;const int maxn=1010;const int maxm=12;int score[maxm];struct Node{    char name[22];    int m,g;};vectorvt;bool cmp(Node a,No

#include "iostream"#include "stdio.h"#include #include #include #include #include #include using namespace std;//1015int a,b,k;int main(){    //freopen("input.txt","r",stdin);    while(ci

#include#include#includeusing namespace std;const int maxn=100;const int maxm=1010;const int maxnb=200;int prime[maxn];int isprime[maxm];void getPrime(){    fill(isprime,isprime+maxm,0);  

#include #include #include #include #include #include #include using namespace std; //exp5.3#define N 101int Tree[N];int findRoot(int x){    if(Tree[x]==-1)        return x;    else{

#includeint main(){    int n;    while(~scanf("%d",&n)&&n)    {        int hash[101]={0};        for(int i=1;i<=n;i++)        {            int x;            scanf("%d",&x);            hash[

#include  using namespace std; int main(){    char ch;    int i, j, temp;    double a[200];    while (scanf("%d", &temp) != EOF&&temp!=0)    {        i = 1;        a[0] = 0;        a[1] =

#include #include #include #include #include #include #include #include #include #include using namespace std;//1020int a,b;int main(){    int xmin,ymin,xmax,ymax;    //freopen("input.t

#include "iostream"#include "stdio.h"#include #include #include #include #include #include #include #include #include using namespace std;//1021string s;string t;int ans[6];int main(){

#include int  s_time[100]; int main() {     char time[6];    char style;    int i,t,order,sum=0,count=0;    for(i=0;i<100;i++)      s_time[i]=-1;  while(1)  {      scanf("%d",&order);

#include #include #include using namespace std; typedef struct{    char no[8];    char name[10];    int score;}Node; Node ary[100000+3]; bool cmp1( Node a , Node b ){    return strcmp(

#include "iostream"#include "stdio.h"#include #include #include #include #include #include #include #include #include using namespace std;//1024int t[110];int n,m,a,b,c,size;struct edge

#include #include#include#include#include#include#include#include#include#includeusing namespace std;double price[35];double limit;int size;double ans;void dfs(int x,double cost){

#include "iostream"#include "stdio.h"#include #include #include #include #include #include using namespace std;//1026long int a,b;int m;vector v;int main(){    //freopen("input.txt","r",

#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;//1027int n,m,a,b;int in[1001];int m

#include #include using namespace std;#define N 101 int tree[N];int find(int x){    if (tree[x] == -1) return x;    else    {        int tmp = find(tree[x]);        tree[x] = tmp;

#include   #include   #include        struct dic  {    char wo[22];    char ex[82];  }a[10000],b[10000];       int cmp1(const void *a,const void *b)  {   return strcmp((*(struct dic *)a).w

#include  #include     using namespace std;     struct bg {         int hap; //欢乐度          int last; // 持续时间          int time; //必须离开时间   };  bg b[40];     bool comp(const bg &a, const b

#include #include #include #include #include #include #include #include #include #include using namespace std;//1031int n;int main(){    while(scanf("%d",&n)&&n!=0){        int k=0;

#include "iostream"#include "stdio.h"#include #include #include #include #include #include #include #include #include using namespace std;//1032string s;int d[3];int main(){    //freop

#includeint hash[1001];int a[501];int main(){    int n;    while(scanf("%d",&n) != EOF && n != 0){        for(int i = 0;i <= 1000;i++) hash[i] = 1;        hash[0] = hash[1] = 0;        for(in

#include "iostream"#include "stdio.h"#include #include #include #include #include #include #include #include #include #include using namespace std;//1034int n,m,t;priority_queue q;int

#include #include#include#include#include#include#include#include#include#includeusing namespace std;struct N{    int f;    int m;}node[30];void findParent(int a,int b,bool &flag,int l

#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct bigi{    int d[1001];    int len;    bigi(){        memset(d,0,sizeof(d));len=

#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;//1038int d[10];v

#include "iostream"#include "stdio.h"#include #include #include #include #include #include #include #include #include using namespace std;//1039int n;vector v;int main(){    //freopen(

#include #include #include #include #include #include #include #include using namespace std;//1107 method 2priority_queue,greater >Q;int main(){    int n;    while(scanf("%d",&n)!=EOF){