Cod sursa(job #639595)
Utilizator | Data | 23 noiembrie 2011 17:01:41 | |
---|---|---|---|
Problema | Taramul Nicaieri | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("harta.in");
ofstream g("harta.out");
int a[105],b[105],i,n,j,s;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i]>>b[i];
for(i=1;i<=n;i++)
s+=a[i];
g<<s<<'\n';
for(i=1;i<=n;i++)
{
for(j=n;j>=1;j--)
if (i!=j&&a[i]>0&&b[j]>0)
{
b[j]--;
a[i]--;
g<<i<<" "<<j<<'\n';
s++;
}
}
f.close();
g.close();
return 0;
}