1058
有一个很取巧的办法:stl库中的全排列next_permutation
将s转化为下一个字典序的字符串
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[]) {
int T;
cin >> T;
for(int i = 0; i < T; i++)
{
string s;
cin >> s;
if(is_sorted(s.begin(), s.end(), greater<char>())) s = '0' + s;
next_permutation(s.begin(), s.end());
cout << "case #" << i << ":" << endl << s << endl;
}
return 0;
}
多次函数
又复习了一遍多项式加法的算法……懒得多说,算法不要乱改顺序,附上代码:
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(int argc, const char * argv[]) {
string s;
while(cin >> s)
{
char output[42][42];
for(int i = 0; i < 41; i++)
{
for(int j = 0; j < 41; j++)
{
if(i == 0 && j == 20) output[i][j] = '^';
else if(i == 20 && j == 40) output[i][j] = '>';
else if(i == 20 && j == 20) output[i][j] = '+';
else if(j == 20) output[i][j] = '|';
else if(i == 20) output[i][j] = '-';
else output[i][j] = '.';
}
}
int coef[4] = {0}, sign = 1;
for(int i = 5; i < s.size();)
{
int coe = 0, dim = 0;
if(s[i] == '-')
{
sign = -1;
i++;
}
else if(s[i] == '+')
{
sign = 1;
i++;
}
while(s[i] >= '0' && s[i] <= '9') coe = coe * 10 + s[i++] - '0';
if(s[i] != 'x')
{
coef[0] = coe * sign;
break;
}
if(coe == 0) coe = 1;
coe *= sign;
i++;
if(s[i] != '^')
{
coef[1] = coe;
continue;
}
i++;
dim = s[i] - '0';
coef[dim] = coe;
i++;
}
for(int x = -20; x <= 20; x++)
{
int y = pow(x,3) * coef[3] + pow(x,2) * coef[2] + x * coef[1] + coef[0];
if(y <= 20 && y >= -20) output[20 - y][x + 20] = '*';
}
for(int i = 0; i < 41; i++)
{
for(int j = 0; j < 41; j++) cout << output[i][j];
cout << endl;
}
cout << endl;
}
return 0;
}
幂次转换
不能设数组来储存幂次,因为数据太大了空间不够:不能用自己写的除法来算幂次,因为会超时(……我日)
用pow算能节约时间,但是会有精度问题,我懒得弄明白了(这啥跟啥啊),从2开始循环到sqrt(x),循环的是指数不是底数,这样就可以按照幂的升序输出了。
#include <iostream>
#include <cmath>
using namespace std;
struct num
{
long long power, times = 0;
};
bool cmp(num x, num y)
{
return x.times < y.times;
}
int main(int argc, const char * argv[]) {
int T;
cin >> T;
for(int i = 0; i < T; i++)
{
long long n;
cin >> n;
long long num_max = sqrt(n);
cout << n;
bool F = 0;
for(long long i = 2; i <= num_max; i++)
{
double cnt = pow((double)n, 1.0 / i) + 0.0000001;
if(cnt < 2) break;
if(fabs(cnt - (int)cnt) < 0.00001)
{
F = 1;
cout << '=' << (int)cnt << '^' << i;
}
}
if(!F) cout << " is powerless.";
cout << endl;
}
return 0;
}
n!进制
这道题限制了n!是在10!-1,因此可以暴力解决(因为我不会不暴力的算法啊啊)找到最小的m!,做除法找余数,然后m依次向下递减,继续做除法即可
进制数值和均值
这道题吗……复习一下辗转相除法的算法,然后还要注意输出格式!!!!