Information Science Orsay (c + + Edition) website supplementary topic
http://ybt.ssoier.cn:8088
1414 "2017NOIP universal group" results
Sample passed, submitted AC 2017-12-31 21:45
#include <stdio.h>
int main () {
int a,b,c;
scanf ("%d%d%d", &a,&b,&c);
printf ("%d", a/10*2+b/10*3+c/10*5);
return 0;
}
1415 "2017NOIP Universal group" librarian
The test center, take more than
Sample passed, submitted AC 2017-12-31 21:59
#include <stdio.h>
int n,q,a[1100];
int My_pow (int k) {
int I,ans=1;
for (i=1;i<=k;i++) ans*=10;
return ans;
}
int main () {
int i,j,t,b,d,p;
scanf ("%d%d", &n,&q);
for (i=1;i<=n;i++) scanf ("%d", &a[i]);
for (i=1;i<=n;i++)//From childhood to large sort
for (j=i+1;j<=n;j++)
if (A[i]>a[j]) t=a[i],a[i]=a[j],a[j]=t;
while (q--) {
scanf ("%d%d", &b,&d);
P=my_pow (b);
for (i=1;i<=n;i++)
if (A[i]%p==d) {
printf ("%d\n", A[i]);
Break
}
if (i==n+1) printf (" -1\n");/not Found
}
}