【LYOI2016】EasyRound1

这可能是给新高一写的吧……随手写着玩玩……

A：随便模拟

#include<cstdio>
#include<cstring>
using namespace std;
int n,m,k,x,y;
inline int read(){
    int f=,x=;char ch;
    do{ch=getchar();if(ch=='-')f=-;}while(ch<''||ch>'');
    do{x=x*+ch-'';ch=getchar();}while(ch>=''&&ch<='');
    return f*x;
}
int main(){
    n=read();m=read();k=read();
    int a[n+][m+];
    memset(a,,sizeof(a));
    for(register int i=;i<=k;++i){
        x=read(),y=read();
        if(x==)for(register int j=;j<=m;++j)a[y][j]=i;
        else for(register int j=;j<=n;++j)a[j][y]=i;
    }
    for(register int i=;i<=n;++i){
        for(register int j=;j<=m;++j)printf("%d ",a[i][j]);
        puts("");
    }
}

B：就是问你二进制拆分后有几位……

#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
ll x;
int main(){
    cin>>x;int ans=;
    while(x){
        ans++;x>>=;
    }
    printf("%d\n",ans);
}

C：随手写完猜一个递推式。

#include<bits/stdc++.h>
#define yql 15746
#define N 1000010
using namespace std;
typedef long long ll;
int  f[N],n;
int main(){
    scanf("%d",&n);
    f[]=;f[]=;
    for(int i=;i<=n;i++)f[i]=((f[i-]%yql)+(f[i-]%yql))%yql;
    printf("%d\n",f[n]);
    return ;
}