Codeforces #641 div2 A

Codeforces #641 div2 A

原题

• 链接在这

思路：思维题，分奇偶讨论即可

ACcodes：

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
long long inf = 0x3f3f3f3f3f3f3f3f;
int test = 1;
int n,k,a[N];
int main()
{
	scanf("%d",&test);
	while(test--)
	{
		cin >> n >> k;
		if(n%2==0)
			cout << n+2*k << endl;
		else
		{
			int ans;
			for(int i=2;i<=n;i++)
				if(n%i==0)
				{
					ans = i;
					break;
				}
			cout << n+ans+2*k-2 << endl;
		}

	}
	return 0;
}