代码

#include<bits/stdc++.h>
using namespace std;
int v[65000], prime[65000], tot=0;
const int n=65000;
int main()
{
   tot=0;
   for (int i=2; i<=n; i++)
   {
      if (!v[i]) {v[i]=i; prime[++tot]=i;}
      for (int j=1; j<=tot; j++)
      {
         if (prime[j]>v[i] || prime[j]> n/i) break;
         v[i*prime[j]]=prime[j];
      }
   }
   int t;
   cin>>t;
   int a,b;
   while(t--)
   {
      cin>>a>>b;
      cout<<a+b<<endl;
   }
   return 0;
}

评测结果