code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(i) begin(i), end(i)
const int INF = 0x3fffffff;
const ll MINF = 0x7fffffffffff;
const ld DINF = numeric_l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 13,841,772 |
#include <iostream>
using namespace std;
int Millennium(int y, int m, int d) {
int t = 0;
while(y < 1000){
t++;
if(y % 3 == 0){
if(d == 20){
d = 1;
m++;
}else{
d++;
}
}else{
if(m % 2 == 0){
... | #include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | 0 | 100,168,095 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> D;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
P dp[2000][2000];
int main() {
int H, W;
cin >> H >> W;
vector<string> field(H);
rep(i, H) cin >> field[i];
rep(h, H) rep(w, W) dp... | 0 | 94,918,208 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
c... | 0 | 99,532,440 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <functional>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace st... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; string S; cin >> N >> K >> S;
vector<int> v;
if(S.at(0) == '1') v.push_back(0);
char c = S.at(0);
for (int i = 0; i < N; i++) {
int cnt = 1;
while(i + 1 < N) {
if(S.at(i + 1) == c) {
i++; cnt++;
}
else break... | 0 | 88,039,836 |
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,x,y;
int amax=-100;
int bmin=100;
cin >> n >> m >> x >> y;
vector<int> a(n),b(m);
for(int i=0;i<n;i++){
cin >> a.at(i);
if(amax<a.at(i))amax=a.at(i);
}
for(int i=0;i<m;i++){
cin >> b.at(i);
... | 0 | 8,420,661 |
#include<stdio.h>
int main(void){
int H,W,i,t;
for(;;){
scanf("%d %d",&H,&W);
if(H==0&&W==0){
break;
}
for(i=1;i<=H;i++){
for(t=1;t<=W;t++){
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n, m;
cin >> n >> m;
vector<vector<int> > s(m, vector<int>());
vector<int> p(m);
rep(i, m){
int k;
cin >> k;
rep(j, k){
int sw;
ci... | 0 | 49,511,763 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t,n;
cin>>t>>n;
int ar[t];
for(int i=0;i<t;++i) cin>>ar[i];
sort(ar,ar+t,greater<int>());... | #pragma GCC optimize("O3")
#include <iostream>
#include <cstring>
#include <string>
#include <cassert>
#include <random>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
using namespace std;
namespace fastinput {
template <class T = int> inline T readInt();
... | 0 | 89,439,284 |
#include<cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#defi... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout<<setprecision(x);
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX*0.99
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define yes "Yes"
#define no "No"
#define divs 100000000... | 0 | 75,698,950 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include <bits/stdc++.h>
#define fin ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ii pair<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fore(i,a,b) for(int i = a;i < b; i+= 1)
#de... | 0 | 70,170,440 |
#include<bits/stdc++.h>
using namespace std;
#define rg register
#define rep(i,a,b) for (rg int i=a;i<=b;i++)
#define per(i,a,b) for (rg int i=b;i>=a;i--)
#define pb push_back
#define lowbit(x) (x&(-x))
#define mk make_pair
#define VI vector<int>
#define pii pair<int,int>
#define pLL pair<long long,long long>
#define f... | #include <cstdint>
#include <iostream>
#include <map>
using namespace std;
int main() {
int64_t n;
cin >> n;
map<int64_t, int> m;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
m[i]++;
n /= i;
}
}
if (n != 1) {
m[n] = 1;
}
int ans = 0;
for (auto p : m) {
auto v... | 0 | 23,502,038 |
#include <iostream>
#include <math.h>
#include<algorithm>
#include <stdio.h>
using namespace std;
const int N = 2e5 + 50;
#define pi acos(-1.0)
#define ll long long
struct point
{
int x, y;
double r;
} poi[2 * N];
bool cmp(const point &p1, const point &p2)
{
return p1.r < p2.r;
}
int n;
ll sx[N * 2], sy[N *... | #include <bits/stdc++.h>
#include <map>
using namespace std;
typedef long long ll;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=(int)0;... | 0 | 10,822,487 |
#define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
ll ans = INF;
void solv(ll H, ll W){
for(ll i = 1; i < W; i++){
ll a = i * H... | 0 | 86,973,484 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
type... | #include<bits/stdc++.h>
using namespace std;
#define I INT32_MAX
#define IM INT_MIN
#define MOD 1000000007
#define ll long long
#define lli long long int
#define rep(i,n) for (int i = 0; i < n; i++)
#define repk(i,k,n) for (int i = k; i <= n; i++)
#define repr(i,k,n) for (int i = k; i >= n; i--)
#define all(v) (v).begi... | 0 | 12,722,550 |
#include<bits/stdc++.h>
using namespace std;
int main (){
int a,b,c;
cin >>a>>b>>c;
vector<int> s(3);
int tmp,i,j;
s.at(0) = abs(a-b);
s.at(1) = abs(b-c);
s.at(2) = abs(c-a);
for(i=0;i<3;i++){
for(j=1;j<3-i;j++){
if(s.at(i)<s.at(i+j)){
tmp = s.at(i);
... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <functional>
#include <numeric>
#include <set>
using namespace std;
typedef long long li;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
li n;
cin >> n;
vector<li> xs(n);
li negs = 0;
for (int i ... | 0 | 98,697,470 |
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | #include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <cstdio>
using namespace std;
#define prev prev55
long long n, a[500], ss;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
long long fh = 1e18;
for (int i = 0; i < ... | 0 | 4,961,250 |
#include<bits/stdc++.h>
#define ll long long
#define d double
#define ld long double
#define vi vector<int>
#define vul vector<ull>
#define vl vector<ll>
#define pb push_back
#define si set<int>
#define sl set<ll>
#define yes cout<<"YES\n"<<endl
#define no cout<<"NO\n"<<endl
#define ys cout<<"Yes\n"<<endl
#define n cou... | #include<bits/stdc++.h>
using namespace std;
#define MP make_pair
#define F first
#define S second
typedef pair<double, double> P;
vector<P> ans;
double Pythagorean(double x, double y){
return sqrt(x * x + y * y);
}
void KochCurve(P s, P e, int n){
if(n){
double l = Pythagorean((e.F - s.F) / 3, (e.S - s... | 0 | 43,708,130 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <deque>
#include <numeric>
#include <utility>
#include <bitset>
#define sign(a) ((a>0)-(a<0))
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define LL long long
#define INF (LL)(1LL<<60)
#define all(a) a.begin(), a.end()
#define gr greater<L... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for(int i = 1; i <= n; i++) {
string s = to_string(i);
int sum = 0;
for(auto cc : s) {
sum += cc - 48;
}
if(a <= sum && sum <= b) {
ans... | 0 | 68,063,108 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
#define Mod 1000000007
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
#define INF 12345678901234
int m... | 0 | 854,769 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,sub;
cin>>s;
int digit,arr[10],n=s.length();
for(int i=0;i<n-1;i++){
sub=s.substr(i,3);
digit=(sub[0]-'0')*100+(sub[1]-'0')*10+(sub[2]-'0');
arr[i]=abs(digit-753);
}
sort(arr,arr+n-2);
cout<<arr[0];
... | #include <bits/stdc++.h>
#define long long long int
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, p;
cin >> n >> p;
string s;
cin >> s;
if (p < 10) {
vector<int> cnt(p);
int cur = 0;
long res = 0;
cnt[0]++;
for (int i = 0; i < n; i+... | 0 | 17,062,317 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b;
cin>>a>>b;
if(a.size()>b.size())cout<<"GREATER"<<endl;
if(a.size()<b.size())cout<<"LESS"<<endl;
if(a.size()==b.size()){
if(a>b)cout<<"GREATER"<<endl;
else if(a<b)cout<<"LESS"<<endl;
else if(a==b)cout<<"EQUAL"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 10,036,320 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | #include <iostream>
using namespace std;
int main(void) {
int N, M, P, X, per_m, champ = 0;
double sum_money = 0;
while (cin >> N >> M >> P, N | M | P) {
per_m = champ = sum_money = 0;
for (int i = 1; i <= N; i++) {
cin >> X;
if (i == M) champ = X;
sum_money += X;
}
sum_money = sum_money * 100 - sum... | 0 | 54,544,283 |
#include<stdio.h>
int main(){
int W,H,x,y,r;
scanf("%d %d %d %d %d",&W, &H, &x, &y, &r);
if (W >= x + r){
if (x >= r){
if (H >= y + r){
if (y >= r)
printf("Yes\n");
else
printf("No\n");
}
else
printf("No\n");
}
else
printf("No\n");
}
else
printf("No\n");
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
#define INF 1e9
using ll=long long;
using namespace std;
int main()
{
int N,M;
cin>>N>>M;
vector<pair<int,int>> ab(N);
rep(i,N)
{
int a,b;
cin>>a>>b;
ab[i]=make_pair(a,b);
}
vector<pair<int,... | 0 | 32,620,434 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
int dy[]={1,0,-1,0}... | #include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long... | 0 | 27,961,590 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a=0;
int b=1;
cin >>N;
for (int i=0; i<8; i++){
a+= N%(b*10)/b;
b*=10;
}
if (N%a==0){
cout << "Yes" << endl;
}
else
cout << "No" << endl;
} | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
#include <list>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
io... | 0 | 2,896,539 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int e[105][105];
int main()
{
int n;
int k,m,p;
memset(e,0,sizeof(e));
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&k);
scanf("%d",&m);
for(int j=1;j<=m;j++)
{
scanf("... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define ff first
#define ss second
#define vi vector<ll>
#define vii vector<vector<ll>>
#define vpi vector<pii>
#define mod 1000000007
#define MOD 1000000007
#defin... | 0 | 48,868,577 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>h(n);
for(int i=0;i<n;i++){
cin>>h[i];
}
int w=h[0],aw=1;
for(int i=1;i<n;i++){
w=max(w,h[i]);
if(w==h[i]){
aw++;
}
}
cout<<aw<<endl;
} | #include<cstdio>
#include<cstring>
int main(void){
int s, n;
int i, j;
int flag = 0;
char txt[101];
char pat[101];
scanf("%s", txt);
scanf("%s", pat);
n = strlen(txt);
s = strlen(pat);
for(i = 0; i < n; i++){
int p = i;
while(j < s){
if(p == n) p = 0;
... | 0 | 49,782,139 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
string s, t;
for(int i=0; i<b; i++) s += to_string(a);
for(int i=0; i<a; i++) t += to_string(b);
if (s >= t) cout << t << endl;
else cout << s << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 478,419 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
string s, t;
cin >> s >> t;
for(int i=0; i<n; i++){
cout << s[i] << t[i];
}... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<cstdlib>
#include<cmath>
#include<numeric>
#include<iomanip>
#include<functional>
#include<cstdlib>
#include<queue>
#include<deque>
const double PI = acos(-1);
#define rep(i,n)for(int i=0;i<(n);i++)
using n... | 0 | 43,937,473 |
#include <bits/stdc++.h>
#define st first
#define nd second
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(... | #include<bits/stdc++.h>
using namespace std;
map<int,int>mp;
int cnt=0;
void Divisors(int n)
{
vector<int>v;
for (int i=1; i<=sqrt(n); i++)
{
if (n%i == 0)
{
if (n/i == i)
v.push_back(i);
else
{
v.push_back(i);
... | 0 | 67,311,337 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int H, W;
cin >> H >> W;
vector<int> x{1, 0, -1, 0};
vector<int> y{0, 1, 0, -1};
vector<vector<char> > m(H,vector<char>(W));
for(int i = 0; i < H; i++) {
string S;
cin >> S;
for(int j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | 0 | 46,737,044 |
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<queue>
#include<stack>
#include<algorithm>
#include<string>
#include<math.h>
#include <iomanip>
#include <numeric>
#define _USE_MATH_DEFINES
using namespace std;
int main()
{
int n,m;cin>>n>>m;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcountll(bit)
using namespace std;
template<class T> bool chmax(T &a, c... | 0 | 63,915,729 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include<bits/stdc++.h>
using namespace std;
int main(){
string rev_s; cin >> rev_s;
string s = rev_s;
reverse(rev_s.begin(), rev_s.end());
string key = "keyence";
string rev_key = "ecneyek";
int cnt=0, rev_cnt=0;
int n = s.length();
for(int i=0; i<n; i++){
if(s[i] == key[cnt]){
... | 0 | 17,648,706 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n,k,a=0;
cin>>n>>k;
std::vector<int> v(n,0);
for (int i = 0; i < n; ++i)
{
cin>>v[i];
if(v[i]>= k){
a++;
}
}
cout<<a<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int g[N];
int n;
int main()
{
cin>>n;
int res=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n/i;j++)
{
int c=n-i*j;
if(c && i*j+c == n) res++;
}
cout<<res;
} | 0 | 87,157,392 |
#include <bits/stdc++.h>
using namespace std;
#define Vi vector<int>
#define FOR(i,s,e) for (int i=s; i<e; i++)
#define ITER(v) v.begin(), v.end()
constexpr int MAX_LEN = 1'000;
int dp[MAX_LEN][MAX_LEN];
void set_val(int i, int j, int inc) {
int val = inc;
if (i > 0 && j > 0) {
int tmp = dp[i-1][j-1] + ... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 0 | 16,909,819 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
const int MOD = 1e9+7;
ll dp[100010];
int main(){
int n, m;
cin >> n >> m;
map<int,int> a;
rep(i,m){
int A;
cin >> A;
a[A]++;
}
rep(i,n+1){
dp[i]=0... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
priority_queue<long long> pq[8];
for(int i = 0; i < n; i++){
long long x, y, z;
cin >> x >> y >> z;
pq[0].push(x+y+z);
pq[1].push(x+y-z);
pq[2].push(x-y+z);
pq[3].push(-x+y+z);
pq[4].push(x-y-z);
... | 0 | 36,886,522 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
struct card{
char type;
int num;
};
void swap(card *a,card *b){
card temp=*a;
*a=*b;
*b=temp;
return ;
}
int printCardArray(card data[],int num){
int i;
for(i=0;i<num;i++){
if(i!=0)printf(" ");
printf("%c%d",data[i].type,data[i].num);... | #include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <list>
#include <set>
#include <queue>
#include <iterator>
#include <bitset>
#include <bits/stdc++.h>
#include <vector>
#include <cctype>
#include <algorithm>
#define ll long long
#define _ ios_base::sync_with... | 0 | 84,929,267 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a;
for(ll i = 1; i*i <=n; i++) {
if(i*i==n) a.push_back(i);
else if(n%i==0) {
a.push_back(i);
a.push_bac... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n... | 0 | 83,969,345 |
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n>>o>>p)
{
if(abs(m-o)<=p)
cout<<"Yes"<<endl;
else if(abs(m-n)<=p&&abs(n-o)<=p)
cout<<"Yes"<<endl;
e... | #include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
int main() {
int n, q;
scanf("%d %d", &n, &q);
dsu d(n);
for (int i = 0; i < q; i++) {
int t, u, v;
scanf("%d %d %d", &t, &u, &v);
if (t) {
puts(d.same(u, v) ? "1" : "0");
} else {
d.merge(u, v);
}
}
retu... | 0 | 45,522,368 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,k;
cin >> n >> k;
vector<ll> a(n);
for(i = 0;i < n;++i){
cin >> a.at(i);
}
if(k >= 50){
for(i = 0;i < n;++i){
... | 0 | 88,491,322 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n,m;
cin >> n >> m;
vector<ll> v(n+1,0);
rep(i,m){
int a,b;cin ... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 80,176,540 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9+5;
const int mod... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,m,a,b;
cin >> n >> m >> a >> b;
vector<int>x(n);
vector<int>y(m);
rep(i,n) cin >> x.at(i);
rep(i,m) cin >> y.at(i);
int xma=-250;
int ymi=+250;
rep(i,n) xma = max(xma,x.at(i));
rep(i... | 0 | 32,618,420 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<int,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NUL... | #include <iostream>
using namespace std;
int combinations[51] = {};
int main() {
for (int a = 0; a < 10; a++) {
for (int b = 0; b < 10; b++) {
for (int c = 0; c < 10; c++) {
for (int d = 0; d < 10; d++) {
combinations[a + b + c + d] += 1;
}
... | 0 | 79,343,784 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
int dp[n+1];
for(int i = 0; i < n; i++){
cin >> arr[i];
dp[i+1] = INT_MAX;
}
dp[0] = 0;
for(int i = 0; i < n; i++){
for(int j = i+1; j <= i+k; j++){
if(j < n){
dp[j] = min(dp[j], dp[i]+abs(arr[j]-arr[i])... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define PI acos(-1)
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define sz(a) a.size()
#define srt(a) sort(all(a))
#define mem(a, h) memset(a, (h), sizeof(... | 0 | 15,519,946 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
const ll p=1000000007;
int main(){
ll n;
cin >> n;
ll bb=0;
ll k[n];
rep(i,n){
ll a,b;
cin >> a >> b;
bb+=b;
k[i]=a+b;
}
sort(k,k+n);
ll ans=0;
rep(i,n-n/2){
ans+=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>;
using P = pair<int,int>;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const l... | 0 | 12,014,729 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(ve... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<map>
#include<numeric>
#include<queue>
#include<string>
#include<sstream>
using namespace std;
int main(void) {
int m, nmin, nmax;
while(cin >> m >> nmin >> nmax){
if( m == 0 ) break;
vector<i... | 0 | 41,382,595 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
int main... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 0 | 29,586,460 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef v... | 0 | 20,387,204 |
#include <bits/stdc++.h>
#define FOR(i,n) for(int i=0;i<n;i++)
#define FORR(i,n) for(int i=n;i>=0;i--)
#define pb push_back
#define vlli vector<int>
#define slli set<int>
#define mlli map<int,int>
#define int long long int
#define test int tt1234; cin>>tt1234;while(tt1234--)
#define endl "\n"
#define all(zz) zz.begin(... | #include <bits/stdc++.h>
#define ll long long
const ll MOD=1e9+7;
using namespace std;
int main(){
ll N,AB=0,A=0,B=0,cnt=0;
cin>>N;
for(ll i=0;i<N;i++){
string s;
cin>>s;
ll a=s.size();
for(ll j=0;j+1<a;j++){
if(s[j]=='A'&&s[j+1]=='B') cnt++;
}
if(... | 0 | 79,206,163 |
#include <vector>
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <climits>
using namespace std;
struct Node {
int to;
int weight;
Node(int _to, int _weight) {
to = _to;
weight = _weight;
}
};
vector<Node> adj[101];
int v;
int dis[101][101];
void floyd() {
for (in... | #include <algorithm>
#include <vector>
#include <string>
#include <ctype.h>
#include <set>
#include <map>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<time.h>
#include<string>
#include<stack>
#include<cmath>
#include<iostream>
#include<cstring>
#include<complex>
#include<bitset>
#include <climits>
#inclu... | 0 | 63,485,515 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long doubl... | 0 | 98,672,625 |
#include<iostream>
using namespace std;
int main(){
int x,y;
while(cin>>y>>x){
if(x!=0||y!=0){
for(int i=0;i<y;i++){
for(int j=0;j<x;j++){
cout<<'#';
}
cout<<endl;
}
cout<<endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int mod = 1e9 + 7;
ll modpow(ll k, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * k % mod;
k = k * k % mod;
n /= 2;
}
return res;
}
ll choose(ll n, ll k) {
ll ... | 0 | 43,122,208 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n,r=0,g=0,b=0;
string s;
ll cnt1=0;
cin >> n >> s;
for (int i=0;i<n;i++) {
if (s[i]=='R') r++;
else if (s[i]=='G') g++;
else if (s[i]=='B') b++;
}
cnt1=r*g*b;
for (int i=0;i<n;i++) {... | #include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <cstdlib>
#include <utility>
#include <cmath>
#include <queue>
#include <stack>
#include <cstring>
using namespace std;
#define ll long long
#ifndef ONLINE_JUDGE
#define debug(format, ...) fprintf(stderr, \
"%s:%d: " format "\n", __fun... | 0 | 19,846,986 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> v;
for(int i = 1; i < N; i++) {
v.push_back(i);
}
vector<vector<bool> > c(N, vector<bool>(N));
f... | #include<cstdio>
#include<cmath>
#include<string>
#include<iostream>
#include<algorithm>
#include<utility>
#include<vector>
#include<map>
#include<set>
#include<limits>
#include<bitset>
using namespace std;
int n,a[300000];
long long int b,sm=0,sa,r=0;
int main(){
cin>>n;
for(int i=0;i<n;i++){
scanf("%d... | 0 | 28,758,152 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<int> A(N); unordered_map<int, int> mp;
REP(i, 0, N) {
cin >> A[i]; mp[A[i]] = i;
... | #include<stdio.h>
#include<string.h>
#define M 1000000
#define L 14
char H[M][L];
int getChar(char ch){
if(ch=='A')return 1;
else if (ch=='C') return 2;
else if (ch=='G') return 3;
else if (ch=='T') return 4;
return 0;
}
long long getkey(char str[]){
long long sum=0,p=1,i;
for(i=0;i<strlen(str);i++){
... | 0 | 53,077,994 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int,... | #include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <cctype>
#include <nume... | 0 | 85,190,523 |
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
class Disjointset {
private:
vector<int> p, rank;
public:
Disjointset(int size) {
p.resize(size, 0);
rank.resize(size, 0);
for (int i = 0; i < size; ++i) {
p[i] = i;
}
}
int find(int v) {
if (p[v] != v)
p[v] = find(p[v]);
... | #include <iostream>
#include <vector>
using namespace std;
struct node { int parent,depth; vector<int> child; };
vector<node> tree;
void dfs(int num){
if(tree[num].child.size() == 0) return;
for(int i = 0;i < tree[num].child.size();i++){
tree[tree[num].child[i]].depth = tree[num].depth + 1;
dfs(tree[num].child[i]... | 0 | 984,178 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll ans = c-(a-b);
if (ans < 0) cout << 0 << endl;
else cout << ans << endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<bitset>
#include <climits>
#include<set>
#include<bitset>
using namespace std;
typedef long long ll;
typedef long long ijt;
typedef vector<int> vi;
typedef v... | 0 | 23,918,878 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
int fa[100010],num[100010],n,m,cnt;
bool bo[100010],pd[100010];
ll ans;
inline int rd()
{
int x=0;char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar());
for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'... | #include <unistd.h>
#define MIN(x,y) ((x)<(y)?(x):(y))
#define MAX(x,y) ((x)>(y)?(x):(y))
int n;
long long int B[60];
char ibuf[4000000];
char *ibufe = ibuf-1;
void readall(){
int k, t = 0;
while((k=read(STDIN_FILENO, ibuf+t, sizeof(ibuf)-t))>0) t += k;
}
long long int read_uintll(){
long long int x=0;
while(*(... | 0 | 65,763,335 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void solve() {
int n, m; scanf("%d%d", &n, &m);
if (n > m) swap(n, m);
long l... | 0 | 61,703,261 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | #include <bits/stdc++.h>
using namespace std;
void Main()
{
int R;
cin >> R;
if (R < 1200)
cout << "ABC";
else if (R < 2800)
cout << "ARC";
else
cout << "AGC";
}
int main(void)
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
#ifdef DEBUG_BUILD
while (true)
... | 0 | 39,737,058 |
#include<bits/stdc++.h>
#define rint register int
#define ll long long
using namespace std;
const ll Max=1e9;
int N,P[1010000];
ll Sum[1010000],A[1010000],B[1000000];
int main(){
cin>>N;
for(rint i=1;i<=N;++i) cin>>P[i];
for(rint i=1;i<=N;++i) {
Sum[P[i]]=Max-N+i;
}
A[1]=Max/2;B[1]=Sum[1]-A[1];
for(rint i=2;i<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
ll n;cin >> n;
bool e=false;
if(n%2==0) e=true;
if(!e){
cout << 0 << endl;
return 0;
}
ll a=0;
n /= 10;
a += n;
while(n>=5){
n /= 5... | 0 | 61,077,114 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 9223372036854775807;
struct LL... | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <map>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
bool comp(pair<ll,int> &a,pair<ll,int> &b){
return a.first>b.first;
}
int main()
{
int n,k;cin >> n >>... | 0 | 68,261,789 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 88,480,402 |
#include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
using namespace std;
int main() {
int a, b;
cin >> a >> b;
puts(a % 3 == 0 || b % 3 == 0 || (a + b) % 3 == 0 ? "Possible"
: "Impossible");
return 0;
} | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector... | 0 | 75,691,744 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define REP(i, n) for (LL i = 0; i < (LL)(n); i++)
#define REP2(i, n) for (LL i = 1; i <= (LL)(n); i++)
#define FOR(i, m, n) for (LL i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) ... | 0 | 1,911,111 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf(... | 0 | 84,163,587 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define vll vector < ll >
#define vvll vector < vll >
#define vld vector < ld >
#define pll pair < ll,ll >
#define pld pair ... | #include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp;
int divideprime(long long n){
long long i=2;
for(i=2;i<=sqrt(n)+1;i++){
while(n%i==0){
n/=i;
mp[i]++;
}
}
if(n!=1) mp[n]++;
return 0;
}
int main(){
long long n, ans=0, cnt=1;
cin... | 0 | 29,795,605 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
void dfs(vector<int>& perm, int state, int pre, ll sum, ll& ans,
vector<vector<ll>>& adj) {
... | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX/3
#define LLINF LLONG_MAX/3
#define MOD (1000000007LL)
#define MODA(a, b) a=((a)+(b))%MOD
#define MODP(a, b) a=((a)*(b))%MOD
#define inc(i, l, r) for(int i=(l);i<(r);i++)
#define dec(i, l, r) for(int i=(r)-1;i>=(l);i--)
#defin... | 0 | 63,763,883 |
#include <iostream>
int main()
{
int N, M;
std::cin >> N >> M;
int64_t sum = 0;
for (int i = 0; i < M; i++)
{
int temp;
std::cin >> temp;
sum += temp;
}
if (sum <= N)
{
std::cout << N - sum << std::endl;
}
else
{
std::cout << -1 << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define MAX 1000001
int A[MAX];
int ans[MAX];
void mark(int x) {
if (A[x] >= 2) ans[x] = 0;
for (int i = 2; i <= MAX / x; i++) {
if (A[x*i]) ans[x*i] = 0;
}
}
v... | 0 | 83,732,257 |
#include <iostream>
using namespace std;
int main()
{
int h;
int max1 = 0, max2 = 0, max3 = 0;
while (cin >> h)
{
if (max1 <= h)
{
max3 = max2; max2 = max1; max1 = h;
}
else if (max2 <= h)
{
max3 = max2; max2 = h;
}
else if (max3 <= h)
{
max3 = h;
}
}
cout << max1 << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 78,583,244 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,x,t;
cin >> n >> x >> t;
cout<<(int)((int)(ceil(n*1.0/x)) * t)<<endl;
return 0;
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
ll powmod(ll a, ll n, ll mod) {
ll ret = 1;
while (n > 0) {
if (n % 2 == 1) { ret = ret * a % mod; }... | 0 | 85,450,483 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
char x,y;
cin >> x >> y;
if(x > y) cout << ">" << endl;
else if(x < y) cout << "<" << endl;
else cout << "=" << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include... | 0 | 47,799,492 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 39,776,472 |
#include <iostream>
#define llint long long
#define mod 1000000007
using namespace std;
llint n;
llint a[100005];
llint pos[100005];
llint l, r;
llint fact[200005], fact_i[200005];
llint pow(llint a, llint n)
{
if(n == 0) return 1;
if(n % 2){
return ((a%mod) * (pow(a, n-1)%mod)) % mod;
}
else{
return pow((a*a)... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()
#define PI 3.14159265358479... | 0 | 26,622,196 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N,A,B;
cin >> N >> A >> B;
vector<int> P(N);
for(int i = 0;i < N;i++) {
cin >> P.at(i);
}
sort(P.begin(),P.end());
int o = 0,t = 0,th = 0;
for(int i = 0;i < N;i++) {
if(P.at(i) <= A) o++;
else if(P.at(i) > A... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | 0 | 17,963,497 |
#include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <sstream>
#include <stack>
#include <map>
#include <set>
#include <ios>
#include <cctype>
#include <cstdio>
#include <functional>
#includ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
long long all = 0;
long long current = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
all += abs(current - A[i]);
current = A[i];
}
all += abs(current - 0);
current = 0;
for (int i = 0; i < N; i+... | 0 | 44,747,552 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <bitset>... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair < int, int >
#define pll pair < ll, ll >
#define pci pair < char, int >
#define psi pair < string, int >
#define vi vector < int >
#define vll vector < ll >
#define vs vector < string >
#define vc vector < char >
#define vpi ve... | 0 | 56,954,316 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_N 100000
typedef long long ll;
typedef pair<ll,ll> P;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
int main(){
int N,M,R;
cin >> N >> M >> R;
vector<ll> r(R);
ll d[N][N];... | #include <iostream>
#include <string>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
set<int> pas;
int cnt = 0;
for (int i = 0; i < 1000; i++) {
string tmp;
if (i < 10) tmp = "00" + to_string(i);
else if (i < 100) tmp = '0' + to_... | 0 | 30,192,857 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans *= A - i;
}
for (int i = ... | #include<stdio.h>
int main()
{
int a_coin,total;
scanf("%d\n%d",&total,&a_coin);
int x=total/500;
int b=x*500;
if(b==total){
printf("Yes\n");
}
else{
int c=total-b;
if(a_coin>=c){
printf("Yes\n");
}
else{
printf("No\n");
... | 0 | 25,596,995 |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
struct node {
int key;
node *pre, *nex;
};
node *nil;
void init() {
nil = (node *)malloc(sizeof(node));
nil->nex = nil;
nil->pre = nil;
}
void insert(int key) {
node *a = (node*)malloc(sizeof(node));
a ->... | #include<bits/stdc++.h>
using namespace std;
#define SORT(c) sort((c).begin(),(c).end());
#define pb push_back
#define MP make_pair
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define pi 3.141592653589793
#d... | 0 | 47,013,719 |
#include <bits/stdc++.h>
using namespace std;
#define ld double
#define ll long long
#define pb emplace_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) x.begin(),x.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
cin >> C.at(i);
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int ans = 100000000;
bool ok = f... | 0 | 56,133,301 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <ca... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;cin >> n;
int k;cin >> k;
vector<ll> sum(n+1,0),best(n+1,0);
for (int i = 0; i < n; i++) {
int a;cin >> a;
sum[i + 1] = sum[i] + a;
best[i + 1] = best[i] + max(a,0);
}
ll ans = 0;
... | 0 | 55,494,426 |
#include <iostream>
using namespace std;
int main(void){
int n, i=1;
while(cin>>n&&n!=0){
cout<<"Case "<<i<<": "<<n<<endl;
i++;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
string s;
cin>>s;
for (int i=s.size()-1; i>=0; i--) {
string res=s.substr(0,i);
int n=res.size();
if (n... | 0 | 34,018,995 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<numeric>
#include<string>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
int main()
{
int N, Y; cin >> N >> Y;
int c, tmp;
Y /= 1000;
N -= Y%5;
... | #include<iostream>
#include<vector>
using namespace std;
int selectionSort(vector<int> &v){
int cnt = 0, size = v.size(), i, j, min;
for(i = 0; i < size; i++){
min = i;
for(j = i; j < size; j++){
min = v[j] < v[min] ? j : min;
}
if(i != min){
int tmp = v[i... | 0 | 27,566,595 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN = 100000 + 10;
const int BIG = 1000000000LL * 1000LL;
int cnt;
int pref;
int make_num(int x) {
int y = pref * 10 + x;
while (y < BIG) {
y = 10*y+9;
}
return y;
}
bool check(int x) {
cout << "? " << x << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#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 vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pi... | 0 | 56,120,117 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll a,b,k;
cin>>a>>b>>k;
if(k <= a){
cout << a - k << " " << b <<endl;
}else if(k <= a+b){
cout << 0 << " "<< b - (k-a) <<endl;
}else{
cout << 0 << " " << 0 <<endl;
}
} | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 53,448,535 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
using Graph = vector<vector<ll>>;
ll c2(ll x)
{
return x*(x-1)/2;
}
int main(){
int n;cin>>n;
vector<int> a(n);
map<int,ll> mp1;
for (auto &&i : a)
{
cin >> i;
mp1[i]++;
}
vector<ll> ans;
ll calc = 0;
for (auto &&i : mp1)
... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return... | 0 | 166,027 |
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typedef vecto... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ii=pair<ll,ll>;
using vi=vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(),(x).end()
#define print(a); for(auto x:a)cout<<x<<" "; cout<<"\n... | 0 | 32,409,305 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
static int n,T[251];
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&T[i]);
for(int i=1;i<=n;i++)
{
printf("node %d: key = %d, ",i,T[i]);
if(i>1) printf("parent key = %d, ",T[i/2]);
if(i*2<=n) printf("left key = %d, ",T[i*2]);
if(i*2+1<=n) print... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
class Dice
{
private:
int surf[6];
public:
void set_surf(int* input);
void roll(char orient);
void disp_top();
void disp_right(int tp, int fw);
};
void Dice::set_surf(int* input)
{
memcpy(surf, input, 6*sizeo... | 0 | 27,619,467 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,m;cin>>a>>b>>m;
vector<int >ref(a,0),mic(b,0);
for(int i=0;i<a;i++)cin>>ref[i];
for(int j=0;j<b;j++)cin>>mic[j];
int mini = 100000000;
for(int i=0,x,y,c;i<m;i++){
cin>>x>>y>>c;
mini=min(mini,ref[x-1]+mic[y-1]-c);
}
sort(ref.begin(),... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int... | 0 | 79,359,622 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#define rep(i,n) for (int i=0; i < (n); ++i)
using namespace std;
using ll = long long ;
const int INF = 1001001001;
int main() {
int a,b,c ;
cin >> a >> b >> c ;
if(a<b) swap(a,b) ;... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | 0 | 70,187,089 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <deque>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typ... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 0 | 52,056,514 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';
const i... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
long long cntA = 0;
for (long long i = 0; i < N - 1; i++) {
for (long long j ... | 0 | 70,329,831 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, s... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int car[100],num,i=0;
while(cin>>num){
if(num==0){
i--;
cout<<car[i]<<endl;
}else{
car[i]=num;
i++;
}
}
return 0;
} | 0 | 95,717,813 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,c) for(int i=0;i<c;++i)
#define PI 3.14159265358979323846264338327950L
typedef unsigned long long uint64;
using namespace std;
using ll = long long;
int main(){
int a;
cin >> a;
string s,t;
cin >> s >> t;
rep(i,s.length()){
cout << s[i] << t[i] ;... | #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
using namespace std;
#define repi(i,n) for(int i=... | 0 | 67,927,103 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, N;
cin >> N;
int t[100001], x[100001], y[100001], z[100001];
for (int i = 0; i < N; i++) cin >> t[i+1] >> x[i+1] >> y[i+1];
t[0] = 0; x[0] = 0; y[0] = 0;
for (int i = 0; i <= N; i++) z[i] = x[i] + y[i];
for (int i = 0; i< N; i++) {
a... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
int main()
{
int N;
cin >> N;
int A[N];
int min = INT_MAX;
int flag = 0;
for(int i=0;i<N;i++){
cin >> A[i];
if(A[i]<min){
min = A[i... | 0 | 26,726,568 |
#include <iostream>
#include <cmath>
#include <climits>
#include <string>
#include <numeric>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;
template<typename T> void print(T t) { cout << t << endl; }
int main() {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 3,941,780 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unsigned long long i... | #include <iostream>
using namespace std;
const long MAX = 100001;
const long NIL = -1;
struct Node{
long parent, leftChild, rightSibling;
};
struct Node T[MAX];
long n, Depth[MAX];
void print(long id){
cout << "node " << id << ": ";
cout << "parent = " << T[id].parent << ", ";
cout << "depth = " << Depth[id] << ", ... | 0 | 64,038,364 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
if(n%2 == 0) cout << n/2-1 << endl;
else cout << n/2 << endl;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef pair<int, int> i_i;
int H, W, M;
int main() {
cin >> H >> W >> M;
set<i_i> st;
map<int, int> sumh, sumw;
int max_h = 0, max_w = 0;
for (int i = 0; i < M; i++) {
int h, w;
cin >> h >> w;
st.insert({h, w... | 0 | 95,526,239 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.