A - Two Rectangles


Time limit : 2sec / Memory limit : 256MB

Score : 100 points

Problem Statement

There are two rectangles. The lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B. The lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.

Print the area of the rectangle with the larger area. If the two rectangles have equal areas, print that area.

Constraintsfewfew

  • All input values are integers.
  • 1≤A≤104
  • 1≤B≤104
  • 1≤C≤104
  • 1≤D≤104

Input

The input is given from Standard Input in the following format:

A B C D

Output

Print the area of the rectangle with the larger area. If the two rectangles have equal areas, print that area.


Sample Input 1

Copy
3 5 2 7

Sample Output 1

Copy
15

The first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14. Thus, the output should be 15, the larger area.


Sample Input 2

Copy
100 600 200 300

Sample Output 2

Copy
60000
题意:求哪个的面积最大
解法:比较大小
 1 #include<bits/stdc++.h>
2 using namespace std;
3 #define ll long long
4 int main()
5 {
6 ll a,b,c,d;
7 cin>>a>>b>>c>>d;
8 cout<<max(a*b,c*d);
9 return 0;
10 }

B - Increment Decrement


Time limit : 2sec / Memory limit : 256MB

Score : 200 points

Problem Statement

You have an integer variable x. Initially, x=0.

Some person gave you a string S of length N, and using the string you performed the following operation N times. In the i-th operation, you incremented the value of x by 1 if Si=I, and decremented the value of x by 1 if Si=D.

Find the maximum value taken by x during the operations (including before the first operation, and after the last operation).

Constraints

  • 1≤N≤100
  • |S|=N
  • No characters except I and D occur in S.

Input

The input is given from Standard Input in the following format:

N
S

Output

Print the maximum value taken by x during the operations.


Sample Input 1

Copy
5
IIDID

Sample Output 1

Copy
2

After each operation, the value of x becomes 1221 and 2, respectively. Thus, the output should be 2, the maximum value.


Sample Input 2

Copy
7
DDIDDII

Sample Output 2

Copy
0

The initial value x=0 is the maximum value taken by x, thus the output should be 0.

题意:I是增长,D是下降,现在求变化中的最大值

解法:模拟

 1 #include<bits/stdc++.h>
2 using namespace std;
3 #define ll long long
4 int main()
5 {
6 ll a,b,c,d;
7 cin>>a;
8 string s;
9 cin>>s;
10 ll sum=0;
11 ll max1=0;
12 for(int i=0;i<a;i++)
13 {
14 if(s[i]=='I')
15 {
16 sum++;
17 }
18 else
19 {
20 sum--;
21 }
22 max1=max(sum,max1);
23 }
24 cout<<max1<<endl;
25 return 0;
26 }

C - Factors of Factorial


Time limit : 2sec / Memory limit : 256MB

Score : 300 points

Problem Statement

You are given an integer N. Find the number of the positive divisors of N!, modulo 109+7.

Constraints

  • 1≤N≤103

Input

The input is given from Standard Input in the following format:

N

Output

Print the number of the positive divisors of N!, modulo 109+7.


Sample Input 1

Copy
3

Sample Output 1

Copy
4

There are four divisors of 3! =6123 and 6. Thus, the output should be 4.


Sample Input 2

Copy
6

Sample Output 2

Copy
30

Sample Input 3

Copy
1000

Sample Output 3

Copy
972926972

题意:求N!能被多少个数整除

解法: 额。。。http://oeis.org/A027423

 #include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef long long LL;
LL fun(LL x,LL n)
{
LL res=;
while(n>)
{
if(n & )
res=(res*x);
x=(x*x);
n >>= ;
}
return res;
}
ll a[]={, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,};
int main()
{
ll n;
ll mod=1e9+;
ll ans=;
cin>>n;
ll b[];
int pos=;
while()
{
if(a[pos]<=n)
{
pos++;
}
else
{
break;
}
}
//cout<<<<endl;
for(int i=; i<=pos-; i++)
{
ll sum=;
for(int j=; j<=n; j++)
{
if(fun(a[i],j)<=n)
{
sum+=(n/fun(a[i],j));
}
else
{
break;
}
}
ans=ans*(sum+);
ans%=mod;
}
cout<<ans<<endl;
return ;
}

D - Walk and Teleport


Time limit : 2sec / Memory limit : 256MB

Score : 500 points

Problem Statement

There are N towns on a line running east-west. The towns are numbered 1 through N, in order from west to east. Each point on the line has a one-dimensional coordinate, and a point that is farther east has a greater coordinate value. The coordinate of town i is Xi.

You are now at town 1, and you want to visit all the other towns. You have two ways to travel:

  • Walk on the line. Your fatigue level increases by A each time you travel a distance of 1, regardless of direction.

  • Teleport to any location of your choice. Your fatigue level increases by B, regardless of the distance covered.

Find the minimum possible total increase of your fatigue level when you visit all the towns in these two ways.

Constraints

  • All input values are integers.
  • 2≤N≤105
  • 1≤Xi≤109
  • For all i(1≤iN−1)Xi<Xi+1.
  • 1≤A≤109
  • 1≤B≤109

Input

The input is given from Standard Input in the following format:

N A B
X1 X2 XN

Output

Print the minimum possible total increase of your fatigue level when you visit all the towns.


Sample Input 1

Copy
4 2 5
1 2 5 7

Sample Output 1

Copy
11

From town 1, walk a distance of 1 to town 2, then teleport to town 3, then walk a distance of 2 to town 4. The total increase of your fatigue level in this case is 2×1+5+2×2=11, which is the minimum possible value.


Sample Input 2

Copy
7 1 100
40 43 45 105 108 115 124

Sample Output 2

Copy
84

From town 1, walk all the way to town 7. The total increase of your fatigue level in this case is 84, which is the minimum possible value.


Sample Input 3

Copy
7 1 2
24 35 40 68 72 99 103

Sample Output 3

Copy
12

Visit all the towns in any order by teleporting six times. The total increase of your fatigue level in this case is 12, which is the minimum possible value.

题意:看样列知题意

解法:每一步都取最小值

#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef long long LL;
LL fun(LL x,LL n)
{
LL res=;
while(n>)
{
if(n & )
res=(res*x);
x=(x*x);
n >>= ;
}
return res;
}
ll a[]={, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,};
int main()
{
ll dp[];
ll a[];
ll n,x,b;
cin>>n>>x>>b;
for(int i=;i<=n;i++)
{
cin>>a[i];
}
dp[]=;
a[]=;
for(int i=;i<=n;i++)
{
dp[i]=min(dp[i-]+(a[i]-a[i-])*x,dp[i-]+b);
}
cout<<dp[n]<<endl;
return ;
}

AtCoder Beginner Contest 052 ABCD题的更多相关文章

  1. AtCoder Beginner Contest 068 ABCD题

    A - ABCxxx Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement This contes ...

  2. AtCoder Beginner Contest 053 ABCD题

    A - ABC/ARC Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Smeke has ...

  3. AtCoder Beginner Contest 069 ABCD题

    题目链接:http://abc069.contest.atcoder.jp/assignments A - K-City Time limit : 2sec / Memory limit : 256M ...

  4. AtCoder Beginner Contest 070 ABCD题

    题目链接:http://abc070.contest.atcoder.jp/assignments A - Palindromic Number Time limit : 2sec / Memory ...

  5. AtCoder Beginner Contest 057 ABCD题

    A - Remaining Time Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Dol ...

  6. AtCoder Beginner Contest 051 ABCD题

    A - Haiku Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement As a New Yea ...

  7. AtCoder Beginner Contest 054 ABCD题

    A - One Card Poker Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Ali ...

  8. AtCoder Beginner Contest 058 ABCD题

    A - ι⊥l Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Three poles st ...

  9. AtCoder Beginner Contest 052

    没看到Beginner,然后就做啊做,发现A,B太简单了...然后想想做完算了..没想到C卡了一下,然后还是做出来了.D的话瞎想了一下,然后感觉也没问题.假装all kill.2333 AtCoder ...

随机推荐

  1. 笔记整理--Linux平台MYSQL的C语言

    Linux平台MYSQL的C语言API全列表 - 第三只眼的专栏 - 博客频道 - CSDN.NET - Google Chrome (2013/8/18 22:28:58)   Linux平台MYS ...

  2. PHP中require()文件包含的正确用法

    以前看一些PHP框架源码的时候,很奇怪在文件包含的时候,会用dirname(__FILE__)来拼凑文件路 径,不知道这样做有什么好处,后来终于发现了其中的缘由. 我们来看一个简单的例子: 有a,b, ...

  3. hdu_2457_DNA repair(AC自动机+DP)

    题目连接:hdu_2457_DNA repair 题意: 给你N个字符串,最后再给你一个要匹配的串,问你最少修改多少次,使得这个串不出现之前给的N的字符串 题解: 刚学AC自动机,切这题还真不知道怎么 ...

  4. hdu_5085_Counting problem(莫队分块思想)

    题目连接:hdu_5085_Counting problem 题意:给你一个计算公式,然后给你一个区间,问这个区间内满足条件的数有多少个 题解:由于这个公式比较特殊,具有可加性,我们考虑讲一个数分为两 ...

  5. css text-indent:999em

    em是个单位,是字符宽度text-indent:999em首行缩进999个字符 大约多长?大约相当于多少PX?能不能用PX来表示这个缩进? 等于当前的字体大小.当font-size:12px; 1em ...

  6. 2016青岛网络赛 Barricade

    Barricade Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Proble ...

  7. OpenGL学习--------颜色的选择

    OpenGL支持两种颜色模式:一种是RGBA,一种是颜色索引模式.无论哪种颜色模式,计算机都必须为每一个像素保存一些数据.不同的是,RGBA模式中,数据直接就代表了颜色:而颜色索引模式中,数据代表的是 ...

  8. Android CTS 测试总结【转】

    Android CTS 测试总结[转] 最近一直在做Android兼容性测试,根据Android官网给出的android-cts-manual 配置好了device后,开始测试. 首先配置软件环境: ...

  9. ptrace

    http://zhangwenxin82.blog.163.com/blog/static/114595956201171510512459/

  10. expected: file:///

    [java] java.lang.IllegalArgumentException: Wrong FS: hdfs://192.168.190.128:9000/user/hadoop/output/ ...