poj 1455(环的性质)
#include<iostream> #include<cstdio> using namespace std; int main(){ int t,n,k,ans; scanf("%d",&t); while(t--){ scanf("%d",&n); if(n==1)printf("0\n"); else{ k = n/2; printf("%d\n",k*(k-1)/2+(n-k)*(n-k-1)/2); } } return 0; }
#include<iostream> #include<cstdio> using namespace std; int main(){ int t,n,k,ans; scanf("%d",&t); while(t--){ scanf("%d",&n); if(n==1)printf("0\n"); else{ k = n/2; printf("%d\n",k*(k-1)/2+(n-k)*(n-k-1)/2); } } return 0; }
