Group competition 54

E-Relax! It's just a game A, B at least 1. Is =

Http://livearchive.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 2366

/*Problem ID:meaning:Analyzing:*/#include <iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<vector>using namespace std;typedef struct even{int y1,y2,x;}even;#define FOR(i,s,t) for(int i=(s); i<(t); i++)#define LL long long#define BUG puts("here!!!")#define STOP system("pause")#define file_r(x) freopen(x, "r", stdin)#define file_w(x) freopen(x, "w", stdout)#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define maxn 100005LL gcd(LL a,LL b) {return a?gcd(b%a,a):b;}int main(){    int a,b;    while(scanf("%d%d",&a,&b)){        if(a==-1&&b==-1) break;        int sum1=a+b;        int sum2=-1;        if(a==1||b==1) sum2=a+b;        if(sum1==sum2) printf("%d+%d=%d\n",a,b,sum1);        else printf("%d+%d!=%d\n",a,b,sum1);    }    return 0;}

Question HMusical Chairs: Joseph's ring problem is fixed with a template.. t_t

Http://livearchive.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 2369

/*Problem ID:meaning:Analyzing:*/#include <iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<vector>using namespace std;typedef struct even{int y1,y2,x;}even;#define FOR(i,s,t) for(int i=(s); i<(t); i++)#define LL long long#define BUG puts("here!!!")#define STOP system("pause")#define file_r(x) freopen(x, "r", stdin)#define file_w(x) freopen(x, "w", stdout)#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define maxn 16666LL gcd(LL a,LL b) {return a?gcd(b%a,a):b;}// Joseph's Problem// input: n,m-- the number of persons, the inteval between persons// output:-- return the reference of last personint josephus(int n, int m){    int l=0,c;    for(c=1;c<=n;c++)        l=(l+m-1)%c+1;    return l;}int main(){    int N,D,W;    while(~scanf("%d%d",&N,&D)&&(N||D)){        printf("%d %d %d\n",N,D,josephus(N,D));    }    return 0;}

Question K: Boiled eggs greedy. No sample results were wa several times .. 55

Http://lightoj.com/volume_showproblem.php? Problem = 1227.

/*Problem ID:meaning:Analyzing:*/#include <iostream>#include<algorithm>#include<cstdio>#include<cstdlib>#include<cstring>#include<vector>using namespace std;typedef struct even{int y1,y2,x;}even;#define FOR(i,s,t) for(int i=(s); i<(t); i++)#define LL long long#define BUG puts("here!!!")#define STOP system("pause")#define file_r(x) freopen(x, "r", stdin)#define file_w(x) freopen(x, "w", stdout)#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define maxn 16666LL gcd(LL a,LL b) {return a?gcd(b%a,a):b;}int egg[35];int main(){    int i,n,p,q,T,sum,Cas=1;    scanf("%d",&T);    while(T--)    {        scanf("%d%d%d",&n,&p,&q);        for(i=0;i<n;i++)            scanf("%d",&egg[i]);        sum=0;        i=0;        sort(egg,egg+n);        while(1)        {            if(sum+egg[i]>q||i+1>p||i+1>n) break;            sum+=egg[i];            i++;        }        printf("Case %d: %d\n",Cas++,i);    }    return 0;}

C: * match an even number of characters, # match an odd number of characters. = No... to be updated

Question f...