蓝桥算法训练 求平方和 ALGO-239

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <cmath>
#include <map>

using namespace std;
typedef long long ll;

const double inf=1e20;
const int maxn=2e5+10;
const int mod=1e9+7;

void pow2(int a,int b){
    cout<<a*a+b*b<<endl;
}
void pow2(double c,double d){
    cout<<c*c+d*d;
}
int main(){
    int a,b;
    double c,d;
    cin>>a>>b;
    cin>>c>>d;
    pow2(a,b);
    pow2(c,d);
    return 0;
}