ACM International Collegiate Programming Contest (2018)
文章目录
题目链接:http://codeforces.com/gym/101810/
B. Friends and Cookies
Problem: X块饼干n个朋友(编号1~n),蛇形给与顺序(1->…->n-1->n->n-1->…->1)
问每个朋友得到多少饼干
Solution: 找周期,每个周期饼干比例1:2:2:…:2:2:1,把最后一个周期拿出单独算
Code:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int t;
ll x,n,a[1005];
int main() {
scanf("%d",&t);
while(t--) {
scanf("%lld%lld",&x,&n);
memset(a,0,sizeof(a));
if(n==1){
printf("%lld\n",x);
continue;
}
a[1]=a[n]=x/(2*n-2);
for(int i=2; i<=n-1; i++) a[i]=2*(x/(2*n-2));
ll b=x%(2*n-2);
bool flag=true;
int cnt=1;
while(b) {
if(flag){
if(cnt!=n){
a[cnt]++;
cnt++;
}else{
a[cnt]++;
cnt--;
flag=false;
}
}else{
a[cnt]++;
cnt--;
}
b--;
}
for(int i=1;i<=n;i++) printf("%lld ",a[i]);
printf("\n");
}
return 0;
}
C. Flip the Bits
Problem: 求二进制下n 变为n-1,需要改变几位
Solution: n奇数时,改变最后一位
Code:
#include<bits/stdc++.h>
using namespace std;
int t,n,ans;
int main(){
scanf("%d",&t);
while(t--){
ans=1;
scanf("%d",&n);
while(n%2==0){
ans++;
n/=2;
}
printf("%d\n",ans);
}
return 0;
}
D. Magic Sticks
Problem: n*m,每个方格至少选取一边(任意两边不能相交),最少选多少边
Solution: 平行交错选取,然后找规律
Code:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t,n,m;
int main(){
scanf("%lld",&t);
while(t--){
scanf("%lld%lld",&n,&m);
if(n<m) swap(n,m);
printf("%lld\n",(n/2+1)*(m/2)+(n-n/2)*((m+1)/2));
}
return 0;
}
F. Minimum Sum of Array
Problem: n个数,当某数的因数是这n个数之一,则该数可以变为他的因数,求改变过后,n个数的和的最小值
Solution: 记录每个出现次数,从小到大,判断是否有它的倍数
Code:
#include<bits/stdc++.h>
using namespace std;
const int maxn=1000005;
typedef long long ll;
ll t,n,a[maxn],cnt[maxn],sum;
int main() {
scanf("%lld",&t);
while(t--) {
sum=0;
memset(cnt,0,sizeof(cnt));
scanf("%lld",&n);
for(ll i=1; i<=n; i++) {
scanf("%lld",&a[i]);
cnt[a[i]]++;
}
sort(a+1,a+n+1);
for(ll i=1;i<=n;i++){
if(cnt[a[i]]){
int s=a[i];
while(s<=a[n]){
if(cnt[s]){
sum+=cnt[s]*a[i];
cnt[s]=0;
// cout<<sum<<endl;
}
s+=a[i];
}
}
}
printf("%lld\n",sum);
}
return 0;
}
H. Making Friends
Problem: 2n个数,第i个和倒数第i个为一对,求所有对中和的最大值
Solution: 首位相加,排序
Code:
#include<bits/stdc++.h>
using namespace std;
int t,n,h[1005];
int main(){
scanf("%d",&t);
while(t--){
memset(h,0,sizeof(h));
scanf("%d",&n);
for(int i=1;i<=n;i++){
int x;
scanf("%d",&x);
h[i]+=x;
}
for(int i=n;i>=1;i--){
int x;
scanf("%d",&x);
h[i]+=x;
}
sort(h+1,h+n+1);
printf("%d\n",h[n]);
}
return 0;
}
I. Split the Number
Problem: 将数x分成n个数,使得最大数和最小数的差值最小,输出升序
Solution: n份x/n,再加余数
Code:
#include<bits/stdc++.h>
using namespace std;
int t,x,n;
int main() {
scanf("%d",&t);
while(t--) {
scanf("%d%d",&x,&n);
if(x<n) {
cout<<-1<<endl;
continue;
} else {
for(int i=1; i<=n-x%n; i++) printf("%d ",x/n);
for(int i=1; i<=x%n; i++) printf("%d ",x/n+1);
printf("\n");
}
}
return 0;
}