Codeforces Round #185 (Div. 1) && (Div. 2)

Div 2

A  模拟。模拟。模拟。我看错了一句话，最近总是犯这种毛病。。。According to his experience, he thought that Freda always said "lala."at the end of her sentences, while Rainbow always said "miao." at thebeginning of his sentences.

导致WAWAWA----find problem --- solve ----- AC

#include<functional>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<sstream>
#include<iomanip>
#include<numeric>
#include<cstring>
#include<cassert>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<list>
#include<set>
#include<map>

using namespace std;

int ans[12];
int T;
string s;
int main()
{
    cin>>T;
    cin.get();
    for(int i=1;i<=T;i++)
    {
        getline(cin,s);
        if (s.size()<5||s.substr(0,5)=="miao."&&s.substr(s.size()-5,5)=="lala.") ans[i]=0;
        else
        {
            if(s.substr(0,5)=="miao.") ans[i]=2;
            if(s.substr(s.size()-5,5)=="lala.") ans[i]=1;
        }
    }
    for(int i=1;i<=T;i++)
    {
        if(ans[i]==0) cout<<"OMG>.< I don't know!"<<endl;
        if(ans[i]==1) cout<<"Freda's"<<endl;
        if(ans[i]==2) cout<<"Rainbow's"<<endl;
    }
    return 0;
}

 B  等比数列无限求和公式 a+ap+ap^2+... 0<p<1 --> S=a/(1-p)。。。。。。尼玛、、、

 

#include<functional>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<sstream>
#include<iomanip>
#include<numeric>
#include<cstring>
#include<cassert>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<list>
#include<set>
#include<map>
//等比数列无限求和公式 a+ap+ap^2+...    0<p<1   -->     S=a/(1-p)
using namespace std;

int main()
{
    double a,b,c,d;  
    cin>>a>>b>>c>>d;  
    printf("%.12lf\n",a/b/(1-(1-a/b)*(1-c/d)));
    return 0;
}

 

C 题（Div 1  A题）

这是尼玛的2 13题。。。。一个 I  f   搞定啊。。。。ym

 

#include<functional>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<sstream>
#include<iomanip>
#include<numeric>
#include<cstring>
#include<cassert>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<list>
#include<set>
#include<map>

using namespace std;

int main()
{
	int n,k;
	while(cin>>n>>k)
	{
		if(n*(n-1)/2<=k)
		cout<<"no solution\n";
		else
		{
			for(int i=1;i<=n;i++)
			printf("0 %d\n",i);
		}
	}
	return 0;
}