66666666

/*
* 文件名:Test.java
* 版权:Copyright 2000-2007 晏新锋
* 描述: 重构-改善既有代码的设计
* 修改人: 晏新锋
* 修改时间:2009-10-13
* 修改内容:新增
* 跟踪单号:
* 修改单号:
* 修改内容:
*/
package test;

import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;


/**
* 〈一句话功能简述〉
* 〈功能详细描述〉
* @author 晏新锋
* @version V1.00 2009-10-13
* @see [相关类/方法]
* @since 重构-改善既有代码的设计
*/
public class Test
{
public static void main(String[] args)
{
String varName = "";
String varValue = "";
List<String> list = new ArrayList<String>();
StringTokenizer string = new StringTokenizer(
"[SubscriberNumber] = $1 AND [AcceptTime] between $2 AND $3 AND [SubscriberNumber] = $4 AND [AcceptTime111] between $2 AND $3 ",
"[]");
while (string.hasMoreTokens())
{
list.add(string.nextToken());

}

for (int i = 0; i < list.size() / 2; i++ )
{
varName = list.get(i + (i * 1));

String varValueTemp = list.get(i + (i * 1) + 1);

String[] strings = varValueTemp.split("\\$");
for (int j = 0; j < strings.length; j++ )
{
String string3 = strings[j];

String string6 = string3.substring(0, string3.indexOf(" "));
if ( !string6.equals(""))
{
//System.out.println(string6);
varValue = string6;
System.out.println(varName + ":$" + varValue);
}
}

}
}

}
from Crypto.Util.number import * n=1130559951242142418553461557920917245278152787036994964813122956739956040733223190585188299825937660853090732755660557900622564346469528239989519875434612493124663925800482373019421482927567375862528994310090666571233446002163478309309649223886467303834842172338454971591276606602163799133000582891965785243482166772793400065793927508012418516719549212969303944155066541587875789636798394581666621711612432864870236407912486149901575077993702841083287354610398446101725184000000000000000000000000000000149 e=65537 m=bytes_to_long(flag) def zhuanzhuan(n): if n < 2: return n return 9* zhuanzhuan(n - 1) + zhuanzhuan(n - 2) g = 1766592252951269548814352411327322447034194093921285273353477875204196603230641896039854934719468650093602325707751568 hint_0=zhuanzhuan(g)%50254221567892101225665855 def encrypt(hint_0): #n_1,n_2 both are int if (n_1+hint_0)**2+1712463104290490642*n_1+4730060142800357260761833404838169046987798-66666666*n_2**2=0: d=55607604802787651645008458776960381905274761803290637507632188635838921065681450951091689278291418693230528750002533602907652688436593464630306292523277204515196410606067221890882848225521819884919432609641732036959698443050773592482567332594684068998082886109352105201496925283866221090767083891241755981564899917062843679988341936588610298860835342859782896551931353504004447312763256966682142206683209406463516580194846276027818291321875085607298572702721743561*n_1+n_2-69462057634597116805075535702860983356198049 return d c=pow(m,e,n)=encrypt(hint_0) #The n is very dangerous 结果是多少
06-03
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值