code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
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; }
typedef long long ll;
const int MAX_N = 1e+6;
int ... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
#include<stdio.h>
#include <cstdint>
#inclu... | 1 | 91,539,473 |
#include <bits/stdc++.h>
using namespace std;
#define fi(i,a,n) for (ll i=a; i < n; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
typedef pair<ll, ll>... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi atan(1.0)*4
#define pb(x) push_back(x)
#define in(x) insert(x)
#define fl(x,y) for(ll i=x;i<y;i++)
#define vi vector<long long>
#define vs vector<string>
#define vp(vi,x) cin>>x; vi.pb(x);
string en="\n";
string t="hello";
string Y="YES\n";
s... | 1 | 75,703,647 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A[i];
ll min_cost = INF;
for(int i=-100; i<=100; i++) {
ll cost=0;
for(int j=0; j<N; j++) {
... | 1 | 96,458,052 |
#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b){
if(b==0) return a;
else return GCD(b, a % b);
}
long long LCM(long long a, long long b) {
long long g = GCD(a, b);
return a / g * b;
}
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long CD = LCM(C, D)... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t A, B, C, D, c, d, cd;
cin >> A >> B >> C >> D;
c = (B / C) - (A - 1) / C;
d = (B / D) - (A - 1) / D;
cd = (B / lcm(C, D)) - (A - 1) / lcm(C, D);
cout << (B - (A - 1)) - c - d + cd << endl;
} | 1 | 95,568,709 |
#include <bits/stdc++.h>
#define pb push_back
#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>
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
... | #include <bits/stdc++.h>
#include<math.h>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
int main () {
int n ;
cin >> n ;
vector<int> d(n);
rep(i, n){
cin >> d[i];
}
int ... | 1 | 64,917,301 |
#include<stdio.h>
int main()
{
int N,K;
scanf("%d%d",&N,&K);
if(K==1)
printf("0");
else
printf("%d",N-K);
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 | 38,222,942 |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <functional>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <complex>
#include <list>
#include <cassert>
#include <deque>
#i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); ++i)
#define repr(i, a, b) for (int i=a; i<(b); ++i)
#define reprev(i, n) for (int i=n-1; i>=0; --i)
#define reprrev(i, a, b) for (int i=b-1; i>=(a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e7;
int N;
int ... | 1 | 51,933,912 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
u... | 1 | 39,686,666 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> solve(int N, int A, int B){
vector<int> res(N), used(N+1, 0);
for(int dec=1;;dec++){
int start = max(1, N-dec*A+1);
for(int i=0;i<A;i++){
int idx = (dec-1)*A+i;
if(idx >= N) return... | #include <assert.h>
#include <ctype.h>
#include <errno.h>
#include <float.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <locale>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <wchar.h>
#include <wctype.h>
#include <algor... | 1 | 37,444,517 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a[11], b[11], c[11];
cin >> a >> b >> c;
if(a[strlen(a)-1] == b[0] && b[strlen(b)-1] == c[0]){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
return 0;
} | #include<stdio.h>
int main(){
char q[15];
char w[15];
char e[15];
char r,t;
scanf("%s %s %s",q,w,e);
for(int i = 0; q[i]!= '\0';i++){
r=q[i];
}
for(int i =0; w[i] != '\0'; i++){
t =w[i];
}
if (r == w[0] && t ==e[0]){
printf("YES");
}
else{
printf ("NO");
}
return 0;
} | 1 | 73,141,431 |
#include<iostream>
#include<cmath>
#include<iomanip>
#include<stack>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<limits>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
s1 = s1 + s1;
int sz = s2.size();
for( int i=0;i<sz;i++)
if (s1.compare(i,sz, s2) == 0) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main(void) {
string s, t;
cin >> s >> t;
s += s;
bool ans = false;
rep(i, s.size()) {
if (s.substr(i, t.size()) != t) continue;
ans = true;
break;
}
... | 1 | 71,644,627 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
vector<int> isMax(n + 1, false);
int tmp = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (tmp < a[i]) {
tmp = a[i];
isMax[i] = true;
}
}
m... | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9+7)
#define i_5 (ll)(1E9+5)
ll mod... | 1 | 84,223,123 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T-X+1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | 1 | 7,893,106 |
#include <fstream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <bitset>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <set>
#include <complex>
using namespace std;
const int SIZE = 1 << 10;
int pointer = SIZE;
ch... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
int N;
long long a, b, res;
bool check (long long);
int main () {
scanf("%d", &N);
for (int i = 1;i <= N; ++i) {
scanf("%lld%lld", &a, &b);
long long m = (long long)std :: sqrt(a * b);
res = 2 * m - 1;
if (m * m =... | 1 | 50,354,789 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T euqlid(T a, T b){
if(a < b){
int x = a;
a = b;
b = x;
}
T q, r;
q = b;
r = a % b;
if(r) return euqlid(q, r);
else return q;
}
int main(){
long long a, b, c, d;
cin >> a >> b >> c >> d;
l... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | 1 | 90,976,218 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <limits.h>
using namespace std;
int N;
long long int K;
int P[5001];
long long int C[5001];
long long int Max=LLONG_MIN;
int main(){
cin >> N >> K;
for(int i=1;i<=N;i++)cin >> P[i];
for(int i=1;i... | #include<bits/stdc++.h>
#define ll long long
#define F(type, i, a, b) for(type i = a; i <= b; i ++)
#define RF(type, i, a, b) for(type i = a; i >= b;i --)
#define sz(a) sizeof(a)
#define deb(a) cerr<<" ["<<#a<<"->"<<a<<"] "
#define name(a) cerr<<" ["<<#a<<"->"
#define next_line cerr<<'\n'
#define all(a) a.begin(), a.en... | 1 | 28,140,733 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll ans;
string a="abcdefghijklmnopqrstuvwxyz";
int biao[26];
inline ll gcd(ll x,ll y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
int main(){
string s;
cin>>s;
int len=s.length();
for(int i=0;i<len;i++){
biao[int(s... | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef string str;
typedef vector<int> vint;
typedef vector<double> vdou ;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<int, int> pii;
typedef vector<pii> vpii ;
#define REP(i, n) for (ll (i) = 0; (i) < (... | 1 | 26,128,704 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
map<ll,ll> dict;
map<ll,ll>::iterator it;
ll t;
cin>>t;
while(t--) {
ll num;
cin>>num;
if(dict.find(num)!=... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 | 49,734,505 |
#include<bits/stdc++.h>
#define swap(type,a,b) {type t; t=a; a=b; b=t;}
#define forN(i,n) for(int i=0;i<n;i++)
#define forS(i,start,n) for(int i=start;i<n;i++)
#define ll long long
#define pb(t,d,n) {t p;int i;forN(i,n){cin>>p;d.push_back(p);}}
#define DOUBLE fixed << setprecision(15)
using namespace std;
typedef vecto... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
string S;
cin >> S;
ll red = 0;
ll blue = 0;
for (size_t i = 0; i < S.size(); i++)
{
if (S[i] == '0') {
red += 1;
} else {
blue += 1;
... | 1 | 3,359,449 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main() {
ll n;
cin >> n;
vll a(n);
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | 1 | 69,834,786 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int r;
cin >> r;
if(r<1200)
cout << "ABC";
else if(r>=1200 && r<2800)
cout << "ARC";
else
{
cout << "AGC";
}
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 1 | 31,343,507 |
#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>
using namespace std;
int main(void){
long long int i=0,j,c=0,p,h[1000010],m=1,max=0,k;
string s;
cin >> s >> k;
for(i=0;i<k;i++)
{
if(s[i]!='1')
{
cout << s[i] << endl;
return 0;
}
}
cout << '1' << endl;
return 0;
} | 1 | 2,513,975 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define vl vector
using namespace std;
int main()
{
set<char> se;
string s;
cin>>s;
for(ll i=0;i<s.size();i++) se.insert(s[i]);
if(se.size()==2) cout<<"Yes";
else cout<<"No";
} | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | 1 | 94,594,095 |
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
using ll = long long;
int MOD = 1e9 + 7;
using namespace std;
ll GCD(ll x, ll y)
{
if (y == 0)
{
return x;... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(... | 1 | 49,338,950 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline void chmax(T1 &a, const T2 &b) {
if (a < b) a = b;... | #include <iostream>
using namespace std;
void swap(int *a, int *b)
{
int t= *a;
*a = *b;
*b = t;
}
int partition(int arr[], int low, int high)
{
int pivot=arr[high];
int i=low-1;
for (int j=low; j<= high-1; j++)
{
if (arr[j] <= pivot)
{
i++;
swap(&arr[... | 1 | 54,442,382 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int (i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define UNIQUE(o) (o).erase(unique(sort(all((o)))))
typedef long long ll;
const int M = 200;
int p[M];
int main() {
int m, ... | #include<bits/stdc++.h>
#define M 205
using namespace std;
int main(){
while(1){
int m,nmin,nmax,g=-1,ans,p[M];
cin>>m>>nmin>>nmax;
if(!m&&!nmin&&!nmax)break;
for(int i=1;i<=m;i++)cin>>p[i];
for(int n=nmin;n<=nmax;n++){
if(p[n]==p[n+1])continue;
if(g<=p[n]-p[n+1]){
g=p[n]-p[n+1];
ans... | 1 | 59,499,541 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
int M, Nmin, Nmax, P[200];
int main(){
while(1){
cin >> M >> Nmin >> Nmax;
if (M == 0 && Nmin == 0 && Nmax == 0)
break;
for (int i = 0; i < M; ++i)
cin >> P[i];
int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int main(... | 1 | 94,730,251 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <iomanip>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using namespace std;
int main() {
ll n,m,d;
cin >> n >> m >> d;
ll c = n - d;
ll mul = 1;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
const int INF = 1LL<<30;
int main() {
double n,m,d;
cin>>n>>m>>d;
double x;
if(d==0) x=n;
else x=2*(n-d);
double ans=(x/(n*n))*(m-1);
cout<<fixe... | 1 | 85,954,928 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N , K , cnt;
cin >> N >> K ;
vector<int> h(N) ;
cnt = 0 ;
for (int i = 0 ; i < N ; i++){
cin >> h[i] ;
if(h[i] >= K){
cnt++ ;
}
}
cout << cnt << endl ;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int a, n, k, ans = 0;
cin >> n >> k;
rep(i, n) {
cin >> a;
if (k <= a)
ans++;
... | 1 | 16,308,591 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
double n,m,d;
cin >> n >> m >> d;
double ans;
if(abs(d) > 0.1){
ans = 2*(n-d)/(n*n)*(m-1.0);
}else{
ans = (n-d)/(n*n)*(... | 1 | 17,604,556 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
signed main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if(abs(c-a) <=d||(abs(a-b)<=d&&abs(b-c)<=d)){
cout << "Yes" << endl;
}
else cout << "No" << endl;
} | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 1 | 90,906,799 |
#include<iostream>
using namespace std;
int main()
{
unsigned long x, y;
cin >> x >> y;
int ct = 0;
while (1)
{
if ((x > y) || (x > 10e18)) {
break;
}
x *= 2;
ct++;
}
cout << ct;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x, y; cin >> x >> y;
int count = 1;
ll val = x;
while (true) {
val *= 2;
if (val > y) break;
count ++;
}
cout << count << endl;
} | 1 | 10,464,451 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define rep(i,N) for(int i=0;i<N;i++)
int main(){
ios::sync_with_stdio(false);
cin... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...)... | 1 | 34,949,240 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;
#define MAX 256
#define S(x) (x*x)
int f(int z){
if (z < 10)return 1;
return 1 + f(z / 10);
}
int main(void){
int ans[MAX];
for (int i = 0; i < MAX; i++){
ans[i] = 0;
}
int d;
int i = 0;
while (scanf("%d", &d) != EOF... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int n;
int sum;
int i;
while(1){
cin>>n;
if(cin.eof()) break;
sum=0;
for(i=n;i<=600;i+=n){
sum+=n*pow((i-n),2);
}
cout<<sum<<endl;
}
return 0;
} | 1 | 14,828,665 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double sum = 0;
for (int i = 0; i < n; ++i) {
double x;
char u[4];
cin >> x >> u;
sum += u[0] == 'J' ? x : x * 380000;
}
printf("%f",sum);
} | 1 | 4,622,800 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,X;
cin >> A >> B >> X;
if(A > X){
cout << "NO";
}else{
X-A<=B?cout<<"YES":cout<<"NO";
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, x;
cin >> a >> b >> x;
if (x > (a + b) || a > x) {
cout << "NO" << endl;
} else {
cout... | 1 | 87,553,128 |
#include <bits/stdc++.h>
using namespace std;
string a, b;
int main () {
cin >> a >> b;
reverse (a.begin(), a.end());
if (a == b){
cout << "YES";
} else {
cout << "NO";
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
char C[2][3];
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
rep(i, 2) rep(j, 3) cin >> C[i][j];
if (C[0][0]==C[1][2] && C[0][1]==C[1][1] && C[0][2]==C[1][0]) cout << ... | 1 | 27,864,178 |
#include<bits/stdc++.h>
using namespace std;
#define deb(x) cerr<<"["#x<<" : "<<x<<" ]\n";
int main()
{
int N;
cin >> N;
for(int i = 0; i < N; i++) {
if(N - i*4 < 0) break;
if((N - i*4) % 7 == 0) {
puts("Yes");
return 0;
}
}
puts("No");
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF 1e9
#define LINF __LONG_LONG_MAX__
int main() {
int ... | 1 | 62,650,332 |
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main()
{
int n,a,r;
cin>>n>>r;
if(n < 10){
a = 100*(10-n);
a = a+r;
}
else{
a = r;
}
cout<<a;
return 0;
} | #include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
int main() {
int N = 0;
int R = 0;
int Ans = 0;
cin >> N >> R;
if (N >=10) {
Ans = R;
}
else
{
Ans = R + (100 * (10 - N));
}
cout << Ans << endl;
return 0;
} | 1 | 64,250,193 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main(){
int n, k, ans, dis;
cin >> k >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) cin >> vec.at(i);
dis = k - vec.at(n-1) + vec.at(0);
for (int i = 1; i < n; i++) dis = max(dis, vec.at(i) - vec.at(i-1));
cout << k -... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef vector<int>vi;
#define pb push_back
#define sc(n) scanf("%d",&n)
#define lsc(n) scanf("%lld",&n)
#define all(x) x.begin(),x.end()
#define rep(i,n) for(i=0LL;i<n;i++)
#define rep1(i,n) for(i=1;... | 1 | 66,405,825 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n; cin >> n;
vector<long long> a(n); for(int i = 0; i < n; i++) cin >> a[i];
long long dp[n] = {0LL};
dp[0] = 1000;
for(int i = 1; i < n; i++) {
dp[i] = dp[i-1];
for(int j = 0; j < i; j++) {
long lon... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const LL N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
LL maximums[85];
int main()
{
int n,array1[100],i;
scanf("%lld",&n);
for(LL i=... | 1 | 64,265,328 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int now = 1;
for (int i = 0; i < n; i++) {
if (now < k) {
now = now * 2;
} else {
now += k;
}
}
cout << now << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int res = 1;
for (int i = 0; i < N; i++) {
if (res >= K) {
res += K*(N - i);
break;
}
else res *= 2;
}
cout << res << endl;
} | 1 | 2,218,142 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 1 | 6,959,779 |
#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>
#include <cstdio>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n; cin >> n;
double sum = 0;
for(int i = 0; i < n; ... | 1 | 59,859,900 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
const ll MOD = 1000000007;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(m+2);
for(int i=1;... | 1 | 37,924,717 |
#include <stdio.h>
#include <string.h>
int main() {
char s[101];
int k;
scanf("%d",&k);
getchar();
scanf("%[^\n]", &s);
if (strlen(s) > k ){
for(int i = 0; i < k; i++){
printf("%c", s[i]);
}
printf("...\n");
}else{
for(int i = 0; i < strlen(s); i++){
printf("%c", s[i]);
}
}
return 0;
} | #include<stdio.h>
#include<string.h>
int main(){
int n;
char s[1000];
scanf("%d",&n);
scanf("%s",s);
if(n>=strlen(s)){
printf("%s\n",s);
}else{
for(int i=0; i<=n; i++){
if(i==n){
puts("...");
}else{
printf("%c",s[i]);
}
}
}
return 0;
} | 1 | 59,959,996 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char **argv)
{
ll N; cin >> N;
ll res{0};
for (ll i = 0; i < N; ++i)
{
ll a, b; cin >> a >> b;
res += b - a + 1;
}
std::cout << res << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | 1 | 51,804,358 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,K;
cin >> N >> K;
ll edgeNum = (N-1)*(N-2)/2;
if(edgeNum<K){
cout << -1 <<endl;
return 0;
}
cout << N-1 +edgeNum -K <<endl;
for(int i=1;i<N;i++){
cout << i <<" "<< N <<endl;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | 1 | 58,686,328 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<iomanip>
#include<sstream>
#include<map>
#include<set>
#include<cmath>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
bool flag = true;
map<char, char> a, b;
for(int i = 0; i < S.size(); i++){
char s = S[i], t = T[i];
if(a.count(s)){
if(a[s] != t){
flag = false;
}
}
... | 1 | 17,261,002 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0 ; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>>n ;
vector<int> x(n) ;
vector<int> y(n) ;
rep(i,n){
cin>>x[i] ;
}
rep(i,n){
cin>>y[i] ;
}
vector<int> temp=x ;
sort(temp.begin(),temp.e... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
long n;
cin >> n;
vector<long long> p(n);
for (auto &x : p) {
cin >> x;
}
vector<long long> q(n);
for (auto &x : q) {
cin >> x;
}
vector<lo... | 1 | 54,503,031 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long num, c, k;
long long cntBus = 0;
cin >> num >> c >> k;
vector<long long> vec(num);
for (int i = 0; i < num; i++) { cin >> vec.at(i); }
sort(vec.begin(), vec.end());
long long cnt = 0, genkaiTi;
for (int i = 0; i < num;)... | #include <bits/stdc++.h>
#define respa return 0
#define all(x) x.begin(), x.end()
#define sz size
#define pb push_back
#define eb emplace_back
#define forn(i, x, n) for(int i = x; i <= n; ++i)
#define forr(i, n, x) for(int i = n; i >= x; --i)
using namespace std;
typedef long long ll;
typedef long double ld;
const int ... | 1 | 99,822,624 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
string s; cin>>s;
int n = s.size();
for(int i = 1; i < n; i++){
if(s[i] == s[i - 1]){
co... | 1 | 38,774,927 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char X, Y;
cin >> X >> Y;
if (X<Y) cout << "<\n";
else if (X>Y) cout << ">\n";
else cout << "=\n";
} | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#defin... | 1 | 50,419,943 |
#include<iostream>
using namespace std;
int main() {
int n, x, a, b, c;
int s = 0;
while (true) {
cin >> n >> x;
if (n == 0 && x == 0) {
break;
}
a = x / 3 + 1;
for (int i = a; i <= n; i++) {
c = (x - i) / 2 + 1;
for (int j = c; j < i; j++) {
if (0 < x - i - j&&x - i - j < a) {
s += 1;
... | #include <iostream>
using namespace std;
int main(void) {
int n, x;
while(cin >> n >> x && (n != 0 || x != 0)) {
int cnt = 0;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
for(int k = 1; k <= n; k++) {
if(i < j && j < k && i + j + k == x) {
cnt++;
... | 1 | 31,867,165 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int n, k;
int main() {
cin >> n >> k;
int limit = (n-1)*(n-2)/2;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 1 | 31,590,271 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | 1 | 10,520,101 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define rep(i,n) for(int i=0;i<n;i++)
int N, X, M;
int nxt[100010][60];
int cost[100010][60];
signed main()
{
cin >> N >> X >> M;
rep(i, M)nxt[i][0] = i * i % M;
for(int i = 1; i < 60; i++)
{
rep(j, M)nx... | #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... | 1 | 34,325,461 |
#include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
ll P[100005];
const ll mod = 998244353;
ll pow(ll x, ll y) {
if (y == 0L... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while(!(x))
#define unless(x) if(!(x))
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
#define pc __builtin_popcount
const int mod = 998244353;
int ar[100005];
int cnt[100005];
int n;
int32_t main(){
cin>>n;
... | 1 | 14,821,597 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=1e6+10;
const int INF=0x3f3f3f3f;
const double eps=1e-10;
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
int n;
ll x,y;
int t;
scanf("%lld%lld",&x,&y);
if(max(x... | #include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
string win = "Alice";
string lose = "Brown";
long long X, Y;
int issente[210][210];
int naive(int a, int b) {
if (a <= 1 && b <= 1) return issente[a][b] = 0;
if (issente[a][b] != -1) return issent... | 1 | 11,714,063 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int cnt=0;
void f(vector<int>& a){
if(a[0]==a[1] && a[1]==a[2]) cout<<cnt<<"\n";
else{
sort(a.begin(),a.end());
if(a[1]-a[0]>=2){
a[0]+=2;
}
else{
a[0... | 1 | 97,632,588 |
#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 main()
{
int n,m;cin>>n>>m;
while(n!=0||m!=0)
{
int i;
vector<int> d(n);
vector<int> p(n);
rep(i,n)cin>>d[i]>>p[i];
vector<pair<int,int>> dp(n);
rep(i,n... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<ve... | 1 | 89,266,062 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
ll a,b;
cin>>a>>b;
if(a==0 || a==1){
ll ans;
if(b%4==1) ans=1;
else if(b%4=... | 1 | 82,918,272 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(... | 1 | 51,037,804 |
#include<stdio.h>
int main ()
{
int X,K,yeet;
scanf("%d",&K);
scanf("%d",&X);
yeet = K * 500;
if (yeet >= X )
{
printf("Yes\n");
}
else
{
printf("No\n");
}
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<ll, ll>;
const int INF = 0x3f3f3f3f;
int main() {
int k, x;
cin >> k >> x;
if (k * 500 < x)
cout << "No" <<... | 1 | 78,961,944 |
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
string t, h;
int n, t_len, h_len, itr, t_score, h_score;
t_score = 0;
h_score = 0;
cin >> n;
for (int i=0; i<n; ++i){
cin >> t >> h;
itr = 0;
t_len = t.length();
h_len = h.l... | #include<iostream>
using namespace std;
int main() {
int n;
char Taro[1001][101], Hanako[1001][101];
int TaroPoint = 0, HanakoPoint = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> Taro[i] >> Hanako[i];
for (int j = 0; j < 101; j++) {
if (Taro[i][j] > Hanako[i][j]) {
TaroPoint += 3;
break;
}
... | 1 | 72,767,846 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define vii vector < ll >
#define vll vector < ll >
#define dt cout<<"HERE\n";
#define pii pair < ll , ll >
#define pll pair < ll , ll >
#define vpi vector < pii >... | #include <bits/stdc++.h>
#define ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ret(n) return cout << n, 0
#define se(n) cout << setprecision(n) << fixed
#define pb push_back
#define int long long
#define ld long double
#pragma GCC optimize("Ofast,no-stack-prote... | 1 | 94,456,611 |
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<set>
#include<map>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#defi... | #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 | 97,170,465 |
#include <iostream>
using namespace std;
const int MAX_A = 17;
const int MAX_B = 17;
bool passable[MAX_A][MAX_B];
int dp[MAX_A][MAX_B];
int main() {
int a, b;
while (cin >> a >> b) {
if (a == 0 && b == 0) break;
int N;
cin >> N;
for (int i = 1; i <= a; i++) {
for (int j = 1; j <= b; j++) {
... | #include <stdio.h>
int main(void){
while(1){
int n,i,j,a,b;
int masu[20][20]={0};
int ura[20][20]={0};
int bad[2];
scanf("%d %d", &a, &b);
if(a==0)break;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d", &bad[0], &bad[1]);
ura[bad[0]][bad[1]]=1;
}
masu[0][1]=1;
for(i=1;i<=a;i++){
for(j=1;... | 1 | 13,974,303 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
int main(){
int n, k; cin >> n >> k;
int a[n];
for (int i = 0; i < n; ++i) cin >> a[i];
vector<ll> dp(k+1, 0);
dp[0] = 1;
for(int &i : a){
vector<ll> fake(k+1, 0);
for(int j = k; j >= 0; --j){
int tmp = dp[j];
int... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7ll ;
const int MAX = 100010 , N = 110 ;
long long dp[MAX][N] , dp2[MAX][N] ;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n , k ;
cin>>n>>k ;
long long arr[n+1] ;
for(int i = 1 ; i <= n ; ++i)
cin>>arr[i]... | 1 | 39,955,196 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa,k)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<in... | #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(void){
int n, k;
cin >> n >> k;
int ans = 0;
rep(i,n) {
int h;
cin >> h;
if(h >= k) ans++;
}
cout << ans << endl;
return 0;
} | 1 | 30,066,547 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
string s;
cin >> s;
if(s[A] != '-') {
cout << "No" << endl;
return 0;
}
for(int i=0; i<A; i++) {
if(s[i] < '0' || s[i] > '9') {
cout << "No" << endl;
return ... | /*https:
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b;
string s;
cin >> a >> b >> s;
if (s.size() != a + b + 1 || s[a] != '-')
{
cout << "No... | 1 | 78,913,142 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
void solve(){
cin.tie(0);
ios::sync_with... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 1 | 61,434,065 |
#include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int days[1000][11][21];
int main(){
int n,y,m,d;
int year=999,month=10,day=20,cnt=1;
while(year>=1 && month>=1 && day>=1){
days[year][month][day]=cnt;
cnt++;
day--;
if(day<=0){
if(month==1){
y... | #include <iostream>
using namespace std;
int main(){
int n,y,m,d,o,i,j,k,sum;
cin >> n;
for(o=0;o<n;o++){
cin >> y >> m >> d;
sum=0;
i=y;j=m;k=d;
while(i!=1000){
sum++;
k++;
if(i%3!=0&&j%2==0){
if(k==20){
j++;
k=1;
}
}else if(k==21) {
k=1;
j++;
}
if(j=... | 1 | 22,559,864 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n,k;
cin>>n>>k;
long long int s=n;
while(n--){
long long int x;
cin>>x;
}
long long int u=(s-1);
long long int d=(k-1);
if(u%d==0){
cout<<u/d;
}
else{
cout<<(u/d)+1;
}
re... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int n,k,i;
cin>>n>>k;
int a[n];
for (i=0;i<n;i++)
cin>>a[i];
... | 1 | 58,732,918 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
long double ans = 0.0;
for (int i = 1; i <= min(n, k - 1); i++)
{
int idx = ceil(log2(k / (i + 0.0)));
long double tmp = pow(0.5, idx);
tmp /= ... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 33,787,685 |
#include <iostream>
#include <stack>
using namespace std;
int main()
{
string str;
while (getline(cin,str))
{
if (str == ".") return 0;
stack<char> p;
bool flag = true;
for (int i=0;i<str.length();i++)
{
if (str[i] == '(') p.push('(');
else if (str[i] == ')')
{
if (!p... | #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define EPS 1e-14
#define all(v) v.begin(),v.end()
typedef v... | 1 | 99,116,775 |
#include <iostream>
#define N 100
using namespace std;
int main() {
ios::sync_with_stdio(false);
int A[N], n, cnt = 0;
cin >> n;
for(int i = 0; i < n; ++i) {
cin >> A[i];
}
for(int i = 0; i < n; ++i) {
int mini = i;
for(int j = i; j < n; ++j) {
if(A[j] < A[mini]) {
mini = j;
}
}
if(mini != i) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,flag=0,min;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
min=i;
for(int j=i;j<n;j++){
if(a[j]<a[min])min=j;
if(j==n-1&&i!=min){
swap(a[i],a[min]);
flag++;
}
}
if(i==n-1)cout<<a[i]<<end... | 1 | 78,703,465 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
string str[10]={"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
string s;
cin>>s;
int b=0,c=0;
for(int j=0;j<s.size();j++){
if(s[j]=='0'){
if(b)... | #include<iostream>
#include<vector>
#include<string>
#include<stdlib.h>
using namespace std;
vector<string> ans;
string bot[10] = {"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int main(){
int n;
cin >> n;
for(int i = 0;i < n;i++){
string mess;
string code;
cin >> code;
int count = 0;
for(... | 1 | 62,235,458 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int A, B, X;
cin >> A >> B >> X;
if(A <= X && A + B >= X ) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define cina(s, n, a) for(int quer = s; quer < n; quer++) cin >> a[quer]
#define mod(a, b) (abs(b) + (a % abs(b))) % abs(b)
#define setp(x) fixed << setprecision(x)
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;... | 1 | 18,278,513 |
#include<iostream>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include <algorithm>
#include <set>
#include<math.h>
#include<cmath>
#include<vector>
#include<map>
#include<random>
#include<sstream>
using namespace std;
int main(){
string t;cin >> t;
string ty,tm,td={};
int j = 0;
for(int i = 0... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
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;}
int ... | 1 | 92,196,671 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y);
signed main() {
int n;
long long t[100], g, ans;
cin >> n;
for ( int i = 0; i < n; i++ ) {
cin >> t[i];
}
g = t[0];
for ( int i = 1; i < n; i++ ) {
if ( t[i] % g == 0 ) {
g = t[... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | 1 | 77,784,615 |
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
using ll = long long;
const int nax = 1e5 + 5;
vector<int> edges[nax];
const int mod = 1e9 + 7;
int mul(int a, int b) {
return (ll) a * b % mod;
}
pair<int,int> dfs(int current, int pre) {
int presently_white = 1, presently_black = 1;
for (... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#def... | 1 | 89,518,446 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MAXN = 110;
const int MAXK = 1e5+10;
const int MOD = 1e9+7;
int N, K;
int dp[MAXK];
void add_self(int& a, int b) {
a+=b;
if(a>=MOD){
a-=MOD;
}
}
void sub_self(int& a, int b) {
a-=b;
if(a<0){
a+=MOD;
}
}
i... | #include<bits/stdc++.h>
#define M 1000000007
#define pb push_back
#define ll long long int
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int a[n];
int i,j;
for(i=0;i<n;i++)
cin>>a[i];
ll dp[n][k+1];
ll prefsum[k+1];
for(i=0;i<n;i++)
{
for(j=0;j<=k;j++)
{
if(i==0)
{
dp[i][j] = (j<=a[i]);... | 1 | 24,606,654 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) a[i] = a[i] - (i + 1);
sort(a.begin(), a.end());
int b;
if (n % 2 ... | #pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (... | 1 | 4,720,088 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
int n, m; cin >> n >> m;
vector<ll>x(n), y(m); for (auto&& xx : x)cin >> xx;for (auto&& yy : y)cin >> yy;
sort(x.begin(), x.end());sort(y.begin(), y.end());
ll a = 0, b = 0;
for ... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
ve... | 1 | 10,756,520 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#defi... | #include<bits/stdc++.h>
#include<bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for(int i=st; i<ed; i++)
#define repn(i, st, ed) for(int i=st; i<=ed; i++)
#define repb(i, ed, st) for(int i=ed; i>=st; i--)
#define all(v) v.begin(),v.end()
ty... | 1 | 83,348,970 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define PI 3.14159265358979
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repp(i, s, e) for(int i = (s); i <= (e); ++i)
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#defin... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define all(v) (v).begin(),v.end()
set<string> c;
const ll mod=1000000007;
const ll mod2=998244353;
const ll inf=100000000000000000;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){... | 1 | 48,861,803 |
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define ll long long int
#define pb push_back
int m... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::string S){
int pointer = 0;
int need_left = 0;
for(int i = 0; i < S.size(); ++i){
if(S[i] == '(') pointer++;
else
{
if(pointer == 0) need_left++;
else pointer--;
}
}
int... | 1 | 98,380,795 |
#include<iostream>
int main(){
int n;
std::cin >> n;
int a[n+1];
for(int i=1;i<=n;i++)
std::cin >> a[i];
bool f=0;
int t=0;
int i=1;
while(t!=n){
if(a[i]==2){
t++;
f=1;
break;
}
else{
i=a[i];
}
t++;
}
f==1?std::cout << t : std::cout << "-1";
return 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,p=0,c=0;
cin >> n;
vector<int> vec(n);
vector<bool> check(n,false);
for(int i=0;i<n;i++){
cin >> vec.at(i);
}
while(p!=1){
if(check.at(p)){
break;
}else{
check.at(p) = true;
p = vec.at(p)-1;
c++;
}
}... | 1 | 43,041,962 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
const int cnMaxArray = 1000033;
long long fnStrToInt(string sKey)
{
int iElement;
int iBase = 1;
int llKey = 0;
for (int i = sKey.size() - 1; i >= 0; i--)
{
switch (sKey[i])
{
case 'A': iElement = 1;
... | #include<iostream>
#include<set>
using namespace std;
int main()
{
ios::sync_with_stdio( false );
int n;
cin>>n;
set< string > dict;
string cmd, key;
for( int i=0; i<n; i++ ) {
cin>>cmd>>key;
if( "insert" == cmd ) {
dict.insert( key );
} else {
if( dict.end() != dict.find( key ) ) {
cout<<"yes\n";... | 1 | 2,798,929 |
#include<stdio.h>
int main(void)
{
double a, b;
scanf("%lf %lf", &a, &b);
if(a>b){printf("a > b\n");}
else{if(a ==b){printf("a == b\n");}
else{printf("a < b\n");}}
return 0;
} | #include <stdio.h>
int main() {
int a, b;
while(~scanf("%d%d", &a, &b)) {
if(a > b) {
printf("a > b\n");
} else if (a == b) {
printf("a == b\n");
} else {
printf("a < b\n");
}
}
return 0;
} | 1 | 12,956,700 |
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
long long MAX = 1000000000000000000;
int main(){
cout << setprecision(10);
int N,M;
cin >> N >> M;
map<int,string> order;
map<string,string> ans;
vector<vector<ll>> pref(N);
for(in... | 1 | 60,136 |
#include <bits/stdc++.h>
using namespace std;
const int match[10] = { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
const int INF = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
int a[m];
for ( int i = 0; i < m; i++ ) { cin >> a[i]; }
sort(a, a+m, greater<int>());
int dp[n+1];
dp[0] = 0;
for ( int i = 1; i <= n; i++... | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
int dp[10050];
const int gs[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main(){
int n, m; cin >> n >> m;
vector<int> match(m);
for( auto &k : match ) cin >> k;
fill_n( dp, 1000... | 1 | 99,415,336 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int q,h,s,d;
cin >> q >> h >> s >> d;
int n;
cin >> n;
long long int price;
price=min(min(4*q,2*h),s);
if(n%2){
price=(n-1)*min(2*price,d)/2+price;
}
else{
price=n*min(2*price,d)/2;
}
cout << ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
s = min({4 * q, 2 * h, s});
ll ans = 0;
if (s * 2 > d)
ans = n / 2 * d + (n % 2) * s;
else
ans = s * n;
... | 1 | 57,801,983 |
#include <iostream>
using namespace std;
static const int MAX=100001;
int parent(int i) {
return i/2;
}
int left(int i) {
return 2*i;
}
int right(int i) {
return 2*i+1;
}
int main() {
int H;
cin>>H;
int A[MAX];
for (int i=1; i<=H; i++) {
cin>>A[i];
}
for (int i=1; i<=H; i++) {
cout<<"node "<<i... | #include<stdio.h>
int main(){
int i,h,data[250];
scanf("%d",&h);
for(i=0;i<h;++i) scanf("%d",&data[i]);
for(i=0;i<h;++i){
printf("node %d:",i+1);
printf(" key = %d, ",data[i]);
if(i!=0) printf("parent key = %d, ",data[(i-1)/2]);
if(i*2+1<h) printf("left key = %d, ",data[i*2+1]);
if(i*2+2<h) ... | 1 | 85,793,328 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string str;
while (getline(cin, str), str != "."){
stack<char> st;
bool res = true;
for (int p = 0; p < str.size(); p++){
if (str[p] == '(' || str[p] == '['){
st.push(str[p]);
}
else if (str[p] == ')' || str[p] == ']'){
if (st.empty()){... | #include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(){
while(true){
string s;
getline(cin, s);
if(s == "."){ break; }
stack<char> stk;
bool success = true;
for(int i = 0; i < s.size(); ++i){
char c = s[i];
if(c == '(' || c == '['){
stk.push(c);
}else if(c == ')... | 1 | 18,496,135 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define REP(i, d, n) for(int i=(d); i<(n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main() {
ll n; cin>>n;
long double a=sqrt(n);
ll b=a/1;
ll ans;
rep(i,n){if(n%(b-i)==0){ans=b-i;break;}}
ll answe... | #include <bits/stdc++.h>
using namespace std;
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vector<vector<t>>;
typedef long long ll;
typedef vc<int> vi;
typedef vvc<int> vvi;
typedef pair<int, int> pi;
#define uset unordered_set
#define umap unordered_map
#define endl "\n"
#define fi first
#de... | 1 | 11,643,087 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll ans = 1;
for (ll i=0; i<N; i++) {
cin >> A[i];
if (A[i]==0) {
ans = 0;
}
}
if (ans==0) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ll long long
int main(){
int n;
const ll max=1e18;
cin >> n;
vector<ll> a(n);
rep(i,n){
cin >> a[i];
if(a[i]==0){
cout << 0 << endl;
return 0;
}
... | 1 | 66,176,543 |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lowe... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin>>n>>k;
int a[n];
for (int i=0; i<n; i++) cin>>a[i];
vector<int> b;
for (int i=0; i<n; i++) {
if (a[i] < k) {
b.push_back(a[i]);
}
}
int size = b.size();
bool dp_left[size+1][k], dp_right[size+1][k];
for (int i=0; ... | 1 | 2,349,267 |
#include <algorithm>
#include <iostream>
#include <cstdio>
int main()
{
int a = 0, b = 0, c = 0;
std::cin >> a >> b >> c;
if (a > b)
std::swap(a, b);
if (b > c)
std::swap(b, c);
if (a > b)
std::swap(a, b);
std::cout << a << " " << b << " " << c << std::endl;
return 0;... | #include <iostream>
#include <algorithm>
using namespace std;
#define for_(i,a,b) for(int i = (a);i < (b);i++)
#define rfor_(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define rep(i,n) for_(i,0,(n))
#define rrep(i,n) rfor_(i,0,(n))
int a[3];
int main(){
cin.tie(0);
rep(i, 3)cin>>a[i];
sort(a, a+3);
cout<<a[0]<<' '<<a[1... | 1 | 86,592,092 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.