Starry

发表于 更新于 分类于 本文字数： 21 阅读时长 ≈ 1 分钟

死在了c题，从15:00-18:02耗死在那，又是划水的一天。。

发表于 更新于 分类于 本文字数： 155 阅读时长 ≈ 1 分钟

不开long long见祖宗👀

洛谷P1226

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include <stdio.h>

#define LL long long
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "w", stdout)
#define scan(x) scanf("%d", &x)
#define sqr(x) (x) * (x)
#define f(i, a, b) for (int i = a; i <= b; i++)
#define pn(x) printf("%d", x)
#define pr1(x) printf("Case %d: ", x)
#define pn1(x) printf("Case %d:\n", x)
#define pr2(x) printf("Case #%d: ", x)
#define pn2(x) printf("Case #%d:\n", x)
#define lowbit(x) (x & (-x))

int quikpower (int a,int b,int p){
    LL ans = 1, base = a;
    while(b>0){
        if(b&1){
            ans *= base;
            ans %= p;
        }
        base *= base;
        base %= p;
        b >>= 1;
    }
    return (int)ans%p;
}

int main()
{
    int a, b, p;
    scan(a);
    scan(b);
    scan(p);
    printf("%d^%d mod %d=", a, b, p);
    pn(quikpower(a,b,p));
    return 0;
}

发表于 更新于 分类于 本文字数： 251 阅读时长 ≈ 1 分钟

辗转相除法找最大公约数,然后用欧拉筛求出以内的质数与是否除尽来找答案

另好像有其他好方法，数论渣渣😪

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define LL long long
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "w", stdout)
#define scan(x) scanf("%d", &x)
#define f(i, a, b) for (int i = a; i <= b; i++)
#define pn(x) printf("%d", x)
#define lowbit(x) (x & (-x))

int cnt = 0;
void Euler_prime(int n, bool *vis, int *prime)
{
    vis[1] = true;
    for (int i = 2; i <= n; ++i)
    {
        if (!vis[i])
            prime[cnt++] = i;
        for (int j = 0; j < cnt; ++j)
        {
            if (i * prime[j] > n) //判断是否越界
                break;
            vis[i * prime[j]] = true; //筛数
            if (i % prime[j] == 0)
                break;
        }
    }
}

int main()
{
    int n, x, min, max;
    scan(n);
    scan(x);
    min = n < x ? n : x;
    max = n > x ? n : x;
    while (max % min)
    {
        int temp = max % min;
        max = min;
        min = temp;
    }
    if (min == 1)
    {
        printf("-1");
        return 0;
    }
    int *prime = (int *)malloc(sizeof(int) * (min / 2));
    bool *vis = (bool *)malloc(sizeof(bool) * (min + 1));
    memset(vis, 0, sizeof(bool) * (min + 1));
    Euler_prime(min, vis, prime);
    f(i, 0, cnt - 1)
    {
        if ((min / prime[i]) * prime[i] == min)
        {
            pn(min / prime[i]);
            return 0;
        }
    }
    printf("1");
    return 0;
}

发表于 更新于 分类于 本文字数： 123 阅读时长 ≈ 1 分钟 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#include <stdio.h>
#include<string.h>
#include<stdlib.h>

#define LL long long
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "w", stdout)
#define scan(x) scanf("%lld", &x)
#define sqr(x) (x) * (x)
#define f(i, a, b) for (int i = a; i <= b; i++)
#define pn(x) printf("%lld", x)
#define pr1(x) printf("Case %d: ", x)
#define pn1(x) printf("Case %d:\n", x)
#define pr2(x) printf("Case #%d: ", x)
#define pn2(x) printf("Case #%d:\n", x)
#define lowbit(x) (x & (-x))

int main()
{
    LL n, x,min,max;
    scan(n);
    scan(x);
    min = n < x ? n : x;
    max = n > x ? n : x;
    while(max%min){
        int temp = max % min;
        max = min;
        min = temp;
    }
    pn(min);
    return 0;
}

发表于 更新于 分类于 本文字数： 109 阅读时长 ≈ 1 分钟

做这个是真的不快乐，开个sta数组来验证是否重复即是否进入循坏

那个图灵班看来是指望不上了，太懒了。😴

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
int sum (int n)
{ int a=0;
 while(n>0){
 a+=(n%10) *(n%10);
 n /=10;
 }
 return a;
}

bool isHappy(int n){
    int sta[10001];
    memset(sta,0,10001);
   long long  int a=0;
if (n == 1) 
    return 1;
while (n>3){
 if (sum (n)==1)
    return 1;
 else {
     if(sta[sum(n)]==1)
     return 0;
     n=sum(n);
     sta[n]=1;
 }
}
return 0;
}
0%