SCU2016-05 R题数学模拟

最新推荐文章于 2021-03-17 20:31:12 发布

羁绊残阳

最新推荐文章于 2021-03-17 20:31:12 发布

阅读量297

点赞数

分类专栏： ACM_数学类 ACM_模拟

本文链接：https://blog.csdn.net/jibancanyang/article/details/51907067

版权

ACM_模拟同时被 2 个专栏收录

53 篇文章 0 订阅

订阅专栏

ACM_数学类

15 篇文章 0 订阅

订阅专栏

Analyse:
这个题就是模拟除法的过程,标记被除数第二次出现的位置即可.
Get:
写的时候思路迁移到正确的简洁思路用时过长,迁移到之后写的时间过长,不能边写边完善思路,在纸上写好才是对的.

/**********************jibancanyang**************************
 *Author*        :jibancanyang
 *Created Time*  : ¶þ  7/ 5 15:44:46 2016
**Problem**:

**Code**:
***********************1599664856@qq.com**********************/

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <stack>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
#define pr(x) cout << #x << ": " << x << "  "
#define pl(x) cout << #x << ": " << x << endl;
#define pri(a) printf("%d\n",(a))
#define xx first
#define yy second
#define sa(n) scanf("%d", &(n))
#define sal(n) scanf("%lld", &(n))
#define sai(n) scanf("%I64d", &(n))
#define vep(c) for(decltype((c).begin() ) it = (c).begin(); it != (c).end(); it++)
const int mod = int(1e9) + 7, INF = 0x3f3f3f3f;
const int maxn = 2e3 + 13;
int vis[int(1e7) + 15];

int main(void)
{
    int T; sa(T);
    //for (int i = 9; i <= 30; i++) printf("%d %.14f\n",i,  1 / double(i));
    while (T--) {
        int n; sa(n);
        memset(vis, -1, sizeof(int) * (n + 10));
        int cur = 1, cnt = 0;
        if (n == 1) {
            puts("0 0");
            continue;
        }
        vis[1] = cnt++;
        while (true) {
            bool ok = false;
            while (cur < n) {
                cur *= 10;
                if (cur >= n) break;
                if (vis[cur] != -1) {
                    ok = true;
                    printf("%d %d\n", vis[cur], cnt - vis[cur]);
                    break;
                }
               // pr(cur), pl(cnt);
                vis[cur] = cnt++;
            }
            if (ok) break;
            cur = cur % n;
            if (cur == 0) {
                printf("%d 0\n", cnt);
                break;
            }
            if (vis[cur] != -1) {
                printf("%d %d\n", vis[cur], cnt - vis[cur]);
                break;
            } else vis[cur] = cnt;
             //pr(cur), pl(cnt);
             cnt++;
        }
    }
    return 0;
}