(I3
I113
I7
(dp0
Vbricks.%l
p1
(Vbricks.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint main(){\r\nlong long n,tuhli[2001],m,i,f,maxtuh=0;\r\nlong long kut[4000],g[2001];\r\ncin>>n;\r\nfor(i=0;i<n;i=i+1){\r\ncin>>tuhli[i];\r\ng[i]=0;\r\n}\r\ncin>>m;\r\nfor(i=0;i<m;i=i+1){\r\ncin>>kut[i];\r\n}\r\nsort(tuhli,tuhli+n);\r\nfor(i=0;i<m;i=i+1){\r\n    for(f=0;f<n;f=f+1){\r\n        if(kut[i]%tuhli[f]==0 and kut[i]!=0){}\r\n        maxtuh=maxtuh+kut[i]*(kut[i]/tuhli[f]);\r\n        g[f]=kut[i]*(kut[i]/tuhli[f]);\r\n        kut[i]=0;\r\n    }\r\n}\r\ncout<<maxtuh<<"\\n";\r\nfor(i=0;i<n;i=i+1){\r\n    cout<<g[i]<<" ";\r\n}\r\nreturn 0;\r\n}\r\n'
p3
tp4
stp5
.