Pagini recente » Cod sursa (job #2077609) | Cod sursa (job #2328680) | Cod sursa (job #1506250) | Cod sursa (job #2449067) | Cod sursa (job #1929428)
#include <cstdio>
#define PHI 1000005
using namespace std;
int phi[PHI];
inline long long Phi(int n){
long long S=1;
for(int i=2;i<=n;++i)
phi[i]=i-1;
for(int i=2;i<=n;++i){
S+=2*phi[i];
for(int j=2*i;j<=n;j+=i)
phi[j]-=phi[i];
}
return S;
}
int main(){
freopen("adunare.in","r",stdin);
freopen("adunare.out","w",stdout);
int a,b;
scanf("%d %d",&a,&b);
printf("%d\n",a+b);
fclose(stdin);fclose(stdout);
return 0;
}