Codeforces Round #259 (Div. 2) - c++编程基础

TOP

Codeforces Round #259 (Div. 2)(一)

2015-07-20 18:01:25 来源: 作者: 【大中小】浏览:10次

A. Little Pony and Crystal Mine time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output

Twilight Sparkle once got a crystal from the Crystal Mine. A crystal of size n (n is odd; n?>?1) is an n?×?n matrix with a diamond inscribed into it.

You are given an odd integer n. You need to draw a crystal of size n. The diamond cells of the matrix should be represented by character "D". All other cells of the matrix should be represented by character "*". Look at the examples to understand what you need to draw.

Input

The only line contains an integer n (3?≤?n?≤?101; n is odd).

Output

Output a crystal of size n.

Sample test(s) input

output

*D*
DDD
*D*

input

output

**D**
*DDD*
DDDDD
*DDD*
**D**

input

output

***D***
**DDD**
*DDDDD*
DDDDDDD
*DDDDD*
**DDD**
***D***

模拟题：

#include
  
   
#include
   
     #include
    
      #include
     
       #include
      
        #include
       
         char str[105][105]; using namespace std; int main() { int i,j,n,m; scanf("%d",&n); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { if(i<=n/2+1) { if(j<=n/2-i+1||j>n/2+i) printf("*"); else printf("D"); } else { if(j<=i-n/2-1||j>3*n/2+1-i) printf("*"); else printf("D"); } } printf("\n"); } return 0; }

B. Little Pony and Sort by Shift time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output

One day, Twilight Sparkle is interested in how to sort a sequence of integers a1,?a2,?...,?an in non-decreasing order. Being a young unicorn, the only operation she can perform is a unit shift. That is, she can move the last element of the sequence to its beginning:

a1,? a2,?...,? a n?→? a n,? a1,? a2,?...,? a n?-?1.

Help Twilight Sparkle to calculate: what is the minimum number of operations that she needs to sort the sequence?

Input

The first line contains an integer n (2?≤?n?≤?105). The second line contains n integer numbers a1,?a2,?...,?an (1?≤?ai?≤?105).

Output

If it's impossible to sort the sequence output -1. Otherwise output the minimum number of operations Twilight Sparkle needs to sort it.

Sample test(s) input

2
2 1

output

input

3
1 3 2

output

-1

input

2
1 2

output

#include
   
    
#include
    
      #include
     
       #include
      
        #include
       
         #include
        
          int a[100005]; using namespace std; int main() { int n,i,sum=0,flag=0; scanf("%d",&n); for(i=1;i<=n;i++){ scanf("%d",&a[i]); } for(i=1;i
         
          a[i+1])flag++; if(flag)sum++; if(flag>=2) break; } if(a[n]<=a[1]&&flag==1||flag==0) printf("%d\n",sum); else printf("-1\n"); return 0; }
         
        
       
      
     
    
   
C. Little Pony and Expected Maximumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interested in the dice that were used in the game.
The dice has m faces: the first face of the dice contains a dot, the second one contains two dots, and so on, the m-th face contains mdots. Twilight Sparkle is sure that when the dice is tossed, each face appears with probability . Also she knows that each toss is independent from others. Help her to calculate the expected maximum number of dots she could get after tossing the dice n times.<??http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vcD5JbnB1dDxwPkEgc2luZ2xlIGxpbmUgY29udGFpbnMgdHdvIGludGVnZXJzIDxlbT5tPC9lbT4gYW5kIDxlbT5uPC9lbT4gKDE/odw/PGVtPm08L2VtPiw/PGVtPm48L2VtPj+h3D8xMDUpLjwvcD5PdXRwdXQ8cD5PdXRwdXQgYSBzaW5nbGUgcmVhbCBudW1iZXIgY29ycmVzcG9uZGluZyB0byB0aGUgZXhwZWN0ZWQgbWF4aW11bS4gVGhlIGFuc3dlciB3aWxsIGJlIGNvbnNpZGVyZWQgY29ycmVjdCBpZiBpdHMgcmVsYXRpdmUgb3IgYWJzb2x1dGUgZXJyb3IgZG9lc24="t exceed 10??-?4.
Sample test(s)input6 1
output3.500000000000
input6 3
output4.958333333333
input2 2
output1.750000000000
NoteConsider the third test example. If you've made two tosses:
  
   You can get 1 in the first toss, and 2 in the second. Maximum equals to 2.
   You can get 1 in the first toss, and 1 in the second. Maximum equals to 1.
   You can get 2 in the first toss, and 1 in the second. Maximum equals to 2.
   You can get 2 in the first toss, and 2 in the second. Maximum equals to 2.The probability

首页上一页 1 2 下一页尾页 1/2/2
【大中小】【打印】【繁体】【投稿】【收藏】【推荐】【举报】【评论】【关闭】【返回顶部】
分享到:
上一篇：HDU 4902 Nice boat(线段树)	下一篇：poj3436 ACM Computer Factory， ..

帐　　号:

密码: (新用户注册)

验证码:

表　　情:

内　　容: