
OnlineJudge
zgmzmg
这个作者很懒,什么都没留下…
展开
-
UVa489刽子手
#include#include#define maxn 100char s1[maxn],s2[maxn];int Guess();int main(){ int i,T=1; while(scanf("%d",&T) == 1){ if(T == -1) break; scanf("%s",s1); scanf("%s",s2); i=Guess();原创 2018-01-15 14:37:37 · 148 阅读 · 0 评论 -
UVa455周期串
#include#includeint main(void){int n,stlen,i,j;char carr[1000];while(scanf("%d",&n)!=EOF){while(n--){scanf("%s",carr);stlen=strlen(carr);for(i=1; i<=stlen; i++){if(stlen%i==0){for(j=i;原创 2018-01-15 14:38:30 · 174 阅读 · 0 评论 -
UVa232纵横字谜
#include#include#define maxn 15void AA(int a[maxn][maxn],char maps[maxn][maxn],int r,int c);void Down(char maps[maxn][maxn],int a[maxn][maxn],int r,int c);int main(){int i,j,r,c,flag=0,key=1;i原创 2018-01-15 14:39:17 · 329 阅读 · 0 评论 -
UVa227谜题
#include#include#define maxn 26int main(){int i=0,j=0,count;int b_x=0,flag,x,y;int b_y=0,cases;char a[5][7],s[maxn];cases=0;while(gets(a[0])){if(a[0][0]=='Z') break;for(i=1;i<5;i++)gets(a[i原创 2018-01-15 14:40:00 · 227 阅读 · 0 评论 -
UVa201正方形
#include#includeint h[9][9],v[9][9];int tag=0;void Size(int i,int n);int main(){ int i,n,m,r,c,cont=1; char M; while(scanf("%d",&n)){ scanf("%d",&m); getchar(); memset(h,0,sizeof(h));原创 2018-01-15 14:40:37 · 266 阅读 · 0 评论 -
UVa1589象棋
#include#include#includeint a[8][5];char A[8];int map[11][10];int Check_G(int r,int c);int Check_R(int r,int c);int Check_H(int r,int c);int Check_C(int r,int c);int main(){ int i,c,num=原创 2018-01-15 14:41:27 · 293 阅读 · 0 评论 -
UVa1368DNA序列
#include#include#define maxn 15void AA(int a[maxn][maxn],char maps[maxn][maxn],int r,int c);void Down(char maps[maxn][maxn],int a[maxn][maxn],int r,int c);int main(){int i,j,r,c,flag=0,key=1;i原创 2018-01-15 14:42:25 · 327 阅读 · 0 评论