ACdream 1196 KIDx's Pagination(模拟)

来源：互联网发布：java解析xml文件编辑：程序博客网时间：2024/05/17 22:03

题目链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=71823

#include<cstdio>#include<iostream>#include<sstream>#include<cstdlib>#include<cstring>#include<string>#include<climits>#include<cmath>#include<algorithm>#include<queue>#include<vector>#include<stack>#include<set>#include<map>using namespace std;int main(){    int n,cur,d;    int cas=1;    while(~scanf("%d%d%d",&n,&cur,&d))    {        printf("Case #%d: ",cas++);        if(cur==1)            printf("[<<]");        else            printf("(<<)");        if(cur-d>1)            printf("[...]");        for(int i=max(cur-d,1);i<cur;i++)            printf("(%d)",i);        printf("[%d]",cur);        for(int i=cur+1;i<=min(cur+d,n);i++)            printf("(%d)",i);        if(cur+d<n)            printf("[...]");        if(cur==n)            printf("[>>]");        else            printf("(>>)");        printf("\n");    }    return 0;}

0 0