(I3
I93
I7
(dp0
Vbricks.%l
p1
(Vbricks.cpp
p2
S'#include <bits/stdc++.h>\r\nusing namespace std;\r\nint main()\r\n{\r\n    long long n,b[2000], k[4000], m;\r\n    cin>>n;\r\n    for(int i=1; i<=n; i++)\r\n    {\r\n        cin>>b[i];\r\n    }\r\n    cin>>m;\r\n    for(int i=1; i<=m; i++)\r\n    {\r\n        cin>>k[i];\r\n    }\r\n    long long d[2000];\r\n    for(int i=1;i<=n;i++)\r\n        d[i]=b[i];\r\n    int ok,swap;\r\n       do\r\n    {\r\n        ok=1;\r\n        for(int i=0;i<n;i++)\r\n        {\r\n            if(d[i]>d[i+1])\r\n            {\r\n                swap=d[i];\r\n                d[i]=d[i+1];\r\n                d[i+1]=swap;\r\n                ok=0;\r\n            }\r\n        }\r\n    }\r\n    while(!ok);\r\n    long long bri, tuh[4000], kut [4000], max[4000];\r\n    for(int i=1;i<=m;i++)max[i]=0;\r\n    for(int i=1;i<=n;i++)//b\r\n        for(int j=1;j<=m;j++)//k\r\n    {\r\n        if(k[j]>=b[i]  && k[j]%b[i]==0)\r\n        {\r\n            bri=k[j]/b[i]*k[j]/b[i]*k[j]/b[i];\r\n            if(bri>max[j])\r\n            {\r\n                max[j]=bri;\r\n                tuh[j]=b[i];\r\n                kut[j]=1;\r\n            }\r\n        }\r\n    }\r\n    long long new1=0;\r\n    long long sum[2000];\r\n    for(int i=1;i<=n;i++)//b\r\n    for(int j=1;j<=m;j++)//tuh\r\n    {\r\n        if(b[i]==tuh[j])sum[i]+=max[j];\r\n    }\r\n    int new2=0;\r\n    for(int i=1;i<=n;i++)\r\n    {\r\n        new2+=sum[i];\r\n    }\r\n    cout<<new2<<" ";\r\n    for(int i=1;i<=n;i++)new1+=kut[i];\r\n    cout<<m-new1<<endl;\r\n    for(int i=1;i<=n;i++)\r\n        cout<<sum[i]<<" ";\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.