HDU 5874 2016 ACM/ICPC Asia Regional Dalian Online 1007 Friends and Enemies

 这题是这个OEIS题 :http://oeis.org/A002620

或者：

Nero搞出了一个结论: $n$个点的图, 要求有尽量多的边, 并且不存在三元环. 这个边数就是$m$的下界.

对于一个$n$个结点的没有三元环的图, 边数最大的就是完全二分图. 于是答案就是\lfloor \frac{n}{2} \rfloor \cdot \lceil\frac{n}{2} \rceil⌊​2​​n​​⌋⋅⌈​2​​n​​⌉.

【代码】

<span style="font-size:14px;">/* ***********************************************
Author        :angon

************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define showtime fprintf(stderr,"time = %.15f\n",clock() / (double)CLOCKS_PER_SEC)
#define lld %I64d
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scanl(d) scanf("%I64d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define scannl(n,m) scanf("%I64d%I64d",&n,&m)
#define mst(a,k)  memset(a,k,sizeof(a))
#define LL long long
#define N 1005
#define mod 1000000007
inline int read(){int s=0;char ch=getchar();for(; ch<'0'||ch>'9'; ch=getchar());for(; ch>='0'&&ch<='9'; ch=getchar())s=s*10+ch-'0';return s;}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    LL n,m;
    while(~scannl(n,m))
    {
        LL ans = (2 * n * n + (n&1?-1:1)) / 8;
        if(ans <= m)
            printf("T\n");
        else
            printf("F\n");
    }


    return 0;
}</span>