算法和数据结构
izheng000
这个作者很懒,什么都没留下…
展开
-
S2
#include <iostream> #include <cstring> #include <cstdio> #include <vector> using namespace std; const int maxn = 1005; int map[maxn][maxn], dp[maxn][maxn], ldp[maxn][maxn], rd...原创 2020-04-03 09:36:10 · 158 阅读 · 0 评论 -
Uva227
#include<stdio.h> #include<string.h> int main(){ int counter=0,i,j,blank_x,blank_y; char str[5][7],command; bool line=false; while(gets(str[0])){ if(strcmp(str[0],"Z")==0)原创 2016-02-26 16:06:33 · 346 阅读 · 0 评论 -
Uva232
#include<stdio.h> #include<string.h> int main(){ int r,c,i,j,k,counter,number=0; char str[10][10],digit1[10][10],digit2[10][10]; scanf("%d",&r); while(r!=0){ counter=0;原创 2016-02-26 16:07:06 · 390 阅读 · 0 评论 -
Uva445
#include<stdio.h> #include<string.h> #define maxn 100 int main(){ int times,length,period,flag,i,j,num; char str[maxn],repetition[maxn]; scanf("%d",×); while(times--){ scan原创 2016-02-26 16:07:37 · 327 阅读 · 0 评论 -
Uva1368
#include<stdio.h> #include<string.h> int main(){ int m,n,distance=0,i,j,letter,number,times; char str[50][1001],answer[1001],count[4]; scanf("%d",×); while(times--){ distance=0原创 2016-02-26 16:08:43 · 364 阅读 · 0 评论 -
Uva1586
#include<stdio.h> #include<string.h> int main(){ int times,str_length,flag,i,j,number; float sum,atom; char str[100]; scanf("%d",×); while(times--){ sum=0; atom原创 2016-02-26 16:09:18 · 305 阅读 · 0 评论 -
Uva10340
#include<stdio.h> #include<string.h> #define maxn 100000 int main(){ int i,j; char str1[maxn],str2[maxn]; while(scanf("%s%s",str1,str2)!=EOF){ int flag=1; int length_str2;原创 2016-02-26 16:10:08 · 386 阅读 · 0 评论 -
Uva202
Uva202原创 2016-02-24 16:18:08 · 386 阅读 · 0 评论 -
Caesar_Ciphers(凯撒移位)python描述
#encryption code from #http://thelivingpearl.com/2013/06/03/caesar-ciphers-in-#python/ import sysdef main(argv): if (len(sys.argv) != 2): sys.exit('Usage: sub.py <k>') plaintext = list(原创 2016-04-24 18:52:30 · 1776 阅读 · 0 评论