如果是在非常高的并发之下,还是建议用内存数据库redis去实现计数的功能。如果不是那么高的并发,用表实现就可以。DROP TABLE access_counter;CREATE TABLE access_counter( cnt INT UNSIGNED NOT NULL );INSERT INTO access_counter VALUES(0);UPDATE a
思路:直接枚举每个约数的个数,然后乘起来比较codecodecode#include<iostream>#include<cstdio>#include<algorithm>using namespace std;unsigned long long n, ans=1e18, sum;unsigned long long prime[13]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29,