#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("bin.txt");
int main()
{
int sum,pack;
int min = 0;
int bin[10];
while(fin >> bin[1] >> bin[2] >> bin[3] >> bin[4] >> bin[5] >> bin[6] >> bin[7] >> bin[8] >> bin[9])
{
min = bin[2]+bin[3]+bin[4]+bin[5]+bin[7]+bin[9 ...
Search found 2 matches
- Fri Sep 01, 2006 7:59 am
- Forum: Volume 1 (100-199)
- Topic: 102 - Ecological Bin Packing
- Replies: 485
- Views: 117355
- Fri Sep 01, 2006 7:57 am
- Forum: Volume 1 (100-199)
- Topic: 101 - The Blocks Problem
- Replies: 635
- Views: 110252
101 wa ?
#include<iostream>
#include<cstring>
//#include<fstream>
using namespace std;
//ifstream fin("block.txt");
int block[25][25];
void FindDimen(int k,int *Find_i,int *Find_j)
{
for(int i=0;i<25;i++)
for(int j=0;j<25;j++)
if(block [j] == k)
{
*Find_i = i;
*Find_j = j;
}
}
int main()
{
int ...
#include<cstring>
//#include<fstream>
using namespace std;
//ifstream fin("block.txt");
int block[25][25];
void FindDimen(int k,int *Find_i,int *Find_j)
{
for(int i=0;i<25;i++)
for(int j=0;j<25;j++)
if(block [j] == k)
{
*Find_i = i;
*Find_j = j;
}
}
int main()
{
int ...