liuzhan214的博客

Description You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*…*N. For example, 5! = 120, 120 contains one zero

A Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C)statement;I.e., a loop which starts by setting variable to value A and while varia

数论 需要细心，模拟过程就可以了，注意给出的字符串有前导0，需要去前导0#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; typedef long long LL; const int maxn = 50; char s1[maxn],s2[maxn]

题目链接 花了半个小时来画图，最后发现只要把输入的数据正反输出就可以了…#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; typedef long long LL;int main() { int T,cas = 1; scanf("%