Cod sursa(job #586219)
| Utilizator | Data | 30 aprilie 2011 14:08:02 | |
|---|---|---|---|
| Problema | Fabrica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Algoritmiada 2011, Runda Finală, Clasele 5-9 | Marime | 0.4 kb |
#include<stdio.h>
int nra[10000],nrb[10000],i,t1,tt,k,n,m1,m2;
int main()
{
freopen("fabrica.in","r",stdin);
freopen("fabrica.out","w",stdout);
scanf("%d %d %d\n",&n,&m1,&m2);
for(i=1;i<=m1;i++)
scanf("%d\n",&nra[i]);
for(i=1;i<=m2;i++)
scanf("%d\n",&nrb[i]);
t1=0;tt=0;k=0;
for(i=1;i<=n;i++)
if(i-k*m1>=nra[m1]){t1++;k++;}
tt=t1+nrb[m2];
printf("%d %d\n",t1,tt);
return 0;
}