cipher

-1] + K]? p-1: p++;if (P >= N) break;m = p;}}int main () {scanf ("%s", s);N = strlen (S);for (int i = 0; i H.add (s[i + N] = s[i]);N h.add (s[n++] =-1);h.work ();for (int i = 0; i S[i] = H.hash (S[i]);Build_sa ();for (int i = 0; i Putchar (H._hash (S[sa[i] + N/2-1]));return 0;}--------------------------------------------------------------------- 1031: [JSOI2007] character encryption cipher time limit: ten Sec Memory Limit: 162 MB

1031: [JSOI2007] character encryption cipher time limit:10 Sec Memory limit:162 MBsubmit:5983 solved:2491[Submit] [Status] [Discuss] Description like to delve into the problem of JS classmate, and recently fascinated by the encryption method of thinking. One day, he suddenly came up with what he thought was the ultimate encryption: to make a circle of information that needs to be encrypted, it is clear that they have many different ways of re

7:Bzoj 1031: [JSOI2007] character encryption cipher the beginning of the fall array of sa and rank array teacher confused; the topic is to get the order of the last letter Mistaken: The last string after the order is made. Familiarity with rank and SA definitions soon code:1031: #include Bzoj 1031: [JSOI2007] character encryption cipher

BASE64 encryption algorithm, widely used, especially in e-mail transmission, has a great useThe program code written in Java is as followsImportjava.awt.BorderLayout;ImportJava.awt.EventQueue;Importjava.awt.event.ActionEvent;ImportJava.awt.event.ActionListener;Importjava.io.IOException;ImportJavax.swing.JFrame;ImportJavax.swing.JPanel;ImportJavax.swing.border.EmptyBorder;ImportJavax.swing.JTextArea;ImportJavax.swing.JButton; Public classBase64frameextendsJFrame {PrivateJPanel ContentPane; Privat

Project Introductionrecently participated in the 2017-year 360 front-end star program, completed a fun UI component development work, take the opportunity to share with you the mobile development technology ~ ~This project uses native JS and canvas to implement the mobile gesture cipher component, which supports gesture password setting and verification. after the first star-watching, million annual salary! Please pay attention to my GitHub, learn fro

TopicLet God be God, Caesar's Caesar.Here we introduce the world's most popular Caesar password Caesar cipher, also known as the shift password.The shift password, which is the letter in the password, is shifted according to the specified number.A common case is the ROT13 password, which shifts the letters to 13 positions. By ' A '? ' N ', ' B '? ' O ', and so on.Write a ROT13 function, implement input encryption string, output decrypt string.All lett

1031: [JSOI2007] character encryption cipher time limit:10 Sec Memory limit:162 MBsubmit:7338 solved:3182[Submit] [Status] [Discuss] Description like to delve into the problem of JS classmate, and recently fascinated by the encryption method of thinking. One day, he suddenly came up with what he thought was the ultimate encryption: to make a circle of information that needs to be encrypted, it is clear that they have many different ways of re

1031: [JSOI2007] character encryption cipher time limit:10 Sec Memory limit:162 MBsubmit:3157 solved:1233[Submit] [Status] DescriptionLike to delve into the problem of JS classmate, and recently fascinated by the encryption method of thinking. One day, he suddenly came up with what he thought was the ultimate encryption: to make a circle of information that needs to be encrypted, it is clear that they have many different ways of reading. For

2017-2018-1 201552228 algorithm for brute-attack algorithm of block cipher: an innovative approach to the stability of the English alphabet based on the reading of random sequences generated by the use of the English alphabet of randomly arranged text materials as the key to the brute-attack.We take des algorithm as an example to illustrate the algorithm of brute-lift attack.Des algorithm adopts 64-bit master key, so the key number of key space of mas

1031: [JSOI2007] character encryption cipher time limit:10 Sec Memory limit:162 MBsubmit:7593 solved:3291[Submit] [Status] [Discuss] Description like to delve into the problem of JS classmate, and recently fascinated by the encryption method of thinking. One day, he suddenly came up with what he thought was the ultimate encryption: to make a circle of information that needs to be encrypted, it is clear that they have many different ways of re

1031: [JSOI2007] character encryption cipher time limit:10 Sec Memory limit:162 MBsubmit:3146 solved:1226[Submit] [Status] DescriptionLike to delve into the problem of JS classmate, and recently fascinated by the encryption method of thinking. One day, he suddenly came up with what he thought was the ultimate encryption: to make a circle of information that needs to be encrypted, it is clear that they have many different ways of reading. For

Public Static voidMain (string[] args) {Try{String plaintext= "Duwenlei"; Keypairgenerator Keypairgenerator= Keypairgenerator.getinstance ("RSA"); Keypairgenerator.initialize (2048); KeyPair KeyPair=Keypairgenerator.generatekeypair (); //SignatureMessageDigest MD = messagedigest.getinstance ("SHA1"); byte[] Enchash =md.digest (Plaintext.getbytes ()); Pkcs8encodedkeyspec KeySpec=NewPkcs8encodedkeyspec (Keypair.getprivate (). getencoded ()); Keyfactory keyfactory= Keyfactory.getinstance ("RSA"); K

DescriptionLike to delve into the problem of JS classmate, and recently fascinated by the encryption method of thinking. One day, he suddenly came up with what he thought was the ultimate encryption: to make a circle of information that needs to be encrypted, it is clear that they have many different ways of reading. For example, it can be read as:JSOI07 soi07j oi07js i07jso 07JSOI 7jsoi0 sort them by the size of the string: 07JSOI 7jsoi0 i07jso JSOI07 oi07js soi07j read the last column of chara

], HEIGHT[MAXN];voidBuild_height (int(RNint*sa,intN) {//R is the converted original array, SA is the evaluated array, and N is Len intI, j, k =0; for(i =1; I i; for(i =0; I k) { for(K. k--:0, j = Sa[ranking[i]-1]; R[i + K] = = R[j + K]; k++); }}intSA[MAXN], R[MAXN];strings;intSTR[MAXN];intMain () {//freopen ("1031.in", "R", stdin); //freopen ("1031.out", "w", stdout); //Cin.sync_with_stdio (false);CIN >>s; intn =s.length (); S= S +s; for(inti =0; I 2; Str[s.length ()]=1; Da (str, SA, s.len

A hash is the conversion of the target text into an irreversible hash string (or message digest) of the same length, whereas encryption (Encrypt) converts the target text into a reversible cipher with different lengths. This article mainly introduces PHP commonly used hash encryption function, in the case of a detailed analysis of PHP hash encryption function usage, code with detailed comments, easy to understand, the need for friends can refer to, Th

DoWriteln (Y[i]); + fori:=0 toN-1 Dowd[i]:=X[y[i]]; - fori:=0 toM Dowc[i]:=0; $ fori:=0 toN-1 DoInc (Wc[wd[i]); $ fori:=1 toM Dowc[i]:=wc[i-1]+Wc[i]; - fori:=n-1 Downto 0 Do - begin the Dec (wc[wd[i]]); -sa[wc[wd[i]]]:=Y[i];Wuyi End; the - fori:=0 toN Doswap (x[i],y[i]); Wu -p:=1; x[sa[0]]:=0; About fori:=1 toN-1 Do $ begin - ifCMP (sa[i-1],SA[I],J) Thenx[sa[i]]:=p-1 - Else beginX[sa[i]]:=p; Inc (P);End; - End; A +j:=j*2; them:=p; - End; $ E

becomes 62 the binary is 8o, less than 5 bits in front plus 0 padded.Then, we can write a method to traverse the password of the specified length. Call:Testpassword (2, 3);The program will output all combinations of 2-bit and 3-bit passwords. (From: 00-zzz)According to this idea, we can also write more forms of the exhaustive algorithm. For example, we traverse the password also contains the decimal point ".", then we just need to change the algorithm to 63 binary.10 binary to 62, implem

Description like to delve into the problem of JS classmate, and recently fascinated by the encryption method of thinking. One day, he suddenly came up with what he thought was the ultimate encryption: to make a circle of information that needs to be encrypted, it is clear that they have many different ways of reading. For example, it can be read as:JSOI07 soi07j oi07js i07jso 07JSOI 7jsoi0 sort them by the size of the string: 07JSOI 7jsoi0 i07jso JSOI07 oi07js soi07j read the last column of char

Mathematical. X^2% n = 1 (x+1) (x-1) = kn. Set x+1 = K1*n1, x-1=k2*n2. Then K1*k2=k, N1*n2=n. It is possible to calculate the approximate number of each greater than sqrt (n) and then make the N1,N2 attempt separately. Calculate x Be sure to take the mold. Otherwise 1 will become n+1. #include #include#include#include#includeusing namespacestd;Const intMAXN =100000+Ten;intRES[MAXN];intn,m,cnt;Long Longt,j;intMain () {CIN>> N; Cnt=0; if(n==1) {printf ("none\n");return 0;} M=(int) sqrt (n+0.5); f

Topic: Given a two-dimensional matrix, the sub-matrix of the a*b with the most occurrences is obtained.Two-dimensional hash, just remember that the vertical base can not be the same, love how to engage in how to doThe natural overflow result from the beginning of writing OLE thought it was a natural overflow was stuck out and then wrote a double modulo ... The result is still OLEFinally found that the problem read into the pit dad ... There are spaces in the string not to say, full of invisible