HDU1250 高精度斐波那契数列
来源:互联网 发布:腾讯mac软件 编辑:程序博客网 时间:2024/06/05 22:59
Machine Schedule
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7632 Accepted Submission(s): 3816
Problem Description
As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constraints that must be satisfied and the type of schedule desired. Here we consider a 2-machine scheduling problem.
There are two machines A and B. Machine A has n kinds of working modes, which is called mode_0, mode_1, …, mode_n-1, likewise machine B has m kinds of working modes, mode_0, mode_1, … , mode_m-1. At the beginning they are both work at mode_0.
For k jobs given, each of them can be processed in either one of the two machines in particular mode. For example, job 0 can either be processed in machine A at mode_3 or in machine B at mode_4, job 1 can either be processed in machine A at mode_2 or in machine B at mode_4, and so on. Thus, for job i, the constraint can be represent as a triple (i, x, y), which means it can be processed either in machine A at mode_x, or in machine B at mode_y.
Obviously, to accomplish all the jobs, we need to change the machine's working mode from time to time, but unfortunately, the machine's working mode can only be changed by restarting it manually. By changing the sequence of the jobs and assigning each job to a suitable machine, please write a program to minimize the times of restarting machines.
There are two machines A and B. Machine A has n kinds of working modes, which is called mode_0, mode_1, …, mode_n-1, likewise machine B has m kinds of working modes, mode_0, mode_1, … , mode_m-1. At the beginning they are both work at mode_0.
For k jobs given, each of them can be processed in either one of the two machines in particular mode. For example, job 0 can either be processed in machine A at mode_3 or in machine B at mode_4, job 1 can either be processed in machine A at mode_2 or in machine B at mode_4, and so on. Thus, for job i, the constraint can be represent as a triple (i, x, y), which means it can be processed either in machine A at mode_x, or in machine B at mode_y.
Obviously, to accomplish all the jobs, we need to change the machine's working mode from time to time, but unfortunately, the machine's working mode can only be changed by restarting it manually. By changing the sequence of the jobs and assigning each job to a suitable machine, please write a program to minimize the times of restarting machines.
Input
The input file for this program consists of several configurations. The first line of one configuration contains three positive integers: n, m (n, m < 100) and k (k < 1000). The following k lines give the constrains of the k jobs, each line is a triple: i, x, y.
The input will be terminated by a line containing a single zero.
The input will be terminated by a line containing a single zero.
Output
The output should be one integer per line, which means the minimal times of restarting machine.
Sample Input
5 5 100 1 11 1 22 1 33 1 44 2 15 2 26 2 37 2 48 3 39 4 30
Sample Output
3
Source
Asia 2002, Beijing (Mainland China)
Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1068 1151 1281 1507 1528
#include <iostream>#include <stdio.h>using namespace std;int a[10000][260]={0};int main(){ int i,j,n; a[1][0]=1; a[2][0]=1; a[3][0]=1; a[4][0]=1; for(i=5;i<10000;i++) { for(j=0;j<260;j++) { a[i][j]+=a[i-1][j]+a[i-2][j]+a[i-3][j]+a[i-4][j]; a[i][j+1]+=a[i][j]/100000000; a[i][j]=a[i][j]%100000000; } } while(cin>>n) { for(j=259;j>=0;j--) if(a[n][j]!=0) break; cout<<a[n][j]; for(j=j-1;j>=0;j--) printf("%08d",a[n][j]); //不能直接cout 数大的时候是错的 因为可能会输出七位 正常应该输出八位的 反正就是不对 cout<<endl; } return 0;}
0 0
- HDU1250 高精度斐波那契数列
- 斐波那契数列hdu1250
- hdu1316(斐波那契数列+高精度)
- hdu 1250 高精度+类似斐波那契数列
- HDU 5686 (斐波那契数列 高精度)
- hdu1250高精度
- 20141001 【 高精度?/数论--斐波那契数列 】 hdoj 1568 Fibonacci
- HDURevenge of Fibonacci --- 高精度 + 斐波那契数列 + 字典树
- 高精度求斐波那契数列中间个数
- 斐波那契数列数列计算
- 斐波那契数列
- 斐波那契数列
- 斐波那契数列
- 斐波那契数列
- 斐波那契数列
- 斐波那契数列
- 斐波那契数列
- 斐波那契数列
- HDU1005&&NEFU67 没有循环节
- HDU1009老鼠的旅行 (贪心算法)
- eclipse libs 和 buildpath区别
- HDU1130 卡特兰数
- 程序员编程的 7 + 1 条小贴士
- HDU1250 高精度斐波那契数列
- HDU1267 递推
- 第十二章 并发编程
- HDU1286新朋友欧拉函数版
- 特殊格式的String转Map
- linux IIC子系统分析(一)——AT24C02 芯片简介
- HDU1297女孩不能单独走 (DP)
- 关于Scroller的理解
- redis设置服务