2015
09-17

# HDU 4727-The Number Off of FFF-线性结构-[解题报告]HOJ

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

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

int num[100005];

int main()
{
int T,cas = 1,n,i,x,flag;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
x = -1;
flag = -1;
for(i = 0; i<n; i++)
scanf("%d",&num[i]);
for(i = 1;i<n;i++)
{
if(num[i]-num[i-1]!=1)
flag = i+1;
}
if(flag==-1)
flag = 1;
printf("Case #%d: ",cas++);
printf("%d\n",flag);
}

return 0;
}


1. 美眉图ܿ日美少女拍摄写真美胸真的有效吗青岛写真性感小美女杨幂比基尼国际比基尼小姐大赛hTTp://T.cN/R6buDE0

2. #!/usr/bin/env python3# -*- coding: utf-8 -*-def test(): num_1 = int(input(‘测试组数：’)) for n1 in range(num_1): num_2 = int(input(‘测试数目：’)) L = [] for n2 in range(num_2): num_3 = int(input()) L.append(num_3) for i in range(1, num_2): if L – L[i-1] != 1: print(‘Case #{}: {}’.format(n1 + 1, i + 1))if __name__ == ‘__main__’: test()