codeforces 312

简介: A. Whose sentence is it?

A. Whose sentence is it?

代码:

//codeforces 312 A
//2013-05-01-19.12
#include <stdio.h>
#include <string.h>
char str[102];
int main()
{
    int n;
    scanf("%d", &n);
    getchar();
    while (n--)
    {
        int f = 0;
        int r = 0;
        gets(str);
        int l = strlen(str);
        if (str[0] == 'm' && str[1] == 'i' && str[2] == 'a' && str[3] == 'o' && str[4] == '.')
            r = 1;
        if (str[l-5] == 'l' && str[l-4] == 'a' && str[l-3] == 'l' && str[l-2] == 'a' && str[l-1] == '.')
            f = 1;
        if ((!f&&!r) || (f && r))
            puts("OMG>.< I don't know!");
        else if (f && !r)
            puts("Freda's");
        else
            puts("Rainbow's");
    }
    return 0;
}


B. Archer

//codeforces 312 B
//2013-05-01-19.51
#include <stdio.h>
const double inf = 0.00000000001;
int main()
{
    double a, b, c, d;
    double sw, zw, sl, zl; // snallr win zanoes win and lost
    while (scanf("%lf %lf %lf %lf", &a, &b, &c, &d) != EOF)
    {
        sw = a/b;
        sl = 1.0 - sw;
        zw = c/d;
        zl = 1.0 - zw;
        double ans = 0;
        double tmp = 1.0;
        while(1)
        {
            ans += tmp*sw;
            tmp = tmp*sl*zl;
            if (tmp < inf)
                break;
        }
        printf("%.12lf\n", ans);
    }
    return 0;
}
目录
相关文章
|
6月前
|
C++
codeforces 305 C. Ivan and Powers of Two
我的思路是这样的,由2^a+2^a = 2^(a+1)可知,如果有两个连续的数a,我们可以把他们合并为a+1放入集合中,使集合中没有重复的数,我可以用stl里的set。如果想要满足题目中的要求,集合中必须有最大那个数个元素,缺多少就可以计算出来了。
15 0
|
6月前
codeforces 327 A Ciel and Dancing
给你一串只有0和1的数字,然后对某一区间的数翻转1次(0变1 1变0),只翻转一次而且不能不翻转,然后让你计算最多可能出现多少个1。 这里要注意很多细节 比如全为1,要求必须翻转,这时候我们只要翻转一个1就可以了,对于其他情况,我们只要计算区间里面如果0多于1,将其翻转后计算1的总数,然后取最大值。
20 0
Codeforces 833E Caramel Clouds
E. Caramel Clouds time limit per test:3 seconds memory limit per test:256 megabytes input:standard input output:standard out...
1129 0
|
机器学习/深度学习 人工智能 网络架构
Codeforces 706B Interesting drink
B. Interesting drink time limit per test:2 seconds memory limit per test:256 megabytes input:standard input output:standard outp...
1137 0
|
人工智能
Codeforces 777C Alyona and Spreadsheet
C. Alyona and Spreadsheet time limit per test:1 second memory limit per test:256 megabytes input:standard input output:standard ...
1133 0
|
人工智能
Codeforces 719B Anatoly and Cockroaches
B. Anatoly and Cockroaches time limit per test:1 second memory limit per test:256 megabytes input:standard input output:stan...
862 0