Pagini recente » Cod sursa (job #1016726) | Cod sursa (job #1069816) | Cod sursa (job #2174358) | Cod sursa (job #2178162) | Cod sursa (job #2022500)
#include <fstream>
using namespace std;
ifstream fi("harta.in");
ofstream fo("harta.out");
int n,b[101],s,a[101],t,c[101],d[101],i,j,o[101][101];
int main()
{
fi>>n;
for(i=1;i<=n;i++)
{fi>>a[i]>>b[i];s+=a[i]+b[i];}fo<<s/2<<endl;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(o[i][j]==0)
if(i!=j)
while(a[i]!=0)
if(b[j]!=0 and i!=j)
{a[i]--;b[j]--;c[++t]=i;d[t]=j;o[j][i]=1;j++;}
else j++;
for(i=1;i<=t;i++)
fo<<c[i]<<" "<<d[i]<<endl;
return 0;
}