文件名称:poj3910
-
所属分类:
- 标签属性:
- 上传时间:2013-07-17
-
文件大小:1.14kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
poj 3910
nput
The input file contains several test cases. Each test case starts with an integer n (0 < n < 1000), that stands for the cardinality of S. The next line contains the numbers of S: x1, x2, ..., xn. It is known that each xi is an integer, 0 < xi < 2*109. The input data set is correct and ends with an end of file.
Output
For each test case find and print the value Dn mod 1000000007.
Sample Input
2
1 2
3
1 3 9
4
1 2 3 6-poj 3910 nput The input file contains several test cases. Each test case starts with an integer n (0 < n < 1000), that stands for the cardinality of S. The next line contains the numbers of S: x1, x2, .. ., xn. It is known that each xi is an integer, 0 < xi < 2* 109. The input data set is correct and ends with an end of file. Output For each test case find and print the value Dn mod 1000000007. Sample Input 2 1 2 3 1 3 9 4 1 2 3 6
nput
The input file contains several test cases. Each test case starts with an integer n (0 < n < 1000), that stands for the cardinality of S. The next line contains the numbers of S: x1, x2, ..., xn. It is known that each xi is an integer, 0 < xi < 2*109. The input data set is correct and ends with an end of file.
Output
For each test case find and print the value Dn mod 1000000007.
Sample Input
2
1 2
3
1 3 9
4
1 2 3 6-poj 3910 nput The input file contains several test cases. Each test case starts with an integer n (0 < n < 1000), that stands for the cardinality of S. The next line contains the numbers of S: x1, x2, .. ., xn. It is known that each xi is an integer, 0 < xi < 2* 109. The input data set is correct and ends with an end of file. Output For each test case find and print the value Dn mod 1000000007. Sample Input 2 1 2 3 1 3 9 4 1 2 3 6
(系统自动生成,下载前可以参看下载内容)
下载文件列表
poj3910.c
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.