code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | #include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<string.h>
#include<functional>
using namespace std;
int n,bs;
int hs,sl;
int dh[5]={0,0,0,1,-1};
int dll[5]={0,1,-1,0,0};
int cun[1003][1003];
struct pt{
int hh;
int ll;
int step;
};
pt dl1[11];
char vis[1003][1003];
pt dl[1<<16];
voi... | 0 | 72,889,192 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
int in() { int x; scanf("%d", &x); return x; }
template<typename T> void pv(T a, T b) { for (T i = a; i < b; i++) cout << *i << ' '; cout << endl; }
template<typename T, typename U> void chmin(T &x, U y) { if (y < x) x = y;... | #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;
typedef vector<vector<int>> Graph;
const int INF = 1e9;
co... | 0 | 22,874,442 |
#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_s... | #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 | 19,982,620 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
int mod = N % 500;
(mod <= A) ? cout << "Yes" : cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll n,m;cin >>n>>m;
vector<P>p(n);
for (int i = 0; i < n; ++i) {
ll a,b... | 0 | 64,305,738 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
double ans=0;
rep(i,0,n){
double x;
string u;
cin>>x>>u;
if(u=="JPY") ans+=x;
else ans+=x*380000;
}
cout<<ans<<end... | #include<bits/stdc++.h>
using namespace std;
map<char,char> ma;
int main(){
ios_base::sync_with_stdio(false);
int n,m;
char a,b;
while(1){
cin >> n;
if(n==0) break;
for(int i=0;i<n;i++){
cin >> a >> b;
ma[a]=b;
}
cin >> m;
char temp;
for(int i=0;i<m;i++){
cin >> tem... | 0 | 35,916,794 |
#include <iostream>
using namespace std;
int main()
{
int x, y;
while (cin>>x>>y) {
if (x==0 && y==0) continue;
if (x > y) {
cout << y << ' ' << x << endl;
} else {
cout << x << ' ' << y << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A , B , C , D , N ;
cin >> N ;
A = N / 1000 ;
B = ( N - A * 1000 ) / 100 ;
C = ( N - A * 1000 - B * 100 ) / 10 ;
D = N % 10 ;
if (B != C) {
cout << " No " <... | 0 | 25,106,829 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> ii;
int X[200005];
int dir[200005];
ii dest[200005];
int res[200005];
int n, L, T;
void c(int &x){
x %= L;
if(x < 0) x += L;
}
signed main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> L >> T;
for(int i = 1;i ... | 0 | 72,079,648 |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define NUM 105
char table[NUM][NUM];
int main(){
int A,B;
scanf("%d %d",&A,&B);
for(int row = 0; row... | 0 | 80,737,387 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int gcd(int a, int b){
if(a%b == 0){
return(b);
}else{
return(gcd(b, a%b));
}
}
int lcm(int a, ... | 0 | 90,017,769 |
#include<iostream>
#include<cmath>
#include<algorithm>
#define Fast ios_base :: sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define loop(i, n) for(i=1; i<=n; i++)
#define ll long long
using namespace std;
int main() {
Fast;
ll n;
cin >> n;
ll mint = 1000000000002;
ll i, tmp = 0;
for(i=1; i<=... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx")
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <unordered_set>
#incl... | 0 | 94,020,065 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <functional>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define for1(i, m, n) for(int i = m;i < n;i++)
#define ll long l... | #include<bits/stdc++.h>
using namespace std;
#define ms(x,y) memset(x, y, sizeof(x))
#define lowbit(x) ((x)&(-x))
#define sqr(x) ((x)*(x))
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
void run_case() {
int n, p;
string s;
cin >> n >> p >> s;
LL ans = 0;
if(p == 2) {
... | 0 | 30,462,319 |
#include <bits/stdc++.h>
using namespace std;
int main (){
int N;
int K;
int num;
cin >> N >> K;
if(K == 1){
cout << 0 << endl;
}
else{
num = N - K;
cout << num << endl;
}
} | #include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
#include <map>
#include <utility>
using namespace std;
class DICE
{
private:
void swapMap(string a, string b);
public:
map<string,int> dice;
DICE(vector<int> &v);
~DICE();
void turnDice(char c);
void ro... | 0 | 45,702,166 |
#include <iostream>
#include <string>
#include <queue>
using namespace std;
queue<char> q;
int m, h;
string s;
char ch;
int main(){
while (cin >> s && s != "-") {
q = queue<char>();
for (int i = 0; i < s.size(); i++) {
q.push(s[i]);
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> h;
while (h != 0) ... | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define... | 0 | 4,777,027 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x(100000);
for(int i = 0;i < n;i++) cin >> x[i];
return x;
}
int main(){
string n;
cin >> n;
int cnt = 0;
for(int i = 0;i < 3;i++){
if(n[i] == '7'){
cnt++;
}
}
if(cnt != 0){
cout << "Yes" << endl;
}else{
cout... | 0 | 91,926,942 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#inc... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 30,727,617 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
signed main(){
int n, k, x, y;
cin >> n >> k >> x >> y;
if(n <= k){
cou... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 | 9,997,293 |
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
using ll = long long;
#define pi 3.1415926
int x[3];
int main(){
int a, b, c;
cin >> a >> b >> c;
x[0] = a;
x[1] = b;
x[2] = c;
sort(x, x+3);
cout << x[2]*10 + x[1] + x[0];
} | #include<bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ifor(st,lim) for(int i=st;i<lim;i++)
#define jfor(stt,llim... | 0 | 73,294,979 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 | 38,468,791 |
#include <cmath>
#include <iostream>
using namespace std;
int n;
int main() {
cin >> n;
cout << (long long)tgamma((long double)(n + 1)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | 0 | 94,722,406 |
#include<stdio.h>
int main(void) {
int i, j;
int scnt = 0;
int tcnt = 0;
int ans_diff;
int diffcnt;
char s[1001],t[1001];
scanf("%s",s);
scanf("%s",t);
for (i = 0; s[i] != '\0'; i++)scnt++;
for (i = 0; t[i] != '\0'; i++)tcnt++;
ans_diff = tcnt;
for (i = 0;i + tcnt<=scnt; i++) {
for (j = 0, diffcnt = 0; j ... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | 0 | 52,864,320 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n,m ;
cin>>n>>m ;
vector<vector<int>> jobs(m+1) ;
rep(i,n){
int a,b ;
cin>>a>>b ;
if(a>m)
continue ;
jobs[m-a].push_back(b) ;
}
priority_queue... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<31)-1
#define MOD 1000000007
#define all(x) (x).beg... | 0 | 7,167,690 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n,m;
cin >> n >> m;
int d=n-m;
vector<vector<char>> a(n,vector<char>(n));
vector<vector<char>> b(m,vector... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int main(){
ll N, M; cin >> N >> M;
if(N == 1 && M == 1) {
cout << 1 << endl;... | 0 | 28,075,598 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
Graph G;
vector<int> to_exit;
void bfs(int start) {
queue<int> que;
que.push(start);
while (!que.empty())
{
int cur = que.front();
que.pop();
for (auto nex: G[cur]) {
if (to_exit[nex] != ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 61,119,650 |
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
constexpr ll INF = 1e16;
constexpr ll INM = 114514;
constexpr ll MOD = 1e9 + 7;
constexpr ld EPS = 1e-12;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, ... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll ans=0;
vector<char>memo;
ll n,k;cin >>n>>k;
ll r,s,p;cin >>r>>s>>p;
... | 0 | 99,440,573 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
void outStr(vector<string>& ary) {
string aryStr = "";
for (int i = 0; i < ary.size(); i++)
{
aryStr = aryStr + ary[i];
if (i < ary.size() - 1) aryStr = aryStr + " ";
}
cout << aryStr << endl;
return;
}
bool isSm... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <cerrno>
#include <cfenv>
#include <math.h>
#include <iomanip>
#include <limits>
#define ll long long int
using namespace std;
int main(){
int m,n_min,n_max;
vector<int> data(200);
while(true)... | 0 | 72,500,112 |
#include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n;
cin >> n;
vector<ll> a(n);
vector<ll> sheet(n+1);
rep(i,n) {
cin... | 0 | 24,162,949 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main() {
string tmp;
string longest;
int mlength=0;
map<string,int> m;
while(cin >> tmp)
{
m[tmp]++;
if (tmp.size()>mlength)
{
mlength=tmp.size();
longest=tmp;
}
}
string frequent;
int mfreq=0;
for... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | 0 | 53,049,068 |
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;
const int MOD = 1... | #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 <... | 0 | 8,479,761 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | 0 | 63,895,719 |
#include<stdio.h>
int main()
{
int a, b;
scanf("%d", &a);
b = (a*(a+1))/2;
printf("%d\n", b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
template <typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
cout << "{";
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
cout ... | 0 | 54,677,110 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N,K; cin >> N >> K;
ll ans =1;
for (int i =0; i<N; i++) {
if (i ==0) {
ans *= K;
} else {
ans *= K - 1;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/diverta2019_d.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 0 | 20,385,532 |
#include<iostream>
#include<bits/stdc++.h>
#include<iomanip>
#include<math.h>
#include<vector>
#include<cctype>
#include<string>
#include<set>
#include<map>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
std::string line;
typedef long long ll;
int main(){
int n,i;
cin >> n>>i;
cout << n-i+1 << endl... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void fun(ll n, ll s){
ll a[n],sum=0;
for(ll i=0;i<n;i++){cin>>a[i];sum+=a[i];}
ll l,r;
l=0,r=n-1;
while(l<r){
if(a[l]<a[r]&&sum-a[l]>=s){
sum-=a[l++];
}else if(sum-a[r]>=s){
sum-=a[r--];
}else break;
}
cout << r... | 0 | 71,607,602 |
#include <bits/stdc++.h>
#define int long long int
#define gif(a,b) (a/b +(a%b?1:0))
#define pi 3.14159265358
#define watch(x) cout<<(#x)<<" is "<<(x)<<"\n";
#define float long double
using namespace std;
int32_t main()
{
cin.tie(NULL);
std::ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
y /... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | 0 | 7,368,906 |
#include<cstdio>
template<class I>
inline I max(I a, I b) {
return a > b ? a : b;
}
long long _k, n, p[5010], c[5010], preans[5010], ed[5010], dis[5010], ans = -2147483647;
bool vis[5010];
long long getend(long long now, long long _from, long long _st) {
if (!vis[now]) {
vis[now] = 1;
preans[now] = c[now] + prean... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 24,102,845 |
#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <cstring>
#include <climits>
#include <queue>
#include <algorithm>
#include <utility>
#define INF INT_MAX / 2
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int main(void) {
string c[] = {".,!? ","abc","def","ghi","... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int m, k;
cin >> m >> k;
if(k >= (1 << m))cout << -1 << endl;
e... | 0 | 97,512,740 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <list>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <iomanip>
#define INF 1050000000
using namespace std;
int par[10001];
... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 12,685,384 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #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 bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 0 | 94,896,839 |
#include <iostream>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
if(n%k==0) cout << 0 << "\n";
else cout << 1 << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000 + 10, mod = 1e9 + 7;
int a[N],n,k;
ll f(ll x){
return x * (x + 1) / 2 % mod;
}
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
ll ans = 0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++) if(a[i]<a[j])... | 0 | 16,595,264 |
#include <bits/stdc++.h>
using namespace std;
int vector_max(vector<int> A){
int max = A.at(0);
for(int i=0; i<A.size(); i++){
if (A.at(i) > max){
max = A.at(i);
}
}
return max;
}
int vector_secondmax(vector<int> A){
sort(A.begin(), A.end());
int second_max = A[A.size... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | 0 | 47,892,569 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | #include<bits/stdc++.h>
using namespace std;
const int N=2e5;
#define endl "\n"
struct dsu{
int g[N];
void init(){for(int i=0;i<=N;i++)g[i]=i;}
int find(int x){return x==g[x]?x:g[x]=find(g[x]);}
void uni(int u,int v){
int pu=find(u),pv=find(v);
if(pu!=pv)g[pu]=pv;
}
}dis;
int main(){... | 0 | 73,222,288 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
signed main() {
int n,k;
cin >> n >> k;
vector<pair<int,int>> sushi(n);
for (int i = 0; i < n; i++) {
cin >> sushi[i].second >> sushi[i].first;
}
sort(sushi.rbegin(),sushi.rend());
... | #include <bits/stdc++.h>
#include<iostream>
#include<fstream>
#define ll long long
using namespace std;
int main(){
int N; cin >> N;
vector<int> T(N+2,0), A(N+2,0);
for(int i=1; i<=N; i++) cin >> T[i];
for(int i=1; i<=N; i++) cin >> A[i];
vector<pair<int,int>> rangeT(N+1,{0,0}), rangeA(N+1,{0,0}); ... | 0 | 50,228,232 |
#include<iostream>
#include<queue>
#include<utility>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
int main(){
int n,k;cin >> n >> k;
vector<pair<int,int> > in(n);
for(int i=0;i<n;i++){
int a,b;cin >> a >> b;
a --;
in[i] = make_pair(b,a);
}
sort(in... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<ctime>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const int d[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
int main(){
string s;
int n,m;
w... | 0 | 15,086,047 |
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a); i<(b); ++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#de... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
typedef long long ll;
static const ll MX = 100005;
static const ll MX_ll = 1e18;
using namespace std;
struct Node{
int p, l, r;
};
Node T[100005];
int n, D[100005];
void print(int u){
int i, c... | 0 | 58,111,510 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin >> n;
vector<ll> t(n);
vector<ll> a(n);
rep(i,n) ... | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#if 0
const int MOD = ;
inline int lgput(int a, int b) {
int ans = 1;
while(b > 0) {
if(b & 1) ans = (1LL * ans * a) % MOD;
b >>= 1;
a = (1LL * a * a) % MOD;
}
return ans;
}
inl... | 0 | 83,777,247 |
#include <bits/stdc++.h>
#include <unordered_map>
typedef long long ll;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << ... | #include <bits/stdc++.h>
using namespace std;
struct point {
int x;
int y;
int a;
};
int main() {
int W, H, N;
cin >> W >> H >> N;
vector<point> points(N);
for (int i = 0; i < N; i++) {
cin >> points[i].x >> points[i].y >> points[i].a;
}
vector<vector<bool>> field(W + 1, vect... | 0 | 1,775,888 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
const ll INI = -1;
int n;
vector<vector<P>> tree(101010, vector<P>(0));
vector<ll> dist(101010, INI);
void dfs(int pos)
{
for(auto x : tree[pos])
{
if(dis... | #include <iostream>
using namespace std;
#define FS0 fs[v[0]]
#define FS1 fs[v[1]]
void rollv(int v[], int h[]) {
int t = v[0];
v[0] = v[1];
v[1] = v[2];
v[2] = v[3];
v[3] = t;
h[0] = v[1];
h[2] = v[3];
}
void rollh(int v[], int h[]) {
int t = h[0];
h[0] = h[1];
h[1] = h[2];
... | 0 | 95,953,998 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,a,b) for (int i=a ; i<b ; i++)
#define fre(i,a,b) for (int i=a ; i<=b ; i++)
#define mem(a, b) memset(a, (b), sizeof(a))
#define mp make_pair
#define pb push_back
#define inf (int)1e9
#define pii 3.1415926535897932384626433832795
#define mo... | #include <iostream>
int countPattern(int n) {
int count = 0;
int ni, ij, ijk;
for (int i = 0; i < 10; i ++) {
ni = n - i;
for (int j = 0; j < 10; j ++) {
ij = ni - j;
for (int k = 0; k < 10; k ++) {
ijk = ij - k;
if (0 <= ijk && ijk <= 9) {
count ++;
}
}... | 0 | 23,022,070 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define pb push_back
const long double PI = acos(-1);
const long long INF = (1 << 30);
ll gcd(ll a,ll b){return b ? gcd(b,a%b... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<climits>
#include<string>
#include<bitset>
#include<cfloat>
#include<iomanip>
#include<numeric>
#define repi(i,start,end) for(int (i)=(start),Tem... | 0 | 9,541,406 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> A;
int H=0;
void maxHeapify(int idx)
{
int left=2*idx, right=2*idx+1;
int largest;
if(left<=H && A[left]>A[idx]){
largest=left;
} else{
largest=idx;
}
if(right<=H && A[right]>A[largest]){
... | 0 | 22,891,685 |
#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() {
string S;
cin >> S;
map<char, int> t;
for (int i = 0; i < S.length(); i++)
{
t[S[i]]++;
}
if (t.size() == 2 && t[S[0]] == 2)
{
... | #include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int n;
setprecision(5);
long double x[4], y[4],d1,d2,d3,d4;
int ans[100];
cin >> n;
for (int a = 0; a < n; a++) {
cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3];
if (x[0] > x[1]) {
d1 = x[0] - x[1];
d3 = y[0] -... | 0 | 70,963,957 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using V = vector<int>;
using VV = vector<V>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = ... | #include <iostream>
int main(int argc, const char * argv[])
{
int n;
std::cin >> n;
long int min = 1000001;
long int max = -1000001;
long long int sum = 0;
for (int i=0; i<n; i++){
int val;
std::cin >> val;
if (min > val){
min = val;
}
if (max ... | 0 | 26,638,612 |
#include <iostream>
#include <cstdio>
int main() {
int N;
std::cin >> N;
int k = 1;
for ( ; ; ++k)
if (k * (k+1) >= 2*N)
break;
int rem = k * (k + 1) / 2 - N;
for (int i = 1; i <= k; ++i)
if (rem != i)
printf("%d\n", i);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
#define mp make_pair
#define f first
#define s second
#define pb push_back
const int N = 50 + 5;
const int M = 100 + 5;
const ll OO = 1e18;
const int mod = 1e9 + 7;
int n,k,v[N],dp[N][N][M];
int solve(in... | 0 | 30,428,372 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int k,x;
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>
#include <cmath>
using namespace std;
int main() {
long long n, m, a, b, c, d, i, j;
cin >> n >> m;
vector<long long> v... | 0 | 76,372,263 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int arr[n];
for(int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr+n);
int res = abs(arr[n-1] - arr[0]);
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 0 | 28,969,167 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int m,a[N];
ll ans=0;
int top,s[N];
int solve()
{
while(top>1)
{
ans++;
s[top-1]+=s[top];
if(s[top-1]<10) top--;
else
{
s[top]=s[top-1]%10;
s[top-1]=1;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define debug(a) cout << #a << " = " << a << " ";
#define endl "\n"
const int MOD=1000000007;
const int N=100010;
void solve(){
int n;
cin>>n;
... | 0 | 73,405,959 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
bool flag[4] = {};
for(int i = 0;i < 4;i++)
{
int n;
cin >> n;
if(n == 1)
{
flag[0] = true;
}
else if(n == 9)
{
flag[1] ... | #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 M = 1e9 + 7;
int ni[] = {-1, 0, 1, 0};
int nj[] = {0, -1, 0, 1};
int main() {
int h,w;
cin >> h >> w;
vector<string> a(h);
rep(i,h) cin >> a[i];
queue<pair<int, int>> q;
rep(i,h)... | 0 | 76,931,050 |
#include<iostream>
#include<queue>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
typedef long long ll;
#define pi 3.141592653589793238462... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#def... | 0 | 25,316,631 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
size_t as = a.size();
size_t bs = b.size();
if (as > bs) {
cout << "GREATER" << endl;
} else if (as < bs) {
cout << "LESS" << endl;
} else {
bool eq = true;
for (int i = 0; i < as; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
string s;
cin >> s;
bool flag = false;
for(int i = 0; i < s.size()-1; ++i)
{
if(s[i] == s[i+1])
{
cout << i+1 << " " << i+2 << endl;
return 0;
}
if(i+2 < s.size() && s[i] == s[i+2])... | 0 | 59,032,982 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#define INF 100000000000000
using namespace std;
typedef long long llong;
int main(){
llong N,K;
llong d;
llong ans=0;
cin >> N >> K;
vector<vector<llong>... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll C[205][205];
int main() {
ll N, M, R;
cin >... | 0 | 86,659,152 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T,X;
cin >> T >> X;
double ans = double(T) / X;
cout << fixed << setprecision(5) << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 80,076,785 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
typedef long long ll;
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin >> n >> m;
vector... | #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
vector<int> ... | 0 | 2,529,817 |
#include <iostream>
using namespace std;
int main(){
int root[5][51], i, j;
for (i = 0; i < 5; i++) {
for (j = 0; j < 51; j++)
root[i][j] = 0;
}
for (i = 0; i < 10; i++) {
root[1][i] = 1;
}
for (i = 1; i < 5; i++) {
root[i][0] = 1;
}
for (i = 2; i < 5; i++) {
for (j = 1; j < 51; j++) {
for (int k ... | #include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <climits>
#include <cmath>
#include <cstdlib>
#define roundup(n,d) ( ((n) + ((d)-1)) / (d) )
#define ll long long
#define assign_max(into, compared) (into = max((into), (compared)))
using namespace std;
int main(void){
int N,M... | 0 | 52,546,338 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
if(A <= 25) {
cout << "Christmas";
}
if(A <= 24) {
cout << " Eve";
}
if(A <= 23) {
cout << " Eve";
}
if(A <= 22) {
cout << " Eve";
}
} | #include<iostream>
#include<vector>
#include<string>
int main(){
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> ship(n);
for(int i = 0; i < m; i++){
int a, b;
std::cin >> a >> b;
a--; b--;
ship[a].push_back(b);
ship[b].push_back(a);
}
int now... | 0 | 40,530,221 |
#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
using namespace std;
int main() {
ll X, Y, cnt = 0;
cin >> X >> Y;
while(X <= Y) {
X *= 2;
cnt++;
}
cout << cnt << endl;
} | #include<bits/stdc++.h>
using namespace std;
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
#define ull unsigned long long int
#define ll long long int
#define MAX 1000000007
#define pll pair<ll,ll>
#define pii pair<int,int>
#define IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FO ifstream fin("a.in");ofstream... | 0 | 90,071,422 |
#include<iostream>
#include<cmath>
int main(){
int a,b,c,d;
std::cin >> a >> b >> c >> d;
if(std::abs(a - b) <= d && std::abs(b - c) <= d || std::abs(a-c) <= d) std::cout<<"Yes";
else std::cout<<"No";
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
ll count(string &now){
ll sum{};
while(now.size()>1){
sum++;
int k = now.size();
int a = (*(now.end()-1))-'0';
int b = (*(now.end()-2))-'0';
now.erase(now.end()-2,now.end());
auto s = to_string(a+b);
now += s;
}
... | 0 | 28,191,540 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n,tmp,ans;
int a[5000];
while(scanf("%d",&n) && n){
for(int i=0;i<n;i++)scanf("%d",&a[i]);
ans = a[0];
for(int i=0;i<n;i++)
for(int j=i;j<n;j++){
if(i==j)tmp = a[i];
else tmp += a[j];
ans = max(tmp,ans);
}
pri... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
bool start[n], end[n], boat = false;
for (long long i = 0; i < n; i++)
{
start[i] = false;
end[i] = false;
}
for (long long i = 0; i < m; i++)
{
long long a, b;
cin >... | 0 | 80,720,562 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, ... | 0 | 15,820,875 |
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) #x "=" << x << " "
#define fore(i,a,b) for(int i=a,gon=b;i<gon;++i)
#define pb push_back
#define F first
#define S second
typedef double lf;
typedef long long ll;
typedef pair<int, int> pii;
ll solve(ll h, ll w) {
ll mn = w*h, a[3] = {};
for (ll i = 1... | #define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
int main() {
int N;
cin>>N;
int sum=0;
int a[N+2];
a[0]=0;
a[N+1]=0;
for(int i=1;i<=N;i++){
cin>>a[i];
sum+=abs(a[i]-a[i-1]);
... | 0 | 75,876,649 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
void yes() {
cout << "Yes" << endl;
exit(0);
}
void no() {
cout << "No" << endl;
exit(0);
}
#define REP(i, n) for (lo... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie... | 0 | 51,800,688 |
#include<bits/stdc++.h>
#define ro(a) (a).begin(),(a).end()
using namespace std;
using ll = long long int;
string sk;
int main(){
vector<ll> vo(3);
for(ll &i:vo) cin>>i;
sort(ro(vo));
for(ll i = 2;i>=1;i--) sk+=to_string(vo[i]);
cout<<stoll(sk)+vo[0]<<'\n';
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | 0 | 99,541,803 |
#include <bits/stdc++.h>
#include <string>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) (a)=max(a, b);
#define chmin(a, b) (a)=min(a, b);
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
static const ll INF=1e18... | #include "bits/stdc++.h"
using namespace std;
using i64 = int_fast64_t;
using seika = string;
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
template <class kotonoha>
using akane = prior... | 0 | 88,032,384 |
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
int compare(string taro,string hana,int *t,int *h){
int m;
if( taro == hana){
*t += 1;
*h += 1;
}
m = (taro.size() > hana.size()) ? taro.size():hana.size();
for(int i = 0;i < m;i++){
if(taro[i] -'a' > hana[i] - 'a'){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int M, K;
cin >> M >> K;
if (M <= 1) {
if (K == 0) {
cout << 0 << " " << 0 << " ";
if (M == 1) cout << 1 << " " << 1 << endl;
} else
cout << -1 << endl;
return 0;
... | 0 | 69,029,930 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
#define ODD 1
#define EVEN 0
signed main() {
int h, w;
cin >> h >> w;
vector<string> s(h);... | #include <iostream>
#define REP(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;
int N;
int digit(char c) {
if(c == 'm') return 1000;
if(c == 'c') return 100;
if(c == 'x') return 10;
return 1;
}
char undigit(int k) {
if(k == 1000) return 'm';
if(k == 100) return 'c';
if(k == 10) return 'x';
... | 0 | 7,750,453 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | #include <bits/stdc++.h>
using namespace std;
typedef tuple<int, int, int> tiii;
int main() {
int H, W; cin >> H >> W;
vector<string> A(H);
for (int i = 0; i < H; i++) cin >> A[i];
int ans = 0;
vector<vector<bool>> visited(H, vector<bool>(W, false));
queue<tiii> q;
for (int i = 0; i < H; i+... | 0 | 5,790,515 |
#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... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD =1000000007;
ll modPow(ll a, ll n) {
if (n == 0) return 1;
if (n == 1) return a % MOD;
if (n % 2 == 1) return (a * modPow(a, n - 1)) % MOD;
ll t = modPow(... | 0 | 48,197,719 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
for (char c : s) {
if (c == '1') cout << '9';
else cout << '1';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int N;
int D[110000], n[110000], d[110000];
unordered_map<int, int> mp;
v... | 0 | 74,842,558 |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n,t,l,x[N],w[N],ans[N],q[N];
typedef pair<int,int> pii;
pii p[N];
bool cmp(int a,int b){return p[a]<p[b];}
int main()
{
scanf("%d%d%d",&n,&l,&t);
for (int i=1;i<=n;i++){
scanf("%d%d",&x[i],&w[i]);
if (w[i]==2) w[i]=-1;
p[i]=pii((l+(x[i]+w[i]*t... | #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>
... | 0 | 48,185,666 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
string a,b,c;
cin >> a >> b >> c;
cout << char(a[0]-'a'+'A') << char(b[0]-'a'+'A') << char(c[0]-'a'+'A') << endl;
} | #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 | 26,831,603 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <algorithm>
using namespace std;
bool solve(){
while(1){
int n;
cin>> n;
if(!n) break;
vector<int> a(n,0);
for(int i=0;i<n;i++){
cin... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
string A[n];
string B[m];
for(int i = 0; i < n; i++){
cin >> A[i];
}
for(int i = 0; i < m; i++){
cin >> B[i];
}
bool exist = false;
for(int y = 0; y <= n-m; y++){
... | 0 | 15,081,999 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long X, Y;
cin >> X >> Y;
if (abs(X-Y) <= 1) cout <<"Brown\n";
else cout << "Alice\n";
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<int>> a(n,vector<int> (n,0));
vector<vector<int>> v(n,vector<int> (n));
for(int i=0;i<n;i++){
int u,k;
cin>>u>>k;
for(int j=0;j<k;j++){
int m;
cin>>m;
a.... | 0 | 91,631,637 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(ll i=num, i##_len=(n); i<i##_len; ++i)
#define repprev(i,a,b) for(ll i=b-1;i>=a;i--)
#define reprev(i,n) repprev(i,0,n)
using namespace std;
#define sz(x)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | 0 | 45,977,113 |
#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;
}();
int main() {
int n;
cin >> n;
vector<ll> arr(n+2, 1e6);
unordered_map<ll, int> pos;
... | #include <iostream>
using namespace std;
void solve(std::string S){
bool ans = true;
int count = 0;
while (true) {
S.erase(S.end() - 1);
count++;
if (S.size() % 2) continue ;
int mid = S.size() / 2;
if (S.substr(0, mid) == S.substr(mid))
break ;
}
... | 0 | 61,821,612 |
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<numeric>
#include<algorithm>
#include<tuple>
#include<cmath>
#include <iomanip>
typedef unsigned long long ull;
typedef long long ll;
ll DENOM = 1000000000LL + 7LL;
using namespace s... | #include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define INF 1<<30
#define LINF (ll)1<<62
#define MAX 510000
#define rep(i,n) for(ll i=0; i<(n); i+... | 0 | 25,502,884 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int h[100];
cin >> n;
for (int i = 0; i < n; i++) cin >> h[i];
int ans = 0;
while (true) {
if (*max_element(h, h + n) == 0) break;
int i = 0;
while (i < n) {
if (h[i] == 0) i++;
else... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
string word, previous_word;
bool flag = true;
map<string, bool> history;
cin >> previous_word;
history[previous_word] = true;
rep(i, n - 1) {
... | 0 | 16,877,414 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
c=0;
cin>>a>>b;
for(int64_t i=0;i<=a;i++){if(b==2*i+4*(a-i)){cout<<"Yes"<<endl;
c=1;
break;}}
if(c==0){cout<<"No"<<endl;}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | 0 | 87,678,874 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
int main()
{
char ans = 'D';
char a, b;
cin >> a >> b;
if((a=='H'&&b=='H')||(a=='D'&&b=='D')){
ans = 'H';
}
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cstdlib>
#include <cmath>
using namespace std;
const int N = 200050;
int a[N];
int n;
typedef long long LL;
void init()
{
}
void solve()
{
cin >> n;
LL sumX = 0,sumY = 0;
for(int i=0; i<n; i++)
{
cin >> a[i];
sumY += a... | 0 | 39,614,275 |
#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);
}
const int N = 1e5+23;
int a[N], b[N];
void solve() {
int n; scanf("%d", &n);
for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 98,244,392 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
int main(void){
double a,b;
cin>>a>>b;
cout<<a/b<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return abs(a*b)/gcd(a,b);}
vector<ll> enum_div(ll n){vector<ll> ret;for(int i=1 ; i*i<=n ; i++){if(n%i == 0){ret.push_back(i);if(i!=1 && i*i!=n)ret.push_back(n/i);}}ret.push_back(n);return ret... | 0 | 36,809,616 |
#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<typename T> void chmax(T &a, T b) { a = max(a, b); }
template<typename T> void chmin(T &a, T b) { a = min(a, b); }
int main() {
int n;
cin >> n;
vector<string>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
bool flag = false;
while(n){
int rem = n%10;
if(rem==7){
flag = true;
break;
}
n = n/10;
}
if(flag){
cout<<"Yes\n";
}
else{
cout<<"No\n";
... | 0 | 39,495,566 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,i,j,ans=0,M=0;
cin>>N;
vector<int> A(N),a(1000001);
for(i=0;i<N;i++){
cin>>A[i];
a[A[i]]++;
M=max(A[i],M);
}
sort(A.begin(), A.end());
for(i=0;i<N;i++){
if(a[A[i]]==1)ans++;
for(j=2;A[i]*j<=M;j++)a[A[i]*j]=0;
}
cout<... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 76,344,180 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | #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()
{
int a[9];
for (int i = 1; i <= 9; i++) cin >> a[i];
int n;
cin >> n;
int b;
rep(i, n){
cin >> b;
for (int j = 1; j <= 9; j++) ... | 0 | 23,608,754 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long now=0,ans=0;
for(int i=0;i<n;i++){
int x;
cin >> x;
now+=x;
if(x==0){
ans+=(now/2);
now=0;
}
}
ans+=now/2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int maxN= 50;
const ll INF =ll(1e18)+5;
ll dp[maxN][maxN][maxN];
ll V[maxN];
ll N,K;
ll dfs(int l,int r,int stay){
if(l>N-1-r || l+r+stay ==K){
return 0;
}
if(l +r + stay>K){
return -INF;
}
if(dp[l][r][stay] != -... | 0 | 80,135,768 |
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long ... | #include<stdio.h>
int main()
{
int x,n,cou;
cou=0;
while(1)
{
cou=0;
scanf("%d",&n);scanf("%d",&x);
if(x==0&&n==0)break;
for(int i=1;i<=n-2;i++){
for(int j=i+1;j<=n-1;j++){
for(int k=j+1;k<=n;k++)
{
if(i+j+k==x)cou++;
}}}
printf("%d\n",cou);
}
return 0;
} | 0 | 67,938,397 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 0 | 63,860,490 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef vector <int> vi;
int main(void){
int n=5;
vi a(n);
for (int i=0; i<n; i++){
cin>>a[i];
}
sort(&a[0], &a[n], greater <int>());
for (int i=0; i<n; i++){
if (i==n-1) cout<<a[i]<<endl;
else cout<<a[i]<<... | #include<bits/stdc++.h>
using namespace std;
long long N, P;
string S;
long long memo[200005];
map<long long, long long>pcount;
long long kaidan[10000000];
long long modpow(long long ori, long long po){
long long res = 1;
while(po > 0){
if(po&1){
res *= ori;
res %= P;
}
ori *= ori;
ori %= P;
po >>= 1;... | 0 | 76,258,673 |
#include <iostream>
using namespace std;
int main(){
string s; int k, cnt=0;
cin >> s >> k;
for(int i=0; i<k; i++){
if(s[i]!='1'){
cout << s[i] << endl;
return 0;
}else{
cnt++;
}
}
if(cnt==k) cout << 1 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std ;
#define endl "\n"
#define async ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long int
#define all(y) y.begin(), y.end()
#define present( x, y ) (x.find( y ) != x.end())
const int mod = (int)1e9 + 7 ;
template<class T>
auto matrix( int r, int c, T v ){
... | 0 | 100,415,877 |
#include <iostream>
int main(int argc, char const *argv[])
{
int a = 0;
int b = 0;
std::cin >> a >> b;
std::cout << "a";
if (a > b) {
std::cout << " > ";
} else if (a < b) {
std::cout << " < ";
} else {
std::cout << " == ";
}
std::cout << "b" << std::endl;
... | #include <iostream>
#include <string>
#include <cstdio>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <functional>
#include <queue>
#include <math.h>
#include <cmath>
#include <unordered_map>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
void solve(long long A, long long B, lo... | 0 | 60,852,703 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
const int MOD_TYPE = 1;
const ll MOD = (MO... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100001,INF=1<<30;
int main(){
int N;cin>>N;
int j=-1;
for(int i=1;i<=1000;i++){
if(i*(i+1)/2==N) j=i;
}
if(j==-1) cout<<"No"<<endl;
else{
cout<<"Y... | 0 | 75,205,492 |
#include <iostream>
#include <stdio.h>
#include <stdint.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <deque>
using namespace::std;
int ri()
{
int x;
scanf("%d", &x);
return ... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define FOR(x,y) for(ll i=x;i<=y;i++)
#define pb(x) push_back(x)
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vii vector<int>
#define vll vector<ll>
#define matrix(x) vector<vector<x>>
#define vss vector<string>
#defin... | 0 | 71,923,623 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <iomanip>
#include <algorithm>
#include <string>
#include <queue>
#include <numeric>
#include <stack>
using namespace std;
#define nptr nullptr
#define all(x) (x).begin(), (x).end()
#define drobucs ios... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < n; i++)
#define irep2(i,a,n) for(int i = (a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long long i = (a)... | 0 | 54,652,667 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.