首页 > 其他 > 详细

Codeforces Round #233 (Div. 2) A、Pages

时间:2014-03-14 18:22:27      阅读:429      评论:0      收藏:0      [点我收藏+]
bubuko.com,布布扣
#include <iostream>
using namespace std;

int main(){
    int n,p,k;
    cin >> n >> p >> k;
    bool hasLeft = true, hasRight = true;
    int first = p-k,last = p + k;
    if( p - k <= 1) first = 1,hasLeft = false;
    if( p + k >= n) last = n,hasRight = false;
    if(hasLeft) cout<<"<< ";
    for(int i = first; i<= last; ++ i){
        if(i == p) cout<<"("<<p<<") ";
        else cout<<i<<" ";
    }
    if(hasRight) cout<<" >>"<<endl;
}
bubuko.com,布布扣

Codeforces Round #233 (Div. 2) A、Pages,布布扣,bubuko.com

Codeforces Round #233 (Div. 2) A、Pages

原文:http://www.cnblogs.com/xiongqiangcs/p/3599310.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!