zoukankan      html  css  js  c++  java
  • HDU 4727 The Number Off of FFF

    The Number Off of FFF

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 87    Accepted Submission(s): 40


    Problem Description
    X soldiers from the famous "*FFF* army" is standing in a line, from left to right.
    You, as the captain of *FFF*, decides to have a "number off", that is, each soldier, from left to right, calls out a number. The first soldier should call "One", each other soldier should call the number next to the number called out by the soldier on his left side. If every soldier has done it right, they will call out the numbers from 1 to X, one by one, from left to right.
    Now we have a continuous part from the original line. There are N soldiers in the part. So in another word, we have the soldiers whose id are between A and A+N-1 (1 <= A <= A+N-1 <= X). However, we don't know the exactly value of A, but we are sure the soldiers stands continuously in the original line, from left to right.
    We are sure among those N soldiers, exactly one soldier has made a mistake. Your task is to find that soldier.
     

    Input
    The rst line has a number T (T <= 10) , indicating the number of test cases.
    For each test case there are two lines. First line has the number N, and the second line has N numbers, as described above. (3 <= N <= 105)
    It guaranteed that there is exactly one soldier who has made the mistake.
     

    Output
    For test case X, output in the form of "Case #X: L", L here means the position of soldier among the N soldiers counted from left to right based on 1.
     

    Sample Input
    2 3 1 2 4 3 1001 1002 1004
     

    Sample Output
    Case #1: 3 Case #2: 3
     

    Source
     

    Recommend
    zhuyuanchen520
     
    思路:好水
     
    代码:
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cstdlib>
    using namespace std;
    int t;
    int n;
    int map[100100];
    int main()
    {
        scanf("%d",&t);
        for(int i = 1;i <= t;i ++)
        {
            scanf("%d",&n);
            for(int k = 1;k <= n;k ++)
               scanf("%d",&map[k]);
            int flag = 1;
            for(int l = 2;l <= n;l ++)
               if(map[l] - map[l - 1] != 1){
                    flag = l;
                    break;}
         printf("Case #%d: %d
    ",i,flag);
        }
        return 0;
    }
  • 相关阅读:
    移植BOA
    [转]Ubuntu(Linux)使用Eclipse搭建C/C++编译环境
    服务器软件设计的算法和问题
    [solve]Bind: Address Already in Use
    Simple guide for Automake/Autoconf by Nick
    Ubuntu(Linux)中设置samba
    VMware不能上网,解决办法
    数组的顺序存储和实现
    根文件系统的构成
    Linux网络编程IP转换函数inet_addr和inet_ntoa
  • 原文地址:https://www.cnblogs.com/GODLIKEING/p/3315093.html
Copyright © 2011-2022 走看看