2015
07-17

# Pen Counts

Chicken farmer Xiaoyan is getting three new chickens, Lucy, Charlie and CC. She wants to build a chicken pen so that each chicken has its own, unobstructed view of the countryside. The pen will have three straight sides; this will give each chicken its own side so it can pace back and forth without interfering with the other chickens. Xiaoyan finds a roll of chicken wire (fencing) in the barn that is exactly N feet long. She wants to figure out how many different ways she can make a three sided chicken pen such that each side is an integral number of feet, and she uses the entire roll of fence.
Different rotations of the same pen are the same, however, reflections of a pen may be different (see below).

The first line of input contains a single integer P,(1<= P <=1000), which is the number of data sets that follow. Each data set should be processed identically and independently.

Each data set consists of a single line of input. It contains the data set number, K, and the length of the roll of fence, N, (3 <= N <= 10000).

The first line of input contains a single integer P,(1<= P <=1000), which is the number of data sets that follow. Each data set should be processed identically and independently.

Each data set consists of a single line of input. It contains the data set number, K, and the length of the roll of fence, N, (3 <= N <= 10000).

5
1 3
2 11
3 12
4 100
5 9999

1 1
2 5
3 4
4 392
5 4165834

#include<iostream>
using namespace std;
#include<iostream>
using namespace std;
int max(int a,int b)
{
if(a>b)return a;
return b;
}
int main()
{
int num,n,t,s,x,j,z,temp;
cin>>t;
while(t--)
{
cin>>num>>n;
s=0;
for(z=1;z<=n/3;z++)
{
temp=0;
x=(n-z)/2;
j=max(z,n/2-z+1);

if(x+z<=n-z-x||x>n-z-x)continue;
if(j==z)
{
temp=z;
s--;
}
if(temp!=x&&x==n-z-x)s--;
s+=(x-j+1)*2;
//cout<<z<<" "<<x<<" "<<j<<" "<<temp<<" "<<s<<endl;

}
cout<<num<<" "<<s<<endl;
}
return 0;
}