虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

ver<b>if</b>y

  • The government of a small but important country has decided that the alphabet needs to be streamline

    The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d . Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet. Create a class Alphabet that contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1. Definition

    标签: government streamline important alphabet

    上传时间: 2015-06-09

    上传用户:weixiao99

  • function y_cum = cum2x (x,y, maxlag, nsamp, overlap, flag) %CUM2X Cross-covariance % y_cum = cum2x

    function y_cum = cum2x (x,y, maxlag, nsamp, overlap, flag) %CUM2X Cross-covariance % y_cum = cum2x (x,y,maxlag, samp_seg, overlap, flag) % x,y - data vectors/matrices with identical dimensions % if x,y are matrices, rather than vectors, columns are % assumed to correspond to independent realizations, % overlap is set to 0, and samp_seg to the row dimension. % maxlag - maximum lag to be computed [default = 0] % samp_seg - samples per segment [default = data_length] % overlap - percentage overlap of segments [default = 0] % overlap is clipped to the allowed range of [0,99].

    标签: cum2x y_cum Cross-covariance function

    上传时间: 2015-09-08

    上传用户:xieguodong1234

  • We have a group of N items (represented by integers from 1 to N), and we know that there is some tot

    We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.

    标签: represented integers group items

    上传时间: 2016-01-17

    上传用户:jeffery

  • 写一个对文本文件加密的程序和一个解密的程序。密码规则是:对于小写字母

    写一个对文本文件加密的程序和一个解密的程序。密码规则是:对于小写字母,a换成x,b换成y,c换成z,d换成a,e换成b,...;对于大写字母,A换成X,B换成Y,C换成Z,D换成A,E换成B,...;其他字符不变。

    标签: 程序 文件加密 密码 字母

    上传时间: 2016-08-16

    上传用户:jennyzai

  • private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoin

    private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoint.Y > AOrigin.Y) return Math.PI * 0.5f else return Math.PI * 1.5f else if (APoint.Y == AOrigin.Y) if (APoint.X > AOrigin.X) return 0 else return Math.PI else {

    标签: AOrigin APoint Point PointToAngle

    上传时间: 2016-10-31

    上传用户:zhyiroy

  • private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoin

    private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoint.Y > AOrigin.Y) return Math.PI * 0.5f else return Math.PI * 1.5f else if (APoint.Y == AOrigin.Y) if (APoint.X > AOrigin.X) return 0 else return Math.PI else {

    标签: AOrigin APoint Point PointToAngle

    上传时间: 2016-10-31

    上传用户:sunjet

  • private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoin

    private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoint.Y > AOrigin.Y) return Math.PI * 0.5f else return Math.PI * 1.5f else if (APoint.Y == AOrigin.Y) if (APoint.X > AOrigin.X) return 0 else return Math.PI else {

    标签: AOrigin APoint Point PointToAngle

    上传时间: 2013-12-18

    上传用户:rocketrevenge

  • 汉诺塔!!! Simulate the movement of the Towers of Hanoi puzzle Bonus is possible for using animation

    汉诺塔!!! Simulate the movement of the Towers of Hanoi puzzle Bonus is possible for using animation eg. if n = 2 A→B A→C B→C if n = 3 A→C A→B C→B A→C B→A B→C A→C

    标签: the animation Simulate movement

    上传时间: 2017-02-11

    上传用户:waizhang

  • 离散实验 一个包的传递 用warshall

     实验源代码 //Warshall.cpp #include<stdio.h> void warshall(int k,int n) { int i , j, t; int temp[20][20]; for(int a=0;a<k;a++) { printf("请输入矩阵第%d 行元素:",a); for(int b=0;b<n;b++) { scanf ("%d",&temp[a][b]); } } for(i=0;i<k;i++){ for( j=0;j<k;j++){ if(temp[ j][i]==1) { for(t=0;t<n;t++) { temp[ j][t]=temp[i][t]||temp[ j][t]; } } } } printf("可传递闭包关系矩阵是:\n"); for(i=0;i<k;i++) { for( j=0;j<n;j++) { printf("%d", temp[i][ j]); } printf("\n"); } } void main() { printf("利用 Warshall 算法求二元关系的可传递闭包\n"); void warshall(int,int); int k , n; printf("请输入矩阵的行数 i: "); scanf("%d",&k); 四川大学实验报告 printf("请输入矩阵的列数 j: "); scanf("%d",&n); warshall(k,n); } 

    标签: warshall 离散 实验

    上传时间: 2016-06-27

    上传用户:梁雪文以

  • java入门编程合集

    题目:古典问题:有一对兔子,从出生后第3个月起每个月都生一对兔子,小兔子长到第三个月后每个月又生一对兔子,假如兔子都不死,问每个月的兔子总数为多少?    //这是一个菲波拉契数列问题 public class lianxi01 { public static void main(String[] args) { System.out.println("第1个月的兔子对数:    1"); System.out.println("第2个月的兔子对数:    1"); int f1 = 1, f2 = 1, f, M=24;      for(int i=3; i<=M; i++) {       f = f2;       f2 = f1 + f2;       f1 = f;       System.out.println("第" + i +"个月的兔子对数: "+f2);          } } } 【程序2】    题目:判断101-200之间有多少个素数,并输出所有素数。 程序分析:判断素数的方法:用一个数分别去除2到sqrt(这个数),如果能被整除, 则表明此数不是素数,反之是素数。    public class lianxi02 { public static void main(String[] args) {     int count = 0;     for(int i=101; i<200; i+=2) {      boolean b = false;      for(int j=2; j<=Math.sqrt(i); j++)      {         if(i % j == 0) { b = false; break; }          else           { b = true; }      }         if(b == true) {count ++;System.out.println(i );}                                   }     System.out.println( "素数个数是: " + count); } } 【程序3】    题目:打印出所有的 "水仙花数 ",所谓 "水仙花数 "是指一个三位数,其各位数字立方和等于该数本身。例如:153是一个 "水仙花数 ",因为153=1的三次方+5的三次方+3的三次方。 public class lianxi03 { public static void main(String[] args) {      int b1, b2, b3; 

    标签: java 编程

    上传时间: 2017-12-24

    上传用户:Ariza