- 博客(3)
- 收藏
- 关注
RSS订阅原创 递归算法之全排列
#include int a[15]; void swap(int &a,int &b) { int temp; temp=a; a=b; b=temp; } void perm( int a[],int k,int n) { int i; if( k == 1) { for( i = 0; i < n; i++) printf("%d",a[i]);
2014-07-27 21:01:45
540
原创 hartals——UVA 10050
A social research organization has determined a simple set of parameters to simulate the behavior of the political parties of our country. One of the parameters is a positive integer h (called the
2014-07-17 16:57:53
477
原创 Digital Roots——ZOJ 1115
Background The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value
2014-07-17 16:01:43
413
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人