(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[400000],n,m,i,j,sbor=0,prazni=0,izpolzvaniT[2000];\r\nbool pylnaLiEKutiqNo[400000];\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    }\r\n    sort(tuhli+0,tuhli+n);\r\n    cin>>m;\r\n    for(i=0;i<m;i++){\r\n        cin>>kutii[i];\r\n        pylnaLiEKutiqNo[i]=false;\r\n    }\r\n    for(i=0;i<n;i++){\r\n        for(j=0;j<m;j++){\r\n            if(kutii[j]%tuhli[i]==0 && !pylnaLiEKutiqNo[j]){\r\n                sbor=sbor+pow(kutii[j]/tuhli[i],3);\r\n                izpolzvaniT[i]=izpolzvaniT[i]+pow(kutii[j]/tuhli[i],3);\r\n                pylnaLiEKutiqNo[j]=true;\r\n            }\r\n        }\r\n    }\r\n    for(i=0;i<m;i++){\r\n        if(!pylnaLiEKutiqNo[i]){\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
.