Submission #3414537
Source Code Expand
#if 0
cat <<EOF >mistaken-paste
#endif
// thanks for @rsk0315_h4x
#pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
#include <time.h>
#define BIG 2000000007
#define VERYBIG 2000000000000007LL
#define MOD 1000000007
#define FOD 998244353
typedef uint64_t ull;
typedef int64_t sll;
#define N_MAX 1000000
#ifdef __cplusplus
#include <queue>
#include <stack>
#include <tuple>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <functional>
#include <array>
using std::queue;
using std::priority_queue;
using std::stack;
using std::tuple;
using std::set;
using std::map;
using std::vector;
using std::greater;
using std::pair;
using std::string;
#endif
typedef struct {
int32_t a;
int32_t b;
} hw;
typedef struct {
sll a;
sll b;
} hwll;
typedef struct {
sll a;
sll b;
sll c;
} hwllc;
typedef struct {
hwll a;
hwll b;
} linell;
ull n, m;
ull h, w;
ull k;
ull q;
sll va, vb, vc, vd, ve, vf;
ull ua, ub, uc, ud, ue, uf;
long double vra, vrb, vrc;
double vda, vdb, vdc;
char ch, dh;
ull umin (ull x, ull y) {
return (x < y) ? x : y;
}
ull umax (ull x, ull y) {
return (x > y) ? x : y;
}
sll smin (sll x, sll y) {
return (x < y) ? x : y;
}
sll smax (sll x, sll y) {
return (x > y) ? x : y;
}
ull gcd (ull x, ull y) {
if (x < y) {
return gcd(y, x);
} else if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
ull bitpow (ull a, ull x, ull modulo) {
ull result = 1;
while (x) {
if (x & 1) {
result *= a;
result %= modulo;
}
x /= 2;
a = (a * a) % modulo;
}
return result;
}
ull divide (ull a, ull b, ull modulo) {
return (a * bitpow(b, modulo - 2, modulo)) % modulo;
}
ull udiff (ull a, ull b) {
if (a >= b) {
return a - b;
} else {
return b - a;
}
}
sll sdiff (sll a, sll b) {
if (a >= b) {
return a - b;
} else {
return b - a;
}
}
int bitcount (ull n) {
int result = 0;
while (n) {
if (n & 1) result++;
n /= 2;
}
return result;
}
// double distance (sll x1, sll y1, sll x2, sll y2) {
// double xdist2, ydist2, origindist, dist;
// xdist2 = (x1 - x2) * (x1 - x2);
// ydist2 = (y1 - y2) * (y1 - y2);
// return sqrt(xdist2 + ydist2);
// }
int32_t pullcomp (const void *left, const void *right) {
ull l = *(ull*)left;
ull r = *(ull*)right;
if (l < r) {
return -1;
}
if (l > r) {
return +1;
}
return 0;
}
int32_t prevcomp (const void *left, const void *right) {
ull l = *(ull*)left;
ull r = *(ull*)right;
if (l > r) {
return -1;
}
if (l < r) {
return +1;
}
return 0;
}
int32_t psllcomp (const void *left, const void *right) {
sll l = *(sll*)left;
sll r = *(sll*)right;
if (l < r) {
return -1;
}
if (l > r) {
return +1;
}
return 0;
}
int32_t pcharcomp (const void *left, const void *right) {
char l = *(char*)left;
char r = *(char*)right;
if (l < r) {
return -1;
}
if (l > r) {
return +1;
}
return 0;
}
int32_t pdoublecomp (const void *left, const void *right) {
double l = *(double*)left;
double r = *(double*)right;
if (l < r) {
return -1;
}
if (l > r) {
return +1;
}
return 0;
}
int32_t pstrcomp (const void *left, const void *right) {
char* l = *(char**)left;
char* r = *(char**)right;
return strcmp(l, r);
}
int32_t phwllABcomp (const void *left, const void *right) {
hwll l = *(hwll*)left;
hwll r = *(hwll*)right;
if (l.a < r.a) {
return -1;
}
if (l.a > r.a) {
return +1;
}
if (l.b < r.b) {
return -1;
}
if (l.b > r.b) {
return +1;
}
return 0;
}
int32_t phwllREVcomp (const void *left, const void *right) {
hwll l = *(hwll*)left;
hwll r = *(hwll*)right;
if (l.b < r.b) {
return -1;
}
if (l.b > r.b) {
return +1;
}
if (l.a < r.a) {
return -1;
}
if (l.a > r.a) {
return +1;
}
return 0;
}
int32_t ptriplecomp (const void *left, const void *right) {
hwllc l = *(hwllc*)left;
hwllc r = *(hwllc*)right;
if (l.a < r.a) {
return -1;
}
if (l.a > r.a) {
return +1;
}
if (l.b < r.b) {
return -1;
}
if (l.b > r.b) {
return +1;
}
if (l.c < r.c) {
return -1;
}
if (l.c > r.c) {
return +1;
}
return 0;
}
int32_t ptripleREVcomp (const void *left, const void *right) {
hwllc l = *(hwllc*)left;
hwllc r = *(hwllc*)right;
if (l.b < r.b) {
return -1;
}
if (l.b > r.b) {
return +1;
}
if (l.a < r.a) {
return -1;
}
if (l.a > r.a) {
return +1;
}
if (l.c < r.c) {
return -1;
}
if (l.c > r.c) {
return +1;
}
return 0;
}
int32_t pquadcomp (const void *left, const void *right) {
linell l = *(linell*)left;
linell r = *(linell*)right;
sll ac = phwllABcomp(&(l.a), &(r.a));
if (ac) return ac;
sll bc = phwllABcomp(&(l.b), &(r.b));
if (bc) return bc;
return 0;
}
bool isinrange (sll left, sll x, sll right) {
return (left <= x && x <= right);
}
bool isinrange_soft (sll left, sll x, sll right) {
return (left <= x && x <= right) || (left >= x && x >= right);
}
sll a[N_MAX];
// ull a[N_MAX];
// sll a[3001][3001];
sll b[N_MAX];
// sll b[3001][3001];
sll c[N_MAX];
// sll d[N_MAX];
// sll e[N_MAX];
// char s[N_MAX + 1];
char s[3010][3010];
char t[N_MAX + 1];
// char t[3010][3010];
hwll xy[N_MAX];
hwllc tup[N_MAX];
sll table[3000][3000];
// here we go
ull dsor[N_MAX], dlen = 0;
ull pdiv[2][N_MAX];
ull sm[2][N_MAX];
ull exsum[2][N_MAX];
ull cp (ull x) {
ull r = 0;
for (ull i = 2; i * i <= x; i++) {
while (x % i == 0) {
r++;
x /= i;
}
}
return r + ((x > 1) ? 1 : 0);
}
ull solve () {
sll i, j, ki, li;
// ull result = 0;
sll result = 0;
double dresult = 0;
// ull maybe = 0;
sll maybe = 0;
// ull sum = 0;
sll sum = 0;
sll item;
ull *dpcell;
for (i = 1; i * i <= k; i++) {
if (k % i) continue;
dsor[dlen++] = i;
}
ull lhalf = dsor[dlen - 1];
for (i = dlen - 1; i >= 0; i--) {
if (dsor[i] * dsor[i] == k) continue;
dsor[dlen++] = k / dsor[i];
}
for (i = dlen - 1; i >= 0; i--) {
ull d = dsor[i];
ull xi = ((d > lhalf) ? 1 : 0), xj = ((d > lhalf) ? k / d : d);
sm[xi][xj] = d * (((n / d) * (n / d + 1) / 2) % MOD) % MOD;
pdiv[xi][xj] = cp(d);
exsum[xi][xj] = sm[xi][xj];
for (j = i + 1; j < dlen; j++) {
ull e = dsor[j];
if (e % d) continue;
ull yi = ((e > lhalf) ? 1 : 0), yj = ((e > lhalf) ? k / e : e);
// if ((pdiv[yi][yj] - pdiv[xi][xj]) % 2) {
// exsum[xi][xj] += (MOD - sm[yi][yj]);
// exsum[xi][xj] %= MOD;
// } else {
// exsum[xi][xj] += sm[yi][yj];
// exsum[xi][xj] %= MOD;
// }
exsum[xi][xj] = (exsum[xi][xj] + MOD - exsum[yi][yj]) % MOD;
}
// printf("%lld: sm %llu pdiv %llu exsum %llu\n", d, sm[xi][xj], pdiv[xi][xj], exsum[xi][xj]);
result = (result + divide(exsum[xi][xj], d, MOD)) % MOD;
// printf("+%lld -> %llu\n", divide(exsum[xi][xj], d, MOD), result);
}
result = (result * k) % MOD;
printf("%lld\n", result);
// printf("%.15lf\n", dresult);
// puts(s);
return 0;
success:
// puts("YES");
puts("Yes");
// printf("%llu\n", result);
// puts("0");
// puts("Yay!");
return 0;
fail:
// puts("NO");
// puts("No");
// puts("0");
puts("-1");
// puts("-1 -1 -1");
// puts("Impossible");
return 1;
}
int32_t main (void) {
int32_t i, j;
int32_t x, y;
// scanf("%llu%llu", &h, &w);
scanf("%llu", &n, &m);
scanf("%llu", &k, &n, &m);
// scanf("%llu%llu", &h, &w);
// scanf("%lld%lld", &va, &vb, &vc, &vd);
// scanf("%llu%llu", &ua, &ub, &uc, &ud);
// scanf("%llu", &q);
// scanf("%s", s);
// scanf("%s", t);
// for (i = 0; i < n; i++) {
// // scanf("%lld%lld", &xy[i].a, &xy[i].b);
// // scanf("%lld%lld%lld", &tup[i].a, &tup[i].b, &tup[i].c);
// scanf("%lld", &a[i]);
// scanf("%lld", &b[i]);
// // scanf("%lld", &c[i]);
// // scanf("%lld", &d[i]);
// // a[i]--;
// // b[i]--;
// // c[i]--;
// // tup[i].a--;
// // tup[i].b--;
// }
// scanf("%llu", &m, &k);
// scanf("%llu", &q);
// scanf("%s", s);
// for (i = 0; i < m; i++) {
// scanf("%lld", &b[i]);
// // b[i]--;
// }
// for (i = 0; i < h; i++) {
// for (j = 0; j < w; j++) {
// scanf("%llu", &table[i][j]);
// }
// }
// // for (i = 0; i < h; i++) {
// scanf("%s", &s[i]);
// }
solve();
return 0;
}
Submission Info
Submission Time
2018-10-15 22:37:09+0900
Task
D - LCM Rush
User
sheyasutaka
Language
C (GCC 5.4.1)
Score
101
Code Size
8667 Byte
Status
AC
Exec Time
16 ms
Memory
18560 KB
Compile Error
./Main.c: In function ‘solve’:
./Main.c:416:9: warning: format ‘%lld’ expects argument of type ‘long long int’, but argument 2 has type ‘sll {aka long int}’ [-Wformat=]
printf("%lld\n", result);
^
./Main.c: In function ‘main’:
./Main.c:447:8: warning: format ‘%llu’ expects argument of type ‘long long unsigned int *’, but argument 2 has type ‘ull * {aka long unsigned int *}’ [-Wformat=]
scanf("%llu", &n, &m);
^
./Main.c:447:8: warning: too many arguments for format [-Wformat-extra-args]
./Main.c:448:8: warning: format ‘%llu’ expects argument of type ‘long long unsigned int *’, but argument 2 has type ‘ull * {aka long unsigned int *}’ [-Wformat=]
scanf("%llu", &k, &n, &m);
^
./Main.c:448:8: warning: too many arguments for format [-Wformat-extra-args]
./Main.c:447:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%llu", &n, &m);
^
./Main.c:448:2: warning: ignoring return value of ‘scanf’, declared with attribut...
Judge Result
Set Name
Sample
Subtask1
Subtask2
Subtask3
Subtask4
Score / Max Score
0 / 0
5 / 5
10 / 10
85 / 85
1 / 1
Status
Set Name
Test Cases
Sample
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
Subtask1
subtask0_sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Subtask2
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt
Subtask3
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask3_31.txt, subtask3_32.txt, subtask3_33.txt, subtask3_34.txt, subtask3_35.txt, subtask3_36.txt, subtask3_37.txt, subtask3_38.txt, subtask3_39.txt, subtask3_40.txt, subtask3_41.txt, subtask3_42.txt, subtask3_43.txt, subtask3_44.txt, subtask3_45.txt
Subtask4
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask3_31.txt, subtask3_32.txt, subtask3_33.txt, subtask3_34.txt, subtask3_35.txt, subtask3_36.txt, subtask3_37.txt, subtask3_38.txt, subtask3_39.txt, subtask3_40.txt, subtask3_41.txt, subtask3_42.txt, subtask3_43.txt, subtask3_44.txt, subtask3_45.txt, subtask4_46.txt, subtask4_47.txt, subtask4_48.txt, subtask4_49.txt, subtask4_50.txt, subtask4_51.txt, subtask4_52.txt, subtask4_53.txt, subtask4_54.txt, subtask4_55.txt, subtask4_56.txt, subtask4_57.txt, subtask4_58.txt, subtask4_59.txt, subtask4_60.txt, subtask4_61.txt, subtask4_62.txt, subtask4_63.txt, subtask4_64.txt, subtask4_65.txt, subtask4_66.txt, subtask4_67.txt, subtask4_68.txt, subtask4_69.txt, subtask4_70.txt, subtask4_71.txt, subtask4_72.txt, subtask4_73.txt, subtask4_74.txt, subtask4_75.txt, subtask4_76.txt, subtask4_77.txt, subtask4_78.txt, subtask4_79.txt, subtask4_80.txt, subtask4_81.txt, subtask4_82.txt, subtask4_83.txt, subtask4_84.txt, subtask4_85.txt
Case Name
Status
Exec Time
Memory
subtask0_sample_01.txt
AC
4 ms
16512 KB
subtask0_sample_02.txt
AC
3 ms
16512 KB
subtask0_sample_03.txt
AC
3 ms
16512 KB
subtask0_sample_04.txt
AC
4 ms
18560 KB
subtask1_01.txt
AC
2 ms
10368 KB
subtask1_02.txt
AC
4 ms
16512 KB
subtask1_03.txt
AC
2 ms
10368 KB
subtask1_04.txt
AC
3 ms
16512 KB
subtask1_05.txt
AC
4 ms
16512 KB
subtask1_06.txt
AC
4 ms
16512 KB
subtask1_07.txt
AC
4 ms
16512 KB
subtask1_08.txt
AC
3 ms
16512 KB
subtask1_09.txt
AC
4 ms
16512 KB
subtask1_10.txt
AC
3 ms
16512 KB
subtask1_11.txt
AC
4 ms
16512 KB
subtask1_12.txt
AC
4 ms
16512 KB
subtask1_13.txt
AC
3 ms
16512 KB
subtask1_14.txt
AC
3 ms
16512 KB
subtask1_15.txt
AC
3 ms
16512 KB
subtask2_16.txt
AC
2 ms
10368 KB
subtask2_17.txt
AC
3 ms
16512 KB
subtask2_18.txt
AC
4 ms
16512 KB
subtask2_19.txt
AC
4 ms
16512 KB
subtask2_20.txt
AC
3 ms
16512 KB
subtask2_21.txt
AC
3 ms
16512 KB
subtask2_22.txt
AC
3 ms
16512 KB
subtask2_23.txt
AC
3 ms
16512 KB
subtask2_24.txt
AC
4 ms
16512 KB
subtask2_25.txt
AC
4 ms
16512 KB
subtask2_26.txt
AC
4 ms
16512 KB
subtask2_27.txt
AC
4 ms
16512 KB
subtask2_28.txt
AC
4 ms
16512 KB
subtask2_29.txt
AC
3 ms
16512 KB
subtask2_30.txt
AC
3 ms
16512 KB
subtask3_31.txt
AC
2 ms
10368 KB
subtask3_32.txt
AC
3 ms
16512 KB
subtask3_33.txt
AC
3 ms
16512 KB
subtask3_34.txt
AC
3 ms
16512 KB
subtask3_35.txt
AC
4 ms
16512 KB
subtask3_36.txt
AC
3 ms
16512 KB
subtask3_37.txt
AC
3 ms
16512 KB
subtask3_38.txt
AC
3 ms
16512 KB
subtask3_39.txt
AC
3 ms
16512 KB
subtask3_40.txt
AC
3 ms
16512 KB
subtask3_41.txt
AC
3 ms
16512 KB
subtask3_42.txt
AC
3 ms
16512 KB
subtask3_43.txt
AC
4 ms
16512 KB
subtask3_44.txt
AC
3 ms
16512 KB
subtask3_45.txt
AC
3 ms
16512 KB
subtask4_46.txt
AC
4 ms
18560 KB
subtask4_47.txt
AC
4 ms
18560 KB
subtask4_48.txt
AC
16 ms
18560 KB
subtask4_49.txt
AC
16 ms
18560 KB
subtask4_50.txt
AC
16 ms
18560 KB
subtask4_51.txt
AC
16 ms
18560 KB
subtask4_52.txt
AC
16 ms
18560 KB
subtask4_53.txt
AC
16 ms
18560 KB
subtask4_54.txt
AC
11 ms
18560 KB
subtask4_55.txt
AC
11 ms
18560 KB
subtask4_56.txt
AC
11 ms
18560 KB
subtask4_57.txt
AC
11 ms
18560 KB
subtask4_58.txt
AC
11 ms
18560 KB
subtask4_59.txt
AC
11 ms
18560 KB
subtask4_60.txt
AC
4 ms
16512 KB
subtask4_61.txt
AC
4 ms
16512 KB
subtask4_62.txt
AC
4 ms
16512 KB
subtask4_63.txt
AC
4 ms
18560 KB
subtask4_64.txt
AC
13 ms
18560 KB
subtask4_65.txt
AC
15 ms
18560 KB
subtask4_66.txt
AC
15 ms
18560 KB
subtask4_67.txt
AC
13 ms
18560 KB
subtask4_68.txt
AC
8 ms
16512 KB
subtask4_69.txt
AC
8 ms
16512 KB
subtask4_70.txt
AC
3 ms
16512 KB
subtask4_71.txt
AC
3 ms
16512 KB
subtask4_72.txt
AC
3 ms
16512 KB
subtask4_73.txt
AC
4 ms
16512 KB
subtask4_74.txt
AC
4 ms
16512 KB
subtask4_75.txt
AC
4 ms
16512 KB
subtask4_76.txt
AC
4 ms
16512 KB
subtask4_77.txt
AC
4 ms
16512 KB
subtask4_78.txt
AC
3 ms
16512 KB
subtask4_79.txt
AC
3 ms
16512 KB
subtask4_80.txt
AC
4 ms
16512 KB
subtask4_81.txt
AC
3 ms
16512 KB
subtask4_82.txt
AC
6 ms
16512 KB
subtask4_83.txt
AC
4 ms
16512 KB
subtask4_84.txt
AC
4 ms
16512 KB
subtask4_85.txt
AC
3 ms
16512 KB