void sortlist(struct node** l)
{
    struct node *al,*bl;
    split(*l,&al,&bl);
    rever(bl);
    merge(al,bl);
}
Esempio n. 2
0
int main()
{
	char nombre[10] = {"Cadena"};
	int arr[4] = {3, 5, 178, 2};
	int i;
	//ordenar(arr);

	rever(nombre);
	rev(&i);
	printf("%s\n", nombre);
	return 0;
}
 void reverseWords(string &s) {
     if(s.length() == 0) return;
     int begin=0;
     while(*(s.end()-1) == ' '){
         s.erase(s.length()-1, 1); 
     }   
     for(int i=0; i < s.length();){
         if(s[i] == ' '){
             if(begin == i){ 
                 s.erase(begin, 1); 
             }else{
                 rever(s, begin, i-1);
                 i++;
                 begin = i;
             }   
         }else{
              i++;
         }   
     }   
     rever(s, begin, s.length()-1);
     rever(s, 0, s.length()-1);
 }   
Esempio n. 4
0
int main()
{
int l,i,j;
while(scanf("%s",str),str[0]!='#')
{
    l=strlen(str)-1;
    int i=l;
    while(i && str[i]<=str[i-1])i--;
    if(i==0)printf("No Successor\n");
    else
    {
        i--;
        j=find(i,l);
        chang(i,j);
        rever(i+1,l);
        printf("%s\n",str);
    }
       
}
return 0;
}
Esempio n. 5
0
int sss_test2()
{
	uint32 D[MAX_N_LENGTH] = 
	{
		0x0e85980c, 0x64ed9426, 0x6965357b, 0x148d7858,
		0x1fccaf34, 0x9dbb975d, 0xdbd454bf, 0xd31430f7,
		0xbcad1f90, 0x8ff6a4ad, 0xec59636f, 0xd0b54bc8,
		0x14614184, 0x7a1bbf74, 0xa7838212, 0x6a782cb3,
		0xd7e372fd, 0x8c146b8d, 0x0ca47816, 0x781323e6,
		0x00e729c5, 0xc9e7a788, 0x4d9a3516, 0xf9b81076,
		0xdf9bbb1d, 0x3edf8067, 0xf10fe7c7, 0x2a147030,
		0x09d038d3, 0x95e72f37, 0x7678c1f9, 0xaf1a81a1
	};
	uint32 E[MAX_N_LENGTH] =
	{
		0x10001,
	};
	uint32 N[MAX_N_LENGTH] =
	{
		0xe6f18faf, 0x4db624a6, 0x9471fbeb, 0x0156b6db,
		0xcadff22a, 0x6cb96fd8, 0x70f28e44, 0x32b10c1b,
		0xeea8dc03, 0x3372e6c0, 0x83a74734, 0x01101ea6,
		0x1f04e6b3, 0x41ec9759, 0xf2f6f77c, 0x16c5dd97,
		0xf5db6c60, 0xbd53bca9, 0xbdd7aebf, 0x70f338f4,
		0xb45a259c, 0xcff12faf, 0xdb5d435a, 0xeb075da7,
		0xd844a150, 0x2a98baba, 0x81c16187, 0x093b548c,
		0x20dec362, 0x64cfc03f, 0xe797a77d, 0x658e31eb
	};

	uint32 rsa[MAX_N_LENGTH];      /* rsa加密后的数据 */
    uint32 rsaDec[MAX_N_LENGTH];   /* rsa解密后的数据 */
	uint32 org_data[MAX_N_LENGTH]; /*源数据*/
	uint32 tmp_cmn_buff[MAX_N_LENGTH];

	rsa_public_key key_input[2] = {{0,{0},{0}},{0,{0},{0}}};
	int ret = 0;
	int rsa_out_len = sizeof(rsa);
	int rsaDec_out_len = sizeof(rsaDec);
	int i = 0;

    rever(N, MAX_N_LENGTH);
    rever(D, MAX_N_LENGTH);

	memset(tmp_cmn_buff, 0, sizeof(u32) * MAX_N_LENGTH);
	memset(rsa, 0, 4 * MAX_N_LENGTH);
	memset(rsaDec, 0, 4 * MAX_N_LENGTH);
	memset(org_data, 0, sizeof(org_data));

	memcpy(tmp_cmn_buff, N, sizeof(u32) * MAX_N_LENGTH);
	nn_encode((uint8*)&N[0], (uint16)(sizeof(u32) * MAX_N_LENGTH), (uint32*)tmp_cmn_buff,(uint16) MAX_N_LENGTH);
	memcpy(tmp_cmn_buff, D, sizeof(u32) * MAX_N_LENGTH);
	nn_encode((uint8*)&D[0], (uint16)(sizeof(u32) * MAX_N_LENGTH), (uint32*)tmp_cmn_buff, (uint16)MAX_N_LENGTH);
	memcpy(tmp_cmn_buff, E, sizeof(u32) * MAX_N_LENGTH);
	nn_encode((uint8*)&E[0], (uint16)(sizeof(u32) * MAX_N_LENGTH), (uint32*)tmp_cmn_buff, (uint16)MAX_N_LENGTH);

	key_input[1].bits = 8*sizeof(N);
	memcpy(key_input[1].modulus, N, sizeof(N));
	memcpy(key_input[1].public_exponent, D, sizeof(D));

	org_data[0] = 0xFFFFFFFF;
	org_data[1] = 116;
	org_data[2] = 116;
	org_data[3] = 116;
	org_data[4] = 116;
	org_data[5] = 116;
	org_data[6] = 116;


	ret = crypto_rsa_encrypt((char*)org_data, 7*4, (char*)&key_input, sizeof(key_input), (char*)rsa, &rsa_out_len);
	if(BSP_ERROR == ret)
	{
		security_print("function : %s -- linenum : %d -- retval : %X\n", ret);
		return ret;
	}
	security_print("rsa_out_len : %d\n\n",rsa_out_len);
	for(i = 0; i < rsa_out_len/4; i++)
		security_print("%lx\n", rsa[i]);
	security_print("========================\n");

	key_input[1].bits = 8*sizeof(N);
	memcpy(key_input[1].modulus, N, sizeof(N));
	memcpy(key_input[1].public_exponent, E, sizeof(E));
	ret = crypto_rsa_decrypt((char*)rsa, rsa_out_len, (char*)&key_input, sizeof(key_input), (char*)rsaDec, &rsaDec_out_len);
	if(BSP_ERROR == ret)
	{
		security_print("function : %s -- linenum : %d -- retval : %X\n", ret);
		return ret;
	}

	security_print("rsaDec_out_len : %d\n\n", rsaDec_out_len);
	for(i = 0; i < rsaDec_out_len/4; i++)
		security_print("%lx\n",rsaDec[i]);

	ret = memcmp(org_data, rsaDec, (unsigned) rsaDec_out_len);
	if(BSP_ERROR == ret)
	{
		security_print("function : %s -- linenum : %d -- retval : %X\n", ret);
		return ret;
	}

	return ret;
}
Esempio n. 6
0
File: 2991.c Progetto: zlhsmfj/zoj
int main()
{
	


	int n,cas=0,m,k,flip[90];
	int i,j,tmp[31],flag[31],loca[31],temp,ttt;
	char c,d;
	float t;
	
	/*
freopen("in.txt","r",stdin);*/
	
	scanf("%d",&n);
	while(n--)
	{
		cas++;
		scanf("%d",&m);
		for(i=1;i<=m;i++)
		{
			scanf("%d",&tmp[i]);
			if(tmp[i]>0) flag[i]=1;
			else {flag[i]=-1;tmp[i]*=-1;}
			loca[tmp[i]]=i;
		/*
	printf("%d\n",loca[tmp[i]]);*/
			
		}
		j=1;
	/*
	for(i=1;i<=6;i++)
		{
			printf("loca=%d, tmp=%d, flag=%d\n",loca[i],tmp[i],flag[i]);
		}
		printf("\n");
		rever(loca,tmp,flag,3.5,6);
		for(i=1;i<=6;i++)
		{
			printf("loca=%d, tmp=%d, flag=%d\n",loca[i],tmp[i],flag[i]);
		}*/
	
		
		for(i=m;i>1;i--)
		{
			/*
if(i==5) for(ttt=1;ttt<=6;ttt++)
		{
			printf("loca=%d, tmp=%d, flag=%d\n",loca[ttt],tmp[ttt],flag[ttt]);
		}*/
			if(loca[i]==i&&flag[i]==1) continue;
			t=(loca[i]+1)/2.0;
			flip[j++]=loca[i];
			rever(loca,tmp,flag,t,loca[i]);
			
			if(flag[1]==1) {flag[1]=-1;flip[j++]=1;}
			
			flip[j++]=tmp[1];
			t=(tmp[1]+1)/2.0;
			rever(loca,tmp,flag,t,tmp[1]);

		}
		if(flag[i]==-1) flip[j++]=1;
		printf("%d %d",cas,j-1);
		for(i=1;i<j;i++)
			printf(" %d",flip[i]);
		printf("\n");
		
	}
	return 0;
}