题意:判断给出数字中,奇数位的元素和是否与偶数位元素和相等且不为回文数。
链接:http://acm.hdu.edu.cn/showproblem.php?pid=5146
思路:暴力模拟,水过。
注意点:无
以下为AC代码:
Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
12557944 | 2014-12-21 21:26:55 | Accepted | 5146 | 31MS | 1136K | 1453 B | C++ | luminous11 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
int main()
{
int t;
cin >> t;
while ( t -- )
{
int n;
cin >> n;
int num[1005];
int sum1 = 0;
int sum2 = 0;
bool flag1 = false;
bool flag2 = false;
for ( int i = 0; i < n; i ++ )
{
cin >> num[i];
i & 1 ? sum1 += num[i] : sum2 += num[i];
}
if ( sum1 == sum2 )
{
flag1 = 1;
}
for ( int i = 0; i < n; i ++ )
{
if ( num[i] != num[n-1-i] )
{
flag2 = 1;
break;
}
}
if ( flag1 && flag2 )
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
return 0;
}