Canvas Frames CodeForces - 127B
题目传送门:http://codeforces.com/problemset/problem/127/B
题目大意:给出几组数据,求能围城多少个矩形。
分析:大概都懂,边长两两相同即可成为矩形,且用过一次的数据不可以再次利用;
所以,水!
AC Code:
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int m,n;
while(cin>>m)
{
int a[100000] = {0};
for(int i = 0; i < m; i++)
{
cin>>a[i];
}
sort(a, a+m);
int same = 0;
double sum = 0;
for(int i = 0; i < m; i++)
{
if(i != 0)
{
if(a[i] == a[i-1])
{
same++;
a[i - 1] = 0;//为了不重复数据,置零;
a[i] = 0;
if(same == 2)
{
same = 0;
sum += 1;
}
}
}
}
int s = (int)sum;
cout<<s<<endl;
}
return 0;
}