code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <chrono>
#include <vector>
using namespace std;
int main () {
int N;
cin >> N;
vector<long long int> x(N), y(N);
for (int i=0; i<N; i++) {
cin >> x[i] >> y[... | #include <bits/stdc++.h>
class WarshallFloyd {
public:
using Matrix = std::vector<std::vector<int>>;
WarshallFloyd(int V) {
mat.resize(V);
for (int i = 0; i < V; ++i) {
mat[i].resize(V, INT32_MAX);
mat[i][i] = 0;
}
}
~WarshallFloyd() = default;
void ad... | 0 | 70,396,137 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n;
scanf("%ld", &n);
long a[n];
for (long i = 0; i < n; i++) {
scanf("%ld", &a[i]);
}
long i = n - 1;
printf("%ld", a[i]);
i -= 2;
for ( ; i >= 0; i -= 2) {
printf(" %ld", a[i]);
}
if (n % 2 == 0)... | #include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
string isTriangle(int a[3]);
int main(){
int n;
int a[3];
cin >> n;
for(int i=0;i<n;++i){
cin >> a[0] >> a[1] >> a[2];
cout << isTriangle(a) << endl;
}
}
string isTriangle(int a[3]){
sort(a, a+3, g... | 0 | 12,809,114 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1e9 + 7;
const double PI = acos(-1.0);
const double eps = 1e-10;
const ll inf = 1e18;
const int maxn = 200005;
inline ll read() { ll s = 0, w = 1; char ch = getchar(); for (; !isdi... | #include <bits/stdc++.h>
#include <vector>
#include <string>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
}
else {
... | 0 | 1,602,001 |
#include<iostream>
using namespace std;
int N,M;
int ans;
long nCr(int n, int r);
int main(){
std::cin >> N >> M;
ans = nCr(N+M,2) - N*M;
std::cout << ans;
}
long nCr(int n, int r) {
long ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans*i;
}
for (int i = 1 ; i < r + 1; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef ... | 0 | 29,320,691 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i,j,r,g,b,k;
cin>>r>>g>>b;
cin>>k;
int k1=0;
while(g<=r)
{
g*=2;
k1++;
}
if(k1>k)
{
cout<<"No";
return 0;
}
while(b<=g)
{
b*=2;
k1++;
}
if(k1>k)
{
cout<<"No";
return 0;
}
cout<<"Yes";
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<pair<string,int>> vc;
for(int i=0;i<n;i++){
string s; cin >> s;
int tim; cin >> tim;
vc.push_back(make_pair(s,tim));
}
string s; cin >> s;
int j;
int total = 0;
for(int i=0;i<n;i++){
if(vc... | 0 | 56,479,502 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll ans(ll n, ll x) { return x ? (ans(x, n % x) + n / x * x * 2) : -n; }
ll x, n;
int main() {
scanf("%lld%lld", &n, &x);
if (n < x + x) x = n - x;
printf("%lld\n", n + ans(n - x, x));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | 0 | 46,072,884 |
#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 n, m;
cin >> n >> m;
int odd=0;
rep(i,n) {
int a;
cin >> a;
if(a%2!=0) odd++;
}
ll ans = 1;
rep(i,n-1) ans *= 2;
if(odd==0&&m==1) ans ... | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
using namespace std;
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;... | 0 | 2,679,146 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1006;
int X,Y,Z,K;
ll A[MAX_N],B[MAX_N],C[MAX_N];
void solve()
{
sort(A,A+X,greater<ll>());
sort(B,B+Y,greater<ll>());
sort(C,C+Z,greater<ll>());
vector<ll> v;
for(int i=0;i<X;++i)for(int j=0;j<Y;++j){
v.push_back(A[i]+B[j]);
... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
using namespace std;
typedef long long ll;
typedef l... | 0 | 59,354,230 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | #include <bits/stdc++.h>
#define speedup ios_base::sync_with_stdio(NULL)
#define fin freopen("gymnastics.in", "r", stdin)
#define fout freopen("gymnastics.out", "w", stdout)
#define FILENAME
#define PUBG push_back
#define p_b pop_back
#define mp make_pair
#define fi first
#define se second
#define cls clear
#define INF... | 0 | 8,623,064 |
#include<bits/stdc++.h>
#define loop(vals,times) for(vals=0;vals<times;vals++)
#define reg(time) for(int val=0;val<time;val++)
#define space <<" "<<
using namespace std;
int main()
{
int n;
set<string> dic;
cin>>n;
reg(n){
string c,w;
cin>>c>>w;
if(c=="insert"){
dic.inser... | #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 | 9,476,270 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
int mod = 1000000007;
int s;
cin >> s;
vector<int> dp(s+1, 0);
dp[0] = 1;
for(int i = 3; i <= s; ++i) {
for(int j = 0; j <= i-3; ++j) {
... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 0 | 47,711,757 |
#include<iostream>
using namespace std;
int main(){
int a;
int b;
int c;
cin >> a >> b >> c;
int n=0;
if(a<b){
for(int i=a;i<=b;i++){
if(c%i==0){
n=n+1;
}
}
}
if(a==b){
if(c%a==0){
n=1;
}
}
cout << n << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
int main() {
int N, K, R, S, P;
string T, U;
cin >> N >> K >> R >> S >> P >> T;
ll score = 0;
for (int i = 0; i < N; i++) {
if (i - K >= 0 && T[i - K] == T[i]) {
if (T[i] == '... | 0 | 7,670,369 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0, tt = 0;
for(int i = n-1; i >= 0; i--){
if(h[i] <= h[i-1]) tt++;
else... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int main () {
int k, s ;
int ans = 0 ;
c... | 0 | 32,808,500 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<... | #pragma GCC optimze("Ofast")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 1000000007
#define md 998244353
#define trace(...)
#define ll long long int
#define ld long double
#define fi first
#define se ... | 0 | 90,802,321 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | #include <bits/stdc++.h>
using namespace std;
typedef vector< vector<int> > vvi;
typedef vector< vector<bool> > vvb;
typedef vector< vector<char> > vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
int main(){
long long N;
cin >> N;
long long div1=1;
for(long long i=1;i*i<=N... | 0 | 26,849,645 |
#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 REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
using namespace std;
using ll = long long;
constexpr int mod = 1e9 + 7;
int main()
{
int n, k, r, s, p, ans = 0;
bool pre = true;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
for (si... | 0 | 79,706,082 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <time.h>
#include <cstdlib>
#include <cmath>
#include <fstream>
using namespace std;
int main() {
string str, order, rep;
int n, s, t;
cin >> str >> n;
for (int i = 0; i < n; i++) {
cin >> order >> s >> t;
... | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
#define N 5001
int a[N];
bool dp[N][N];
bool suf[N];
int minValue[N][N];
void solve() {
int n, k; scanf("%d %d", &n, &k);
long long sum = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]); sum += a[i];
if (a[i] ... | 0 | 65,321,969 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 85,086,190 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string S;
cin >> S;
string ans;
if (S.size() < 26)
{
vector<int> dic(26, 0);
for (int i = 0; i < S.size(); i++)
{
int val = (int)(... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 100,719,852 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
int main(){
ll N;
ll ans = 0;
cin >> N;
if(N%2 == 1||N==0) cout << 0 << endl;
else{
N /= 2;
ll i = 1;
while... | #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#include<c... | 0 | 18,979,952 |
#include<stdio.h>
int main() {
long long int h,n;
long long int i,sum=0;
scanf("%lld %lld",&h,&n);
for(i=0;i<n;i++)
{
long long int m;
scanf("%lld",&m);
sum = sum + m;
}
if(sum>=h)
{ printf("Yes\n"); }
else {printf("No\n"); }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int mark[N], cnt[2], node, val;
vector <int> g[N];
void dfs(int v, int col = 1) {
mark[v] = col, node++;
for (int u : g[v]) {
if (!mark[u]) dfs(u, 3 - col);
else if (col == mark[u]) val = 0;
}
return ;
}
int main() {
... | 0 | 55,609,140 |
#include<stdio.h>
int main(void)
{
int w,h,x,y,r,flg=1;
scanf("%d %d %d %d %d",&w,&h,&x,&y,&r);
if(w<x+r||0>x-r) flg=0;
if(h<y+r||0>y-r) flg=0;
if(flg==1) printf("Yes\n");
else printf("No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).siz... | 0 | 41,726,519 |
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define rep(i,n) for(ll i=0;i<n;i++)
#define INF 1e9+7
#define... | #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
#define pb push_back
using namespace std;
ll cache[100005];
ll dp(ll a[],ll n,ll k){
if(n<=0)
return 0;
if(n==1)
return abs(a[1]-a[0]);
if(cache[n]!=-1)
return cache[n];
... | 0 | 17,847,579 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define fo(i, n1, n, x) for(int i = n1; i <= n; i += x)
#define foo(i, n, n1, x) for(int i = n; i >= n1; i -= x)
#define bit... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef... | 0 | 83,833,008 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll x, y;
cin >> x >> y;
if (x % y == 0ll) {
cout << -1 << endl;
} else {
for (ll i = 2ll; x * i < 1000000000000000000ll; i++) {
if (x * i % y != 0) {
cout << x * i << endl;
... | 0 | 39,080,334 |
#include <iostream>
int f(int a, int b,int c)
{
if (a * a == b * b + c * c) {
return 1;
} else if (b * b == c * c + a * a) {
return 1;
} else if (c * c == a * a + b * b) {
return 1;
} else {
return 0;
}
}
int main()
{
int N;
std::cin >> N;
for (int i = 0; i < N; i++) {
int a;
int b;
int c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, m, n) for (ll(i) = (ll)(m); i < (ll)(n); ++i)
#define REP2(i, m, n) for (ll(i) = (ll)(n)-1; i >= (ll)(m); --i)
#define rep(i, n) REP(i, 0, n)
#define rep2(i, n) REP2(i, 0, n)
#define all(hoge) (hoge).begin... | 0 | 75,800,520 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | #include<iostream>
#include<vector>
using namespace std;
int main(void){
int n,m,p;
while(1){
cin>>n>>m>>p;
if(n==0)break;
vector<int> x(n);
int sum=0;
for(int i=0;i<n;i++){
cin>>x[i];
sum+=x[i];
}
sum=sum*(100-p);
if(x[m-1]==0){
cout<<"0"<<endl;
}else... | 0 | 15,587,743 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | 0 | 24,144,163 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n), B(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
B[i] = a[i] - i - 1;
}
sort(B.begin(), B.end());
int b = B[n/2];
ll ans = 0;
for (int i = 0; i < n; i++) ans += abs(a[i] - (b+(... | #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;
const do... | 0 | 91,218,367 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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 rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | #include <bits/stdc++.h>
using namespace std;
int M, Nmin, Nmax;
vector<int> P;
void solve(){
sort(P.rbegin(), P.rend());
int gap = 0;
int ans = -1;
for(int i=Nmin-1; i<Nmax; i++){
if(P[i]-P[i+1] >= gap){
gap = P[i]-P[i+1];
ans = i + 1;
}
}
cout << ans << ... | 0 | 60,610,401 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n), d(n + 1);
rep(i, n) cin >> a[i];
rep(i, n) {
d[i + 1] = d[i] + a[i];
d[i + 1] %= k;
}
map<ll, ll> mp;
... | 0 | 73,335,036 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (auto& v : a) {
cin >> v;
}
int ans = 0;
for (auto v : a) {
if (ans + 1 == v) ans++;
}
if (ans > 0) {
cout << N - ans << endl;
} else {
cout << -1 <... | #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)
using namespace std;
#define int long long
using ll = long long;
const int MX = 1e6;
const ll inf = ... | 0 | 92,291,095 |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((a) / gcd(a,b)) * (b)
#define all(x) x.begin(),x.end()
#define ll long long
#define ull unsigned long long
#define VI vector<int>
#define VLL vector<ll>
#define VS vector<string>
#define MPII map<int, int>
#define SET set<int>
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
usi... | 0 | 72,307,289 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;... | #include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
using namespace std;
typedef long long ll;
typedef vector<int> vi;... | 0 | 89,734,597 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
vector<pair<T, T>> prime_factor(T n) {
vector<pair<T, T>> ret;
for (T i = 2; i * i <= n; i++) {
T tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
}
ret.push_back(make_pair(i, tmp));
}
... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 22,179,752 |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#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>
#include <tuple>
#in... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 59,401,096 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
double f(double x){
return x * x;
}
int main(void){
double a, b, C, rad;
cin >> a >> b >> C;
rad = C * M_PI / 180.0;
cout << fixed << setprecision(8) << a * b * sin(rad) / 2 << endl;
cout << fixed << setprecision(8) << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 10000... | 0 | 99,965,404 |
#include <iostream>
#include <algorithm>
int main() {
int n;
std::cin >> n;
double v[50];
for (int i = 0; i < n; i++) {
std::cin >> v[i];
}
std::sort(v, v + n);
for (int i = 1; i < n; i++) {
v[i] = (v[i - 1] + v[i]) / 2;
}
std::cout << v[n - 1] << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i < n; i++)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF = 1e18;
int main(){
ll N;
cin >> N;
ll ... | 0 | 91,927,534 |
#include<bits/stdc++.h>
using namespace std;
long long int n,a[1000001];
int gcd(int c,int d) {
return d==0?c:gcd(d,c%d);
}
int main() {
cin>>n;
int ans=0;
for (int i=0; i<n; i++) {
int x;
cin>>x;
a[x]++;
ans=gcd(ans,x);
}
int ok=1;
for (int i=2; i<=1000000; i++) {
int cnt=0;
for (int j=i; j<=1000000... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
int main(){
int n, m;
cin >> n;
map<string, in... | 0 | 3,223,365 |
#include <iostream>
#include <vector>
#include <bitset>
using namespace std;
int main() {
string s;
cin >> s;
int x, y;
cin >> x >> y;
vector<int> dx, dy;
int runlength = 0;
bool isx = true;
for (char c : s) {
if (c == 'F') {
++runlength;
continue;
}
if (isx) {
dx.push_back... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
string s, t;
cin >> s >> t;
char toS[26];
char toT[26];
for (Int i = 0; i < 26; ++i) {
... | 0 | 15,514,854 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include<complex>
using namespace std;
long long int gcd(long long int a, long long int b) {
long long int tmp;
... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(long long i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(long long i=int(n);i>0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | 0 | 64,784,034 |
#include <bits/stdc++.h>
#define Maxn 100007
using namespace std;
int n,m,v,p;
int a[Maxn],b[Maxn];
bool check(int id)
{
int tmp=a[id]+m;
int now=0;
for (int i=1;i<=n;i++)
if (i!=id) b[++now]=a[i];
long long res=1LL*p*m;
for (int i=p;i<=now;i++)
{
if (b[i]>tmp) return false;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
string s;
cin >> n >> s;
char cnt = s[0];
int ans = 1;
for (char c : s)
{
if (c != cnt)
{
cnt = c;
ans++;
}
}
cout <<... | 0 | 71,924,157 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
const int N = 1000005;
#define ld long double
#define PI 3.14159265358979323846
const int INF = 1e9+7;
void flash()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.setf(i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int x,y,mul,cnt=0,ans;
cin>>x>>y;
if(x%y==0)
{
cout<<"-1\n";
return 0;
}
for(int i=1;; i++)
{
if(x%y!=0)
{
cout<<x*i<<endl;
return 0;
}
}
} | 0 | 62,686,863 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#in... | #include <iostream>
#include <vector>
using namespace std;
int main () {
int n;
int sum, max_sum;
while(cin >> n, n){
vector<int> a;
for(int i = 0; i < n; i++){
int temp;
cin >> temp;
a.push_back(temp);
}
max_sum = a[0];
for(int begin = 0; begin < n; begin++){
sum = 0;
... | 0 | 13,001,717 |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
struct QuickFind{
int n;
vector<int> r,p;
vector<vector<int> > v;
QuickFind(){}
QuickFind(int sz):n(sz),r(sz),p(sz),v(sz){
for(int i=0;i<n;i++){
r[i]=1,p[i]=i;
v[i].resize(1,i);
}
}
bool same(int x,int y){
return p... | #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;
const int mod = 1e9+7;
int a[N], t[N];
void solve() {
int n; scanf("%... | 0 | 33,625,085 |
#include <iostream>
#include <vector>
using namespace std;
vector<int> ans;
int ch;
int solute(int k)
{
int num=0;
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++)
{
if(a+b+c+d==k)
num++;
}
return num;
}
int main()
{
while(cin>>ch)
{
ans.push_b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string aa, bb;
for (int i = 0; i < b; i++) {
aa += to_string(a);
}
for (int i = 0; i < a; i++) {
bb += to_string(b);
}
vector<string> vec;
vec.push_back(aa);
vec.push_back(bb);
... | 0 | 38,094,512 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int N;
string S;
signed main()
{
cin >> N;
cin >> S;
int ans = 0;
rep(i,1000)
{
int mem = 1;
rep(j,N)
{
if('0' + ((i / mem) % 10) == S[j])
{
... | #include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#... | 0 | 24,363,664 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | #include <bits/stdc++.h>
using namespace std;
int main(int args, char *argv[])
{
int N;
cin >> N;
vector<pair<int, int>> v1;
for (int i = 0; i < N; i++)
{
int a, b;
cin >> a;
cin >> b;
v1.push_back({a, b});
}
vector<pair<int, int>> v2;
for (int i = 0; i < ... | 0 | 28,587,538 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto&& w : a) cin >> w;
sort(begin(a), end(a));
int x = a[n - 1];
int i = lower_bound(begin(a), end(a), x / 2) - a.begin();
int y;
if (i == 0)
y = a[0];
else
y = ((x - 2 * a[i - 1]) <= (2 * a[i... | #include<bits/stdc++.h>
#define ll long long
#define llu unsigned long long
#define mod 1000000007
#define pi ((2.0)*acos(0.0))
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x... | 0 | 2,589,474 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
int main () {
int N;
cin >> N;
int M = 0;
vector<int> h(N, 0);
rep(i, N) {
cin >> h[i];
M = max(h[i], M);
}
int ans = 0;
for (int i = 1; i <= M ; i++) {
bool flag = fa... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iomanip>
using namespace std;
#define ll long long
int main(void){
ll n;
cin >> n;
ll a[n];
ll check[n];
for(ll i = 0; i < n; i++){
cin >> a[i];
... | 0 | 28,668,484 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a,b;
cin >> a >> b;
if(a=='H'){
if(b=='H')cout << 'H';
else cout << 'D';
}else{
if(b=='H')cout << 'D';
else cout << 'H';
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
using namespace std;
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
class Calc_Mod{
public:
unsigned int mod=1000000007;
ll plus_mod(ll a,ll b){
return (a+b)%mo... | 0 | 53,772,124 |
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int x) {
if(x == 1) return false;
for (int i = 2; i < x; i++) {
if(x % i == 0) return false;
}
return true;
}
int main() {
int n;
cin >> n;
vector<int> Prime;
for (int i = 2; i <= n; i++) {
if(isPrime(i)) Prime.pu... | #include <iostream>
#include <algorithm>
#include <list>
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
list<int> List;
int CommandNum;
string Command;
int Number;
List.clear();
cin >> CommandNum;
for(int i = 0; i < CommandNum; i++){
cin... | 0 | 64,664,037 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int W, H, x, y, r;
scanf("%d %d %d %d %d", &W, &H, &x, &y, &r);
if ((x>=r && x <= W-r) && (y>=r && y <= H-r)){
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | #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;
cin >> n;
VI a(n);
rep(i,n){
cin >> a.at(i);
}
if(n%2==0){
VI b(n/2);
VI c(n/2);
rep(i... | 0 | 26,763,392 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, int> P;
typedef pair<ll, pair<ll, ll> > P3;
const ll MOD = ll(1e9 + 7);
const ll LLINF = LLONG_MAX;
const int IINF = INT_MAX;
const int MAX_N = int(1e5) + 5;
const double EPS = 1e-8;
int dx[] = {1, 0, -1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll x,a,b;
cin>>x>>a>>b;
if(b<=a)
cout<<"delicious";
else if(x+a>=b)
cout<<"safe";
else
cout<<"dangerous";
return 0;
} | 0 | 64,691,521 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string str, com, p;
int q, a, b;
cin >> str >> q;
for (int i = 0; i < q; i++) {
cin >> com >> a >> b;
if (com == "print") {
cout << str.substr(a, b - a + 1) << endl;
}
else if (com == "rever... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace st... | 0 | 67,115,412 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl "\n"
int main()
{
faster;
int n;
cin >> n;
vector<ll> a(n);
ll balance = 1000,stock = 0;
for(auto &x: a) cin >> x;
for(int i = 0; i < n-1; i++){
if(a[i] < a[... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define ... | 0 | 54,448,770 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long i,j,t,a,b,n,c,x,y,m,prev,sum;
t=1;
while(t--)
{
string s;
cin>>a>>b;
cout<<max(0L,a-b);
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 1000000;
const int MOD = 1000000007;
signed main() {
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=1;i<n;i++){
if(a[i-1]>=a[i])break;
if(i==n-1){
cout<<1;
return ... | 0 | 61,783,757 |
#include<cstdio>
long long n,x;
long long ans(long long n,long long x)
{
if (n%x==0) return (2*(n/x)-1)*x;
return ans(x,n%x)+2*(n/x)*x;
}
int main()
{
while (~scanf("%lld%lld",&n,&x)) printf("%lld\n",ans(n-x,x)+n);
} | #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 | 39,874,613 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
int a[5];
rep(i,5){
cin>>a[i];
}
int ans =0;
int lo=a[0];
for(int j=1;j<5;j++){
if(lo%10>a[j]%10&&a[j]%10!=0){
ans +=lo+(10-lo%10);
lo=a[j];
}
... | 0 | 13,256,105 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char in;
cin >> in;
if (in == 'a' || in == 'e' || in == 'i' || in == 'o' || in == 'u')
cout << "vowel" << endl;
else
cout << "consonant" << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 200011
int main(){
ll n,i;
cin>>n;
ll a[n+9],b[n+9];
for(i=1;i<=n;i++){
cin>>a[i];
}
sort(a+1,a+1+n);
ll s=0,p=0,q=0;
for(i=n;i>1;i--){
if(a[i]==a[i-1] && a[i]!=p){
if(s==0) {
p=a[i];
... | 0 | 53,069,748 |
#include <iostream>
using namespace std;
int main()
{
char sr[20];
cin >> sr;
for (int i = 20; i >0; i--)
{
if (sr[i - 1] != '\0') {
cout << sr[i - 1];
}
}cout << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N; cin >> N;
for (int i = 0; i < N; i++) {
string s[2]; cin >> s[0] >> s[1];
int n[2]= {0,0};
for (int i = 0; i <2;i++ ) {
char prev = '1';
for (auto x : s[i]) {
switch... | 0 | 73,008,708 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
ll gcd(ll m, ll n) {... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fill fill_n
#define pf push_front
#define pb push_back
#define FOR(i,l,r) for(int i=l;i<r;i++)
#define ROF(i,r,l) for(int i=r;i>=l;i--)
#define comp(v) (v).begin(),(v).end()
#define ff first
#define ss second
#define infile freopen("input.txt", ... | 0 | 26,013,226 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m, l, r;
cin >> n >> m;
int lmax = 1, rmin = n;
rep(i, m) {
cin >> l;
cin >> r;
lmax = max(lmax, l);
rmin = min(rmin, r);
}
cout ... | #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() {
int n;
cin>>n;
for (int i=0; 4*i<=n; i++) {
for (int j=0; 7*j<=n; j++) {
if (4*i+7*j==n) {
... | 0 | 41,048,706 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <deque>
#include <functional>
using namespace std;
int main(void)
{
int a,b,c,d,e;
int kari[10];
while(cin>>a>>b>>c>>d>>e)
{
deque<int> nums;
nums.push_back(a);
nums.push_back(b);
nums.push_back(c);
nums.push_back(d);
nums.push_back(e);... | #include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int... | 0 | 18,575,154 |
#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... | #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 | 96,019,929 |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define Yes(hoge) cout<<((hoge)?"Yes":"No")<<endl;
#define YES(hoge) cout<<((hoge)?"YES":"NO")<<endl;
us... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <list>
#include <string>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
#define REPD(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) REPD(i, 0, n)
typedef long l... | 0 | 81,379,166 |
#include <iostream>
#include <map>
using namespace std;
int main(){
map<int, string> mp;
for(int i = 0; i < 26; i++){
mp[i] = i + 65;
}
int h, w;
cin >> h;
cin >> w;
string m[h][w];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> m[i][j];
}
}
for(int i = 0; i < h; i+... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
K = min(K, 50);
vector<int> A(N);
REP(i, N) cin >> A[i];
while ... | 0 | 59,486,214 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
using namespace std;
int main(void) {
double x1, x2, y1, y2, dist;
cin >> x1 >> y1 >> x2 >> y2;
dist = sqrt( pow((x1-x2),2) + pow((y1-y2),2) );
cout << fi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; ... | 0 | 77,243,676 |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int sz = 1e5 + 1;
ll n, k;
ll dp[sz];
ll bpow(ll x, ll p) {
if (p == 0)
return 1;
if (p % 2)
return (bpow(x, p - 1) * x) % mod;
else {
ll b = bpow(x, p / 2);
return (b * b) % mod;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1LL << 60
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i, m) for (lon... | 0 | 26,231,784 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <ctime>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while(1){
cin>>n;
if(n==0){
return 0;
}
vector<int> a(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
sort(a.begin(),a.end());
vector<int> ans(n-1);
for(int i=0;... | 0 | 34,851,028 |
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
int main(){
set<int> s;
int x,n;
cin >> x >> n;
if(n == 0){
cout << x << endl;
return 0;
}
for(int i = 0; i < n; i++){
int a;
cin >> a;
s.insert(a);
}
int idx = 0;
whi... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x... | 0 | 13,754,784 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int n;
cin >> n;
int a[n],b[n];
rep(i,n)cin >> a[i];
rep(i,n)cin >> b[i];
vector<ll>sa(n);
rep(i,n)sa[i] = a[i] - b[i];
so... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();... | 0 | 21,860,484 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
int main() {
char x,y;
cin >> x >> y;
if(x==y)
cout << "=" << endl;
else if(x>y)
cout << ">" << endl;
else
cout << "<" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
#define endl "\n"
const int MOD = 1000000007;
int main()
{
int a,len;
str x;
cin >> a >> x;
len = x.length();
if (len <= a){
cout << x << endl;
}
else {
... | 0 | 33,088,582 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 83,738,792 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main(){
double a,b,c,deg,S;
cin >> a >> b >> deg;
S = (0.5) * a * b * sin(M_PI * deg / 180);
c = sqrt(a * a + b * b - 2 * a * b * cos(M_PI * deg /180));
cout << setprecision(10) << S << endl;
cout << a + ... | #include <iostream>
#include <string>
#include <vector>
#include <stack>
using namespace std;
bool ok (string s)
{
stack<char> stk;
for (int i=0; i<s.size(); i++)
{
if (s[i]=='(') stk.push('(');
if (s[i]=='[') stk.push('[');
if (s[i]==')')
{
if (stk.empty()) retur... | 0 | 63,946,131 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 998244353
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;}
const long long INF = 1LL << 60;
bool pairCo... | 0 | 48,215,468 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main( )
{
ll N;
cin>>N;
if(N%2 == 1){
cout<<"0"<<endl;
}
else{
ll cnt=0;
N /= 2;
for(ll i=5;(N/i)>=1;i *= 5){
cnt += (N/i);
}
cout<<cnt<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(),A.end()
void ALLIN1_NUMBER(vector<ll>& V)
{
for(auto& x : V)
{
cin >> x;
}
}
void ALLOUT2_WITHOUT_SPACE(vector<vector<ll>> V)
{
ll Vsize = V.size();
ll Visize = V[0].size();
for(ll i=0;i<Vsize;i+... | 0 | 60,795,301 |
#include <bits/stdc++.h>
using namespace std;
int main()
{string A, B; cin >> A >> B;
cout << (A == B ? "EQUAL" : vector<string>{"GREATER", "LESS"}[A.size() == B.size() ? A < B : A.size() < B.size()]);} | #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 | 68,668,749 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1e9 + 7;
int N, A, B, C;
vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(a, min(b, c)) > 0) {
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
} else {
... | 0 | 82,273,788 |
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
using namespace std;
int size(string x){
string::size_type size=x.size();
return size;
}
#define fu(l,k) for(int i=l;i<k;i++)
#define fd(l,... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n,i;
cin>>n;
ll arr[n];
map<ll,ll> mp;
for(i=0;i<n;i++)
{
cin>>arr[i];
mp[arr[i]]++;
}
ll sum=0;
for(auto itr=mp.begin();itr!=mp.end();itr++)
{
ll temp=itr->second;
s... | 0 | 8,090,677 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define data pair<int,pii>
int N;
vector<data> V;
signed main()
{
cin >> N;
rep(i, N)
{
int a, b;
cin >> a >> b;
V.push_back({a + b, {a, b}});
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 1001001001001001;
int main() {
int n; cin >> n;
ll k; cin >> k;
ll a[n];
rep(... | 0 | 14,362,149 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vi=vector<int>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> ll... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 | 69,473,433 |
#include <iostream>
using namespace std;
const int MAXN = 100 * 1000 + 5;
long long arr[MAXN];
long long temp[MAXN];
int n, k;
int main () {
cin >> n >> k;
for (int i = 0; i < n; i ++) {
cin >> arr[i];
if (i > 0) {
if (arr[i] > 0)
temp[i] = temp[i - 1] + arr[i];
else
temp[i] = temp[i - 1];
arr[i]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define vvll vector<vll>
#define rep(i, n) for(i = 0; i < n; i++)
int main(){
ll A, B, C, D, a;
cin >> a;
A = a / 1000;
B = a / 100 % 10;
C = a / 10 % 10;
D = a % 10;
for (int i = -1; i < 2; i += 2) {
... | 0 | 7,992,640 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for(int i=0;i<(int)n;i++)
const int INF = (1LL<<31)-1;
const int MOD = 1000000007;
int main(){
int n; cin >> n;
vector<int> a(n);
int ma = -1;
rep(i,n){
cin >> a[i];
ma = max(ma,a[... | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll R,G,B,N;
... | 0 | 98,861,800 |
#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#define debug(x) cerr << #x << ": " <... | #include <iostream>
using namespace std;
int main() {
while (true) {
int N, A, B, C, X;
int Y[101];
cin >> N >> A >> B >> C >> X;
if (N == 0 && A == 0 && B == 0 && C == 0 && X == 0) { break; }
for (int i = 0; i < N; i++) { cin >> Y[i]; }
int ans = 0, i = 0;
wh... | 0 | 53,939,480 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> ... | #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 <cctype>
#in... | 0 | 8,723,998 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
int main(){
ll H,N;
cin >> H >> N;
vector<ll> A(N,0);
vector<ll> B(N,0);
for(int i = 0; i < N; i++) cin >> A[i] >> B[i];
ll max_A = 0;
for(int i = 0... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
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; }
const ll INF=1LL<<60;
int main(){
cin.tie(0);
... | 0 | 1,745,930 |
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, X, T;
cin >> N >> X >> T;
for (int i = 1; i < 1e5 + 5; i++) {
if(N <= X * i) {
cout << T * i;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 0 | 53,383,797 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
typedef pair<int, int> P;
const int MAX_N = 10000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef int64_t ll;... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
long long n;
cin >> n;
long long x[n];
for(long long i = 0; i < n; i++) cin >> x[i];
long long minv = 1e9;
for(long long i = -1000; i <= 1000; i++){
long long sum = 0;
for(long long j = 0; j < n; j++){
... | 0 | 17,859,012 |
#include <iostream>
#include <stack>
using namespace std;
int main() {
stack<int> cars;
int command;
while(cin >> command) {
if (command == 0) {
cout << cars.top() << endl;
cars.pop();
} else {
cars.push(command);
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 71,606,165 |
#include <iostream>
using namespace std;
int pow(int r){
int result=1;
for(int i=0;i<r;i++){
result *= 10;
}
return result;
}
int main(){
int n;
cin >> n;
for(int i=0;i<n;i++){
char inp[20]={0},out[10]={0};
int a=0,b=0,t;
bool num=true;
cin >> inp;
for(int j=0;j<10;j++){
if(inp[j]==0){ break; }
... | #include<bits/stdc++.h>
using namespace std;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
long long t;
cin>>t;
long long ans=1;
vector<long long> arr;
while(t--) {
long long num;
cin>>num;
if(num==0) {
cout... | 0 | 55,942,381 |
#include<bits/stdc++.h>
#define ll long long int
#define nl '\n'
using namespace std;
int main(void){
ll n,m,ans=0,cnt=0;
string s;
cin>>n;
cin>>s;
for(ll i=1; i<=n; i++){
if(s[i]!=s[i-1]) cnt++;
}
cout<<cnt;
} | #include <cstdio>
#include <set>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
#define ll long long
const ll N = 1000000000;
int main(){
int h, w;
cin >> h >> w;
vector<vector<int> > ar(h), dp(h);
for (int i = 0; i < h; ++i) {
d... | 0 | 44,420,127 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a,... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ... | 0 | 25,475,538 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | #include<iostream>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#include<sstream>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(c... | 0 | 65,977,405 |
#include <iostream>
#include <vector>
using namespace std;
int INF = 100000;
int min(int a, int b) {
return a > b ? b : a;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M), b(M), c(M);
int dist[100][100];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (i == j) {
dis... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int get(int n){
string ans;
cout << n << endl;
cin >> ans;
if(ans == "Male"){
return 1;
}else if(ans == "Female"){
return 2;
}else if(ans == "Vacant"){
return 0;
}
}
int main(){
int N; cin >> N;
... | 0 | 97,781,768 |
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define LL long long
template <typename T>
class WeightedUnionFind{
private:
std::vector<int> par;
std::vector<int> rnk;
std::vector<T> diff;
public:
WeightedUnionFind(int n):par(n),rnk(n),dif... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<long long> H(N + 1, 0);
for(int i=1; i<=N; ++i) cin >> H[i];
if(K == 0) {
long long res = H[1];
for(int i=2; i<=N; ++i) res += max(H[i] - H[i - 1], 0LL);
cout << res << endl;
} else {
... | 0 | 46,703,459 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
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 ... | #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)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 96,146,417 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long int LL;
vector<int> v[101];
vector<int> dist;
queue<int> q;
int bfs() {
dist[1] = 0;
q.push(1);
while (!q.empty()) {
int c = q.front();
q.pop();
for (int i = 0; i < v[c].size(); i++) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,c;
cin >> s;
bool ok=true;
for(int i=0;i<s.size();i++){
if(s.at(i)!=s.at(s.size()-1-i))ok=false;
}
c=s;
for(int i=0;i<s.size()/2+1;i++){
c.pop_back();
}
for(int i=0;i<c.size();i++){
if(c.at(i)!=... | 0 | 51,445,827 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#define rep(i,n) for (long long i=0; i < (n); ++i)
#define rep2(i,n,m) for(long long i=n;i<=m;i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF=1e18 ;
inline void c... | #include <iostream>
#include <vector>
#include <algorithm>
#define MAXVALUE 10000
#define rep(i,a) for(i=0;i<a;i++)
using namespace std;
void CountingSort(vector<int> &A, vector<int> &B, int k){
int i,j;
vector<int> C(k+1,0);
for(j=0; j<A.size(); j++) {
C[A[j]]++;
}
for(i=1; i<=k; i++) {
... | 0 | 51,741,979 |
#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(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int l, r;
cin >> l >> r;
if(r - l >= 2019) cout << 0 << endl;
else{
vector<int> n;
for(int i = l; i <= r; i++){
n.push_back(i... | 0 | 84,396,060 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.