哭哭哭哭哭哭哭

又降了4。。。。。。

这次吸取的教训是。。。本来就是个做题慢的傻逼。。。。一定要准时题目一开就开始做。。。。。不然就等着降名次吧,。。。。。

开始四十多分钟才开进去的。。。。。再给我四十分钟。。。。岂可修。。。。。

而且提交也要谨慎啊!!wa了两次就给扣了100分。。。。哭哭哭哭哭哭哭

上瘾了。。。。打排位好爽啊!!!一定会把名字升上去的

今天zyyyyy他们的icpc沈阳赛诶,刚刚看了一下榜。。。可怕。。。。比ccpc激烈好多

希望他们能反超!!

A. Jumping Ball
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In a new version of the famous Pinball game, one of the most important parts of the game field is a sequence of n bumpers. The bumpers are numbered with integers from 1 to n from left to right. There are two types of bumpers. They are denoted by the characters '<' and '>'. When the ball hits the bumper at position i it goes one position to the right (to the position i + 1) if the type of this bumper is '>', or one position to the left (to i - 1) if the type of the bumper at position i is '<'. If there is no such position, in other words if i - 1 < 1 or i + 1 > n, the ball falls from the game field.

Depending on the ball's starting position, the ball may eventually fall from the game field or it may stay there forever. You are given a string representing the bumpers' types. Calculate the number of positions such that the ball will eventually fall from the game field if it starts at that position.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the length of the sequence of bumpers. The second line contains the string, which consists of the characters '<' and '>'. The character at the i-th position of this string corresponds to the type of the i-th bumper.

Output

Print one integer — the number of positions in the sequence such that the ball will eventually fall from the game field if it starts at that position.

Examples
input
4
<<><

output
2

input
5
>>>>>

output
5

input
4
>><<

output
0

Note

In the first sample, the ball will fall from the field if starts at position 1 or position 2.

In the second sample, any starting position will result in the ball falling from the field.

水题啊,秒过有没有

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){string in;int n;scanf("%d",&n);cin>>in;int i;int ans=0;bool flag = true;if(in[0]!='<'){flag = false;}for(i=0;i<n;i++){if(in[i]=='>'){break;}if(flag){if(in[i]=='<'){ans++;}}else{break;}}flag = true;if(in[n-1]!='>'){flag = false;}for(i=n-1;i>=0;i--){if(in[i]=='<'){break;}if(flag){if(in[i]=='>'){ans++;}}else{break;}}printf("%d\n",ans);return 0;
}
B. Food on the Plane
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to the left of an aisle (if one looks in the direction of the cockpit), while seats 'd', 'e' and 'f' are located to the right. Seats 'a' and 'f' are located near the windows, while seats 'c' and 'd' are located near the aisle.

It's lunch time and two flight attendants have just started to serve food. They move from the first rows to the tail, always maintaining a distance of two rows from each other because of the food trolley. Thus, at the beginning the first attendant serves row 1 while the second attendant serves row 3. When both rows are done they move one row forward: the first attendant serves row 2 while the second attendant serves row 4. Then they move three rows forward and the first attendant serves row 5 while the second attendant serves row 7. Then they move one row forward again and so on.

Flight attendants work with the same speed: it takes exactly 1 second to serve one passenger and 1 second to move one row forward. Each attendant first serves the passengers on the seats to the right of the aisle and then serves passengers on the seats to the left of the aisle (if one looks in the direction of the cockpit). Moreover, they always serve passengers in order from the window to the aisle. Thus, the first passenger to receive food in each row is located in seat 'f', and the last one — in seat 'c'. Assume that all seats are occupied.

Vasya has seat s in row n and wants to know how many seconds will pass before he gets his lunch.

Input

The only line of input contains a description of Vasya's seat in the format ns, where n (1 ≤ n ≤ 1018) is the index of the row and s is the seat in this row, denoted as letter from 'a' to 'f'. The index of the row and the seat are not separated by a space.

Output

Print one integer — the number of seconds Vasya has to wait until he gets his lunch.

Examples
input
1f

output
1

input
2d

output
10

input
4a

output
11

input
5e

output
18

Note

In the first sample, the first flight attendant serves Vasya first, so Vasya gets his lunch after 1 second.

In the second sample, the flight attendants will spend 6 seconds to serve everyone in the rows 1 and 3, then they will move one row forward in 1 second. As they first serve seats located to the right of the aisle in order from window to aisle, Vasya has to wait 3 more seconds. The total is 6 + 1 + 3 = 10.

这题怎么说呢。。。其实静下心来推应该还是能很快解决的,我一定要相信自己前三题是没问题的啊

可能晚上在床上熄灯了没有纸和笔只能瞎jb推。。。。不对。。。。就是我的脑子不清楚。。。。

不行啊kyoma君。。。

这题就是说飞机上空姐给乘客发放食物,推车往前走一排需要1s,给一个乘客发放食物需要1s,每一排发放食物的顺序都是fedabc,发饭食物的策略是有两个小姐姐,先服务1、3排,往前推一排,再服务第2、4排,接着往前推3排,服务5、7排。。。。。以此类推

坐在某个位子上的乘客想知道他要等多久才能拿到食物

脑残wa了两回

哭哭哭哭哭哭哭

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <sstream>
using namespace std;
int main(){long long n;string in;cin>>in;char a = in[in.length()-1];string now = in.substr(0,in.length()-1);stringstream change;change << now;change >> n;//cout<<n<<endl;long long result = 0;if(a=='a'){result += 4;}else if(a=='b'){result += 5;}else if(a=='c'){result += 6;}else if(a=='d'){result += 3;}else if(a=='e'){result += 2;}else{result += 1;}long long mae4 = (n-1)/4;int dem = n%4;result += mae4*12;if(mae4>1){result += mae4 + 3*mae4;}else if(mae4==1){result += 4;}if(dem==2||dem==0){result +=(1+6);}printf("%I64d\n",result);return 0;
}

CodeForces Canada Cup 2016 A、B水题 _(:з」∠)_相关推荐

  1. 每日一题吧算是,见证自己的成长路程_(:з」∠)_

    目录 前言: 一.整理思路: 1.照明范围: 2.明亮空地的数组思想转化: 2.1: 2.2: 二.代码的实现和细节讲解: 1.变量的定义和含义: 2.火把照明的实现: 3.萤石照明的实现 : 4.对 ...

  2. Educational Codeforces Round 7 B. The Time 水题

    B. The Time 题目连接: http://www.codeforces.com/contest/622/problem/B Description You are given the curr ...

  3. 【CodeForces - 1A】Theatre Square(水题,几何)(CODEFORCES,梦的开始)

    题干: Theatre Square in the capital city of Berland has a rectangular shape with the size n × m meters ...

  4. NoiOpenjudge水题选刷之_搜索

    1789:算24 给出4个小于10个正整数,你可以使用加减乘除4种运算以及括号把这4个数连接起来得到一个表达式.现在的问题是,是否存在一种方式使得得到的表达式的结果等于24. 这里加减乘除以及括号的运 ...

  5. Codeforces Round #300 A. Cutting Banner 水题

    A. Cutting Banner Time Limit: 1 Sec  Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/538/pro ...

  6. CodeForces - 1263A Sweet Problem(思维,水题)

    题目链接:点击查看 题目大意:给出三种颜色的糖果,分别表示为r,g,b,现在Tanya每天可以吃两个不同颜色的糖果,问最多可以吃多少天 题目分析:大水题一个,但自己真的蠢,一开始思路混乱,写了一大堆乱 ...

  7. C - Internet Address CodeForces - 245B(有些思维的水题)

    Vasya is an active Internet user. One day he came across an Internet resource he liked, so he wrote ...

  8. Canada Cup 2016 C. Hidden Word 字符串构造

    传送门 文章目录 题意: 思路: 题意: 给你一个长度为272727的字符串sss,其中262626个字母每种都至少出现一次,让你构造一个2×132×132×13的矩阵,使得每个字母都出现一次,并且存 ...

  9. 【CodeForces - 1038A 】Equality (思维水题,预处理字符串)

    题干: You are given a string ss of length nn, which consists only of the first kk letters of the Latin ...

最新文章

  1. java super快速生成_为什么当我使用编辑器代码生成器时,eclipse会在构造函数中自动添加一个java super()方法?...
  2. [原译]理解并实现生成器模式
  3. Java 8新特性终极指南
  4. Log4j的自定义logger
  5. Leecode31. 下一个排列——Leecode大厂热题100道系列
  6. 计算机应用技术编译原理考试题,《编译原理》练习题库含答案(大学期末复习资料).doc...
  7. 织梦直接往数据库写入数据
  8. 《编译系统透视:图解编译原理》
  9. python 直方图的绘制方法全解_5种方法教你用Python玩转histogram直方图
  10. ESP8266+blinker测温湿度
  11. 苹果低头了,但不想丢掉它的皇冠
  12. python程序实现最大限度突破高德地图爬虫限制,包括.exe文件的编译,提供最大限度爬虫高德地图poi思路
  13. 【Python爬虫】-从入门到入门-个人技术经验汇总-【爬虫和数据】
  14. 推荐下阿里巴巴开源的数据库客户端工具Chat2DB
  15. OpenCV | 直线拟合fitline函数(Python)
  16. Kivy App开发之页面背景设置
  17. Java中获取内存地址
  18. 【LaTex】IEEE论文作者信息排版
  19. 梦想太远,现实太近 3
  20. 中基鸿业小故事投资理财大启示

热门文章

  1. 网络与信息安全-第三章-对称秘钥加密算法
  2. C# 将dataTable中的数据导出到excel表中
  3. 欧几里得变换(Euclidean transformation)详解
  4. 优达学诚--对安然事件数据集的分析
  5. Cannot resolve method ‘create‘ in ‘String‘
  6. 使用node的Hapi框架搭建后台(一)——搭建项目
  7. 如何把多个pdf文件合并成一个pdf
  8. c语言中复合语句不用花括号,【单选题】C语言中,可将一系列语句置于( )从而构成复合语句。 A. 一对尖括号\ \之间 B. 一对圆括号\( )\之间 C. 一对花括号 { } 之间 D....
  9. C# datagridview CheckBox勾选问题
  10. 尤雨溪:重头来过的 Vue3 带来了什么?