7.25第一次组队赛

Problem A UVA 11877

The Coco-Cola Store

直接输出n/2

#include <stdio.h>
int main()
{
int n;
while(~scanf("%d",&n) && n)
{
printf("%d
",n/2);
}
return 0;
}

也可以模拟

#include <stdio.h>
int main()
{
    int n;
    while(scanf("%d",&n)==1 && n)
    {
        int Sum=0;
        while(n>=3)
        {
            Sum+=n/3;
            n=n/3+n%3;
        }
        if(n==2)
        {
            ++Sum;
        }
        printf("%d
",Sum);
    }
    return 0;
}

Problem B UVA 11878

Homework Checker

不解释

#include <stdio.h>

int main()
{
    int a, b, res, ans = 0;
    char op, re[3];
    while(~scanf("%d%c%d=%s", &a, &op, &b, re))
    {
        if(re[0] == '?')continue;
        sscanf(re,"%d", &res);
        if(op == '-' && a-b == res)ans ++;
        else if(op == '+' && a+b == res)ans++;
    }
    printf("%d
",ans);
    return 0;
}

Problem C UVA 11879

Multiple of 17

java水过

import java.math.*;
import java.util.*;
import java.io.*;

public class Main{
    public static void main(String[] args) throws Exception
    {
        Scanner cin = new Scanner(new BufferedInputStream(System.in));
        BigInteger p;
        while(cin.hasNext())
        {
            p = cin.nextBigInteger();
            if(p.equals(BigInteger.valueOf(0)))break;
            BigInteger ten = new BigInteger("10");
            BigInteger five = new BigInteger("5"); 
            BigInteger Seventeen = new BigInteger("17");
            BigInteger divideTen = p.divide(ten);
            BigInteger flag =divideTen;
            divideTen= divideTen.multiply(ten);
            BigInteger cha = p.subtract(divideTen);
            cha = cha.multiply(five);
            flag = flag.subtract(cha);
            BigInteger temp = flag;
            flag = flag.divide(Seventeen);
            flag = flag.multiply(Seventeen);
            boolean ok = temp.equals(flag);
            System.out.println(ok == true ? 1 : 0);
        }
    }
}

Problem E UVA 12289

One-Two-Three

#include<stdio.h>
#include<string.h>

int Same(char *str,const char *cmp)
{
    int s=0;
    for(int i=0;str[i]&&cmp[i];++i)
    {
        if(str[i]==cmp[i]) ++s;
    }
    return s;
}

int main()
{
    int T;
    char str[1005];
    while(scanf("%d",&T)==1) while(T--)
    {
        scanf("%s",str);
        if(strlen(str)==5)
        {
            printf("3
");
        }
        else
        {
            int Same1=Same(str,"one");
            int Same2=Same(str,"two");
            printf("%d
",Same1>Same2?1:2);
        }
    }
    return 0;
}

Problem F UVA 12290

Counting Game

按照每次增加的个数，直接暴力，应为报数不会超过80000

#include <stdio.h>

int judge(int n)
{
    if(n%7 == 0)return 1;
    while(n)
    {
        if(n%10 == 7)return 1;
        n/=10;
    }
    return 0;
}

int main()
{
    int n,m,k;
    while(~scanf("%d%d%d", &n,&m,&k) &&(m||n||k))
    {
        int ans = 0,bao = m;
        if(judge(bao)){k--;}
        ans = bao;
        while(k)
        {
            bao+=(2*(n-m));
            if(judge(bao)){ans = bao;k--;}
            if(!k)break;
            bao += (2*(m-1));
            if(judge(bao)){ans = bao;k--;}
            if(n==m || m==1)if(judge(bao))k++;
        }
        printf("%d
",ans);
    }
    return 0;
}

Problem G UVA 12293

Box Game

推导得必输态为2^k  -  1

#include <stdio.h>
#include <math.h>

int main()
{
    double n;
    while(~scanf("%lf",&n) && n )
    {
        n+=1;
        double ans = log(n)/log(2);
        printf("%s
", ans==(int)ans ? "Bob" : "Alice");
    }
    return 0;
}

Problem J ZOJ 3714

Java Beans

取前导和，求距离为d的差的最大值

#include <stdio.h>
#define MAX(a,b) (a) > (b) ? (a) : (b)
int main()
{
    int Case;
    while(~scanf("%d", &Case))while(Case --)
    {
        int sum[402] = {0},n,m,a,ans=0;
        scanf("%d%d", &n,&m);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a);
            sum[i]=sum[i-1]+a;
            sum[i+n] = sum[i];
        }
        for(int i=m;i<=n+m;i++)
        {
            if(i>n)sum[i]+=sum[n];
            ans = MAX(ans, sum[i]-sum[i-m]);
        }
        printf("%d
", ans);
    }
    return 0;
}

Problem K ZOJ 3706

Break Standard Weight

#include <stdio.h>
#include <string.h>

#define MAX(a,b)  (a)>(b)?(a):(b)

const int Hash[3]={-1,0,1};

int x,y;

int Cnt(int a,int b,int c)
{
    bool HashCnt[500];
    memset(HashCnt,0,sizeof(HashCnt));
    for(int i=0;i<3;++i)
    {
        for(int j=0;j<3;++j)
        {
            for(int k=0;k<3;++k)
            {
                int sss=a*Hash[i]+b*Hash[j]+c*Hash[k];
                if(sss>0)
                {
                    HashCnt[sss]=true;
                }
            }
        }
    }
    int sum=0;
    for(int m=1;m<=x+y;++m)
    {
        sum+=HashCnt[m];
    }
    return sum;
}


int main()
{
    int T;
    while(scanf("%d",&T)==1) while(T--)
    {
        scanf("%d%d",&x,&y);
        int Ans=0;
        for(int i=1;i+i<=x;++i)
        {
            int Kep=Cnt(i,x-i,y);
            Ans=MAX(Ans,Kep);
        }
        for(int j=1;j+j<=y;++j)
        {
            int Kep=Cnt(x,j,y-j);
            Ans=MAX(Ans,Kep);
         }
        printf("%d
",Ans);
    }
    return 0;
}