PAT 天梯赛 L1-046. 整除光棍 【模拟除法】

题目链接

https://www.patest.cn/contests/gplt/L1-046

思路
用同余定理以及模拟除法。

AC代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <cstdlib>
#include <ctype.h>
#include <numeric>
#include <sstream>

using namespace std;
typedef long long LL;

const double PI  = 3.14159265358979323846264338327;
const double E   = 2.718281828459;  
const double eps = 1e-6;

const int MAXN   = 0x3f3f3f3f;
const int MINN   = 0xc0c0c0c0;
const int maxn   = 1e5 + 5; 
const int MOD    = 1e9 + 7;

int main()
{
    int n;
    cin >> n;
    LL ans;
    int len = 1;
    for (ans = 1; ans < n; ans = ans * 10 + 1)
        len++;
    while (1)
    {
        if (ans % n == 0)
        {
            cout << ans / n;
            break;
        }
        else
        {
            cout << ans / n;
            len++;
            ans %= n;
            ans = ans * 10 + 1;
        }
    }
    cout << " " << len << endl;
}

转载于:https://www.cnblogs.com/Dup4/p/9433266.html