#568124 (C++14) No.1260 たくさんの多項式

• 問題: No.1260 たくさんの多項式
• ユーザー: tada721
• 提出日時: 2020-10-16 23:32:22
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 592 ms / 2,000 ms
• コード長: 6,709 bytes
• コンパイル時間: 962 ms
• コンパイル使用メモリ: 87,488 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-21 00:10:37
• 合計ジャッジ時間: 18,996 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	6 ms; 5,248 KB
testcase_01	AC	7 ms; 5,376 KB
testcase_02	AC	7 ms; 5,376 KB
testcase_03	AC	5 ms; 5,376 KB
testcase_04	AC	4 ms; 5,376 KB
testcase_05	AC	8 ms; 5,376 KB
testcase_06	AC	5 ms; 5,376 KB
testcase_07	AC	8 ms; 5,376 KB
testcase_08	AC	7 ms; 5,376 KB
testcase_09	AC	6 ms; 5,376 KB
testcase_10	AC	8 ms; 5,376 KB
testcase_11	AC	7 ms; 5,376 KB
testcase_12	AC	6 ms; 5,376 KB
testcase_13	AC	8 ms; 5,376 KB
testcase_14	AC	8 ms; 5,376 KB
testcase_15	AC	7 ms; 5,376 KB
testcase_16	AC	5 ms; 5,376 KB
testcase_17	AC	7 ms; 5,376 KB
testcase_18	AC	8 ms; 5,376 KB
testcase_19	AC	8 ms; 5,376 KB
testcase_20	AC	583 ms; 5,376 KB
testcase_21	AC	167 ms; 5,376 KB
testcase_22	AC	516 ms; 5,376 KB
testcase_23	AC	416 ms; 5,376 KB
testcase_24	AC	431 ms; 5,376 KB
testcase_25	AC	346 ms; 5,376 KB
testcase_26	AC	403 ms; 5,376 KB
testcase_27	AC	324 ms; 5,376 KB
testcase_28	AC	567 ms; 5,376 KB
testcase_29	AC	419 ms; 5,376 KB
testcase_30	AC	268 ms; 5,376 KB
testcase_31	AC	425 ms; 5,376 KB
testcase_32	AC	421 ms; 5,376 KB
testcase_33	AC	344 ms; 5,376 KB
testcase_34	AC	548 ms; 5,376 KB
testcase_35	AC	247 ms; 5,376 KB
testcase_36	AC	224 ms; 5,376 KB
testcase_37	AC	429 ms; 5,376 KB
testcase_38	AC	464 ms; 5,376 KB
testcase_39	AC	556 ms; 5,376 KB
testcase_40	AC	421 ms; 5,376 KB
testcase_41	AC	526 ms; 5,376 KB
testcase_42	AC	397 ms; 5,376 KB
testcase_43	AC	559 ms; 5,376 KB
testcase_44	AC	353 ms; 5,376 KB
testcase_45	AC	337 ms; 5,376 KB
testcase_46	AC	320 ms; 5,376 KB
testcase_47	AC	383 ms; 5,376 KB
testcase_48	AC	81 ms; 5,376 KB
testcase_49	AC	291 ms; 5,376 KB
testcase_50	AC	152 ms; 5,376 KB
testcase_51	AC	553 ms; 5,376 KB
testcase_52	AC	189 ms; 5,376 KB
testcase_53	AC	254 ms; 5,376 KB
testcase_54	AC	566 ms; 5,376 KB
testcase_55	AC	588 ms; 5,376 KB
testcase_56	AC	278 ms; 5,376 KB
testcase_57	AC	398 ms; 5,376 KB
testcase_58	AC	247 ms; 5,376 KB
testcase_59	AC	420 ms; 5,376 KB
testcase_60	AC	592 ms; 5,376 KB

コンパイルメッセージ

main.cpp: In function 'long long int keta(long long int)':
main.cpp:38:1: warning: control reaches end of non-void function [-Wreturn-type]
   38 | }
      | ^
main.cpp: In function 'long long int gcd(long long int, long long int)':
main.cpp:52:1: warning: control reaches end of non-void function [-Wreturn-type]
   52 | }
      | ^
main.cpp: In function 'long long int lcm(long long int, long long int)':
main.cpp:65:1: warning: control reaches end of non-void function [-Wreturn-type]
   65 | }
      | ^
main.cpp: In function 'int main()':
main.cpp:13:33: warning: 'second' may be used uninitialized [-Wmaybe-uninitialized]
   13 | #define rep(s,i,n) for(int i=s;i<n;i++)
      |                                 ^
main.cpp:21:11: note: 'second' was declared here
   21 | #define s second
      |           ^~~~~~
main.cpp:324:13: note: in expansion of macro 's'
  324 |         int s;
      |             ^

ソースコード

#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
#include<deque>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#define dc(d) double d;cin>>d;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c,a,b) *min_element(c+a,c+b)
#define maxi(c,a,b) *max_element(c+a,c+b)
#define pi 3.141592653589793238462643383279
#define e_ 2.718281828459045235360287471352
#define P pair<int,int>
#define upp(a,n,x) upper_bound(a,a+n,x)-a;
#define low(a,n,x) lower_bound(a,a+n,x)-a;
#define UF UnionFind 
//printf("%.12Lf\n",);
int keta(int x) {
	rep(0, i, 30) {
		if (x < 10) {
			return i + 1;
		}
		x = x / 10;
	}
}
int gcd(int x, int y) {
	if (x == 0 || y == 0)return x + y;
	int aa = x, bb = y;
	rep(0, i, 1000) {
		aa = aa % bb;
		if (aa == 0) {
			return bb;
		}
		bb = bb % aa;
		if (bb == 0) {
			return aa;
		}
	}
}
int lcm(int x, int y) {
	int aa = x, bb = y;
	rep(0, i, 1000) {
		aa = aa % bb;
		if (aa == 0) {
			return x / bb * y;
		}
		bb = bb % aa;
		if (bb == 0) {
			return x / aa * y;
		}
	}
}
int integer(double d){
	return long(d);
}	
int distance(double a,double b,double c,double d){
	return sqrt((b-a)*(b-a)+(c-d)*(c-d));
}
bool prime(int x) {
	if (x == 1)return false;
	rep(2, i, sqrt(x) + 1) {
		if (x % i == 0 && x != i) {
			return false;
		}
	}
	return true;
}
int max(int a, int b) {
	if (a >= b)return a;
	else return b;
}
string maxst(string s, string t) {
	int n = s.size();
	int m = t.size();
	if (n > m)return s;
	else if (n < m)return t;
	else {
		rep(0, i, n) {
			if (s[i] > t[i])return s;
			if (s[i] < t[i])return t;
		}
		return s;
	}
}
int min(int a, int b) {
	if (a >= b)return b;
	else return a;
}
int n2[60];
int nis[60];
int nia[60];
int mody[60];
int nn;
int com(int n, int y) {
	int ni = 1;
	for (int i = 0;i < 59;i++) {
		n2[i] = ni;
		ni *= 2;
	}
	int bunsi = 1, bunbo = 1;
	rep(0, i, y)bunsi = (bunsi * (n - i)) % mod;
	rep(0, i, y)bunbo = (bunbo * (i + 1)) % mod;
	mody[0] = bunbo;
	rep(1, i, 59) {
		bunbo = (bunbo * bunbo) % mod;
		mody[i] = bunbo;
	}
	rep(0, i, 59)nis[i] = 0;
	nn = mod - 2;
	for (int i = 58;i >= 0;i -= 1) {
		if (nn > n2[i]) {
			nis[i]++;
			nn -= n2[i];
		}
	}
	nis[0]++;
	rep(0, i, 59) {
		if (nis[i] == 1) {
			bunsi = (bunsi * mody[i]) % mod;
		}
	}
	return bunsi;
}
int newcom(int n,int y){
	int bunsi = 1, bunbo = 1;
	rep(0, i, y){
		bunsi = (bunsi * (n - i)) ;
		bunbo = (bunbo * (i + 1)) ;
		int k=gcd(bunsi,bunbo);
		bunsi/=k;
		bunbo/=k;
	}	
	return bunsi/bunbo;
}	
int gyakugen(int n, int y) {
	int ni = 1;
	for (int i = 0;i < 59;i++) {
		n2[i] = ni;
		ni *= 2;
	}
	mody[0] = y;
	rep(1, i, 59) {
		y = (y * y) % mod;
		mody[i] = y;
	}
	rep(0, i, 59)nis[i] = 0;
	nn = mod - 2;
	for (int i = 58;i >= 0;i -= 1) {
		if (nn > n2[i]) {
			nis[i]++;
			nn -= n2[i];
		}
	}
	nis[0]++;
	rep(0, i, 59) {
		if (nis[i] == 1) {
			n = (n * mody[i]) % mod;
		}
	}
	return n;
}
int yakuwa(int n) {
	int sum = 0;
	rep(1, i, sqrt(n + 1)) {
		if (n % i == 0)sum += i + n / i;
		if (i * i == n)sum -= i;
	}
	return sum;
}
int poow(int y, int n) {
	if (n == 0)return 1;
	n -= 1;
	int ni = 1;
	for (int i = 0;i < 58;i++) {
		n2[i] = ni;
		ni *= 2;
	}
	int yy = y;
	mody[0] = yy;
	rep(1, i, 58) {
		yy = (yy * yy) % mod;
		mody[i] = yy;
	}
	rep(0, i, 58)nis[i] = 0;
	nn = n;
	for (int i = 57;i >= 0;i -= 1) {
		if (nn >= n2[i]) {
			nis[i]++;
			nn -= n2[i];
		}
	}
	rep(0, i, 58) {
		if (nis[i] == 1) {
			y = (y * mody[i]) % mod;
		}
	}
	return y;
}
int minpow(int x, int y) {
	int sum = 1;
	rep(0, i, y)sum *= x;
	return sum;
}
int ketawa(int x, int sinsuu) {
	int sum = 0;
	rep(0, i, 100)sum += (x % poow(sinsuu, i + 1)) / (poow(sinsuu, i));
	return sum;
}
int sankaku(int a) {
	if(a%2==0) return a /2*(a+1);
	else return (a+1)/2*a;
}
int sames(int a[1111111], int n) {
	int ans = 0;
	rep(0, i, n) {
		if (a[i] == a[i + 1]) {
			int j = i;
			while (a[j + 1] == a[i] && j <= n - 2)j++;
			ans += sankaku(j - i);
			i = j;
		}
	}
	return ans;
}
using Graph = vector<vector<int>>;
int oya[114514];
int depth[114514];
void dfs(const Graph& G, int v, int p, int d) {
	depth[v] = d;
	oya[v] = p;
	for (auto nv : G[v]) {
		if (nv == p) continue; // nv が親 p だったらダメ
		dfs(G, nv, v, d + 1); // d を 1 増やして子ノードへ
	}
}
/*int H=10,W=10;
char field[10][10];
char memo[10][10];
void dfs(int h, int w) {
	memo[h][w] = 'x';

	// 八方向を探索
	for (int dh = -1; dh <= 1; ++dh) {
		for (int dw = -1; dw <= 1; ++dw) {
			if(abs(0-dh)+abs(0-dw)==2)continue;
			int nh = h + dh, nw = w + dw;

			// 場外アウトしたり、0 だったりはスルー
			if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
			if (memo[nh][nw] == 'x') continue;

			// 再帰的に探索
			dfs(nh, nw);
		}
	}
}*/
int XOR(int a, int b) {
	if (a == 0 || b == 0) {
		return a + b;
	}
	int ni = 1;
	rep(0, i, 41) {
		n2[i] = ni;
		ni *= 2;
	}
	rep(0, i, 41)nis[i] = 0;
	for (int i = 40;i >= 0;i -= 1) {
		if (a >= n2[i]) {
			nis[i]++;
			a -= n2[i];
		}
		if (b >= n2[i]) {
			nis[i]++;
			b -= n2[i];
		}
	}
	int sum = 0;
	rep(0, i, 41)sum += (nis[i] % 2 * n2[i]);
	return sum;
}
//int ma[1024577][21];
//for(int bit=0;bit<(1<<n);bit++)rep(0,i,n)if(bit&(1<<i))ma[bit][i]=1;
struct UnionFind {
	vector<int> par; // par[i]:iの親の番号　(例) par[3] = 2 : 3の親が2
 
	UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
		for (int i = 0; i < N; i++) par[i] = i;
	}
 
	int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
		if (par[x] == x) return x;
		return par[x] = root(par[x]);
	}
 
	void unite(int x, int y) { // xとyの木を併合
		int rx = root(x); //xの根をrx
		int ry = root(y); //yの根をry
		if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
		par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
	}
 
	bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
		int rx = root(x);
		int ry = root(y);
		return rx == ry;
	}
};
signed main(){
	ic(n)
	int sum=0;
	int s;
	rep(0,i,10000000){
		if(i*i+i>n){
			s=i;
			break;
		}
	}
	rep(1,i,s){
		int l=n/i,r=n/(i+1)+1;
		int a=n%l,b=n%r;
		sum+=gyakugen(((a+b)%mod*((l-r+1)%mod))%mod,2);
		sum+=i*(l-r+1);
		sum%=mod;
	}
	int t=2;
	while(t*t<=n){
		int l=1;
		int cnt=1;
		while(l<=n){
			l*=t;
			cnt++;
		}
		int k=1;
		rep(0,i,cnt){
			sum+=(n%k*t)/k;
			k*=t;
		}
		sum%=mod;
		t++;
	}
	c(sum)
}