
基础知识
zt_1995
这个作者很懒,什么都没留下…
展开
-
foj1605 Enjoy celebration
Problem Description> Fuzhou University is the national 211 Project focused on building> universities, founded in 1958, has become one one of the Fujian> Provincial key university which is mainly Poly原创 2015-04-30 21:37:45 · 416 阅读 · 0 评论 -
foj 1303
Problem Description A calendar is a system for measuring time, from hours and minutes, to months and days, and finally to years and centuries. The terms of hour, day, month, year and century ar原创 2015-04-30 19:15:33 · 337 阅读 · 0 评论 -
*foj 1453 Bignum Arithmetic
Problem Description In this problem, you will be concerned with integers with very large numbers of digits. You must write code which will repeatedly accept (until end of file) two lines each containi原创 2015-05-01 19:29:12 · 422 阅读 · 0 评论 -
foj1060 Fibonacci数列
Problem Description 1202年,意大利数学家斐波那契出版了他的《算盘全书》,在书中第一次提到了著名的Fibonacci数列,定义如下: 现在你的任务是求出Fibonacci数列的第n项。 Input 输入数据由多组数据组成。每组数据一行,仅一个整数,表示n的值。Output 对于每组数据,输出仅一行,即Fibonacci数列的第n项。我们保证输出的结果不会超过1000原创 2015-05-01 15:57:51 · 476 阅读 · 0 评论 -
插队2
插队2 ★实验任务 春节到了,大家急着排队买车票,但是有些人却喜欢插队,如果有人插队, 排在其后面的人就会愤怒而获得一个愤怒值,当队列中所有人的愤怒值之和超过 一定的限值,队列中的人就会将所有插队的人踢出队列,之和所有人的愤怒值清 0。每个人的初始愤怒值为0,插队的人被插队后也会增加愤怒值。 ★数据输入 第一行有两个整数N 和M,代表有N 个操作和队列的愤怒限值。(1<=N <= 1原创 2015-05-15 23:58:39 · 445 阅读 · 0 评论 -
foj 1371 Election
题目描述:http://acm.fzu.edu.cn/problem.php?pid=1371 题意:给n个政党,和政党的党首,再给出投票结果,问哪个政党获得票数多。原创 2015-05-02 17:40:24 · 389 阅读 · 0 评论 -
foj 1350 Very Simple Problem
题目描述: http://acm.fzu.edu.cn/problem.php?pid=1350 题意:每个评委对一组题目打下难易系数,用0-1000整数表示,找出被定义为最简单的题目。 最简单题目定义: if it was called as “simplest” by more than a half of the jury, and was called as “hardest” by原创 2015-05-02 15:34:51 · 295 阅读 · 0 评论