Pagini recente » Cod sursa (job #1023028) | Cod sursa (job #1356197) | Cod sursa (job #1525616) | Cod sursa (job #2820347) | Cod sursa (job #478411)
Cod sursa(job #478411)
#include<fstream>
using namespace std;
int a[101][3];
int baut[101][3];
short ok[101];
int main(){
int n,l;
ifstream f("lapte.in");
ofstream g("lapte.out");
f>>n>>l;
int i;
int na=0,nb=0;
for(i=1;i<=n;i++){
f>>a[i][0]>>a[i][1];
if(a[i][0]<a[i][1]){
na++;
ok[i]=1;
}
else{
if(a[i][0]>a[i][1]){
nb++;
ok[i]=2;
}
}
}
for(i=1;i<=n;i++){
if(ok[i]==0){
if(na>nb){
nb++;
ok[i]=2;
}
else{
na++;
ok[i]=1;
}
}
}
int ca=0,cb=0,j,t=0;
while(ca<l || cb<l){
t++;
for(i=1;i<=n ;i++){
a[i][2]++;
if(ok[i]==1){
if(ca>=l){
ok[i]=2;
}
}
if(ok[i]==2){
if(cb>=l){
ok[i]=1;
}
}
if(ok[i]==1 && a[i][2]>=a[i][0]){
ca++;
a[i][2]=0;
baut[i][0]++;
}
else{
if(ok[i]==2 && a[i][2]>=a[i][1]){
cb++;
a[i][2]=0;
baut[i][1]++;
}
}
}
}
g<<t<<"\n";
for(i=1;i<=n;i++){
g<<baut[i][0]<<" "<<baut[i][1]<<"\n";
}
return 0;
}