Coderforces练习---水题

http://codeforces.com/contest/454/problem/A

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
using namespace std;

bool cmp(int a,int b){
    return a>b;
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int n;
    char mp[105][105];
    while(cin>>n)
    {   //memset(mp,'*',sizeof(mp));
        int mid=(n+1)/2;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
             {
                mp[i][j]='*';
                 if(j==mid)mp[i][j]='D';
                  if(i<=mid)
                  {int p=mid-i+1;
                  for(int k=1;k<=2*i-1;k++)
                    {
                        mp[i][p++]='D';
                    }
                  }
                   else if(i>mid)
                   {    int p=i-mid+1;
                       for(int k=1;k<=2*n-2*i+1;k++)
                        mp[i][p++]='D';
                   }

             }
             for(int i=1;i<=n;i++)
            {for(int j=1;j<=n;j++)
                cout<<mp[i][j];
                cout<<endl;
            }
    }
    return 0;
}

  
  

   
   

  
  

水题一个！，输出钻石图形；

http://codeforces.com/contest/454/problem/B

#include<iostream>
using namespace std;
int a[100100];
int main()
{
	int n,i;
	while(cin>>n&&n)
	{
		for( i=0;i<n;i++)
			cin>>a[i];
		int sum=0,k;
		for( i=0;i<n-1;i++)
		{
			if(a[i+1]<a[i])
			{
				sum++;k=i;
			}
		}
		if(sum==0)cout<<0<<endl;
		else if(sum==1&&a[0]>=a[n-1])
			cout<<n-k-1<<endl;
		else cout<<-1<<endl;
	}
	return 0;
}

http://codeforces.com/contest/454/problem/C  这道题是求最大值的期望的，看了别人的博客才弄懂这道题的解法

    http://blog.csdn.net/u011639256/article/details/38346687

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>

#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657

const ull inf = 1LL << 61;
const double eps=1e-5;

using namespace std;

bool cmp(int a,int b){
    return a>b;
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int n,m;
    while(cin>>m>>n)
    {
        double ans=0.0,sum=0.0;
        if(m==0&&n==0)break;
        for(int i=1;i<=m;i++)
        {
            sum=pow((i-1.0)/m,n);
            ans+=(pow(i*1.0/m,n)-sum)*i;
        }
        cout<<fixed<<setprecision(12)<<ans<<endl;
    }
    return 0;
}