code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
const int nil = -1;
struct Node {int p, l, r;};
Node T[100000];
int n, D[100000];
void print(int u) {
cout << "node " << u << ": ";
cout << "parent = " << T[u].p << ", ";
cout << "depth = " << D[u] << ", ";
if (T[u].p == nil) cout << "root, ";
else if (T[u].l... | #include<iostream>
#include<string>
using namespace std;
struct Node{
int parent;
int left;
int right;
};
int *D;
Node *T;
void setdepth(int u, int p){
D[u] = p;
if(T[u].right != -1){
setdepth(T[u].right, p);
}
if(T[u].left != -1){
setdepth(T[u].left, p + 1);
}
}
int main(){
int n, x, i, r;
... | 1 | 99,553,790 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<tuple>
#include<ctime>
#include<functional>
#include<cmath>
#include<cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> p;
#define rep(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | 1 | 39,901,405 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ff=1, l=0;
for (int i=S.size()-3; i>=0; i-=2) {
ff=1;
for (int j=0; j<(i+1)/2; j++) {
if (S[j]!=S[j+(i+1)/2]) {
ff=0;
}
}
if (ff==1) {
l=i+1;
break;
}
}
cout << l << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inlin... | 1 | 96,375,183 |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int n,m;
class data{
public:
int x,p;
data(int ix,int ip){
x=ix;
p=ip;
}
bool operator<(const data& d1)const{
return d1.p<p;
}
};
vector<data> dat;
int main(void){
while(1){
scanf("%d %d",&n,&m);
if(n+m==0)break;
dat.clear();
... | #include <iostream>
using namespace std;
int main(){
int n,m,d[10],a,b,t;
while (1){
for (int i=0;i<10;i++)d[i]=0;
t=0;
cin >> n >> m;
if (n==0&&m==0)break;
for (int i=0;i<n;i++) {
cin >> a >> b;
d[b-1]+=a;
}
for (int i=9;i>=0;i--){
if (m==0) break;
if (d[i]<=m){
... | 1 | 79,462,428 |
#include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string s;
cin>>s;
int sum=0;
for(int i=0;i<s.size();++i) sum+=s[i]-'0';
int x=stoi(s);
cout<<((x%sum==0)?"Yes":"No");
ret... | #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() {
long n;
... | 1 | 85,077,356 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
const int MOD = 1000000007;
int main()
{
char a;
scanf("%c",&a);
if(a =='a' || a =='e' || a =='i' || a =='o' || a =='u' ){
printf("vowel\n");
}
else{
printf("consonant\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >>b;
if (b=='a' || b=='e' || b=='i' || b== 'o' || b== 'u'){
cout << "vowel";
}else{
cout << "consonant";
}
return 0;
} | 1 | 77,084,432 |
#include <bits/stdc++.h>
#include<math.h>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#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++)
int main() {
int H,W,D;
cin>>H>>W>>D;
vector<vector<int>>a(H,vector<int>(W));
rep(... | #include <bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
int h, w, d, q, c[90000];
P s[90000];
int main() {
cin >> h >> w >> d;
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++) {
int a;
cin >> a;
a--;
s[a] = make_pair(i, j);
}
for (int i = d; i < h * w; i++)
c[i] = c[i - d] + abs... | 1 | 88,824,470 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template <class T>
using vec = vector<T>;
template <class T>
using vec2 = vector<vec<T>>;
template <class T>
using vec3 = vector<vec2<T>>;... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main(){
int n, r;
cin >> n >> r;
if (n >= 10){
cout << r << endl;
}else{
int ans = 100 * (10 - n) + r;
cout << ans... | 1 | 83,794,118 |
#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 rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pai... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | 1 | 84,718,160 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include <bits/stdc++.h>
#define Phuong_ ios_base::sync_with_stdio(0); cin.tie(0);
#define REP(i,a,b) for(int i=a; i<=b; ++i)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
typedef pair<int,int> pi;
typedef tuple<int, int, int> tp;
typedef vector<vector<int>> vv;
int ... | 1 | 27,752,201 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,k,r,s,p;
cin >> n>> k >> r >> s >> p;
string t;
cin >> t;
vector<char> hand;
int point=0;
for(int i=0; i<k; i++){
if(t.at(i) == 'r'){
hand.push_back('p');
point += p;
... | 1 | 85,002,811 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
using namespace std;
int main(){
int n;
cin>>n;
string s[n];
map<string,int>d;
bool flag=true;
for(int i=0;i<n;i++){
cin>>s[i];
d[s[i]]++;
if(d[s[i]]>1)flag=false;
... | #pragma region header
#define _GLIBCXX_DEBUG
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>... | 1 | 77,556,110 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
int a, b,c ,d ,e;
cin >> a >> b;
c =a/b;
d =a%b;
e =100000 * d/b;
cout << c << " " << d << " " << c << "."<< e << endl;
return 0;
} | #include<stdio.h>
int main(){
int a,b,d,r;
scanf("%d %d",&a,&b);
if(1<=a && a<=1000000000 && 1<=b && b<=1000000000){
d = a / b;
r = a % b;
double x = a;
double y = b;
double f = x / y;
printf("%d %d %.5lf\n",d,r,f);
}
return 0;
} | 1 | 65,055,346 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef long double ld;
ll inv(ll a, ll b){
return (a > 1 ? b - inv(b%a, a)*b/a : 1);
}
#define rc(s) return cout << s, 0
#define fi first
#define se second
#define L (nod << 1)
#define R (L |... | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
ll a[100002];
ll x = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
x ^= a[i];
}
ll r = 0;
for(int j = 0; j < 60; j++){
if((x >> j) & 1){
r += (1ll << j);
... | 1 | 67,894,152 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> vec(N);
bool b = true;
char c;
for(int i = 0; i < N; i++) {
string S;
cin >> S;
vec[i] = S;
if(i != 0) {
if(S[0] != c) {
b = false;
}
}
int M = S.size();
c = S[M - 1];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main()
{
int n;
scanf("%d", &n);
vector<string> w(n);
rep(i, n) cin >> w[i];
bool ans = true;
rep(i, n - 1)
{
int l = w[i].size();
if (w[i][l - 1] != w[i + 1][0])
{
... | 1 | 18,143,568 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double ld;
#define REP(i,a,n) for(int (i)=(a); (i)<(int)(n); (i)++)
#define rep(i,n) REP(i,0,n)
#define vec vector
#define sqrt(d) pow((long double) (d), 0.50)
const ll INF = 2e9;
const ll large_P = 1e9 ... | #include <stdio.h>
int main(void)
{
int R;
scanf("%d\n",&R );
if (R < 1200)
{
printf("ABC");
}
else if (R < 2800)
{
printf("ARC");
}
else
{
printf("AGC");
}
return 0;
} | 1 | 100,361,967 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int maxs,mins,sum;
while(cin>>n,n){
sum=0;
maxs=0;
mins=2000;
for(int i=0,tmp;i<n;i++){
cin>>tmp;
sum+=tmp;
maxs=max(maxs,tmp);
mins=min(mins,tmp);
}
sum-=mins;
sum-=maxs;
cout<<sum/(n-2)<<endl;... | #include <stdio.h>
int main(){
int a,max,min,s,sum,i;
while(1){
scanf("%d",&a);
if(a==0)break;
max=-1;
min=1001;
sum=0;
for(i=0;i<a;i++){
scanf("%d",&s);
sum+=s;
if(max<s)max=s;
if(min>s)min=s;
}
sum-=max;
sum-=min;
sum=sum/(a-2);
printf("%d\n",sum... | 1 | 40,923,303 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long L[100] = {0};
long long luca(long lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> L(86+1);
L[0] = 2;
L[1] = 1;
for (int i=2; i<86+1; i++) L[i] = L[i-1] + L[i-2];
cout << L[n] << endl;
} | 1 | 27,683,838 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793
typedef long long ll;
typedef long double ld;
int main(){
ld a, b, x;
cin >> a >> b >> x ;
ld ans = 0;
if(x <= a * a * b / 2){
ans = 90 - atan(2 * x/ (b * b *a)) * 180 /PI;
}
else{
ans = atan((2 * b - 2 * ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
double a, b, x; std::cin >> a >> b >> x;
double s = x / a;
double a... | 1 | 10,388,821 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n)... | #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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll>... | 1 | 71,034,200 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
bool is_war(const vector<int>& x, const vector<int>& y) {
for (int z = -100; z <= 100; z++) {
bool is_o... | 1 | 54,354,283 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
#define REP(i, n) for(int i = -1; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
int main()
{
long long N, X, M;
cin >> N >> X >> M;
vector<long long> b, l;
vector<bool> i... | #include <cstdint>
#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
pair<vector<int64_t>, vector<int64_t>> MakeVec(
unordered_map<int64_t, int64_t>& nodes, int64_t st) {
vector<int64_t> vec;
vec.push_back(st);
vector<int64_t> sums(2, 0);
sums[1] = st;
int64_t cur = nodes[s... | 1 | 90,677,283 |
#include <iostream>
using namespace std;
const int N = 1000000;
int prime[N];
void init();
int main()
{
init();
int n;
while (cin >> n) {
cout << prime[n] << '\n';
}
return 0;
}
void init()
{
for (int i = 0; i < N; ++i) { prime[i] = 1; }
prime[0] = prime[1] = 0;
for (int i = 2; i < N; ++i) {
if (prime[i])
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
typedef long long i64;
template<i64 N> struct prime_numbers{
set<i64> primes;
bool p[N+1];
constexpr prime_numbers<N>() : primes(), p() {
p[0] = p[1] = true;
for(i64 i=2; i<=N; i++) {
if(p[i]) continue;
... | 1 | 75,456,911 |
#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 A[55];
int main() {
cin.tie(0);
ios::sync_w... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | 1 | 93,186,392 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define SIZE(a) int((a).size();
const int INF=INT_MAX;
int main(){... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 1 | 88,453,511 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n;
string ans="No";
cin >> n;
for(long i=0;i<100;i++) {
for(long j=0;j<100;j++) {
if(i*4+j*7==n) ans="Yes";
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for(int i = 0; i < 100; i++){
for(int j = 0; j < 100; j++){
if(N == 4*i + 7*j){
count++;
}
}
}
string ans;
if(count != 0){
ans = "Yes";
}else{
ans = "No";
}
cout << ans << e... | 1 | 83,068,389 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vec... | 1 | 70,209,587 |
#include "bits/stdc++.h"
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define li long int
#define ld long double
#define lld long long double
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n , m;
cin >> n >> m;
int s = 0;
while (m--) {
int d;
cin >> d;
s += d;
}
if (s > n) {
cout << -1 << endl;
} else {
cout << (n - s) << endl;
}
} | 1 | 20,199,409 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<long long> h(n);
for(int i = 0; i < n; i++){
cin >> h.at(i);
}
long long ans = 1001001001001001;
for(int i = 0; i < (1<<n); i++){
long long sum = 0, tmp = 0;
int can_see = 0;
for(int j = 0; j < n; j++){... | #include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <functional>
#include <string>
#include <utility>
#include <cmath>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define ALL(a) (a).begin(),(a... | 1 | 32,732,653 |
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main(void) {
string a, b;
cin >> a >> b;
a += a;
if (a.find(b) != string::npos) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include<iostream>
#include<cctype>
#include<string>
using namespace std;
int main(){
string s;
string p;
cin>>s;
cin>>p;
s=s+s;
std::string::size_type a = s.find(p);
if(a == string::npos)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
} | 1 | 72,499,275 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x % y == 0) {
return y;
} else {
return gcd(y, x % y);
}
}
int main() {
long long num;
long long Min;
long long tmp;
cin >> num;
vector<long long> vec(num);
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
int main()
{
int n;
cin >> n;
ll a[n];
rep(i,n)
{
cin >> a[i];
}
int gc = a[0];
rep(i,n)
{
gc =... | 1 | 20,976,961 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
int gcd(int a, int b)
{
if(a%b == 0) return b;
else return gcd(b, a%b);
}
int main()
{
int n,k;
cin >> n >> k;
vector<int> a(n);
int i;
int vmax = 0;
rep(i,n)
{
cin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a%b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, K;
... | 1 | 34,340,370 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,x;
cin>>a>>b>>x;
if(x-a<0)
cout<<"NO"<<endl;
else if(a+b<x)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, X;
cin >> A >> B >> X;
if ((X >= A) && (X <= A + B)) cout << "YES" << endl;
else cout << "NO" << endl;
} | 1 | 50,921,939 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,money,kabu;
cin >> N;
money = 1000;
kabu=0;
vector<long long>data(N);
for (int i=0; i<N; i++) {
cin >> data.at(i);
}
for(int i=0; i<N-1; i++) {
if (data.at(i) < data.at(i+1)){
money = money + (((data.at(i+1) - data.at(i... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b... | 1 | 30,446,044 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
int a[5];
int main(void){
rep(i, 5) cin >> a[i];
sort(a, a+5, greater<int>());
rep(i, 4) cout << a[i] << " ";
cout << a[4] << endl;
} | #include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int a[5];
scanf("%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&a[4]);
sort(a,a+5);
for(int i=4;i>=0;i--)
{
printf("%d",a[i]);
if(i>0) printf(" ");
else printf("\n");
}
} | 1 | 9,272,229 |
#include <bits/stdc++.h>
int main(void)
{
std::string n;
std::cin >> n;
bool flag = false;
for (int i = 0; i < n.size(); i++) {
if (n[i] == '7') {
flag = true;
break;
}
}
if (flag) {
std::cout << "Yes" << std::endl;
}
else {
std::cout << "No" << std::endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
char S[4];
int s=0;
cin>>S;
for(int i=0;i<3;i++){
if(S[i]=='7'){printf("Yes\n");return 0;}
}
printf("No\n");
} | 1 | 32,030,710 |
#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;
cin >> n;
vector<int> w(n);
rep(i,n) cin >> w[i];
int ans = accumulate(w.begin(), w.end(), 0);
rep(i,n) {
int s1 = 0, s2 = 0;
... | #include<bits/stdc++.h>
using namespace std;
signed main() {
int N; cin >> N;
vector<int> W(N);
for(int i=0; i<N; i++) cin >> W[i];
int sum = 0;
for(int i=0; i<N; i++) sum += W[i];
int ans = 1e9;
for(int t=0; t<N; t++) {
int s1=0;
for(int i=0; i<t; i++) s1 += W[i];
int s2 = sum - s1;
ans =... | 1 | 90,426,331 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main()
{
double n,m,d;
cin >> n >> m >> d;
double res = (n-d)*(m-1)*(d>0.5?2:1)/(n*n);
cout << fixed << setprecision(10) << res << endl;
return 0;
} | 1 | 77,228,962 |
#include<iostream>
using namespace std;
int a[1000005];
int main(){
int k,i;
cin>>a[0]>>a[1]>>k;
for(i=0;i<k;i++){
a[!(i&1)]+=(a[i&1]>>=1);
}
cout<<a[0]<<" "<<a[1];
return 0;
} | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 1 | 77,187,775 |
#include <iostream>
using namespace std;
void solve()
{
int count = 1;
int x;
while (cin >> x, x)
{
cout << "Case " << count << ": " << x << endl;
++count;
}
}
int main()
{
solve();
return(0);
} | #include <iostream>
using namespace std;
int main(){
int a, i;
i = 1;
while(cin>>a&&a){
if(a != 0) cout<<"Case "<<i<<": "<<a<<endl;
i++;
}
} | 1 | 7,411,547 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
const int INF = 0x3f3f3f3f;
int A[2000005], B[2000005], C[10005];
int main(){
int n, temp = 0;
cin >> n;
for(int i = 1; i <= n; i++) scanf("%d", A + i);
for(int i = 1; i <= n; i++) ... | 1 | 80,334,996 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,j,n) for(int i=j;i<=n;i++)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s;
cin>>s;
switch(s){
case 25:
cout<<"Christmas ";
break;
case 24:
cout<<"Christmas E... | 1 | 672,364 |
#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) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, c, k;
cin >> n >> c >> k;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a, a + n);
int i = 0, bus = 0;
while (i < n)
{
int ptr = i + 1;
while (ptr < (i + c) && ptr < n)
... | 1 | 39,269,787 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
#define fast_io ios_base::sync_wi... | 1 | 54,675,021 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
ll N, i,ans, l[50], K;
int main()
{
cin >> N >> K;
for(i=0;i<N;i++)
{
cin >> l[i];
}
sort(l, l+N);
for(i=N-1;i>N-K-1;i--)
{
ans += l[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> l(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
sort(l.begin(), l.end(), greater<int>());
int sum = 0;
for (int i = 0; i < K; i++) {
sum += l[i];
... | 1 | 62,986,796 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main()
{
int n, a;
cin >> n >> a;
cout << (n * n) - a << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,n;
cin>>a>>n;
a*=a;
cout<<a-n<<endl;
} | 1 | 54,590,553 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statis... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#def... | 1 | 97,930,002 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
char a,b,c;
cin >> a >> b >> c;
if(a != b && a != c && b != c) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<char> s(3);
cin>>s.at(0)>>s.at(1)>>s.at(2);
sort(s.begin(),s.end());
if(s.at(0)=='a'&&s.at(1)=='b'&&s.at(2)=='c'){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | 1 | 84,725,625 |
#include <iostream>
using namespace std;
int main(){
int a;
int b;
cin >> a >> b;
cout << "a " ;
if(a>b){
cout << ">";
}
else if(a==b){
cout << "==";
}
else if(a<b){
cout << "<";
}
cout << " b" << endl;
} | #include <iostream>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int a, b;
std::cin >> a >> b;
std::cout << ((a<b)?"a < b":(a>b)?"a > b":"a == b") << "\n";
return 0;
} | 1 | 89,209,812 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int H, W, D;
cin >> H >> W >> D;
int A[H][W];
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
signed main(void)
{
int h, w, d, l, r, q;
cin >> h >> w >> d;
P memo[h * w];
vector<int> dist(h * w, 0);
rep(i, h) rep(j, w)
{
int a;
cin >> a;
a--;
memo[a] = P(i, j);
}
rep(i, h * w - ... | 1 | 4,288,478 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <queue>
using namespace std;
int main() {
queue<char> q;
string s;
int i, j, h, num;
cin >> s;
while(s!="-"){
for(i=0;i<s.size();i++){
q.push(s[i]);
}
cin >> num;
for(i=0;i<num;i++){
cin >> h;
f... | #include<iostream>
#include<stdio.h>
#include<cctype>
#include<string>
using namespace std;
int main(){
string a, left, right;
int h,m;
while (1){
cin >> a;
if (a == "-")break;
cin >> m;
for (int i = 0; i < m;i++){
cin >> h;
left = a.substr(0, h);
right = a.substr(h, a.size());
a = right + left;
... | 1 | 93,133,096 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
#define MOD 1e9+7LL
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
ll binary_square(ll x, ll n);
void fac... | 1 | 62,360,768 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int N,A,B,C,X;
while(cin>>N>>A>>B>>C>>X,N){
int c=0;
bool f=true;
rep(i,N){
int y;
cin>>y;
for(;;c++){
if(c>10000){
f=false;
break;
}
if(X==y) break;
X=(A*X+B)%C;
}
X=(A*X+B)%C;
... | #include<iostream>
using namespace std;
int main() {
int n, a, b, c, x;
while (cin >> n >> a >> b >> c >> x, n) {
int time = 0;
for (int i = 0; i < n; ++i) {
int y; cin >> y;
while (time <= 10001 && x != y) {
x = (a*x + b) % c; time++;
}
x = (a*x + b) % c; time++;
}
if (time-1 > 10000)cout << ... | 1 | 74,424,627 |
#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>;
vector<pair<ll, ll> > prime_factorize(ll N) {
vector<pair<ll, ll> > res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll ex = 0;
whil... | #include<bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using ll = long long;
#define ull unsigned ll
#define endl "\n"
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(),(v).end()
#define mst(a,b) memset(a,b,sizeof(a))
#define pi pair<int,int>
#define pl pair<ll,ll>
#define p... | 1 | 3,361,283 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int list[3];
int main(){
cin >> list[0] >> list[1] >> list[2];
sort(list, list + 3);
printf("%d %d %d\n", list[0], list[1], list[2]);
return 0;
} | #include <iostream>
using namespace std;
void replace(int& a, int& b)
{
int temp = a;
a = b;
b = temp;
}
void sortValue(int a, int b, int c)
{
if (a > c) replace(a, c);
if (a > b) replace(a, b);
if (b > c) replace(b, c);
cout << a << " " << b << " " << c << endl;
}
int main()
{
int ... | 1 | 86,566,027 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
class dice{
public:
int face[6];
dice(){}
void rollN(){
int c = face[0];
face[0] = face[1];
face[1] = face[5];
face[5] = face[4];
face[4] = c;
}
void rollS(){
... | #include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
class Dice {
private:
std::vector<unsigned short> Value = {1, 2, 3, 4, 5, 6};
unsigned short Top = Value[0];
unsigned short Front = Value[1];
unsigned short Right = Value[2];
unsigned short Left = Value[3];
unsigned short Rear = V... | 1 | 18,596,702 |
#include <cstdio>
#include <queue>
#include <vector>
int main()
{
int n;
scanf("%d", &n);
std::vector<std::vector<int>> graph;
graph.resize(n);
for (int i = 0; i < n; ++i)
{
int u, k, v;
scanf("%d%d", &u, &k);
for (int j = 0; j < k; ++j)
{
scanf("%d", &v);
graph[u - 1].push_back(... | #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++) {
... | 1 | 27,108,449 |
#include<bits/stdc++.h>
using namespace std;
int a[100001],dp[100001];
int solve(int n)
{
dp[0]=0;
dp[1]=abs(a[0]-a[1]);
for(int i=2;i<n;i++)
{
int d=abs(a[i]-a[i-1]);
int e=abs(a[i]-a[i-2]);
dp[i]=min(dp[i-2]+e,dp[i-1]+d);
}
return dp[n-1];
}
int main()
{
int n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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) ... | 1 | 49,312,710 |
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <stack>
#include <queue>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int h, w;
scanf("%d %d", &h, &w);
vector<string> s(h);
for (int i = 0; i < h;... | 1 | 282,421 |
#include <stdio.h>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#include <cstring>
#include <algorithm>
const long long int infty = 1e14;
long long int zero = 0;
int main(){
long long int N, K, tmp;
std::vector<long long int> H;
scanf("%lld%lld", &N, &K);
for(long long... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
int N, K;
cin >> N >> K;
vector<LL> H(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> H[i + 1];
}
H.push_back(0);
LL INF = 1LL << 60;
vector<vector<LL>> dp(N + 2, vector<LL>(N + 2, INF));
dp[0][0] = 0;
for (int i = ... | 1 | 71,296,794 |
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define ret return
#define rep(q, i, n) for(int q=i; q<n; q++)
#define forn(i, n) for(int i=0; i<n; i++)
#define mems(a,x) memset(a,x,sizeof(a))
#define ll long long
#define pb push_back
#define em emplace_back
#define mp ma... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define repp(i,n) for(int i=n-1;i>=0;i--)
#de... | 1 | 14,172,332 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
typedef pair<int, int> P;
char maze[1001][1001];
int dis[1001][1001];
int main(void){
int H, W, N;
int sx, sy;
cin >> H >> W >> N;
rep(i, H) {
rep(j, W) {
... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
using namespace std;
typedef struct info{
int nx;
int ny;
int cost;
int target;
info(int a,int b,int c,int d){
nx = a;
ny = b;
cost = c;
target = d;
}
... | 1 | 13,647,408 |
#include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
vector<vector<int>> g;
vector<int> height;
ll ans = 0;
void dfs(ll idx){
for(int i : g[idx]){
if(height[i] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n, m;
cin >> n >> m;
vector<ll> h(n);
for (ll i = 0; i < n; i++)
{
cin >> h[i];
}
vector<ll> ans(n, 0);
for (ll i = 0; i < m; i++)
{
ll a, b;
cin >> a >> b;
a--;
b--;
ans[a] = max(ans[a], h[b]);... | 1 | 61,846,307 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int X,A,B;
cin>>X>>A>>B;
if(B-A<=0){
cout<<"delicious"<<endl;
}else if(B-A>=X+1){
cout<<"dangerous"<<endl;
}else{
cout<<"safe"<<endl;
}
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 ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main() {
int X, A, B;
cin >>... | 1 | 54,098,986 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<=(int)n;++i)
int main() {
int n;cin>>n;
int ans = n;
rep(i,n){
int cc = 0;
int t = i;
while(t>0)cc+=t%6,t/=6;
t = n - i;
while(t>0)cc+=t%9,t/=9;
if(cc < ans)ans=cc;
}
cout<<ans<<en... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=1;i<n;i++)
using namespace std;
using ll=long long;
using P = pair<int,int>;
int main(){
int N;
cin >> N;
int ans=1000;
for(int i=0;i<=N;i++){
int a=0;
int s=i;
while(1){
a+=s%9;
s=s/9;
if(s==... | 1 | 37,960,435 |
#include <bits/stdc++.h>
using namespace std;
struct P
{
int x, y;
bool operator<(const P &a)const{
return y>a.y;
}
};
vector<long long> v;
vector<char> vs[1111];
int a,c,i,b,n,m,k,d;
int o[111111];
int l[111111];
int j[1];
int e[1];
int dx[10]={0,1,0,-1,1,1,-1,-1},dy[10]={1,0,-1,0,1,-1,1,-1},... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
typedef complex<double> Point;
vector<Point> e = {{+1,0}, {0,+1}, {-1,0}, {0,-1}};
string dir[4] = {"R","U","L","D"};
string command(Point cur, Point goal,int arm){
if(arm == 0){
if(abs(cur - goal) < 1e-4) return "";
... | 1 | 72,080,267 |
#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... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 1 | 98,333,194 |
#include<iostream>
using namespace std;
int main(){
int n,i,a,b,c,aa,bb,cc;
cin>>n;
for(i=0;i<n;i++){
cin >>a>>b>>c;
aa=a*a;bb=b*b;cc=c*c;
if(aa+bb==cc || bb+cc==aa || cc+aa==bb)cout <<"YES"<<endl;
else cout <<"NO"<<endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int n,a,b,c,t;
cin >> n;
for(int i=0;i<n;i++){
cin >> a >> b >> c;
if(a > b){
t = a;
a = b;
b = t;
}
if(b > c){
t = b;
b = c;
c = t;
}
if(a > c){
t = a;
a = c;
c = t;
}
if((a*a+b*b) == c*c){
cout << "YES" << endl;
}else{
cout <<... | 1 | 2,079,894 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | #include "bits/stdc++.h"
#define ll long long
#define ALL(x) x.begin(),x.end()
#define MOD 1000000007
using namespace std;
int main(){
ll N;
cin>>N;
vector<pair<double,double>> en(N);
vector<double> arg(N);
double tmp,tmp1;
for(int i=0;i<N;i++){
cin>>tmp>>tmp1;
en[i]=make_pair(tmp,tmp1);
}
double max =0;
for(int i=... | 1 | 54,646,496 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
void func()
{
int N;
cin >> N;
double JPY = 0, BTC = 0;
for (int i = 0; i < N; ++i)
{
string S;
double money;
cin >> money >> S;
if (S == "JPY")
JPY += mo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
double ans = 0;
for (int i = 0; i < n; i++) {
double x;
string u;
cin >> x >> u;
if (u == "JPY") {
ans += x;
}
else {
ans += x * 380000;
}
}
cout << fixed << setprecision(11) << ans << endl;
retur... | 1 | 78,954,426 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const string M_INF="-";
int n,m,cost[]={0,2,5,5,4,5,6,3,7,6};
string dp[10010];
void chmax(string &s, string t){
if(s.size()<t.size())s=t;
if(s.size()==t.size())if(s<t)s=t;
}
int m... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i=0; i<n; i++)
#define repr(i, s, e) for(ll i=s; i>=e; i--)
#define reps(i, s, e) for(ll i=s; i<=e; i++)
#define inf 1e18
#define all(v) v.begin(),v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>())
#define sz(x) x... | 1 | 57,978,674 |
#include<stdio.h>
#include<string.h>
#include<time.h>
#include<math.h>
#include<stdlib.h>
#include<iostream>
#include<iomanip>
#include<utility>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#define ll long long
#define fi first
#define sec second
#define pb push_back
#define mp make_p... | #include <iostream>
using namespace std;
int main() {
int X;
int Y;
cin >> X >> Y;
for (int i = 1; i <= 2 * Y; i++) {
if ((i * X) % Y !=0 && i * X != X) {
cout << i * X << "\n";
break;
} else if (X % Y == 0) {
cout << "-1 \n";
break;
... | 1 | 4,135,111 |
#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 <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <bits/stdc++.h>
using namespace std;
#define fcout(d) cout << fixed << setprecision(d)
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define repU(i,s,t) for(int i = (s); i <= (t); ++i)
#define repD(i,t,s) for(int i = (t); i >= (s); --i)
#define all(v) begin(v),... | 1 | 5,722,522 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | #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 rep(i, n) for... | 1 | 27,699,534 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#def... | #include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
typedef long long ll;
int main(){
ll x=1,i,lb,rb,mid;
char tp[10];
for(i=1;i<=13;i++,x*=10){
printf("? %lld\n",x);fflush(stdout);
scanf("%s"... | 1 | 69,663,002 |
#include<bits/stdc++.h>
using namespace std;
main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n;
while(cin>>m>>n){
if(m*500>=n)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define FI freopen("input.txt", "r", stdin)
#define FO freopen("output.txt", "w", stdout)
#define FasterIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
typedef long long ll;
typedef uns... | 1 | 17,707,880 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll sum=0;
char n[200000];
scanf("%s", &n);
for(int i=0;i<strlen(n);++i){
sum+= n[i]-'0';
}
if(sum%9==0){
cout<<"Yes";
}
else{
cout<<"No";
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string n;
cin >> n;
int sum=0;
rep(i, n.size()) sum += (int)n.at(i)-48;
if(sum%9==0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 51,081,288 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pai... | #include<iostream>
using namespace std;
#define rep(i,n) for(i=0;i<(n);i++)
#define For(i,a,b) for(i=(a);i<(b);i++)
int main(){
int i,j,k;
int a,b,c;
cin >> a >> b >> c;
if(a<b && b<c) cout << "Yes";
else cout << "No";
cout << endl;
return 0;
} | 1 | 82,161,452 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
cout << N / 3 << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int z;
cin>>z;
cout<<z/3<<endl;
} | 1 | 64,460,448 |
#include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace ... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n=1, y=1, m=1, d=1;
cin >> n;
vector<int> ans(n);
for(int i=0; i<n; i++){
cin >> y >> m >> d;
for(int j=y; j<1000; j++){
for(int k=m; k<=10; k++){
if(j%3==0 || k%2==1) for(int l=d-1; l<20; l++) ans[i]++;
else if(k%2==0) for(in... | 1 | 33,955,497 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
void solve()
{
ll n,k;
cin>>n>>k;
ll c=1;
while(n--)
{
if(c<=k)
c*=2;
else
c+=k;
}
cout<<c;
return;
}
int m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int x = 1;
for(int i=0; i<N; i++) {
x = min(x * 2, x + K);
}
cout << x << endl;
} | 1 | 79,493,795 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, k;
cin >> n >> k;
vector <ll> v(n);
rep(i, n) cin >> v.at(i);
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
l... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | 1 | 79,251,289 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
typedef long long ll;
# define PI acos(-1) Pi
int main(){
int k,x;
cin>>k>>x;
if(x>k*500) cout<<"No";
else cout<<"Yes";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int k,x;
int main()
{
scanf("%d%d",&k,&x);
if(k*500>=x) printf("Yes\n");
else printf("No\n");
return 0;
} | 1 | 75,974,311 |
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(...) fprintf(stderr,__VA_ARGS__)
#define rep(i , l , r) for(int i = (l) , ___ = (r) ; i <= ___ ; ++i )
#define per(i , r , l) for(int i = (r) , ___ = (l) ; i >= ___ ; --i )
typedef long long LL;
typedef unsigned long long uLL;
const int Mod = 998244353;
templ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int n, l, t, sh = 0;
vector <int> p;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> l >> t;
for(int i = 0; i < n; i++){
int x, ty;
cin >> x >> ty;
if(ty == 1){
p.push_back((x + t) % l);
sh += ((x +... | 1 | 81,658,160 |
#include <bits/stdc++.h>
using namespace std;
int a[200001],c[200002],n,k;
int main()
{
cin>>n>>k;
register int i,j,t,s,f;
for (i=1;i<=n;++i) {
cin>>a[i];
}
for (j=1;j<=k;++j) {
memset(c,0,sizeof(c));
for (i=1;i<=n;++i) {
++c[max(1,i-a[i])];
--c[min(n+1,i+a[i]+1)];
}
s=0,f=1;
for (i=1;i<=n;++i) {... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
int n,k; scanf("%d%d",&n,&k);
vector<int> a(n);
rep(i,n) scanf("%d",&a[i]);
vector<int> sum(n+1);
do{
rep(i,n+1) sum[i]=0;
rep(i,n){
sum[max(i-a[i],0)]++;
sum[min(i+a[i]+1,n)]--;
}
... | 1 | 83,496,747 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
constexpr int INF = 0x3f3f3f3f; c... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<double> a(n);
double ans = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < n; i++){
ans += (double)(1 / a[i]);
}
cout << fixed << setprecision(15) << (double)(1 / ans) << endl;
} | 1 | 50,647,304 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
type... | #include<bits/stdc++.h>
using namespace std;
#define long long long
int main(){
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
cin >> B[i];
}
vector<int> C;
long S=0, S1=0;
int ans=0;
for(int i=0; i<N; i++){
if(A[i]... | 1 | 53,971,669 |
#include <iostream>
using namespace std;
int main(void){
int N, K;
cin >> N >> K;
if(K == 1){
cout << "0" << endl;
return 0;
}
int n = N - K;
cout << n << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
if(k==1)cout<<"0\n";
else cout<<n-k<<"\n";
} | 1 | 96,511,822 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<strin... | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = 1e18, larg = 1e5, INF = -1e18;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W, x, y, z;
long long max_value = INF, max_index = -1... | 1 | 70,816,384 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define DEBUG(x) cout<<#x<<": "<<x<<e... | #include <stdio.h>
int main(void) {
int a, b, c, w;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
if( a > b ) {
w = a;
a = b;
b = w;
}
if( b > c ) {
w = b;
b = c;
c = w;
}
if( a > b ) {
w = a;
a = b;
b = w;
}
printf("%d %d %d\n", a, b, c);
return 0;
} | 1 | 76,587,067 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
typedef vector<pi> vpi;
typedef vector<string> vsi;
typedef map<ll, ll> mape;
#define rep(i, a, b) for(ll i=(ll)a;i<=(ll)b;i++)
#define per(i, a, b) for(ll i=(ll)a;i>=(ll)b;i--)
#define fastio {ios_base::s... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
#define all(v) v.begin(),v.end()
void yorn(bool a){if(a) cout << "Yes" << endl ; else cout << "No" << endl ;}
int main(){
ll n,m ;
cin >> n >> m ;
ll sum = 0 ;
vll a(n) ;
for(auto &i:a) ... | 1 | 41,623,501 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
map<int, int> m;
for (int i = 0; i < N; ++i)
++m[A[i]];
if (m.size() % 2 == 1)
cout << m.size() << endl;
els... | 1 | 8,732,570 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,a,b;
cin>>n>>m;
set<int> z;
for(int i=0;i<m;i++){
cin>>a>>b;
if(a==1){
if(z.count(b)){
cout<<"POSSIBLE"<<endl;
return 0;
}
else z.insert(b);
}
else if(b==n){
if(z.count(a)){
cout<<"PO... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,m,a[200005],b[200005],c[200005]={};
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>a[i]>>b[i];
if(b[i]==n){
c[a[i]]=1;
}
}
for(int i=0;i<m;i++){
if(a[i]==1){
if(c[b[i]]==1){
cout<<"P... | 1 | 12,705,524 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
double a,b,c,d,x,y;
cin>>a>>b>>c>>d;
x=a-c;
x*=x;
y=b-d;
y*=y;
double z = sqrt(x+y);
cout<<fixed<<z<<endl;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<cmath>
using namespace std;
int main(){
double x1,x2,y1,y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)) << endl;
} | 1 | 20,068,201 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int result=a*b;
(result%2)?cout<<"Odd":cout<<"Even";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,A;
cin >> N >> A;
if(N*A%2==0){
cout << "Even" << endl;
}
else {cout << "Odd" << endl;}
} | 1 | 86,663,494 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
const int maxn = 1e5+10;
const int mod = 1e9+7;
const double eps ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b; cin >> a >> b;
int ans = -1;
for (int i = 1; i <= 1100; i++) {
int x = i * 0.08;
int y = i * 0.1;
if (x== a && y== b) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
} | 1 | 21,182,423 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
int n;
long long a, b, l;
int main(){
scanf("%d", &n);
while(n--){
scanf("%lld%lld", &a, &b);
if(a>b)std::swap(a, b);
if(a==b)printf("%d\n", a*2-2);
else if(a+1==b)printf("%d\n",a*2-2);
... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 1 | 21,539,879 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
cin >> m;
vector<string> t(m);
rep(i, m) cin >> t.at(i);
int ans = 0;
string say;
rep(i, n) {
... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
using ll = long long;
#define rep(i,n) for (ll i=0;i<n;i++)
using namespace std;
void solve(){
}
int main (){
... | 1 | 51,254,141 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
bool isOk(ll N, ll M, ll V, ll P, vector<ll>& A, int x) {
if (x < P)
return true;
ll maxP = A[x] + M;
if (maxP < A[P - 1])
return false;
ll res = M * V;
res -= (P - 1) * M;
res -= (N - x) ... | #include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<time.h>
using namespace std;
typedef long long ll;
int n,m,v,p,a[100005],b[100005],ans,pth_min;
bool judge(int pth){
ll res=0;
int i;
for(i=1;i<=n;i++)
b[i]=min(m,pth-a[i]);
sort(b+1,b+n+1);
if(b[p]<0)
return 0;
for(i=1;i<=n;i+... | 1 | 86,830,605 |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
using ... | #include <iostream>
using namespace std;
int main(){
const int m[6] = {500,100,50,10,5,1};
int price;
while(true){
cin >> price;
if(!price) break;
int change = 1000 - price,cnt = 0;
for(int i = 0 ; i < 7 ;){
if(change >= m[i]){
change -= m[i];
... | 1 | 14,825,646 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.