409(A,C,D)

202 篇文章 0 订阅
42 篇文章 0 订阅

A. The Great Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' actions in the final battle. Figure out who became the champion.

Input

The input contains two strings of equal length (between 2 and 20 characters, inclusive). Each line describes the actions of one team.

Output

Output "TEAM 1 WINS" if the first team won, "TEAM 2 WINS" if the second team won, and "TIE" if there was a tie.

Sample test(s)
input
[]()[]8<
8<[]()8<
output
TEAM 2 WINS
input
8<8<()
[]8<[]
output
TIE
orz!!!!!能想象出来这是剪刀石头布吗。。。。。。。。

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
typedef long long ll;


int main()
{
    char a[30],b[30];
    cin>>a>>b;
    int aa=0,bb=0;
    int l=strlen(a);
    for(int i=0;i<l;i+=2)
        if(a[i]=='8')
        {
            if(b[i]=='[')
                aa++;
            else if(b[i]=='(')
                bb++;
        }
        else if(a[i]=='[')
        {
            if(b[i]=='8')
                bb++;
            else if(b[i]=='(')
                aa++;
        }
        else if(a[i]='(')
        {
            if(b[i]=='[')
                bb++;
            else if(b[i]=='8')
                aa++;
        }
    if(aa==bb)cout<<"TIE"<<endl;
    else if(aa>bb)cout<<"TEAM 1 WINS"<<endl;
    else cout<<"TEAM 2 WINS"<<endl;

    return 0;
}


C. Magnum Opus
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Salve, mi amice.

Et tu quidem de lapis philosophorum. Barba non facit philosophum. Labor omnia vincit. Non potest creatio ex nihilo. Necesse est partibus.

Rp:

    I Aqua Fortis

    I Aqua Regia

    II Amalgama

    VII Minium

    IV Vitriol

Misce in vitro et æstus, et nil admirari. Festina lente, et nulla tenaci invia est via.

Fac et spera,

Vale,

Nicolas Flamel

Input

The first line of input contains several space-separated integers ai (0 ≤ ai ≤ 100).

Output

Print a single integer.

Sample test(s)
input
2 4 6 8 10
output
1


不知道什么语言出的题目!!!想把人整死。。。。。。百度了一下什么鬼炼金术师。。。。。输入5个药剂的数量,然后按照一定的配比配药,最后看最多能配出来多少药。不过这语言真的是无语了。。。。德语法语拉丁语丹麦语都试过了。。。没一个看得懂的orz!!


#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
typedef long long ll;


int main()
{
    int a[5];
    for(int i=0;i<5;i++)
        cin>>a[i];
    a[2]/=2,a[3]/=7,a[4]/=4;int min0;
    for(int i=0;i<5;i++)
        min0=i==0?a[i]:min(min0,a[i]);
    cout<<min0<<endl;

    return 0;
}

D. Big Data
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Little Petya wanted to give an April Fools Day present to some scientists. After some hesitation he decided to give them the array that he got as a present in Codeforces Round #153 (Div.2). The scientists rejoiced at the gift and decided to put some important facts to this array. Here are the first few of the facts:

  • The highest mountain above sea level in the world is Mount Everest. Its peak rises to 8848 m.
  • The largest board game tournament consisted of 958 participants playing chapaev.
  • The largest online maths competition consisted of 12766 participants.
  • The Nile is credited as the longest river in the world. From its farthest stream in Burundi, it extends 6695 km in length.
  • While not in flood, the main stretches of the Amazon river in South America can reach widths of up to 1100 km at its widest points.
  • Angel Falls is the highest waterfall. Its greatest single drop measures 807 m.
  • The Hotel Everest View above Namche, Nepal — the village closest to Everest base camp – is at a record height of 31962 m
  • Uranium is the heaviest of all the naturally occurring elements. Its most common isotope has a nucleus containing 146 neutrons.
  • The coldest permanently inhabited place is the Siberian village of Oymyakon, where the temperature of -68°C was registered in thetwentieth century.
  • The longest snake held in captivity is over 25 feet long. Its name is Medusa.
  • Colonel Meow holds the world record for longest fur on a cat — almost 134 centimeters.
  • Sea otters can have up to 10000 hairs per square inch. This is the most dense fur in the animal kingdom.
  • The largest state of USA is Alaska; its area is 663268 square miles
  • Alaska has a longer coastline than all of the other 49 U.S. States put together: it is 154103 miles long.
  • Lake Baikal is the largest freshwater lake in the world. It reaches 1642 meters in depth and contains around one-fifth of the world’s unfrozen fresh water.
  • The most colorful national flag is the one of Turkmenistan, with 106 colors.
Input

The input will contain a single integer between 1 and 16.

Output

Output a single integer.

Sample test(s)
input
1
output
1
input
7
output
0

这一套题就是坑人来的orzzzzzzzzzzzzzzzz!!!!!!!!!!!!!判断这16句话说的对不对,对就是1错就是0           T_T。。


#include <cstdio>

char s[] = "1001010111001010";
int main() {
    int n;
    scanf("%d", &n);
    printf("%c\n", s[n-1]);
    return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值