hdoj4727The Number Off of FFF
2015-10-31 23:33
260 查看
L - The Number Off of FFF
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice HDU
4727
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<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
long long num[100010];
int main()
{
int n,t,k=1,i,j;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=0;i<n;++i){
scanf("%lld",&num[i]);
}
int pos=-1;
for(i=1;i<n;++i){
if(num[i]-num[i-1]!=1){
pos=i;
break;
}
}
if(pos==-1)pos=0;
printf("Case #%d: %d\n",k++,pos+1);
}
return 0;
}
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice HDU
4727
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<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
long long num[100010];
int main()
{
int n,t,k=1,i,j;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=0;i<n;++i){
scanf("%lld",&num[i]);
}
int pos=-1;
for(i=1;i<n;++i){
if(num[i]-num[i-1]!=1){
pos=i;
break;
}
}
if(pos==-1)pos=0;
printf("Case #%d: %d\n",k++,pos+1);
}
return 0;
}
相关文章推荐
- JavaScript原生对象之Number对象的属性和方法详解
- Prototype源码浅析 Number部分
- javascript 类方法定义还是有点区别
- JS中不为人知的五种声明Number的方式简要概述
- JavaScript中的object转换成number或string规则介绍
- Javascript基础教程之数据类型 (数值 Number)
- JavaScript中number转换成string介绍
- JavaScript设计模式之策略模式实例
- ERROR 1222 (21000): The used SELECT statements have a different number of columns
- javascript parseInt与Number函数的区别
- PHP number_format() 函数定义和用法
- js中将String转换为number以便比较
- JavaScript中string转换成number介绍
- javascript实现youku的视频代码自适应宽度
- 浅谈JavaScript Math和Number对象
- 自动无线***测试工具——Wi-fEye
- IOS开发之数据保存
- python练习题(二)
- linux HPC
- 数据库Oracle优势