Nowcoder 牛可乐发红包脱单OI赛$

好不容易打一场比赛写完2题信心满满能过结果快读写错炸成0分。。心态崩了。。

A

给一个序列长度n,求把最少数变成1使得任意长度大于等于k的子串gcd=1;

傻逼题。。答案是n/k

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#define ll long long
#define out(a) printf("%d",a)
#define ln printf("
")
const int N=1e5+50;
const int MOD=1e9+7;
using namespace std;
int n,k;
int read()
{
    int s=0,t=1; char c=getchar();
    while (c<'0'||c>'9'){if (c=='-') t=-1; c=getchar();}
    while (c>='0'&&c<='9'){s=s*10+c-'0'; c=getchar();}
    return s*t;
}
ll readl()
{
    ll s=0,t=1; char c=getchar();
    while (c<'0'||c>'9'){if (c=='-') t=-1; c=getchar();}
    while (c>='0'&&c<='9'){s=s*10+c-'0'; c=getchar();}
    return s*t;
}
int main()
{
    cin>>n>>k;
    cout<<n/k;
    return 0;
}

B

两个操作，a把序列最后那个数移到最前面,b把序列第三个数移到最前面.

显然操作是循环的,%一下然后模拟就好了...

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#define ll long long
#define out(a) printf("%d ",a)
#define ln printf("
")
const int N=1e5+50;
const int MOD=1e9+7;
using namespace std;
int n,m;
int a[N],b[N],c[N];
int num,now,tot=0,l;
char s[N];
int read()
{
    int s=0,t=1; char c=getchar();
    while (c<'0'||c>'9'){if (c=='-') t=-1; c=getchar();}
    while (c>='0'&&c<='9'){s=s*10+c-'0'; c=getchar();}
    return s*t;
}
ll readl()
{
    ll s=0,t=1; char c=getchar();
    while (c<'0'||c>'9'){if (c=='-') t=-1; c=getchar();}
    while (c>='0'&&c<='9'){s=s*10+c-'0'; c=getchar();}
    return s*t;
}
int find(int len)
{
    int x=0;
    for (int i=0;i<len-1;i++)
      x=x*10+s[i]-'0';
    return x;
}
int main()
{
    n=read(); m=read();
    for (int i=1;i<=n;i++)
      a[i]=read();
    for (int i=1;i<=m;i++){
      scanf("%s",s); l=strlen(s);
      if (s[l-1]=='a') now=n; else now=3;
        num=find(l)%now; tot=0;
        for (int j=now-num+1;j<=now;j++)
          b[++tot]=a[j];
        for (int j=1;j<=now-num;j++)
          c[j+num]=a[j];
        for (int j=1;j<=num;j++)
          a[j]=b[j];
        for (int j=num+1;j<=now;j++)
          a[j]=c[j];
    }
    for (int i=1;i<=n;i++)
      out(a[i]);
    return 0;
}

 

快读问题就是c没有用getchar()赋初值。。。还好在noip前发现我一直这样写却没发现的错误

本来妥妥200分炸成0分，noip比赛时还是老老实实scanf吧QAQ。。