QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#78258 | #5503. Euclidean Algorithm | Crysfly | ML | 0ms | 3384kb | C++11 | 1.1kb | 2023-02-17 15:15:05 | 2023-02-17 15:15:08 |
Judging History
answer
// what is matter? never mind.
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
if(f)x=-x;return x;
}
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
#define maxn 800005
#define inf 0x3f3f3f3f
int n;
map<int,int>mp;
int calc(int n){
if(mp.count(n))return mp[n];
int res=0;
for(int l=1,r;l<=n;l=r+1){
r=n/(n/l);
res+=(r-l+1)*(n/l);
}
return mp[n]=res;
}
int calc1(int n){
int res=0;
for(int l=1,r;l<=n;l=r+1){
r=n/(n/l);
res+=(r-l+1)*calc(n/l-1);
}
return res;
}
void work()
{
// mp.clear();
n=read();
int res=calc1(n);
cout<<res<<'\n';
}
signed main()
{
int T=read();
while(T--)work();
return 0;
}
/*
10 17
3 10 31
G 4G 7G 10G
G 3G 5G 7G 9G
G 2G 3G 4G 5G
4
A
QUERY B
ADD BBABBBBAAB
QUERY B
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3384kb
input:
3 2 5 14
output:
1 9 62
result:
ok 3 lines
Test #2:
score: -100
Memory Limit Exceeded
input:
3 29107867360 65171672278 41641960535