A1049 最大公约数与最小公倍数B1008

A1049不会做

#include <iostream>
using namespace std;
int main() {
    int n, left = 0, right = 0, a = 1, now = 1, ans = 0;
    scanf("%d", &n);
    while(n / a) {
        left = n / (a * 10), now = n / a % 10, right = n % a;
        if(now == 0) ans += left * a;
        else if(now == 1) ans += left * a + right + 1;
        else ans += (left + 1) * a;
        a = a * 10;
    }
    printf("%d", ans);
    return 0;
}

B1008
我以后一定要去上海看见柳神

#include<iostream>
#include<vector>
#include<algorithm>//reverse函数 
using namespace std;

int main()
{
	int n,m;
	scanf("%d %d",&n,&m);
	vector<int> a(n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	m=m%n;//m若是大于n的话，那么前n项右移没有意义
	reverse(a.begin(),a.end());
	reverse(a.begin(),a.begin()+m);
	reverse(a.begin()+m,a.end());
	for(int i=0;i<n;i++)
	{
		if(i==0) 
		printf("%d",a[i]);
		else printf(" %d",a[i]);
	}
	return 0;
 }