A-字元畫

#include<cstdio>
int main(){
	int w;
	scanf("%d",&w);
	char a[5][4]={"ooo","..o","ooo","o..","ooo"};
	char b[5][4]={"ooo","o.o","o.o","o.o","ooo"};
	char c[5][4]={"ooo",".o.",".o.",".o.","ooo"};
	char d[5][4]={"ooo","o.o","ooo","o.o","ooo"};
	for(int i=0;i<5;i++){
		printf("%s",a[i]);
		for(int j=0;j<w;j++)
		printf(".");
		printf("%s",b[i]);
		for(int j=0;j<w;j++)
		printf(".");
		printf("%s",c[i]);
		for(int j=0;j<w;j++)
		printf(".");
		printf("%s",d[i]);
		printf("\n");
	}
} 
 

時間旅行

#include<cstdio>
int main(){
	int h,c;
	while(~scanf("%d%d",&h,&c)){
		if(h==c){
			printf("%d\n",c+1);
			continue;
		}
		else if(c<h)
		printf("%d\n",h); 
		else printf("%d\n",c+1);
	}
}

2018

#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
const int maxn=2000+100;
const LL mod=1e9+7;

LL ans[maxn][maxn];

int main(){

    for(int i=1;i<=2000;i++) ans[1][i]=i;
    for(int i=2;i<=2000;i++) for(int j=1;j<=2000;j++) ans[i][j]=(ans[i][j-1]+ans[i-1][j]+1)%mod;
    //for(int i=0;i<5;i++){
    	//for(int j=0;j<5;j++){
    	//printf("%d ",ans[i][j]);
	//}
	//printf("\n");
	//}
    int n,m;
    while(scanf("%d%d",&n,&m)==2){

        printf("%lld\n",ans[n][m]*ans[n][m]%mod);
    }
}