code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define pb push_back
#define fr first
#define sc second
char col[4] = { 'R', 'G', 'B', 'Y', };
char sol(int x,int y,int d){
if(d&1){
return col[(x^y)&1];
}
if((... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
string s[2]{
"RY",
"GB"
};
int main(){
int h,w,d;cin>>h>>w>>d;
rep(i,h){
rep(j,w){
int x=i-j,y=i+j;
int a=(x+2*d*1000)%(2*d),b=(y+2*d*1000)%(2*d);
printf("%c",s[a>=d][b>=d]);
}
puts("");
}
} | 1 | 26,058,622 |
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define ll long long
#define f(i, n) for (int i = 0; i < n; i++)
#define ff(i, n) for (int i = 1; i <= n; i++)
#define... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#d... | 1 | 28,012,477 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> d(n);
for(int i = 0; i < n; i++){
cin >> d[i];
}
int sum = 0;
for(int i = 0; i < n - 1; i++){
fo... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define se second
#define fi first
#define ll long long
#define INF INT_MAX
#define mod 1000000007
#define chutiyaap ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
ll pw(ll a, ll b) {
if (b == 0) return 1;
ll t... | 1 | 49,655,403 |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pii pair<ll , ll>
#define mpi make_pair
#define F first
#define S second
#define pb push_back
bool comp1(pii a , pii b)
{
return atan2(a.S , a.... | #include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
using namespace std;
bool cmp(const pair<long long... | 1 | 13,951,838 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n, x; cin >> n >> x;
vector<int> co(n+1);
rep(i,n) {
int y; cin >> y;
co... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3],n;
using Graph = vector<vector<int>>;
vector<vector<i... | 1 | 68,502,127 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s, t;
int c=0;
cin >> s >> t;
for(int i=0; i < s.length(); ++i){
if(s[i] != t[i]){
c++;
}
}
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int total = 0;
int size = s.size();
for (int i = 0; i < size; i++){
if(s.at(i) != t.at(i)){
total = total + 1;
}
}
cout << total << endl;
} | 1 | 14,825,182 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
using namespace std;
int n,s,x;
void sum(int i,int k,int n){
if(s==k&&n==0)... | #include <iostream>
#include <cstdio>
using namespace std;
int count;
int n,s;
void find_dps(int sum, int now, int add_count) {
if (now > 10 || add_count > n || sum > s) {
return;
}
if (sum == s && add_count == n) {
count++;
return;
}
find_dps(sum+now, now+1, add_count+1);
find_dps(sum, now+1, a... | 1 | 21,612,576 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
int main() {
ll a, b, c, d;
cin >> a... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n,k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pa... | 1 | 86,050,908 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
int H, W;
cin... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 1 | 44,832,873 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int N, D, A;
cin >> N >> D >> A;
int X[N], H[N];
P p[N];
for(int i=0; i<N; i++){
int a, b;
... | 1 | 14,015,290 |
#include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
#define int int64_t
using namespace std;
typedef pair<int, int> pii;
const int N = 102;
const int logN = 17;
pii p[N], cur, res;
int n;
pii o... | #include<iostream>
#include<algorithm>
#include<iomanip>
#include<cmath>
using namespace std;
struct point
{
long double x, y;
}pos[105];
int Quadrant(point a)
{
if(a.x>0&&a.y>=0) return 1;
if(a.x<=0&&a.y>0) return 2;
if(a.x<0&&a.y<=0) return 3;
if(a.x>=0&&a.y<0) return 4;
}
long double cross(long ... | 1 | 48,401,305 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int l[N];
for (int i = 0; i < N; i++) {
cin >> l[i];
}
sort (l, l + N);
reverse (l, l + N);
int ans = 0;
for (int i = 0; i < K; i++) {
ans += l[i];
}
cout << ans << endl;
return 0;
} | 1 | 65,697,994 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m; cin>>n>>m;
int s,o_e;
s=((n+m)*(n+m-1))/2;
o_e=n*m;
cout<<s-o_e<<endl;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | 1 | 20,725,966 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | 1 | 87,823,877 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,l) for(lli i=s;i<l;i++)
#define DEBUG 0
#define INF (1LL<<50)
#define MOD 1000000007
signed main(){
lli n,k;
cin>>n>>k;
lli flag=0;
vector<lli> a(n);
REP(i,0,n){
cin>>a[i];
if(a[i]>=0)flag++;
}
vector<lli> data(n+1,0);
d... | 1 | 35,296,935 |
#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;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ... | 1 | 62,288,679 |
#include <bits/stdc++.h>
using namespace std;
map <long long, char> mp;
inline char check(long long x) {
cout << "?" << " " << x << endl;
char ch;
cin >> ch;
return ch;
}
int main() {
int rez, pas, i;
ios::sync_with_stdio(false);
long long x;
if(check(1e9) == 'Y') {
x = 2;
... | #include <cstdio>
typedef long long ll;
inline bool Query(ll x)
{
printf("? %lld\n",x),fflush(stdout);
char s[10];
return scanf("%s",s),*s=='Y';
}
int main()
{
ll X=1000000000;
while(!Query(X))X/=10;
if(X==1000000000)for(X=1;!Query(X+1);X*=10);
else
{
int l=X,r=X*10-1;
wh... | 1 | 82,971,556 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAX=1e5+10;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
struct DOT{
int x,y;
int operator- (const DOT&p)const{
int dx=x-p.x,dy=y-p.y;
if(dx<0) dx=-dx;... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 1 | 511,099 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(a) (long long)((a).size())
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll mod = 1e9+7;
ll n,i,j,m;
cin>>n>>m;
vector<ll> x(n), y(m);
... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cou... | 1 | 51,351,141 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll s;cin>>s;
ll v = 1e9;
ll x = (v - s%v)%v;
ll y = (s+x)/v;
cout<<"0 0 1000000000 1 "<<x<<" "<<y;
} | 1 | 93,753,024 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
int d[] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
signed main(){
i... | #include <algorithm>
#include <iostream>
using namespace std;
int d2c[] = { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
int dd[8];
int qu[9], aa[9], aa_[9];
int k_, l_;
int c_;
void update(int k, int l) {
if (l_ > l)
return;
for (int h = 0; h < k; h++)
aa[h] = dd[qu[h]];
int m = min(l, 9);
for (int h = k; h < m; h++)
aa[... | 1 | 59,749,498 |
#include <algorithm>
#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>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using Grid= vector<vector<char>>;
using vin= vector<int>;
using ll=long long;
using vll= vector<ll>;
using vbl=vector<bool>;
using vch=vector<char>;
using pnn=pair<int ,int>;
#define ft first
#define sd second
#define fn front
#define pb p... | 1 | 14,205,739 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<int> P(M), Y(M), ord[100010];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
ord[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++) sort(ord[i].begin()... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, n) for(int i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define riverse(v) reverse((v).be... | 1 | 63,951,695 |
#include <bits/stdc++.h>
using namespace std;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp(a) setprecision(a)<<fixed
#define ss second
#define fori(v) for(ll i=0; i<v; i++)
#define forj(v) for(ll j=0; j<v; j++)
#define fork(v) for(ll k=0; k<v; k++)
#define forl(v) for(ll l=0; l<v; l++)
#define fort(v) f... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (... | 1 | 81,345,588 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | #include <bits/stdc++.h>
#define level first
#define cnt second
using namespace std;
typedef pair<int,int> ii;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin >> n;
int arr[n]; for(int i = 0;i < n;i++) cin >> arr[i];
bool increasing = true;
for(int i = 1;i < n;i++){
if(arr[i] <= arr[i-1]) in... | 1 | 50,193,004 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 10000... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = (int)(a); i <= (int)(n); ++i)
#define rrep(i, a, n) for (int i = (int)(a); i >= (int)(n); --i)
#define debug(x) cerr << #x << " = " << x << "\n"
#define debug2(x, y) \
cerr << "(" << #x << "," << #y << ") = " \
<< "(" << x << "," ... | 1 | 19,128,891 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int dx[]={-1,0,0,1};
int dy[]={0,-1,1,0};
int H,W;
bool check(vector<string>S,int x,int y){
if(S[y][x]=='.') return true;
for(int i=0;i<4;i++){
... | #include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#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 FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(... | 1 | 95,154,192 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define MOD 1000000007
int main(void) {
int a, b;
cin >> a >> b;
if(a == b) {
cout << "Draw" << endl;
} else if(a == 1 || a > b ... | 1 | 35,127,523 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#... | #include <iostream>
#include <fstream>
#include "bits/stdc++.h"
using namespace std;
#define D double
#define int long long
#define FOR(i, a, b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i, n) FOR(i,0,(n))
class CMinimization {
public:
void solve(std::istream &in, std::ostream &out) {
int n, k;
in... | 1 | 16,980,138 |
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | #include <iostream>
#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];
int m1 = 0, m2 = 0;
for(int i = 0; i < N; i++){
if(m1 <= a[i]){
m2 = m1;
m1 = a[i];
}
else if(m1 > a[i] && m2 < a[i]) m2 = a[i];
}
for... | 1 | 69,965,102 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define all(x) begin(x), end(x)
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
string s; cin >> s;
if(s == "BBB" || s== "AAA"){
cout << "No" << "\n";
}else{
cout << "Yes" << "\n";
}
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string s;
bool f=0;
cin >> s;
for(int i=0; i<s.length(); i++){
if(s[0]!=s[i]) f=1;
}
if(f) cout <<"Yes" <<endl;
else cout <<"No" <<endl;
return 0;
} | 1 | 53,247,065 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1e8;
int main() {
int n;
cin >> n;
vector<int> r(n), c(n);
rep(i, n) cin >> r[i] >> c[i];
vector<vector<int>> dp(n + 1, vector<int>(n + 1, INF));
rep(i, n + 1) dp[i][i] = 0;
rep(i, n... | #include<iostream>
#include<algorithm>
using namespace std;
int n, r[109], c[109];
long long dp[109][109];
const long long MAX = __LONG_LONG_MAX__;
int main(){
cin >> n;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)dp[i][j] = MAX;
}
for(int i=0;i<n;i++)cin >> r[i] >> c[i];
for(int i=0;i<n;i++)dp[i][i] = 0;
... | 1 | 98,649,714 |
#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;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int main(void)
{
ll n; cin>>n;
cout<<n*(n-1)/2... | 1 | 81,784,885 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-1; (i) >= (int) (b... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pa pair<int,int>
const int Maxn=100010;
const int inf=2147483647;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return x*f;
}
int ... | 1 | 61,350,988 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
size_t sz=s.size();
sort(s.begin(),s.end());
s.erase(unique(s.begin(),s.end()),end(s));
sz==s.size()?cout<<"yes":cout<<"no",cout<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
u... | 1 | 52,474,140 |
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A <= C && C <= B ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;string ans="No";cin >>a>>b>>c;
if(a<=c&&c<=b)ans="Yes";
cout <<ans<<endl;
} | 1 | 92,008,817 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n, q;
scanf("%d %d", &n, &q);
dsu d(n);
for (int i = 0; i < q; i++) {
int t, u, v;
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int p[200005];
int root(int x) {return p[x] < 0 ? x : p[x] = root(p[x]);}
void mer(int x, int y) {
if ((x = root(x)) == (y ... | 1 | 47,009,343 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=... | #include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
using namespace std;
typedef unsigned long long ull;
typedef lon... | 1 | 25,885,121 |
#include<stdio.h>
int main()
{
int count=0;
int a,b,c,d,n;
while(scanf("%d",&n)!=EOF)
{
count=0;
for(a=0; a<10; a++)
for(b=0; b<10; b++)
for(c=0; c<10; c++)
for(d=0; d<10; d++)
if(a+b+c+d==n)
... | #include <cstdio>
int main(int argc, char *argv[]) {
using namespace std;
int rcv;
while (EOF != fscanf(stdin, "%d", &rcv)) {
int cnt = 0;
for (int a = 0; a < 10; a++) {
for (int b = 0; b < 10; b++) {
for (int c = 0; c < 10; c++) {
for (int d = 0; d < 10; d++) {
if (a+b+c+d == rcv)
cnt++... | 1 | 85,440,145 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
int d = a / b;
int r = a % b;
double f = (double)a/b;
printf("%d %d %f\n", d, r, f);
} | #include <iostream>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long a,b;
while(cin >> a >> b){
cout.precision(5);
cout << a / b << " " << a % b << " " << fixed << (double)a / (double)b << endl;
return 0;
}
} | 1 | 31,517,721 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char c;
bool a,i,u,e,o;
cin >> c;
a = c == 'a';
i = c == 'i';
u = c == 'u';
e = c == 'e';
o = c == 'o';
if ( a || i || u || e || o ){
cout << "vowel" << endl;
} else {
cout << "consonant" << endl;
}
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
char c;
cin >> c;
set<char> s = {'a', '... | 1 | 61,822,613 |
#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 <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 1 | 89,126,251 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
... | #pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
cout << (n / 2) - !(n % 2) << '\n';
return 0;
} | 1 | 61,401,576 |
#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mid ((x + y) / 2)
#define left (ind * 2)
#define right (ind * 2 + 1)
#define mp make_pair
#define timer ((double)clock() / CLOCKS_PER_SEC)
#define endl "\n"
#define spc " "
#define d1(x) cerr<<#x<<":"<<x<<endl
... | #include <bits/stdc++.h>
#include <complex.h>
#define fmin brent_find_minima
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(ALL(a),k)
#define SMALLER(a,k) lower_bound(ALL(a),k)-a.begin()... | 1 | 80,816,413 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 998244353
#define PI 2*acos(0.0)
in... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
#define pb push_back
template<class T> inline bool... | 1 | 70,436,140 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
string S;
int cnt_0, cnt_1;
int main(){
cin >> S;
rep(i, S.size()){
if (S[i]=='0') cnt_0++;
else cnt... | #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;
... | 1 | 14,498,752 |
#include <bits/stdc++.h>
#include <math.h>
#include <float.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
const int amax = 100000;
ll cnt[amax+1];
int main(){
ll n,k; cin >>n >>k;
rep(i,n){
int a,b; cin >>a >>b;
cnt[a]+=b;
}
for(int i = 1; i<=amax; i++){
if(k<=cnt[i]) {
cout << i << endl;... | 1 | 56,641,237 |
#include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
int main() {
double T,X;
cin>>T>>X;
double A=T/X;
cout<<A;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 1 | 8,252,427 |
#include <cstdio>
#include <cctype>
#include <vector>
#include <iostream>
#define MAXN (100005)
int n;
int s[MAXN];
long long ans;
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; ++i)
{
scanf("%d", &s[i]);
}
for (int i = 0; i < n; ++i)
{
if (s[i] & 1 && s[i + 1])
{
... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 1 | 57,536,801 |
#include <iostream>
using namespace std;
int main(void) {
int width, height, x, y, r;
cin >> width >> height >> x >> y >> r;
string answer;
if (x - r < 0) {
answer = "No";
} else if (x + r > width ) {
answer = "No";
} else if (y - r < 0) {
answer = "No";
} else if... | #include <iostream>
using namespace std;
int main() {
int W, H, x, y, r;
int safe_min_x, safe_max_x, safe_min_y, safe_max_y;
cin >> W >> H >> x >> y >> r;
safe_min_x = r; safe_max_x = W-r;
safe_min_y = r; safe_max_y = H-r;
if ((safe_min_x <= x && x <=safe_max_x)&&(safe_min_y <= y && y <= safe_max_y)){
c... | 1 | 50,678,508 |
#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 i, N, K, count=0, A=0, B=0;
cin >> N >> K;
vector<string> l(N);
rep(i,N) cin >> l[i];
sort(l.begin(),l.end());
rep(i,N) cout << l[i];
} | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define _terminated return 0
#define endl "\n"
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define booster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef vecto... | 1 | 78,880,423 |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int a,b,C;
double S,L,h,rad,cs;
scanf("%d %d %d",&a,&b,&C);
rad=C*pai/180;
cs=sqrt(a*a+b*b-2*a*b*cos(rad));
h=b*sin(rad);
printf("%.8lf\n%.8lf\n%.8lf\n",h*a/2,a+b+cs,h... | #include <cmath>
#include <iostream>
#include <iomanip>
using namespace std;
static const double pi = 3.141592653589793;
int main()
{
double a, b, c;
cin >> a >> b >> c;
double ret3 = b * sin(c * pi / 180);
double ret1 = a * ret3 / 2;
double ret2 = sqrt(pow(ret3, 2) + pow(a - b * cos(c * pi / 180), 2));
cout << s... | 1 | 48,519,641 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i =0; (int)i<n; i++)
using namespace std;
int main(){
int N,M; cin >> N >> M; char A[N][N],B[M][M];
rep(i,N) rep(j,N) cin >> A[i][j];
rep(i,M) rep(j,M) cin >> B[i][j];
bool check = false;
rep(i,N-M+1) rep(j,N-M+1) {
rep(k,M) rep(l,M) if (B[k][l] != A[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using Edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<Edge>>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const ll MO... | 1 | 45,987,764 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
int ans = 0;
int min = *min_element(a.begin(), a.end());
int max = *max_element(a.begin(), a.end());
cout << abs(min - max) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int a1, a2, a3;
cin >> a1 >> a2 >> a3;
cout << max({a1, a2, a3}) - min({a1, a2, a3}) << endl;
return 0;
} | 1 | 52,461,261 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, c, d;
cin >> a >> b >> c >> d;
cout << ((abs... | #include<iostream>
using namespace std;
int abs(int a){
return (a < 0 ? -a : a);
}
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (abs(a-b)<=d && abs(b-c)<=d || abs(a-c)<=d ? "Yes" : "No") << endl;
return 0;
} | 1 | 57,800,529 |
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
int a,b;
char field[16][16];
class Info{
public:
int x,y;
};
int bfs(void){
queue<Info> q;
Info tmp = {0,0};
int dx[4] = {0,1}, dy[4] = {1,0};
int ans = 0;
q.push(tmp);
while(!q.empty()){
tmp = q.front(); q.pop();
if(tmp.x==a-1 && t... | #include <iostream>
#include <cstring>
using namespace std;
int a, b;
bool con[20][20];
int memo[20][20];
inline bool inside(int y, int x) {
return 0 <= y && y < b && 0 <= x && x < a;
}
int dfs(int y = 0, int x = 0) {
if (!inside(y, x)) return 0;
if (con[y][x]) return 0;
if (y == b - 1 && x == a - 1) return 1;
... | 1 | 94,228,244 |
#include <bits/stdc++.h>
#include <string.h>
#define ll long long
using namespace std;
struct value
{
ll x;
ll y;
};
bool compare(value a, value b)
{
if (a.y < b.y)
return 1;
else
return 0;
}
ll sum(ll n)
{
ll c;
ll sum1=0;
while(n>0)
{
c=n%10;
sum1=sum1+c;
n=n/10;
} return sum1;
}
ll minm(ll arr[],l... | #include <bits/stdc++.h>
using namespace std;
int main(){
int i, j, k, o;
cin >> i >> j >> k >> o;
if(o <= i){
cout << o;
}
else if(o - i <= j){
cout << i;
}
else{
cout << i - (o - i - j);
}
return 0;
} | 1 | 8,239,970 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int gcd(int a, int b)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int gcd(int a, int b) {
if (a % b == 0) return b;
return gcd(b, a % b);
}
struct Sieve {
vector<int> p;
Sieve(int n) : p(n + 1, 1) {
for (int i = 2; i <= n; ++i)... | 1 | 15,692,989 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i+... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 1 | 95,623,514 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int w,h,n;cin >>w>>h>>n;
vector<int>x(w,0);
vector<int>y(h,0);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, N; cin >> W >> H >> N;
bool table[H][W]; int ans = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
table[i][j] = true;
}
}
for (int i = 0; i < N; i++) {
int x, y, a; cin >> x >> y >> a;
for (int j = 0; j ... | 1 | 66,797,945 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int a,b;
cin >> a >> b;
int ans=-1;
for(int i=1;i<=100000;i++){
int x=(i*8)/100;
int y=i/10;
if(a==x && b=... | #include<cstdio>
#include<iostream>
using namespace std;
int main(void) {
int A, B;
scanf("%d%d", &A, &B);
int ans = -1;
for (int i = 1; i <= 1300; i++) {
if (i*8/100 == A && i*10/100 == B) {
ans = i;
break;
}
}
printf("%d", ans);
return 0;
} | 1 | 30,530,050 |
#include<bits/stdc++.h>
using namespace std;
#define size1 10
int main(){
int n;
cin>>n;
vector<int> p(n),q(n);
vector<int> sorted;
for(int i=0;i<n;i++){
cin>>p[i];
}
for(int i=0;i<n;i++)
cin>>q[i];
sorted=p;
int a=0,b=0;
do{
a++;
}while(next_permutation(p.begin(),p.end()));
do{
b++;
}while(next_pe... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
double per(double n){
if(n == 1) return n;
return n*per(n-1);
}
int main(){
int n;
cin >> n;
vector<int>p(n), q(n);
for(int i=0;i<n;i++) cin >> p[i];
for(int i=0;i<n;i++) cin >> q[i];
vector<int>t(n);
for(int i=0;i<n;... | 1 | 16,491,954 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int N,M,R;
cin>>N>>M>>R;
int r[R];
rep(i,0,R){
cin>>r[i];
r[i]--;
}
sort(r,r+R);
int d[N][N];
rep(i,0,N){
rep(j,0,N){
d[i][j]=2... | #include <vector>
#include <iostream>
#include <algorithm>
#include <climits>
using namespace std;
const long long INF = (1LL << 29);
long long graph[201][201];
int main(){
int N, M, R;
cin >> N >> M >> R;
vector<int> visit_towns(R);
for(int i = 0 ; i < R; ++i){
cin >> visit_towns[i];
vi... | 1 | 38,667,216 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
set<ll> getFactors(ll n) {
set<ll> res;
while(n%2==0) {
res.insert(2);
n >>= 1;
}
for(int i = 3; i*i <= n; i+=2) {
while(n%i==0) {
res.insert(i);
n /= i;
}
}
if(n > 2)
res.insert(n);
return res;
}
bool ispairwise(vector<ll>& a) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (ll i = (ll)(start); i < (ll)(n); ++i)
static const ll INFTY = 1L << 62L;
void solver(ll *a, ll n)
{
ll ans = a[0];
rep(i, 1, n) ans = gcd(ans, a[i]);
if (ans != 1)
{
cout << "not coprime\n";
... | 1 | 46,742,920 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef priority_queue<int, vector<int>, greater... | 1 | 33,316,671 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using pq =... | 1 | 88,675,489 |
#include <stdio.h>
int main()
{
while(true)
{
int a,b;
scanf("%d %d", &a, &b);
if(0==a&&0==b)
break;
if(a<b)
printf("%d %d\n", a, b);
else
printf("%d %d\n", b, a);
}
return 0;
} | #include<stdio.h>
#define N 65536
int main(){
int i,j,k,m;
int a[N],b[N];
i=0;
while(1){
scanf("%d %d",&j,&k);
a[i] = j;
b[i] = k;
if(j==0 && k==0){
break;
}
i++;
}
for(m=0;m<i;m++){
if(a[m]<b[m]){
printf("%d %d\n",a[m],b[m]);
}else{
printf("%d %d\n",b[m],a[... | 1 | 28,237,754 |
#define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
using namespace std;
typedef long long ll;
static const ... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;
int main(){
in... | 1 | 49,872,229 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
#define MOD 1000000007
using namespace std;
using ll=int64_t;
using pii=pair<int,int>;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int gcd(int a,int b){
if(a%b==0)
return b;
return gcd(b,a%b);
}
int ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 1 | 46,006,458 |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
vector <int> treeconstruction(vector <int> d) {
const int MAX = 111;
vector<int> res,NG;
i... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
int cnt[101];
int main() {
int N;
cin >> N;
int M = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
cnt[a]++;
M = max(M, a);
}
if (N == 2) {
if ... | 1 | 11,888,507 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, time = 0;
cin>>n;
vector<string> s(n);
vector<int> t(n);
rep(i, n) {
cin >> s.at(i) >> t.at(i);
time += t.at(i);
}
string x;
cin >> x... | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP m... | 1 | 28,341,382 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <iostream>
#include <string>
#define MAX 2000
#define LRMAX 1999
#define ANSMAX 3999
using namespace std;
int light_1d(int (*a)[MAX], int l, int i, int j, int d){
int s = 0;
while(true){
if(d==0){
j++;
if(j>l-1 || a[i][j] == 1) break;
s++;
}
else if(d==1){
j--;
if(... | 1 | 92,365,471 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 1 | 68,545,815 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
for(int a=0; a<N; a++){
for(int b=0; b<N; b++){
int total = 4*a + 7*b;
if(total == N){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <math.h>
#include <sstream>
#include <map>
#include <vector>
#include <queue>
#include <iomanip>
#include <unordered_map>
using namespace std;
typedef long long ll;
ll ans, mx, sum,temp, mn = 1e14, flag,cnt;
int main(){
ll n;
cin>>... | 1 | 78,669,375 |
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int h,w;cin>>h>>w;
ss makeblank;
for(int i=0;i<w;i++)makeblank<<'.';
str blank=makeblank.str();
vector<str> m;
for(int i=0;i<h;i++)
{
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ub upper_bound
#define lb lower_bound
#defi... | 1 | 60,244,014 |
#include<stdio.h>
#define k 10000
int main()
{
int C[k+1];
int i,j,n;
scanf("%d",&n);
int A[n+1];
int B[n+1];
for(i=0; i<=k; i++){
C[i] = 0;
}
for(i=0; i<n; i++){
scanf("%d",&A[i+1]);
C[A[i+1]]++;
}
for(i=1; i<=k; i++){
C[i] = C[i] + C[i-1];
}
for(j=n; j>0; j--){
B[C[A[j]]] =... | #include <cstdio>
#include <algorithm>
#define rep(i,n) for(int i=0; i<(n); ++i)
main()
{
int N, a[2000001];
scanf("%d", &N);
rep(i, N)scanf("%d", a+i);
std::sort(a, a+N);
rep(i, N)printf("%d%c", a[i], i+1 < N ? ' ' : '\n' );
} | 1 | 79,585,409 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, A[200000], B[200000];
cin >> N;
for(int i=0; i<N; i++) cin >> A[i] >> B[i];
int64_t S = accumulate(A, A+N, 0LL);
const int INF = 2e9;
int mn = INF;
for(int i=0; i<N; i++) if(A[i] > B[i]) mn = min(mn, B[i]);
int64_t ans = (mn == INF ? 0 : S - mn... | #include<iostream>
using namespace std;
#define df 0
int main(){
if(df) printf("*debug mode*\n");
int n; cin >> n;
bool flag=false;
long int sum=0,MIN_b=1200000000;
for(int i=0;i<n;i++){
long int a,b; cin >> a >> b;
if(a>b){
flag=true;
sum+=a;
if(b<MIN_b)MIN_b=b;
if(df)cout << ... | 1 | 24,627,477 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string src;
cin>>src;
string dest;
cin>>dest;
int ch=0;
for(int i=0;i<src.length();i++)
{
if(src[i]!=dest[i])
ch++;
}
cout<<ch<<endl;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main()
{
string s,t;
long long c=0;
cin>>s>>t;
int len=s.length();
for (int i=0;i<len;i++)
{
if (s[i]==t[i])continue;
else c++;
}
cout<<c;
} | 1 | 75,312,322 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
ll sum[1010];
int main(){
int N,K; cin>>N>>K;
rep(i,N){
ll A; cin>>A;
sum[i+1]=sum[i]+A;
}
vector<ll> V;
for(int i=1;i<=N;i++) for(int j=i;j<=N;j++){
V.push_back(sum... | #include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | 1 | 9,990,195 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(10);
double a,b,x;cin>>a>>b>>x;
double pi=3.14159265359;
double ans;
if(x/a<=a*b/2) ans=a*b*b/(2*x);
else ans=2*b/a-2*x/(a*a*a);
cout<<atan(ans)*180/pi<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const float pi = 3.1415926535;
unsigned GetDigit(unsigned num){
return to_string(num).length();
}
int main() {
float a,b;
int x;
cin >> a >> b >> x;
cout << fixed << setprecision(8);
if (x >= a*a*b/2) {
float k = (2*a*a*b-2*x)/(a*a*a)... | 1 | 62,965,529 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n,k;
cin >> n >> k;
long double ans = 0;
rep(i,1,n+1) {
int t = i;
long double p = (long double)1/(long double)n;
while(t < k) {
p *= (... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int point = i;
double rate = (double)1/n;
while (point < k) {
point *= 2;
rate *= (double)1/2;
... | 1 | 47,560,393 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N = 1e6 + 5;
const double E = 1e-9;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n), b;
for (int i = 0; i < n; i++)
cin >> a[i];
b = a;
sort(b.begin(), b.end(), greater<int>());
for... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,i,m,k;
cin >> n;
vector<int> a(n);
m=0,k=0;
for(i=0;i<n;i++){
cin >> a.at(i);
if(a.at(i)>m){
m=a.at(i);
k=i;
}
}
int m2=0;
for(i=0;i<n;i++){
if(i!=k){
m2=max(m2,a.at(i));
}
}
for... | 1 | 4,932,445 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
vector<vector<int>>grid(h, vector<int>(w,0));
for (int i = 0; i < b; i++) {
for (int j = a; j < w; j++)grid.at(i).at(j) = 1;
}
for (int i = b; i < h; i++) {
for (int j = 0; j < a; j++)grid... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
int h,w,a,b;
cin >> h >> w >> a >> b;
for(int i = 0;i < h;i++){
for(int j = ... | 1 | 87,523,454 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
constexpr int64_t kMod = 1e9+7;
int main() {
int N;
cin >> N;
vector<int64_t> nums(N);
for (int n = 0; n < N; ++n) {
cin >> nums[n];
}
vector<vector<int64_t>> cnt(2, vect... | #include<iostream>
#include<vector>
#define lli long long int
#define pb push_back
using namespace std;
int main()
{
lli n;
lli p = (lli)(1e9+7);
cin>>n;
vector<lli>arr(n+1);
for(lli i=1;i<=n;i++) cin>>arr[i];
vector<lli>set(62,0);
vector<lli>unset(62,0);
for(lli i=0;i<62;i++)
{
... | 1 | 15,928,898 |
#include<bits/stdc++.h>
using namespace std;
bool dp[4001][16001];
int x,y,tx,ty,ax[4001],ay[4001];
void dfsx(int t,int n){
if(dp[t][n+8000]) return;
if(t<tx){
dfsx(t+1,n+ax[t]);
dfsx(t+1,n-ax[t]);
}
dp[t][n+8000]=1;
}
void dfsy(int t,int n){
if(dp[t][n+8000]) return;
if(t<ty){
dfsy(t+1,n+ay[t]);
dfsy(t+1... | #include <bits/stdc++.h>
using namespace std;
const int N = 8200;
const int MAX_VAL = 8000;
int n, to_x, to_y, dis_x, dis_y, sum_x, sum_y;
int x[N], y[N], tot_x = 0, tot_y = 0;
bool fx[N], fy[N];
string s;
int main()
{
cin>> s; n = s.length();
scanf( "%d%d", &to_x, &to_y );
int now = 0;
while( s[now] == 'F'&& now <... | 1 | 96,073,194 |
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
int main(){
int a,b,c,d;cin>>a>>b>>c>>d;
if(a<=c){
if(c<=b){
if(b<=d) cout<<b-c<<endl;
else cout<<d-c<<endl;
}
... | 1 | 10,429,362 |
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
string s;
cin>>s;
(s[0]!=s[1] && s[1]!=s[2] && s[0]!=s[2])? cout<<"Yes" : cout<<"No";
} | #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>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
if(s[0]!=s[1]&&s[1]!=s[2]&&s[0]!=... | 1 | 53,041,176 |
#include <bits/stdc++.h>
using namespace std;
int N,M;
long a[50],b[50],c[50],d[50];
main()
{
cin>>N>>M;
for(int i=0;i<N;++i){
cin>>a[i]>>b[i];
}
for(int i=0;i<M;++i){
cin>>c[i]>>d[i];
}
for(int i=0;i<N;++i){
int p=0;
for(int j=0;j<M;++j){
if(99*(abs(a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(N), b(N), c(M), d(M);
for(int i=0; i<N; i++) {
cin >> a[i] >> b[i];
}
for(int j=0; j<M; j++) {
cin >> c[j] >> d[j];
}
for(int i=0; i<N; i++) {
int min_d = abs... | 1 | 4,541,957 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> A(3,vector<int>(3));
vector<vector<int>> ans(3,vector<int>(3,0));
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin >> A.at(i).at(j);
}
}
int N;
cin >> N;
vector<int> b(N);
for(int i=0;i<N;i++){
cin >> b.at(i)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxn= 5e5+5;
#define mod 1000000007
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
map<int,pair<int,int>> mp;
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
int... | 1 | 62,064,239 |
#include <stdio.h>
using namespace std;
struct Node{
Node(){
left_child = right_child = parent = -1;
}
int left_child,right_child,parent;
};
class Heap{
public:
Heap(int H){
index = 0;
array = new long long[H];
struct_array = new Node[H];
}
~Heap(){
delete[] array;
}
void push(long long data){
array... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end()))
#define POSL(x,v) (lower_bound(x.begin(),x.... | 1 | 44,168,492 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | #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 | 97,895,541 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <c... | #include <iostream>
#include <vector>
using namespace std;
struct Node {
int parent;
int rank;
};
vector<Node> v;
void initialize(int n);
int find_set(int x);
void unite(int x, int y);
void disp(vector<Node> v);
bool same(int x, int y);
void initialize(int n) {
for (int i=0; i<n; i++) {
Node nd = {i... | 1 | 25,801,938 |
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a... | 1 | 58,640,135 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int l;
cin>>l;
double t=l*l*l;
cout<<setprecision(20)<<t/27;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int L;
scanf("%d",&L);
printf("%.12f\n",(double)L*L*L/27);
return 0;
} | 1 | 55,808,034 |
#include<bits/stdc++.h>
#include<string.h>
#define ll long long
#define pf printf
#define sf scanf
#define ff first
#define ss second
#define clr clear()
#define sz size()
#define pb push_back
#define mk make_pair
#define pi acos(-1)
#define inf 20000000000000000
#define mod 998244353
#define ull unsigned long long int... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define float long double
#define pb push_back
#define fi first
#define se second
#define vii vector<int>
#define pii pair<int,int>
#define vpii vector<pii>
#define pq priority_queue<int>
#define test int tcase; cin>>tcase; for(int tc = 1; tc <= tc... | 1 | 93,810,509 |
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PI... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
static const int Infinity=2000000000;
int main(){
int n;cin>>n;
int P[n+1],DP[n][n];
rep(i,n){
scanf("%d %d",&P[i],&P[i+1]);
}
rep(i,n){
DP[i][i]=0;
}
for(int i=1;i<n;i++){
for(int j=0... | 1 | 44,310,464 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
int st[26], ts[26];
fill(begin(st), end(st), -1);
fill(begin(ts), end(ts), -1);
bool ans = true;
for (int i = 0; i < n; i++) {
int si = s[i] - 'a', ti = t[i] - 'a';
if (st[si] != -1 && st[si... | #include <bits/stdc++.h>
#include <boost/range/adaptor/reversed.hpp>
#include <boost/range/algorithm/sort.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using boost::irange;
using boost::sort;
using boost::adaptors::reversed;
int main() {
string s, t;
cin >> s >> t;
map<char, int> sa, ta;
i... | 1 | 37,291,867 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <functional>
#include <map>
#include <math.h>
#include <list>
using namespace std;
#define ll long long int
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
queue<ll> q;... | 1 | 45,966,362 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long int a,b,c,k;
cin>>a>>b>>c>>k;
long long int x = a + b;
if(k <= x)
{
cout<<min(a,k)<<"\n";
}
else
{
long long int ans = a;
ans -= (k-x);
cout<<ans;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int a, b, c, k;
cin >> a >> b >> c >> k;
int ans = 0;
if (k > 0) {
ans += min(k, a);
k-=a;
}
if (k > 0) {
k-=b;
}... | 1 | 99,056,475 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
int n, t = 0, h = 0; cin >> n;
rep(i, n) {
string s, w; cin >> s >> w;
if (s > w)t += 3;
else if (s < w)h += 3;
else t++, h++;
}
cout << t << ' ' << h << endl;
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=int(a);i<int(b);++i)
#define RFOR(i,a,b) for(int i=int(b)-1;i>=int(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
int N;
int main()
{
int l,m,n,a,b;
string h,t;
cin >> N;
a = b... | 1 | 46,188,830 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.