唔 神题一道 大家感受一下

1873. GOV Chronicles

Time limit: 0.5 second
Memory limit: 64 MB
A chilly autumn night. Well wrapped up in a coat, a man is rapidly walking
along a gray street. This is the Tradition Keeper of the ACM club in Ural
State University. Drizzle and dull sky have always turned him
nostalgic. And here we go again, the Tradition Keeper is bringing back the
memories of distant past when Ural Federal University wasn't yet existing,
and the story of Team.GOV was only starting. Indeed, this story deserves
to be preserved for descendants. However, the details are slipping from
the Keeper's mind and he seems to need an archive.
4 Turgeneva st. The sixth floor, home Department of Mathematics and
Mechanics where the Keeper himself has been studying a long time ago. Long
corridors, narrow light bars on the floor, dark corners and eventually an
office with ACM archive. The Keeper opened the door and found himself in a
cramp room with numerous racks. Dozens of boxes and piles of paper are
dumped near the walls. On one box three letters glittered with gold — GOV.
The Keeper stepped to the box, drew a heavy file and opened it. On the
first page in the right upper corner there was a photo of a smiling young
man with curly hair and a subscript: “Vadik Kantorov, the permanent
captain of Team.GOV”.
Right after Vadik had entered University he played a few tricks and got into
the half-ready team of Alex and Misha. Alex had been a bright
programmer even he was a schoolar and so troubled the ACM old-timers. Thus, Alex
was ready to name the team: “Alarm”.
So the Vadik's ACM-career began. The team existed during a year.
The first battle was the Ural SU Championship where Alarm
took only the fifth place and allayed the veterans' fear. Next
contest was the ACM ICPC subregional contest. The team played slightly better
and took the seventh place out of all teams from Ural region, and the
third out of teams from Ural SU. Alarm became the third freshmen
team in the Ural SU history to qualify for the regional contest in St. Petersburg.
Unfortunately, on the regional contest the team scored 86th and broke the
record of lowest position of Ural SU teams. It
was a hard hit for the team. The choice had to be made: practice a lot,
leave programming contests or keep performing poorly.
Putting back the decision, the team participated in the Ural Championship,
and scored 19th of all teams and 5th of Ural SU teams. That very moment it
became clear that the line-up had to change. However, before the Ural
Championship Alarm had applied to the Tatarstan Championship where the
team's final battle took place. The team could not even solve a half of the
offered problems and did not make in the best ten teams (11th place). On
the way back in a train it was decided that Misha had to quit the team.
In the new season the team needed a new name. Here the preamble is
completed and the story of Team.GOV commences. The team consisted of two
members having little experience and even less success. A new name was
defined — Team.GOV. After long considerations Vadik figured out that the
team missed a strong mathematician. Sasha who had been Vadik's high school
friend was picked to fill this role. With Sasha's appearance everyone felt
that everything was going to run smoothly.
The time of Ural SU Championship came, the autumn of 2008, second
university year. In unclear circumstances Sasha has not come to the
contest, but even in that case Team.GOV was second best of Ural SU teams.
One-year experience paid off! Sasha did come to the subregional contest
but the team reached only 14th place and did not qualify for the regional
contest.
Luckily, Ural SU as the host of the subregional contests has a right to
send one extra team to the regional contest. After long negotiations
Team.GOV could make it to the regional contest but with a sudden change
in the line-up — Ivan B. came instead of Sasha. The replacement turned
out to be fruitful — 76th place (+10 to Alarm's achievement).
After returning home Ivan B. found another team, thus Team.GOV had to fix
the line-up again. Nikita was invited as the third player for the Ural
Championship. On the qualification contest Vadik, Nikita and Alex played
very well: the team scored second of Ural SU teams.
Truly an astounding success!
Being very enthusiastic Vadik and Nikita came to the Ural Championship.
For some strange reason Alex did not come. The team performed very poorly
yet another time — 25th place of all teams and 5th of Ural SU teams.
Nikita was not satisfied with such attitude and Team.GOV became only two players
again — Alex and Vadik. What a curse! The team started to search for the
third player.
And the next season came — it's been two years since Vadik entered Ural
SU. The search for the third teammate was completed successfully. Senior
student Fedor was very experienced and had been practicing since 9th
grade of high school. Bright future was ahead of the team.
The curse was over and Team.GOV played three official contests
with the same line-up. The team scored 12th on the subregional contest,
safely advanced to the regional, and then took the third place on the Ural
SU Championship.
The regional contest in St. Petersburg yielded a diploma and the 61st
place, which was +15 to the previous year's position.
Having returned from St. Petersburg, Team.GOV participated in a unique
competition of ACM ICPC veterans and current teams — Battle of
Generations. Sadly, Alex couldn't come but team figured it out — Ivan K.
came to the rescue and replaced Alex.
Alex wasn't keeping fit: no practice, light attitude to contests — Vadik
began to look for a replacement. Nikita accepted the invitation cheerfully
once he heard of Alex quitting the team. The first contest after his
return to Team.GOV was qualification for the Ural Championship.
Suddenly Vadik had some urgent business in Europe, so Fedor and Nikita
participated without him. They performed quite well and solved as many problems
as the leaders did. As a result, the team got the third place and
qualified for the Ural Championship.
The Ural Championship brought a new grief: 25th place out of all teams,
and 4th out of Ural SU teams. Fedor and Nikita couldn't hold the nerves,
and Vadik had to look for new teammates all over again.
The fourth and the last year of university. Vadik wanted to put an end to
his ACM-career and he needed a new team. The veterans recommended to take
young and promising Den. Vadik conducted a little test, and Den was taken.
Only a few days were left before the Ural SU Championship, almost all
the teams were formed, while Vadik was still answering his eternal
question — where to get the third team member? Accidentally he found
that Egor was looking for a new team after his previous team broke
apart. A new line-up
of Team.GOV was born.
On the Ural SU Championship Team.GOV failed again and got only 5th place.
Subregional contest wasn't successful as well — 9th place out of all
teams and 4th out of Ural SU teams. Ural SU got an extended quota and
Team.GOV was going to St. Petersburg again.
Before St. Petersburg Team.GOV needed a serious practice session.
All-Siberian Olympiad was a perfect shot. Team.GOV went to Novosibirsk and
discovered again how weak they were: 39th place out of all teams and the
worst performance out of Ural SU teams. So the guys set out to St.
Petersburg with great leisure plans. Well, taking part counts no less than
victory!
On the regional contest, surprisingly for the coaches, Team.GOV scored
five problems in the first four hours and was quite high ranked. After the contest the coaches
discovered that the team scored not only the sixth problem but also a
seventh one. The result — 26th place (+35 to the last year's position)
and a second grade diploma. Team.GOV finally reached success and glory.
The road back home was ahead.
The spring, Team.GOV traditionally broke up. Vadik wanted to do something
fancy, it was his last contest after all. Vadik invites his Chinese girlfriend
Xiaohong. The
third invited teammate unfortunately didn't come, so on the last minute
Vadik took Vitaliy (medal winner of ACM ICPC World Finals) for the Game
Tournament before the Ural Championship. Unfortunately, Vitaliy could not participate in the main
contest, so Vadik took Sasha as an old friend. This was the last contest
of Team.GOV.
The Tradition Keeper scratched his head: in how many Alarm / Team.GOV
contests has every team member participated? Vadik had always told that
Misha is the member number zero, because he had played in Team.GOV before
the team got its name. Vadik is indeed player number one.
There's a tricky case with Vitaliy: of course he hasn't taken part in any
Team.GOV contest, Game Tournament shouldn't be counted. But he definitely
deserves to be included in the history of Team.GOV, because he is an award winner
of World Finals and a valuable player in general.
The Tradition Keeper meticulously listed all the members of Team.GOV.
(Misha — 0, Vadik — 1, Alex — 2, Sasha — 3, Ivan B. — 4,
Nikita — 5, Fedor — 6, Ivan K. — 7, Den — 8, Egor — 9,
Xiaohong — 10, Vitaliy — 11). He counted that a number zero has played
for 5 times (because exactly 5 contests were played by Alarm). And a number
one participated in 20 contests.

Input

The only line contains an integer from 0 to 11 — the number of Team.GOV player.

Output

Output the number of contests that a given member played in the legendary
team. All contests must be counted but the Game Tournament before the Ural
Championship.

Samples

input output
1
20
11
0

Problem Author: Mikhail Rubinchik
Problem Source: Ural Regional School Programming Contest 2011

 #include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int a[]={,,,,,,,,,,,};
printf("%d",a[n]);
}

URAL 1873. GOV Chronicles的更多相关文章

  1. URAL 1881 Long problem statement

    1881. Long problem statement Time limit: 0.5 secondMemory limit: 64 MB While Fedya was writing the s ...

  2. URAL 1728. Curse on Team.GOV(STL set)

    题目链接:space=1&num=1728" target="_blank">http://acm.timus.ru/problem.aspx?space= ...

  3. hdu 1873 看病要排队(优先级队列)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1873 题目大意: 三个医生看病,病人排队看病,病人有优先级,优先级高的提前看病,同样的优先级按先后.I ...

  4. 后缀数组 POJ 3974 Palindrome && URAL 1297 Palindrome

    题目链接 题意:求给定的字符串的最长回文子串 分析:做法是构造一个新的字符串是原字符串+反转后的原字符串(这样方便求两边回文的后缀的最长前缀),即newS = S + '$' + revS,枚举回文串 ...

  5. ural 2071. Juice Cocktails

    2071. Juice Cocktails Time limit: 1.0 secondMemory limit: 64 MB Once n Denchiks come to the bar and ...

  6. ural 2073. Log Files

    2073. Log Files Time limit: 1.0 secondMemory limit: 64 MB Nikolay has decided to become the best pro ...

  7. ural 2070. Interesting Numbers

    2070. Interesting Numbers Time limit: 2.0 secondMemory limit: 64 MB Nikolay and Asya investigate int ...

  8. ural 2069. Hard Rock

    2069. Hard Rock Time limit: 1.0 secondMemory limit: 64 MB Ilya is a frontman of the most famous rock ...

  9. ural 2068. Game of Nuts

    2068. Game of Nuts Time limit: 1.0 secondMemory limit: 64 MB The war for Westeros is still in proces ...

随机推荐

  1. OpenStack 监控解决方案

    正如你们看到的那样,到目前为止(OpenStack Kilo),OpenStack自己的监控组件Telemetry并不是完美, 获取的监控数据以及制作出来的图表有时候让人匪夷所思,因其重点并不是监控而 ...

  2. Java不为人知的小秘密

    Java中的main方法必须有一个外壳类,而且必须是静态的! Java中的所有函数都属于某个类的方法,所以main方法也不例外,必须放在一个类中才能编译运行. 例如: public class tex ...

  3. FTRL算法

    稀疏解的作用:内存和时间啊 实际的互联网广告应用需要的是快速地进行model的更新.为了保证快速的更新,训练样本是一条一条地过来的,每来一个样本,model的参数对这个样本进行一次迭代,从而保证了mo ...

  4. gbdt和xgboost api

    class xgboost.XGBRegressor(max_depth=3, learning_rate=0.1, n_estimators=100, silent=True, objective= ...

  5. MFC中CString.Format类详解

    在MFC程序中,使用CString来处理字符串是一个很不错的选择.CString既可以处理Unicode标准的字符串,也可以处理ANSI标准的字符串.CString的Format方法给我们进行字符串的 ...

  6. 泛型 for to/in 遍历 PK 效率;TEnumerator、TEnumerable

    再使用泛型的时候,经常需要用到遍历功能: 只要继承了 TEnumerator 或 TEnumerable 这两个抽象类的 都具有遍历功能. 当然没有继承这两个抽象类的 也具有使用 for in 来遍历 ...

  7. mysql慢sql报警系统

    前言:最近有同事反应有的接口响应时间时快时慢,经过排查有的数据层响应时间过长,为了加快定位定位慢sql的准确性,决定简单地搭建一个慢sql报警系统 具体流程如下架构图 第一步:记录日志 每个业务系统都 ...

  8. CentOS 6.5通过yum安装和配置MySQL

    0x00 说明 Linux安装MySQL一共有两种方式,一种是下载安装包离线安装,另一种就是通过yum在线安装,这里先介绍在线安装的方式,此方法简单方便,出错最少,但是无法控制安装的MySQL版本,如 ...

  9. hdu 1085 有num1个 1 ,num2个 2 ,num3个 5 (母函数)

    有num1个 1 ,num2个 2 ,num3个 5问它们不能组成的最小正整数是谁 样例的母函数 (1+X)(1+X2)(1+X5+X10+X15)展开后 X4的系数为0 Sample Input1 ...

  10. 1391: [Ceoi2008]order

    有N个工作,M种机器,每种机器你可以租或者买过来. 每个工作包括若干道工序,每道工序需要某种机器来完成,你可以通过购买或租用机器来完成. 现在给出这些参数,求最大利润 Input 第一行给出 N,M( ...