chapter 2 section 2.3 Controlling Companies
2009-10-28 23:06
295 查看
/*
ID: niepeng1
LANG: C++
TASK: concom
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <iostream>
using namespace std;
#define MAX2 102
int map[MAX2][MAX2],num,n;
int tem[MAX2];
bool cond;
FILE *in, *out;
void Process(int i)
{
int j,j1;
for(j=1;j<=num;j++)
tem[j]=0;
//if(i==21)
// cout<<" ";
for(j=1;j<=num;j++)
{
if(map[i][j] >= 50)
{
for(j1=1; j1<=num; j1++)
{
// if(j1 == 80)
// cout<<" ";
if( j1 != i)
tem[j1] += map[j][j1];
}
}
}
for(j=1; j<=num;j++)
if(tem[j] >= 50 && map[i][j] < 50)
{
map[i][j] =50;
cond=true;
}
}
int main(void)
{
int i,j,i1,j1;
in = fopen("concom.in", "r");
out = fopen("concom.out", "w");
cond=true;
for(i=0;i<MAX2;i++)
for(j=0;j<MAX2;j++)
{
map[i][j]=0;
if(i==j)
map[i][j]=50;
}
fscanf(in,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(in,"%d",&i1);
if(num < i1)
num=i1;
fscanf(in,"%d",&j1);
if(num<j1)
num=j1;
fscanf(in,"%d",&map[i1][j1]);
}
while(cond==true)
{
cond=false;
for(i=1;i<=num;i++)
Process(i);
}
for(i=1;i<=num;i++)
for(j=1;j<=num;j++)
{
if(i !=j && map[i][j] >=50)
fprintf(out,"%d %d/n",i,j);
//cout<<i<<" "<<j<<endl;
}
fclose(in);fclose(out);
return 0;
}
ID: niepeng1
LANG: C++
TASK: concom
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <iostream>
using namespace std;
#define MAX2 102
int map[MAX2][MAX2],num,n;
int tem[MAX2];
bool cond;
FILE *in, *out;
void Process(int i)
{
int j,j1;
for(j=1;j<=num;j++)
tem[j]=0;
//if(i==21)
// cout<<" ";
for(j=1;j<=num;j++)
{
if(map[i][j] >= 50)
{
for(j1=1; j1<=num; j1++)
{
// if(j1 == 80)
// cout<<" ";
if( j1 != i)
tem[j1] += map[j][j1];
}
}
}
for(j=1; j<=num;j++)
if(tem[j] >= 50 && map[i][j] < 50)
{
map[i][j] =50;
cond=true;
}
}
int main(void)
{
int i,j,i1,j1;
in = fopen("concom.in", "r");
out = fopen("concom.out", "w");
cond=true;
for(i=0;i<MAX2;i++)
for(j=0;j<MAX2;j++)
{
map[i][j]=0;
if(i==j)
map[i][j]=50;
}
fscanf(in,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(in,"%d",&i1);
if(num < i1)
num=i1;
fscanf(in,"%d",&j1);
if(num<j1)
num=j1;
fscanf(in,"%d",&map[i1][j1]);
}
while(cond==true)
{
cond=false;
for(i=1;i<=num;i++)
Process(i);
}
for(i=1;i<=num;i++)
for(j=1;j<=num;j++)
{
if(i !=j && map[i][j] >=50)
fprintf(out,"%d %d/n",i,j);
//cout<<i<<" "<<j<<endl;
}
fclose(in);fclose(out);
return 0;
}
相关文章推荐
- USACO - Chapter1 Section 1.2 - Transformations
- USACO - Chapter1 Section 1.3 - Ski Course Design
- USACO - Chapter1 Section 1.5 - Superprime Rib
- jar not loaded. See Servlet Spec 2.3, section 9.7.2. Offending class: javax/servlet/Servlet.class
- USACO-Section2.3 Controlling Companies
- Tomcat6 error : jar not loaded. See Servlet Spec 2.3, section 9.7.2. Offending class: javax/servlet/
- USCAO section 2.3 Zero Sum(dfs)
- USACO-Section2.3 Controlling Companies【深度优先搜索】
- HDU acm step:Chapter one section three(简单贪心)
- chapter 2 section 2.4 The Tamworth Two
- usaco Chapter 3 section 3.2 Feed Ratios
- SymmetricDS文档翻译--【Chapter 3. 详细配置(Configuration)[section C]】
- jar not loaded. See Servlet Spec 2.3, section 9.7.2. Offending class: javax/servlet/Servlet.class
- USACO - Chapter1 Section 1.2 - Palindromic Squares
- USACO - Chapter1 Section 1.3 - Wormhole
- servlet-api-2.4.jar) - jar not loaded. See Servlet Spec 2.3, section 9.7.2. Offending class: javax/s
- Section 2.3-nocows
- validateJarFile jar not loaded. See Servlet Spec 2.3, section 9.7.2. Offending class: javax/servlet
- USACO section 2.3 Longest Prefix(dp)
- USCAO section 2.3 Zero Sum(dfs)