2017.10.25水题大作战题解

rank:

T1P1615 西游记公司

https://www.luogu.org/problemnew/show/P1615

scanf直接秒

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define LL long long 
using namespace std;
inline LL read()
{
    char c=getchar();LL x=0,f=1;
    while(c<'0'||c>'9')    {if(c=='-')    f=-1;c=getchar();}
    while(c>='0'&&c<='9')    x=x*10+c-48,c=getchar();return x*f;
}
int main()
{
    LL a,b,c,d,e,f,n;
    scanf("%lld:%lld:%lld%lld:%lld:%lld%lld",&a,&b,&c,&d,&e,&f,&n);
    printf("%lld",n*(f-c+60*(e-b)+3600*(d-a)));
    return 0;
}

T2P1838 三子棋I

https://www.luogu.org/problemnew/show/P1838

判断好每一种情况，不要忘了平局

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define LL  long long 
using namespace std;
const int MAXN=201;
inline int read()
{
    char c=getchar();int flag=1,x=0;
    while(c<'0'||c>'9')    {if(c=='-')    flag=-1;c=getchar();}
    while(c>='0'&&c<='9')    x=(x*10+c-48),c=getchar();    return x*flag;
}
int a[MAXN][MAXN];
char s[MAXN];
int hang[MAXN];
int lie[MAXN];
int hang2[MAXN];
int lie2[MAXN];
int main()
{
    int n=3;
    scanf("%s",s+1);
    int now=1;
    for(int i=1;i<=strlen(s+1);i++)
    {
        int p=(int)s[i]-48;
        if(p%3!=0)
        {
            a[p/3+1][p%3]=now;
            if(now==1)    hang[p/3+1]++,    lie[p%3]++;
            else    hang2[p/+1]++,    lie2[p%3]++;
        }
        else
        {
            a[p/3][3]=now;
            if(now==1)    hang[p/3]++,    lie[3]++;
            else        hang2[p/3]++,    lie2[3]++;
        }
        if(now==1)    now=0;else now=1;
    }
    for(int i=1;i<=3;i++)
        if(hang[i]==3||lie[i]==3)
        {        printf("xiaoa wins.");    return 0;    }
    if((a[1][1]==1&&a[2][2]==1&&a[3][3]==1)||(a[1][3]==1&&a[2][2]==1&&a[3][1]==1))
    {    printf("xiaoa wins.");    return 0;    }
    for(int i=1;i<=3;i++)
        if(hang2[i]==3||lie2[i]==3)
        {    printf("uim wins.");    return 0;    }
    if((a[1][1]==0&&a[2][2]==0&&a[3][3]==0)||(a[1][3]==0&&a[2][2]==0&&a[3][1]==0))
    {        printf("uim wins.");        return 0;    }
    printf("drew.");
    return 0;
}

T3P1319 压缩技术

https://www.luogu.org/problemnew/show/P1319

根据题意模拟即可

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define LL  long long 
using namespace std;
const int MAXN=201;
inline int read()
{
    char c=getchar();int flag=1,x=0;
    while(c<'0'||c>'9')    {if(c=='-')    flag=-1;c=getchar();}
    while(c>='0'&&c<='9')    x=(x*10+c-48),c=getchar();    return x*flag;
}
int n;
int main()
{
    n=read();
    int now=0;
    int how=1;//zero 
    int p;
    while(cin>>p)
    {
        for(int i=1;i<=p;i++)
        {
            if(how==1)    printf("0");
            else         printf("1");
            now++;
            if(now==n)    printf("
"),now=0;
        }
        if(how==1)    how=0;
        else how=1;
    }
    return 0;
}

^{T4P2077 红绿灯}

https://www.luogu.org/problemnew/show/P2077

模拟汽车的行走路线，注意在经过红绿灯的时候取模

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define LL  long long 
using namespace std;
const int MAXN=200001;
inline int read()
{
    char c=getchar();int flag=1,x=0;
    while(c<'0'||c>'9')    {if(c=='-')    flag=-1;c=getchar();}
    while(c>='0'&&c<='9')    x=(x*10+c-48),c=getchar();    return x*flag;
}
int n,m;
int dis[MAXN];
int green[MAXN];
int red[MAXN];
int get(int pos,int val)
{
    int now=val%(green[pos]+red[pos]);
    if(now<=green[pos])    return 0;
    return red[pos]-(now-green[pos]);
}
int main()
{
    n=read(),m=read();
    for(int i=1;i<=n-1;i++)    dis[i]=read();
    for(int i=1;i<=n;i++)    red[i]=read();
    for(int i=1;i<=n;i++)    green[i]=read();
    int now=m;
    for(int i=1;i<=n;i++)
    {
        now=now+get(i,now);
        printf("%d
",now);
        now+=dis[i];
    }
    return 0;
}

T5P2043 质因子分解

https://www.luogu.org/problemnew/show/P2043

枚举1-n,依次进行分解

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define LL  long long 
using namespace std;
const LL MAXN=200001;
inline LL read()
{
    char c=getchar();LL flag=1,x=0;
    while(c<'0'||c>'9')    {if(c=='-')    flag=-1;c=getchar();}
    while(c>='0'&&c<='9')    x=(x*10+c-48),c=getchar();    return x*flag;
}
LL n;
LL vis[MAXN];
LL prime[MAXN];
LL tot=0;
LL ans[MAXN];
int main()
{
    n=read();
    vis[1]=1;
    for(LL i=1;i<=10000;i++)
    {
        if(vis[i]==0)
        {
            prime[++tot]=i;
            for(LL j=i;j<=15000;j+=i)
                vis[j]=1;
        }    
    }
//    for(LL i=1;i<=tot;i++)
    //    cout<<prime[i]<<" ";
    for(LL i=1;i<=n;i++)
    {
        LL p=i;
        for(LL j=1;j<=tot;j++)
            while(p%prime[j]==0&&p!=1)
                ans[j]++,p=p/prime[j];
    }
    for(LL i=1;i<=tot;i++)
        if(ans[i]!=0)
            printf("%lld %lld
",prime[i],ans[i]);
    return 0;
}

T6P1737 旷野大计算

https://www.luogu.org/problemnew/show/P1737