题目:A. Filling Diamonds
题目链接:https://codeforces.com/problemset/problem/1339/A
题解:水题·:判断长度为n的区域能最多放多少个边不相邻的三角形,当每个都放正中间放的时候,个数最多。所以个数为n个
代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int t;
long long n;
scanf("%d",&t);
while(t--)
{
scanf("%lld",&n);
printf("%lld\n",n);
}
return 0;
}