Submission #8092308
Source Code Expand
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof a);
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define per(i,a,b) for(int i = a; i >= b; i--)
#define __ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
typedef long long ll;
typedef double db;
const db EPS = 1e-9;
using namespace std;
void dbg() {cout << "\n";}
template<typename T, typename... A> void dbg(T a, A... x) {cout << a << ' '; dbg(x...);}
#define logs(x...) {cout << #x << " -> "; dbg(x);}
int T;
int solve(int n,int x){
int ans = n;
int h1 = x, h2 = n-x;
while(1){
if(h1 == h2) {ans += h1; break;}
if(h1 < h2){
ans += 2*h1;
h2 -= h1;
}
else{
ans += 2*h2;
h1 -= h2;
}
}
T = h1;
return ans;
}
ll gcd(ll x,ll y){
return y == 0 ? x:gcd(y,x%y);
}
ll n,x;
int main()
{
scanf("%lld%lld",&n,&x);
ll ans = (n-1ll)*3ll;
ll thp = gcd(n,x);
ans -= (thp-1ll)*3ll;
printf("%lld\n",ans);
// rep(n,2,100){
// printf("\n");
// rep(x,1,n-1){
// printf("n:%d, x:%d, gcd:%d, ans:%d\n",n,x,gcd(n,x),solve(n,x));
// }
// }
return 0;
}
Submission Info
Submission Time
2019-10-23 12:21:43+0900
Task
B - Mysterious Light
User
vjudge3
Language
C++14 (GCC 5.4.1)
Score
500
Code Size
1041 Byte
Status
AC
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:43:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld",&n,&x);
^
Judge Result
Set Name
Sample
Subtask
All
Score / Max Score
0 / 0
300 / 300
200 / 200
Status
Set Name
Test Cases
Sample
sample-01.txt
Subtask
sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt
All
sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, sample-01.txt
Case Name
Status
Exec Time
Memory
01-01.txt
AC
1 ms
256 KB
01-02.txt
AC
1 ms
256 KB
01-03.txt
AC
1 ms
256 KB
01-04.txt
AC
1 ms
256 KB
01-05.txt
AC
1 ms
256 KB
01-06.txt
AC
1 ms
256 KB
01-07.txt
AC
1 ms
256 KB
01-08.txt
AC
1 ms
256 KB
01-09.txt
AC
1 ms
256 KB
02-01.txt
AC
1 ms
256 KB
02-02.txt
AC
1 ms
256 KB
02-03.txt
AC
1 ms
256 KB
02-04.txt
AC
1 ms
256 KB
02-05.txt
AC
1 ms
256 KB
02-06.txt
AC
1 ms
256 KB
02-07.txt
AC
1 ms
256 KB
02-08.txt
AC
1 ms
256 KB
02-09.txt
AC
1 ms
256 KB
sample-01.txt
AC
1 ms
256 KB