2021暑假集训-个人赛6

---

A.Gregor and Cryptography

传送门
这个题挺水的，题目大意就是输入大于等于5的素数，输出两个数，素数对这两个数求余是相同的没输出2和n-1就行了
但是我卡了很久，卡在了long long参考这个

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const ll Max=10000;
using namespace std;
ll t,n,m;
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<in q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld",&n);
        printf("%lld %lld\n",1LL*2,n-1);
    }
    return 0;
}

B.Gregor and the Pawn Game

传送门
题目大意：就是两排棋子，一排是敌人的阵地，一排是你的阵地，你可以直接前进占领阵地，但是你正面刚不过敌人，但是你可以走斜路击毙敌人占领阵地，如果斜路没有敌人你就无计可施

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const ll Max=200007;
using namespace std;
int t,n,m;
char a[2][Max];
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{    scanf("%lld",&t);
    while(t--)
    {   mem(a,0);
        scanf("%d",&n);
        for(int i=0;i<2;i++)
            for(int j=0;j<n;j++)
        {
           cin>>a[i][j];
        }int sum=0;
        for(int i=0;i<n;i++)
        {
            if(a[1][i]=='1'&&a[0][i]=='0')
            {
                sum++;
                a[0][i]='2';
            }
            else if(a[1][i]=='1')
            {
                      if(a[0][i-1]=='1'&&i-1>=0)
                      {sum++;a[0][i-1]=2;}
                      else if(a[0][i+1]=='1'&&i+1<n)
                      {
                          sum++;a[0][i+1]='2';
                      }


            }
        }cout<<sum<<endl;
    }
    return 0;
}

C.Web of Lies*

传送门

D.Integers Have Friends*

传送门

E.The Three Little Pigs *

传送门

F.Gregor and the Odd Cows (Easy) *

传送门

G.Gregor and the Odd Cows (Hard) *

传送门