AIsing Programming Contest 2020----B - An Odd Problem，C - XYZ Triplets

你是我可爱的诱惑，温柔的牵绊，无法割舍的存在.你说青涩最搭初恋，我们有相遇的时间，在风暖月光的地点，海之角也不再遥远.你我之间，看不见的宣言，一直都在，重复过很多年.

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <ctime>
#include <cctype>
#include <bitset>
#include <utility>
#include <complex>
#include <iomanip>
#include <numeric>
#include<unordered_set>
#include <climits>//INT_100010n
#include <regex>
#include<deque>
//#include<bits/stdc++.h>
#define PP pair<ll,int>
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
#define llinf 0x3f3f3f3f3f3f3f3fll
#define dinf 1000000000000.0
#define PI 3.1415926
#define wc 1e-18
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
int N,s,ct;
int main(){
    cin>>N;
    for(int i=1;i<=N;i++){
        cin>>s;
        if(i%2==1&&s%2==1)
            ct++;
    }
    cout<<ct<<endl;
    return 0;
}

 

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <ctime>
#include <cctype>
#include <bitset>
#include <utility>
#include <complex>
#include <iomanip>
#include <numeric>
#include<unordered_set>
#include <climits>//INT_100010n
#include <regex>
#include<deque>
//#include<bits/stdc++.h>
#define PP pair<ll,int>
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
#define llinf 0x3f3f3f3f3f3f3f3fll
#define dinf 1000000000000.0
#define PI 3.1415926
#define wc 1e-18
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
int N;
int js(int x,int y,int z)
{
    return x*x+y*y+z*z+x*y+y*z+z*x;
}
int db(int d)
{
    int ct=0,ls=sqrt(d);
    for(int i=1; i<=ls; i++)
    {
        for(int j=1; j<=ls; j++)
        {
            if(js(i,j,1)<=d)
            {
                for(int k=1; k<=ls; k++)
                {
                    if(js(i,j,k)==d)
                    {
                        ct++;
                        break;
                    }
                    else if(js(i,j,k)>d)
                        break;
                }
            }
        }
    }
    return ct;
}
int main()
{
    cin>>N;
    for(int i=1;i<=20;i++)
        cout<<db(i)<<endl;
    return 0;
}