text stringlengths 49 983k |
|---|
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if (a == 0) {
return b;
}
return gcd(b % a, a);
}
int main() {
int p, q;
cin >> p >> q;
while (true) {
int g = gcd(p, q);
if (g == 1) {
break;
}
p /= g;
q /= g;
}
int t = q;
int ans = 1;
for (int i ... |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define first fi;
#define second se;
using namespace std;
typedef pair<int, int> P;
int gcd(int a, int b){
... |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
vector<LLi> pri={1, 2, 3};
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
void PVL(vector<LLi> pvv) {... |
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
using namespace std;
using lli = long long int... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
const double PI = acos(-1);
const ll MOD = 1000000007;
template<class T>
inline bool chmax(T &a, T b... |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... |
#include <bits/stdc++.h>
using namespace std;
int gcd(int x,int y){
if (y==0) return x;
return gcd(y,x%y);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int p,q,r=1; cin >> p >> q;
q/=gcd(p,q);
for (int i=2;i*i<=q;++i){
if (q%i==0){
r*=i;
while(q%i=... |
#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<sstream>
#include<cmath>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defin... |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
return b ? gcd(b, a % b) : a;
}
int main() {
int p, q;
cin >> p >> q;
p = gcd(p, q);
q /= p;
set<int> s;
for (int i = 2; i <= q;) {
if (i * i > q) {
i = q;
}
if (q % i == 0) {
q /= i;
s.insert(i);
} else {
i++;
}
}
in... |
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll gcd(const ll a, const ll b)
{
if (a == 0 or b == 0) {
return (a == 0) ? b : a;
}
if (a > b) {
return gcd(b, a);
} else {
return gcd(b % a, a);
}
}
constexpr int SQRT = 100000;
bool isprime[... |
#include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)
#define all(a) (a).begin(),(a).end()
#de... |
/* -*- coding: utf-8 -*-
*
* 2706.cc: Let's Solve Geometric Problems
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<n... |
#include<iostream>
using namespace std;
int p,q,ans=1,j;
int so(int n){
for(int i=2;i*i<=n;i++)if(n%i==0)return 1;
return 0;
}
int main(){
cin>>p>>q;
if(so(q)){
for(int i=2;q>=i;i++){
for(j=0;q%i==0;j++){
q/=i;
if(p%i==0)p/=i,j--;
}
if(j==0)continue;
/*if(p%(i*j)==0)p/=(i*j);
e... |
#include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP... |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <c... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i... |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i,n) for(long long i=0;i<n;++i)
#define REPR(i,n) for(long... |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 50;
int solve();
ll gcd(ll p, ll q) {
if (q == 0) { return p; }
return gcd(q, p%q);
}
int main(void) {
while (solve()) {}
return 0;
}
int solve() {
ll p... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for(auto i=(m).beg... |
#include<iostream>
#include<vector>
using namespace std;
int gcd(int a, int b){
if(b==0) return a;
else return gcd(b, a%b);
}
int main(){
int p, q;
cin>> p>> q;
q=q/gcd(p, q);
vector<int> v;
for(int i=2; i*i<=q; i++){
if(q%i==0){
v.push_back(i);
while(q%i... |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
map<long long, int> prime_factorize(long long n) {
map<long long, int> res;
for (long long p = 2; p * p <= n; ++p) {
while (n %... |
#include <iostream>
#include <cmath>
using namespace std;
int gcd(int a,int b){
if(a<b){swap(a,b);}
if(!b){return a;}
return gcd(b,a%b);
}
int main(){
int a=1,p,q,i,gc;
cin>>p>>q;
gc=gcd(p,q);
p/=gc;q/=gc;
for(i=2;i<sqrt(q)+1;i++){
if(!(q%i)){
a*=i;
whil... |
#include<iostream>
#include<algorithm>
using namespace std;
int COU(int a,int b){
if(a==b||a==0)return 1;
while(true){
if(a<b){int t=a;a=b,b=t;}
if(b==0)return a;
a%=b;
}
}
int main(){
int p,q;
cin>>p>>q;
q/=COU(p,q);
for(int i=2;i*i<=q;i++){
while(!(q%(i*i)))q/=i;
}
cout<<q<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
return b ? GCD(b, a%b) : a;
}
int main()
{
int p, q, n, res = 1;
cin >> p >> q;
n = q / GCD(p, q);
for (int i = 2; i < sqrt(n) + 2; i++) {
if (n % i == 0) {
res *= i;
while (n % i == 0) {
n /= i;
}
}
}
res *= n;
if (res == ... |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(a) (a).begin(),(a).end()
using ll = long long;
ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
int main(){
int p, q;
cin>>p>>q;
int g = gcd(q, p);
q /= g;
int res = 1;
for (int i = 2; i*i <= q; ++i) {
if... |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int p, q, mi, ans, temp;
cin >> p >> q;
mi = (p ,q);
while (p%q == 0) {
if (q == 1) break;
p /= q;
q /= q;
}
for (int i = 2; i * i<= mi; i++) {
while (p%i == 0 && q%i == 0) {
p /= i;
q /= i;
}
while (q%(mi/i) == 0 && p... |
#include<bits/stdc++.h>
using namespace std;
int gcd(int p,int q){
return q==0 ? p : gcd(q,p%q);
}
int main(){
int p,q;
while(cin>>p>>q,p){
int g=gcd(p,q);
p/=g;
q/=g;
long long int res=1;
for(int i=2;i<1e5;i++){
if(q%i==0){
res*=i;
... |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
using namespace std;
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
int main(){
int p,q;
cin>>p>>q;
int r=gcd(q,p);
p/=r;q/=r;
int ans=1;
for(int i=2;i*i<=q;i++){
if(q%i!=0)continue;
ans*=i;
... |
#include<stdio.h>
#include<math.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
using namespace std;
int yaku(int n,int m){
if(n%m==0){
return m;
}
return yaku(... |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).su... |
#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;
using ll = long long;
void bunkai(vector<ll> &a,ll x){
ll temp=x;
for(ll i=2;i*i<=x;i++){
if(temp%i==0){
a.push_back(i);
while(temp%i==0){
temp/=i;
}
}
}
a.push_back(temp);
return;
}
ll gcd(ll x,ll y){
if(x%y==0){... |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
using namespace std;
int calc(int x,int y){
if(y == 0){
return x;
}else{
return calc(y,x%y);
}
}
int main(){
int p,q,common,limit;
scanf("%d %d",&... |
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... |
#include <bits/stdc++.h>
using namespace std;
int p, q;
int gcd(int x, int y){
if(x % y == 0) return y;
return gcd(y, x % y);
}
bool prime(int x){
bool f = true;
for(int i=2; i*i<=x; ++i)
if(x % i == 0)
f = false;
return f;
}
int main(){
// cin.tie(0);
// ios::sync_with_stdio(false);
cin >> p >> q;
int g ... |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,j) for(int i = 0; i < j; i++)
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
int main(){
int p1,q;
cin >> p1 >> q;
int t = gcd(p1,q);
q /= t;
vector<int> pl;
pl.push_back(2);
pl.push_back(3);
for(int i = 5; i*i < 1e9; i+=2){
bool f = t... |
#include <bits/stdc++.h>
using namespace std;
int p, q;
int main() {
cin >> p >> q;
vector<int> A = {};
for (int i = 2; i * i <= q; i++) {
if(q % i == 0) {
A.push_back(i);
A.push_back(q / i);
}
}
for (auto i : A) {
while (p % i == 0 and q % i == 0) {
p /= i;
q /= i;
}
}
vector<int> pr ={};
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repp(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#de... |
#include<iostream>
using namespace std;
int p, q; int gcd(int a, int b) { if (b == 0)return a; return gcd(b, a%b); }
int main() {
cin >> p >> q; int res = 1; int r = gcd(p, q); q /= r;
for (int i = 2; i*i <= q; i++) {
if (q%i == 0) { res *= i; while (q%i == 0)q /= i; }
}
if (q >= 2)res *= q;
cout << res << endl;... |
#include<iostream>
using namespace std;
int p,q,ans=1,j;
int so(int n){
for(int i=2;i*i<=n;i++)if(n%i==0)return 1;
return 0;
}
int main(){
cin>>p>>q;
if(so(q)){
for(int i=2;q>=i;i++){
for(j=0;q%i==0;j++){
q/=i;
if(p%i==0)p/=i,j--;
}
if(j==0)continue;
ans*=i;
}
cout<<ans<<... |
#include<bits/stdc++.h>
const int MOD=1000000007;
const int INF=1000000000;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double eps=1e-9;
const int inf=1e9;
typedef pair<int,int> P;
struct Point
{
double x,y;
Point(){x=0;y=0;}
Point(double d_x,double d_y){x=d_x,y=d_y;}
double operato... |
#include<bits/stdc++.h>
using namespace std;
int GCD(int a, int b){
if(b == 0) return a;
else return GCD(b, a % b);
}
int main(){
int p, q;
cin >> p >> q;
q /= GCD(p, q);
map<int, int> mpa;
for(int i = 2; i * i <= q; i++){
while(q % i == 0){
mpa[i]++;
q /= i;
}
}
if(q != 1) mpa[q]++;
map<int, int>... |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <tuple>
#include <cstring>
#include <map>
#include <iomanip>
#include <ctime>
#include <complex>
#include <cassert>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long lon... |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#defi... |
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limit... |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
if (b == 0){
return a;
} else {
return gcd(b, a % b);
}
}
int main(){
int p, q;
cin >> p >> q;
int g = gcd(p, q);
p /= g;
q /= g;
int ans = 1;
for (int i = 2; i * i <= q; i++){
if (q % i == 0){
ans *= i;
whi... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int p, q;
cin >> p >> q;
q /= gcd(p, q);
for (int i = 2; i * i <= q; i++) {
while (q % (i * i) == 0) q /= i;
}
cout << q << endl... |
#include <iostream>
using namespace std;
int gcd(int a, int b)
{
return b == 0 ? a : gcd(b,a%b);
}
int main()
{
int p, q;
cin >> p >> q;
q /= gcd(p,q);
long long int x = 1;
for(int i = 2; i * i <= q; i++){
if(q % i == 0){
x *= i;
while(q % i == 0) q /= i;
}
}
cout << x * q << endl;... |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... |
#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int gcd(int a, int b){
if(b==0) return a;
return gcd(b,a%b);
}
bool isPrime[100000];
typedef pair<int,int> P;
int main(){
int p,q;
cin>>p>>q;
int d = gcd(p,q);
p/=d; q/=d;
// cout<<p<<' '<<q<<endl;
fill(isP... |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
const int M = 1000000007;
int gcd(int a, int b) {
while (b > 0) { int t = a % b; a = b; b = t; }
return a;
}
int main() {
int p, q;
cin >> p >> q;
int g = gcd(p, q);
q /= g;
int ans = 1;
for (int i = 2; i * i <= q; ... |
#include <iostream>
using namespace std;
int gcd(int p,int q){
int r=q%p;
while(r>0){
q=p;
p=r;
r=q%p;
}
return p;
}
int divide(int b,int i){
while(b%(i*i)==0){
b/=i;
}
return b;
}
int main(){
int p,q;
cin>>p>>q;
int b=q/gcd(p,q);
for(int i=2;i*i<=b;i++)
b=divide(b,i);
cou... |
#include<bits/stdc++.h>
using namespace std;
#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE
#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)
int main(){
int p,q;
method(gcd,int,int a,int b){
... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##_cond=(b);i<i##_cond;++i)
int ext_gcd(int a, int b, int &x, int &y){
if(b == 0){
x = 1; y = 0; return a;
}
int q = a / b;
int g = ext_gcd(b, a-q*b, x, y);
int z = x - q * y;
x = y; y = z;
return g;
}
map<int,int> pf(i... |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
long gcd(long a, long b){
if(b == 0)
return a;
return gcd(b, a%b);
}
int main(){
long p, q;
cin >> p >> q;
long tmp = gcd(q, p);
p /= tmp;
q /= tmp;
long ans = 1;
long root = sqrt(q) + 1;
vector<bool> hurui(root, tr... |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
using namespace std;
int main(){
int p,q,pre_limit,limit;
scanf("%d %d",&p,&q);
pre_limit = sqrt(q);
for(int i = 2; i <= pre_limit; i++){
while(p%i ... |
#include<iostream>
using namespace std;
unsigned gcd(unsigned a, unsigned b) {
if(a < b) return gcd(b, a);
unsigned r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
int main(){
long long p,q,t=1,gc;
cin >> p >> q;
gc = gcd(p,q);
p /= gc;
q /= gc;
for(int i=2;i*i<=q;i++){
if(q%i==0){
... |
#include<iostream>
using namespace std;
long gcd(long a,long b){return b?gcd(b,a%b):a;}
long a,b;
int main()
{
cin>>a>>b;
b/=gcd(a,b);
for(long i=2;i*i<=b;i++)
{
while(b%(i*i)<1)b/=i;
}
cout<<b<<endl;
}
|
#include <iostream>
#include <vector>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
using namespace std;
typedef long long ll;
int P, Q;
bool p[1000000];
vector<int> v;
int gcd(int a, int b) {
if(b == 0) return a;
return gcd(b, a % b);
}
bool prime(int n) {
REP(i, 0, v.size()) if(n % v[i] == ... |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int solve(int n) {
int res = 1;
for (int i = 2; i * i <= n; i++) {
if (n % i) continue;
res *= i;
while (n % i == 0) n /= i;
}
if (n != 1) res *= n;
return res;
}
int main(v... |
#include <iostream>
#include <algorithm>
//#include <numeric>
using namespace std;
#define FOR(i,a,b) for (size_t i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (size_t i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define INF 1e7
long gcd(long a, long b)
{
long r;
do {
r = b % a;... |
#include <bits/stdc++.h>
#define ll long long
#define var auto
using namespace std;
ll gcd(ll a, ll b){
while(true){
if (a == 0) return b;
b %= a;
if (b == 0) return a;
a %= b;
}
}
int main(){
ll p, q;
cin >> p >> q;
var g = gcd(p, q);
p /= g;
q /= g;
ll res = 1;
for (ll i = 2; i * i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int x, int y) {
if (x<=y) return gcd(y, x);
if (x%y == 0) return y;
else return gcd(y, x%y);
}
int main() {
int p, q; cin >> p >> q;
int r = q/gcd(p, q);
int s = r;
int res = 1;
for (int i = 2; i*i <= r; ++i) {
if (s%i == 0) {
re... |
#include <cstdio>
#include <utility>
int gcd(int m, int n) {
while (n) std::swap(m %= n, n);
return m;
}
int main() {
int p, q;
scanf("%d %d", &p, &q);
int m = q / gcd(p, q);
int res = 1;
for (int i = 2; i*i <= m; ++i) {
if (m % i == 0) {
res *= i;
do {
m /= i;
} while (m ... |
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll power(ll e, ll x) {
if (x == 0)
return 1;
if (x % 2 == 0)
return power(e * e, x / 2);
return e * power(e, x - 1);
}
int main() {
ll a, b;
cin >> a >> b;
a %= b;
map<ll, int> amp, bmp;
for (ll i = 2; i * i <= a; i++) {
i... |
#include<iostream>
#include<map>
#include<algorithm>
#include <iomanip>
#include <cmath>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#incl... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const in... |
#include<bits/stdc++.h>
using namespace std;
// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
#define MOD 1000000007
int main()
{
ll n,m,k;cin>>n>>m>>k;
vector<int> p(m);
ll i,j,l;
rep(i,m)cin>>p[i];
ll num=1;
ll needs=0;
while(num<=k)
{... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[50][1000];
ll ans[1000];
ll M=1e9+7;
int main(){
ll n,m,K,p[10000];
cin>>n>>m>>K;
dp[0][0]++;
for(int i=0;i<m;i++)cin>>p[i],dp[0][p[i]%n]++;
ll i=0;
ans[0]=1;
while((1<<i)<=K){
if((1<<i)&K){
ll tmp[1000]={}... |
#include <bits/stdc++.h>
/* S.size() s.substr(l,r=s.size()-l) -> l文字目からr文字分
__gcd() lower_bound(a+l,a+r,x)-a でindex
// 配列 -> min/max({})
// vector-> *min_element(a+l,a+r) *忘れず lとrで[l,r)
//reverse(a+l,a+r) 配列aの[l,r)を逆順に strはreverse(all(s))
//sort(a+l,a+r,greater <int>()) 配列aの[l,r)昇順sort,大きい順はgreater<type>()
//vect... |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define R... |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
#include <time.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... |
#include <iostream>
#include <vector>
using namespace std;
const long long p = 1000000007;
void printmat(const vector< int > &a)
{
const int n = a.size();
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
cerr << a[(i+n-j)%n] << " ";
}
cerr << endl;
}
}
// caution: b = a * b
void mulB... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
vector<ll> solve(vector<ll> a,vector<ll> b,ll m) {
vector<ll> c(m,0);
for(int i=0; i<m; i++) {
for(int j=0; j<m; j++) {
c[(i+j)%m]+=a[i]*b[j];
c[(i+j)%m]%=mod;
}
}
return c;
}
vector<ll> mod_pow(ve... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//--------------------------------------------------... |
#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef vector<ll> row;
typedef vector<row> mat;
ll N, M, K, P[10000];
row mul(row &A, row &B) {
row C(N);
REP(i, 0, N)
REP(j, 0, N)
C[i] = (C[i] + A[... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
using ll = long long;
const ll mod = 1e9+7;
using vl = vector<ll>;
using mat = vector<ll>;
mat mul(const mat &a, const mat &b)
{
int n = a.size();
mat c(n);
rep(i,n)
{
c[i] = 0;
rep(j,n)... |
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
//#include <tuple>
//#include <unordered_map>
#include <unordered_set>
#include ... |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
mat mul(mat &A,mat &B){
mat C(A.size(),vec(B[0].size()));
for(int i=0;i<A.size();i++){
for(int k=0;k<B.size();k++){
for(int j=0;j<B[0].size();j+... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).be... |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vec;
vec calc(vec a,vec b){
int n=a.size();
vec res(n,0);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
res[(i+j)%n]+=a[i]*b[j];
res[(i+j)%n]%=MOD;
}
}
return res;
}
signed main(){
... |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... |
#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef vector<ll> row;
typedef vector<row> mat;
ll N, M, K, P[10000];
row mul(row &A, row &B) {
row C(N);
REP(i, 0, N)
REP(j, 0, N)
C[i] = (C[i] + A[... |
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using usize = std::size_t;
using u64 = std::uint64_t;
static constexpr u64 mod = 1000000007;
int main() {
usize n, m;
std::cin >> n >> m;
u64 k;
std::cin >> k;
const auto mul = [&](std::vecto... |
#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
#define fi first
#define se second
template<typename A, typename B> inline bool ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> mp;
ll inf = 1e9;
ll mod = 1e9+7;
int main(){
ll n,m,kk;
cin>>n>>m>>kk;
vector<vector<ll> > dp(32, vector<ll>(n,0) );
dp[0][0]++;
for(ll i=0;i<m;i++){
ll tmp;
cin>>tmp;
//tmp--;
dp[0][tmp%n]++;
}
for(ll i=1;i<32;... |
/* -*- coding: utf-8 -*-
*
* 2844.cc: Almost Infinite Glico
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll,ll>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
#define name3(_1,_2,_3,name,...) name
#define rep1(n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=0;i<(n);++i)
#define rep3(i,a,b) for(ll i=(a);i<(b);++i)
#def... |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typede... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vec;
vec calc(vec a,vec b){
int n=a.size();
vec res(n,0);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
res[(i+j)%n]+=a[i]*b[j];
res[(i+j)%n]%=MOD;
}
}
return res;
}
signed main(){
... |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,true:false;}
template <typena... |
#include<bits/stdc++.h>
typedef long long i64;
const int N=3e5+10,mod=998244353;
int n,ans,p[N],cnt[N],vis[N];
int length(int u){vis[u]=1;return vis[p[u]]?1:length(p[u])+1;}
inline int fpow(int a,int b){int s=1;for(;b;b>>=1,a=(i64)a*a%mod)if(b&1)s=(i64)s*a%mod;return s;}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i... |
#include <bits/stdc++.h>
#define ll long long
#define maxn 300005 /*rem*/
#define mod 998244353
#define db double
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define fi first
#define se second
using namespace std;
ll ksm(ll a, ll b) {
if (!b) return 1;
ll ns = ksm(a,... |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <limits>
#include <random>
#include <utility>
#include <vector>
namespace procon {
class UnionFind {
private:
struct nodeinfo {
int par;
int rank;
nodeinfo(int par) : par(par), rank(0) {}
};
std::vector<nodeinfo> n... |
#include<bits/stdc++.h>
using namespace std;
signed main(){
vector<int> v(10);
for(int i=0;i<10;i++) cin>>v[i];
sort(v.rbegin(),v.rend());
for(int i=0;i<3;i++) cout<<v[i]<<endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.