2020 -08 - 20 比赛总结

A 题：

我比赛提交的代码：

#include <iostream>
using namespace std;
int main()
{
    int n, k, flag;
    cin>>n>>k;
    if(n%k == 0)
    {
        flag = (n/k)*2;
    }
    else
    {
        flag = (n/k)*2 + 1;
    }
    cout<<flag<<endl;
    return 0;
}

未AC的原因是：1我未考虑当n<k的情况；2 我未添加freopen(“input.txt”,“r”,stdin);
freopen(“output.txt”,“w”,stdout);这两行代码；3还有就是我对n>k的情况考虑不对，k是变量，最好用2n来考虑；

AC的代码：

#include <algorithm>
#include <stdio.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include "cstdio"
#include "cstring"
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 0x3f3f3f3f
#define Max 1100000+5
#define C 0.57721566490153286060651209
using namespace std;
int main()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int n, k, flag;
   scanf("%d%d", &n, &k);
    if(n <= k)
    {
        flag = 2;
    }
    else
    {
        if(2*n%k == 0)
        {
            flag = (2*n/k);
        }
        else
        {
            flag = (2*n/k) + 1;
        }
    }
    printf("%d\n", flag);
    return 0;
}

G题：

我比赛时的代码：

#include <iostream>
using namespace std;
bool p[10467400] = {0};
int prime[10467400], h = 0;
int n;
void Findprime()
{
    for(int i = 2; i < n; i++)
    {
        if(p[i] == false && n % i == 0)
        {
            prime[h++] = i;
            for(int j = i+i; j < 1001; j += i)
            {
                p[j] = true;
            }
        }
    }
}
int main()
{
    int i;
    cin>>n;
    Findprime();
    int flag = 0;
    for(i = 0; i < 1001; i++)
    {
        if(prime[i]*prime[i+1]*prime[i+2] == n)
        {
            flag = 1;
            break;
        }
    }
    /*for(i = 0; i < 1001; i++)
    {
        cout <<prime[i]<<endl;
    }*/
    if(flag == 1)
    {
        cout << "YES" << endl;
    }
    else
    {
        cout << "NO" << endl;
    }
    return 0;
}

未AC的原因是：未添加freopen(“input.txt”,“r”,stdin);
freopen(“output.txt”,“w”,stdout);

AC的代码：

#include <algorithm>
#include <stdio.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include "cstdio"
#include "cstring"
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 0x3f3f3f3f
#define C 0.57721566490153286060651209
bool p[10467400] = {0};
int prime[10467400], h = 0;
int n;
void Findprime()
{
    for(int i = 2; i < n; i++)
    {
        if(p[i] == false && n % i == 0)
        {
            prime[h++] = i;
            for(int j = i+i; j < 1001; j += i)
            {
                p[j] = true;
            }
        }
    }
}
int main()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int i;
   scanf("%d", &n);
    Findprime();
    int flag = 0;
    for(i = 0; i < 1001; i++)
    {
        if(prime[i]*prime[i+1]*prime[i+2] == n)
        {
            flag = 1;
            break;
        }
    }
    if(flag == 1)
    {
        printf("YES\n");
    }
    else
    {
        printf("NO\n");
    }
    return 0;
}