(I3
I115
I7
(dp0
Vbricks.%l
p1
(Vbricks.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\r\n#include<cmath>\r\nlong long tuhli[2000],kutii,n,m,i,j,sbor=0,prazni=0,izpolzvaniT[2000],mb,oi[3000];\r\nbool pylnaLiEKutiqta;\r\nusing namespace std;\r\nint main(){\r\n    cin>>n;\r\n    for(i=0;i<n;i++){\r\n        cin>>tuhli[i];\r\n        oi[tuhli[i]]=i;\r\n    }\r\n    sort(tuhli+0,tuhli+n);\r\n    cin>>m;\r\n    for(mb=0;mb<m;mb++){\r\n        cin>>kutii;\r\n        pylnaLiEKutiqta=false;\r\n        for(i=0;i<n && !pylnaLiEKutiqta;i++){\r\n            //for(j=0;j<m;j++){\r\n                if(kutii%tuhli[i]==0 && !pylnaLiEKutiqta){\r\n                    sbor=sbor+pow(kutii/tuhli[i],3);\r\n                    izpolzvaniT[oi[tuhli[i]]]=izpolzvaniT[oi[tuhli[i]]]+pow(kutii/tuhli[i],3);\r\n                    pylnaLiEKutiqta=true;\r\n                }\r\n            //}\r\n        }\r\n        if(!pylnaLiEKutiqta){\r\n            prazni++;\r\n        }\r\n    }\r\n    cout<<sbor<<" "<<prazni<<endl;\r\n    for(i=0;i<n;i++){\r\n        cout<<izpolzvaniT[i]<<" ";\r\n    }\r\nreturn 0;\r\n}\r\n'
p3
tp4
stp5
.