QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#757555#9248. An Easy Math ProblemsilvickyTL 1ms3652kbC++141.2kb2024-11-17 10:32:212024-11-17 10:32:21

Judging History

This is the latest submission verdict.

  • [2024-11-17 10:32:21]
  • Judged
  • Verdict: TL
  • Time: 1ms
  • Memory: 3652kb
  • [2024-11-17 10:32:21]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;

#define C const
#define CE constexpr
#define SC static
#define TL template
#define TN typename
#define OP operator
#define pb push_back
#define ft first
#define sd second
#define mi (l+(l+r)/2)
#define TTT TL<TN T>
#define BE(v) v.begin(), v.end()
#define VD void
#define I int
#define LL long long
#define STR string
using PII = pair<I,I>;
TTT using V = vector<T>;

#define FORX(v) for(auto& x:v)
#define FOR(i,b,e) for(I i = b, _e = e;i<_e;++i)
#define FORR(i,b,e) for(I i = b, _e = e;i>_e;--i)
#define FUNC(T,f,...) function<T(__VA_ARGS__)> f = [&](__VA_ARGS__)->T

TTT VD setmin(T& a, C T& b){if(b<a)a=b;}
TTT VD setmax(T& a, C T& b){if(a<b)a=b;}

VD test()
{
    LL n, ans = 1;cin>>n;

    for(I i = 2, j = 0;i*i<=n;++i,j=0)
    {
        while(!(n%i))n/=i,++j;
        if(j)ans*=j*2+1;
    }
    if(n>1)ans*=1*2+1;

    cout<<(ans+1)/2<<'\n';
}

I main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    if(fopen("test.in","r"))
    {
        freopen("test.in","r",stdin);
        freopen("test.out","w",stdout);
    }
    I t = 1;
    cin>>t;
    while(t--)test();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3652kb

input:

10
1
2
3
4
5
6
7
8
9
10

output:

1
2
2
3
2
5
2
4
3
5

result:

ok 10 lines

Test #2:

score: 0
Accepted
time: 1ms
memory: 3600kb

input:

2000
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
6469693230
646969323...

output:

29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
29525
...

result:

ok 2000 lines

Test #3:

score: -100
Time Limit Exceeded

input:

2000
1763047095
79735483
1016286871
2864801397
2327774116
2668010360
3469893354
3634459021
1613699068
781737219
574741575
2763134701
1458502604
1822260248
2281150332
2924219311
2493931196
3735904708
158802001
2006921221
729928782
1974841034
727412600
2873393292
1291087179
2741607663
1893408215
29827...

output:


result: