Codeforces Round #340 (Div. 2)

最新推荐文章于 2024-09-21 12:17:42 发布

Olga_jing

最新推荐文章于 2024-09-21 12:17:42 发布

阅读量330

点赞数

分类专栏： Codeforces

本文链接：https://blog.csdn.net/Olga_jing/article/details/50573144

版权

Codeforces 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point x(x > 0)of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.

Input

The first line of the input contains an integer x (1 ≤ x ≤ 1 000 000) — The coordinate of the friend's house.

Output

Print the minimum number of steps that elephant needs to make to get from point 0 to point x.

       Sample test(s) 
     
         input 
       
5

         output 
       
1

         input 
       
12

         output 
       
3

Note

In the first sample the elephant needs to make one step of length 5 to reach the point x.

In the second sample the elephant can get to point x if he moves by 3, 5 and 4. There are other ways to get the optimal answer but the elephant cannot reach x in less than three moves.

题不难，不过注意思维的多面性。

方法1.贪心模拟

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<string>
using namespace std;

#define inf 100000
#define rson mid+1,r,rt<<1|1

int a[6]={0,1,2,3,4,5};
int main()
{
    int n,ans;
    while(~scanf("%d",&n))
    {
        ans=0;
        for(int i=5;i>0;i--)
        {
            while(n>=a[i])
            {
                n-=a[i];
                ans++;
            }
            if(n==0)
                break;
        }
        printf("%d\n",ans);
    }
    return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<string>
using namespace std;

#define inf 100000
#define rson mid+1,r,rt<<1|1

int main()
{
    int n,ans;
    while(~scanf("%d",&n))
    {
      if(n%5==0)
        printf("%d\n",n/5);
      else
        printf("%d\n",n/5+1);
    }
    return 0;
}

Bob loves everything sweet. His favorite chocolate bar consists of pieces, each piece may contain a nut. Bob wants to break the bar of chocolate into multiple pieces so that each part would contain exactly one nut and any break line goes between two adjacent pieces.

You are asked to calculate the number of ways he can do it. Two ways to break chocolate are considered distinct if one of them contains a break between some two adjacent pieces and the other one doesn't.

Please note, that if Bob doesn't make any breaks, all the bar will form one piece and it still has to have exactly one nut.

Input

The first line of the input contains integer n (1 ≤ n ≤ 100) — the number of pieces in the chocolate bar.

The second line contains n integers ai (0 ≤ ai ≤ 1), where 0 represents a piece without the nut and 1 stands for a piece with the nut.

Output

Print the number of ways to break the chocolate into multiple parts so that each part would contain exactly one nut.

       Sample test(s) 
     
         input 
       
3
0 1 0

         output 
       
1

         input 
       
5
1 0 1 0 1

         output 
       
4

Note

In the first sample there is exactly one nut, so the number of ways equals 1 — Bob shouldn't make any breaks.

In the second sample you can break the bar in four ways:

10|10|1

1|010|1

10|1|01

1|01|01

题意：问有多少种分法使得一串数字中每段的数字之和为1；

题解：每两个1的位置差的乘积就是结果。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<string>
using namespace std;

#define LL long long
#define rson mid+1,r,rt<<1|1

int a[100],b[100];
int main()
{
    int n,cou,k1,k2,sum,cnt,i;
    LL ans;
    while(~scanf("%d",&n))
    {
        cou=0;ans=1;sum=0;cnt=0;k1=0;k2=0;
        memset(a,0,sizeof(0));

        for(i=1;i<=n;i++)
        {
            scanf("%d",&b[i]);
            if(b[i]==1)
                cou++;
        }
        if(cou==n||cou==1)
            ans=1;
        else
        if(cou==0)
            ans=0;
        else
        {
           for(int j=1,i=1;j<=n;j++)
            {
                if(b[j]==1)
                {
                    sum++;
                    if(sum==2)
                    {
                        a[i]=j-k1;
                        //k1=j;
                        sum--;
                        i++;
                        k2=i;
                    }
                    k1=j;
                }
            }
            for(int j=1;j<k2;j++)
                ans=ans*a[j];
        }
        printf("%lld\n",ans);
    }
    return 0;
}