2020牛客多校第一场FJ

最新推荐文章于 2023-08-19 20:22:14 发布

Karmen Yang

最新推荐文章于 2023-08-19 20:22:14 发布

阅读量117

点赞数

分类专栏：补题文章标签：程序设计算法

本文链接：https://blog.csdn.net/qq_44644225/article/details/108144824

版权

补题专栏收录该内容

28 篇文章 0 订阅

订阅专栏

F

判断两个无限循环串大小

/*
* @Author: Admin
* @Date:   2020-07-12 12:07:02
* @Last Modified by:   Admin
* @Last Modified time: 2020-07-12 12:12:41
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> pll;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
ll qpow(ll base, ll n){ll ans = 1; while (n){if (n & 1) ans = ans * base % mod; base = base * base % mod; n >>= 1;} return ans;}
ll gcd(ll a, ll b){return b ? gcd(b, a % b) : a;}
char a[N], b[N];
int judge(int n, int m){
 int x = 0, y = 0;
    int cnt = 0;
    int limit = 3 * max(n, m);
 while (cnt < limit){
        ++ cnt;
  x %= n;
  y %= m;
  if (a[x] < b[y]) return -1;
  else if (a[x] > b[y]) return 1;
  ++ x;
  ++ y;
 }
 return 0;
}
int main()
{
 while (scanf("%s %s", a , b) != EOF){
  int n = strlen(a);
  int m = strlen(b);
  int f = judge(n, m);
  if (f == -1) printf("<\n");
  else if (f == 0) printf("=\n");
  else printf(">\n");
 }
 return 0;
}

J 推公式

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> pll;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
ll qpow(ll base, ll n){ll ans = 1; while (n){if (n & 1) ans = ans * base % mod; base = base * base % mod; n >>= 1;} return ans;}
ll gcd(ll a, ll b){return b ? gcd(b, a % b) : a;}
char a[N], b[N];
int judge(int n, int m){
    int x = 0, y = 0;
    int cnt = 0;
    int limit = 3 * max(n, m);
    while (cnt < limit){
        ++ cnt;
        x %= n;
        y %= m;
        if (a[x] < b[y]) return -1;
        else if (a[x] > b[y]) return 1;
        ++ x;
        ++ y;
    }
    return 0;
}
int main()
{
    while (scanf("%s %s", a , b) != EOF){
        int n = strlen(a);
        int m = strlen(b);
        int f = judge(n, m);
        if (f == -1) printf("<\n");
        else if (f == 0) printf("=\n");
        else printf(">\n");
    }
    return 0;
}