code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
char base[4] = {'A', 'C', 'T', 'G'};
for (int i=0; i<4; i++) {
if (b == base[i]) {
cout << base[(i+2)%4] << endl;
}
}
} | 1 | 73,693,183 |
#include<bits/stdc++.h>
#define FOR(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define RFOR(i,a,b) for(long long i = (long long)(a); i >= (long long)(b); i--)
#define MIN3(a,b,c) (a)<(b)?((a)<(c)?(a):(c)):((b)<(c)?(b):(c))
#define MAX(a,b) (a)>(b)?(a):(b)
#define MIN2(a,b) (a)<(b)?(a):(b)
using n... | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).su... | 1 | 25,409,937 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(lli i=s;i<n;i++)
#define RREP(i,s,n) for(lli i=s;i>=n;i--)
#define MOD 1000000007
#define NUM 2520
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define ... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <iomanip>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a+b+c+d==1+9+7+4 && a*b*c*d==1*9*7*4){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
return 0;
} | 1 | 57,471,753 |
#include <iostream>
using namespace std;
int main()
{
int cnt[101] = {0};
while(true){
int num;
cin >> num;
if(cin.eof())
break;
cnt[num]++;
}
int max = 0;
for(int i=1; i<=100; i++)
if(cnt[i]>max)
max = cnt[i];
for(int i=1; i<=100; i++)
if(cnt[i]==max)
cout << i << endl;
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main(void){
int n;
int a[101]={0};
while(cin>>n){
a[n]++;
}
int b=0;
for(int i=0;i<100;i++){
b=max(a[i],b);
}
for(int i=0;i<100;i++){
if(a[i]==b)cout<<i<<endl;
... | 1 | 98,995,124 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
vector<P> ans;
int low = 1, hi... | #include<cstdio>
using namespace std;
int m,n;
int main(){
scanf("%d%d",&n,&m);
int l1=1,r1=l1+m,l2=r1+1,r2=l2+m-1;
while(true){
if(l1>=r1) break;
printf("%d %d\n",l1,r1);
if(l2>=r2) break;
printf("%d %d\n",l2,r2);
l1++,l2++;
r1--,r2--;
}
return 0;
} | 1 | 26,096,876 |
#include<iostream>
using namespace std;
int main(){
int p, pt1, pt2;
pt1 = 0;
pt2 = 0;
for(int i=0; i<2; i++){
for(int j=0; j<4; j++){
cin >> p;
if(i == 0) pt1 += p;
else pt2 += p;
}
}
if(pt1 > pt2) cout << pt1 << endl;
else if(pt1 < pt2) cout << pt2 << endl;
else cout << pt1 << endl;
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cctype>
#include <numeric>
using namespac... | 1 | 9,416,094 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alength=... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 1 | 54,316,158 |
#include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define ... | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(... | 1 | 90,345,872 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <deque>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
void yes(){
cout<<"YES";
exit(0)... | #include <iostream>
#include <algorithm>
#include <climits>
#define ll long long
using namespace std;
const int NMAX = 100005;
ll h[NMAX], d[NMAX];
ll poz, n;
int main()
{
int i;
cin >> n >> h[1]; h[0] = INT_MAX;
for(i = 2; i <= n; i++) {
cin >> h[i];
d[i] = INT_MAX;
int ok = 0;
... | 1 | 79,294,252 |
#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)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A,B; cin >> A >> B;
char G[50][100];
rep(h, 50) {
rep(w, 100) {
G[h][w] = h < 25 ?... | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(int i=0;i<N;++i)
typedef long long int LL;
int main()
{
int A, B;
in >> A >> B;
std::vector<std::vector<char>>ans(100, std::vector<char>(100));
rep(i, 100) rep(j, 100) ans[i][j] = (i < 50 ? '#' : '.');
--A; --B;
for (int i = 1... | 1 | 14,003,407 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
template<class T> inline b... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define dbv(v) ... | 1 | 15,328,451 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int C[m], T[m][n + 1];
for(int i = 0; i < m; i++) {
cin >> C[i];
T[i][0] = 0;
}
sort(C, C + m);
for(int i = 0; i < m; i++) {
if(i == 0) {
for(int j = 1; j <... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n , m;
int t[50001]={0};
for(int i=1;i<50001;++i){
t[i]=1e+9;
}
cin >> n >> m;
int* c = new int [m];
for(int i=0;i<m;++i){
cin >> c[i];
}
for(int i=0 ; i<m;++i){
for(int j=c[i]; j<n+1 ;++j){
t[j]=min(t[j] , t[j-c[i]]+1);
}
}
cout << t[n... | 1 | 3,129,334 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
vector<int> a(10);
for(int i=0; i<a.size(); i++){
if(i == 4 || i == 7) continue;
else {
a.at(i) = int(s.at(i));
}
}
long long num = 0;
long long b = 1000000000;
for(int i=... | 1 | 1,093,137 |
#include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespac... | #include<bits/stdc++.h>
using namespace std;
long long int h,w;
int n;
map<pair<int,int>,int> ma;
long long int ans[10];
int main(){
cin >> h >> w >> n;
for(int i=1;i<=n;i++){
int a,b;
cin >> a >> b;
for(int j=-1;j<=1;j++){
for(int k=-1;k<=1;k++){
int nx = a+j;
int ny = b+k;
if(nx < 2 || nx > h-1... | 1 | 1,357,249 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> SE... | #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... | 1 | 35,146,127 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans{0};
for(int i=0;i<3;i++){
if(s[i] == 'R') ans = 1;
}
for(int i=1;i<3;i++){
if(s[i-1] == s[i] && s[i] == 'R') ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int ans = 0;
int ans2 = 0;
string s; cin >> s;
for(int i = 0; i < s.size(); ++i){
if(s[i]=='R'){++ans;}
else{
ans = 0;
}
ans2 = max(ans,ans2);
... | 1 | 60,626,648 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000000LL;
constexpr int inf = 1000000000;
int main() {
ll n, l,... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define orz 1000000007
using namespace std;
int n,l,t,x[100005],w[100005];
ll ans;
int main(){
scanf("%d%d%d",&n,&l,&t);
for(int i=1;i<=n;++i)scanf("%d%d",x+i,w+i);
for(int i=1;i<=n;++i){
if(w[i]==1){
ans+=... | 1 | 64,929,589 |
#include <bits/stdc++.h>
#define fi first
#define se second
const int N = 100100;
using namespace std;
int n;
long long s[N];
long long b[N];
long long a[N];
int main()
{
cin >> n;
for(int i = 0; i <= n; i++){
cin >> b[i];
}
for(int i = n; i >= 0; i--){
s[... | #include "bits/stdc++.h"
using namespace std;
int64_t MAX = 1000000000000000;
int main()
{
int n;
cin >> n;
vector<int64_t> a(n + 1);
vector<int64_t> mae(n + 1);
vector<int64_t> ushiro(n + 1);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
if (n == 0) {
if (a.at(0) == 1) {
cout << 1 << endl;
} e... | 1 | 16,842,465 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t A, B, C, D, minc, mind, dc, dd, mincd, dcd;
cin >> A >> B >> C >> D;
minc = (A % C == 0) ? A : (A / C + 1) * C;
dc = (minc <= B) ? (B - minc) / C + 1 : 0;
mind = (A % D == 0) ? A : (A / D... | 1 | 23,380,747 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
typedef pair<int,int> P;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
struct edge {
int from, to, cost;
};
const int INF = 10000000;
int n, d[10];
void solve() {
vector<edge> es... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
#define ALL(x) x.begin(),x.end()
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typ... | 1 | 7,388,776 |
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main(){
int n;
string str1, str2;
int c1 = 0, c2 = 0;
cin >> n;
for (int i = 0; i < n; i++){
cin >> str1 >> str2;
if (str1 > str2) c1 += 3;
else if (str1 < str2) c2 +=3;
else {c1++; c2++;}
}
cout << c1 << " " << c2 << endl... | #include<iostream>
#include<string>
using namespace std;
int main(){
string taro;
string hanako;
int p_taro=0;
int p_hana=0;
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>taro>>hanako;
if(taro>hanako)
p_taro+=3;
else if(taro<hanako)
p_hana+=3;
else if(taro==hanako){
p_taro+=1;
p_hana+=1;
}
}
... | 1 | 80,497,129 |
#include <bits/stdc++.h>
using namespace std;
#ifdef SG
#include <debug.h>
#else
#define show(...)
#define debug(...)
#define deepen(...)
#define timer(...)
#endif
#define ARG4(_1,_2,_3,_4,...) _4
#define forn3(i,l,r) for (int i = int(l); i < int(r); ++i)
#define forn2(i,n) forn3 (i, 0, n)
#define forn(...) ARG4(_... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> g[100005];
int DFS(int u,int root)
{
int rs=0;
for(int i=0;i<g[u].size();i++)
if(g[u][i]!=root)
rs^=DFS(g[u][i],u)+1;
return rs;
}
int main()
{
cin>>n;
int u,v;
for(int i=1;i<n;i++)
{
cin>>u>>v;
... | 1 | 18,417,236 |
#include<iostream>
using namespace std;
int main ()
{
int r,g,h;
cin>>r>>g;
h=(2*g)-r;
cout<<h;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int x,y,z;
cin>>x>>y;
z=(2*y)-x;
cout<<z<<endl;
return 0;
} | 1 | 6,375,091 |
#include<iostream>
using namespace std;
int main() {
int x;
int count = 1;
while (1) {
cin >> x;
if (x==0) break;
cout << "Case " << count << ": " << x << endl;
count ++;
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <unordered_map>
using namespace std;
int main() {
int num = 1;
int tmp;
while (1) {
cin >> tmp;
if (tmp == 0)
break;
cout << "Case " << num << ": " << tmp << endl;
num++;
}
} | 1 | 46,920,003 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<pair<string, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_pair(a, b);
}
string X;
cin >> X;
bool flag = false;
int ans = 0;
... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
vector<pair<string, int>> M(N);
string S;
for (int i = 0; i < N; i++) cin >> M[i].first >> M[i].second;
cin >> S;
int ans = 0;
for (int i = 0; i < N; i++) {
... | 1 | 18,617,123 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
typedef long long ll;
using namespace std;
int main(){
int x,a;cin>>x>>a;
if(x<a) cout<<0;
else cout<<10;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldIN... | 1 | 69,814,651 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
map<pii,int>m;
vector<int>adjb[200005],adjr[200005];
#define MOD 1000000007
int main()
{
ll n,m,i,ANS=0,ans=0,ans2=0;
cin>>n>>m;
ll ara[n],arb[m];
for(i=0;i<n;i++) cin>>ara[i];
for(i=0;i<... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;
int main() {
long n, m;
long x, y, c;
vector<long> xs... | 1 | 10,589,090 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n;
... | #include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <bits/stdc++.h>
#define PI acos(-1)
#define fs first
#define sc second
#define debug freopen("1.in","r",stdin),fre... | 1 | 54,799,457 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll x, ll y){
if (y == 0) return x;
else return gcd(y, x % y);
}
int main(){
ll A, B;
cin >> A >> B;
cout << A/gcd(A, B)*B << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long a,b;
cin >> a >> b;
long small,big;
if(a<b){
small = a;
big = b;
}else{
small = b;
big = a;
}
long ans = big;
while(ans%small!=0){
ans+=big;
}
cout << ans << endl;
return 0;... | 1 | 863,710 |
#include <iostream>
using namespace std;
#define in(v) cin>>v;
#define out(v) cout<<v<<"\n"
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a % b == 0)
printf("-1\n");
else
printf("%lld\n", (long long)a*(b+1));
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <bitset>
#include <cmath>
#include <queue>
#include <iomanip>
#include <algorithm>
#include <stack>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int x, y; cin >> x >> y;
if(x % y == 0) {
cout << -1 << endl;
... | 1 | 11,234,037 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YE... | 1 | 27,254,538 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, D, X;
cin >> N >> D >> X;
for (int i = 0;i<N;++i) {
int A;
cin >> A;
X += (D+A-1)/A;
}
cout << X << endl;
return 0;
} | 1 | 22,428,810 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LONG... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << "Draw" << endl;
else if (A == 1)
cout << "Alice" << endl;
else if (B == 1)
cout << "Bob" << endl;
else if (A > B)
cout << "Alice" << endl;
else if (A < B)
cout << "Bob" << endl;
} | 1 | 87,675,457 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <functional>
#include <set>
#include <numeric>
#define ll long long int
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const ll M=1000010;
int main() {
ll N, ans=0;
set<ll> st;
cin >> N;
vector <ll> f(... | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(),... | 1 | 45,737,258 |
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
typedef long long Int;
#define REP(i , x) for(int i = 0 ; i < x ; ++i)
int main()
{
int n;
cin >> n;
REP(i, n){
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
string ans ... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
int N, side1, side2, side3, i;
scanf("%d", &N);
for(i = 0; i < N; i++){
scanf("%d %d %d", &side1, &side2, &side3);
if(side1 >= side2 && side1 >= side3){
if(side1 * side1 == side2 * side2 + side3 * side3){
printf("YES\n");
... | 1 | 94,385,783 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define sort(a) sort(all(a))
#define ff first
#define ss second
#define vi vector<int>
#define pii pair<int, int>
#define vll vector<ll>
#define pll pair<ll,ll>
#define mod (int)1... | 1 | 33,539,623 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++) cin >> W[i];
int ans = 100000;
for (int T = 0; T < N - 1; T++) {
int S1 = 0, S2 = 0;
for (int i = 0;... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9+5;
const int mod... | 1 | 47,322,273 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int data[200010]={0};
int N;
int K;
cin >>N>>K;
for (int i=0; i<N; i++)cin>>data[i];
int num[200010]={0};
for (int i=0; i<N;i++) num [data[i]]++;
sort(num,end(num),greater<int>());
int ans=0;
int i=0;
int kind=0;
while(num... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k,a,ans=0,b[200005]={};
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>a;
b[a]++;
}
sort(b,b+200001);
for(int i=0;i<200001-k;i++){
ans+=b[i];
}
cout<<ans<<endl;
return(0);
} | 1 | 39,099,556 |
#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... | #include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k, m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
... | 1 | 82,215,667 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <sstream>
#include <numeric>
#include <queue>
#include <sstream>
#include <set>
using namespace std;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<ll> A(N);
for(int i=0; i<N; i++) cin >> A[i];
vector<ll> B(N);
for(int i=0; i<N; i++) cin >> B[i];
string ans = "Yes";
ll asum = accum... | 1 | 21,435,914 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n;
cin>>n;ll l1[n+1];
for(int i=1;i<=n;i++){
cin>>l1[i];
}
if(n==1){cout<<l1[1];return 0;}
ll x=(ll)((ll)(l1[2]/__gcd(l1[1],l1[2]))*l1[1]);
for(int i=3;i<=n;i++){
x=(ll)((ll)(l1[i]/__gcd(x,l... | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
ll gcd(ll a, ll b){
if(a%b == 0){
return(b);
}else{
return(gc... | 1 | 20,339,672 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int N, D, X;
cin >> N >> D >> X;
int sum = X;
sum += N;
int a;
rep(i, N) {
cin >> a;
sum += (D -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int N, D, X;
cin >> N >> D >> X;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
}
int eaten = 0;
for (int i = 0; i < ... | 1 | 72,566,701 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>
#include... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utili... | 1 | 10,685,687 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int i;
int count = 0;
vector<int> ans;
int a, b, c, d;
while(cin >> i){
count = 0;
if(cin.eof()){
break;
}
for(a = 0; a < 10; a++){
for(b = 0; b < 10; b++){
for(c = 0; c < 10; c++){
for(d =... | #include<iostream>
int main(){
int n,a,b,c,d,f;
while(std::cin>>n){
f=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)f++;
std::cout<<f<<"\n";
}
} | 1 | 2,357,009 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#include <string>
#include <vector>
#include <algorithm>
int main(){
int n,k; cin >> n >> k;
int ans = 0,high;
rep(i,n) {
cin >> high;
if (k <= high) ans++;
}
cout << ans << endl;
} | #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 | 43,077,593 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (n >= m / 2) cout << m / 2;
else cout << n + (m - n * 2) / 4;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N,M;
cin>>N>>M;
cout<<min((N*2+M)/4,M/2)<<endl;
} | 1 | 24,654,780 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
long long n = s.length();
map<char, int> m;
for (int i=0; i<n; i++) {
++m[s[i]];
}
long long ans = n * (n - 1) / 2;
for (auto e: m) {
long long v = e.second;
ans -= v * (v - 1) / 2;
}
cout<<ans+1<<endl;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
typedef long long ll;
template<class T> void out(T a){cout<<a<<endl;}
v... | 1 | 493,884 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
string S;
int main() {
cin >> S;
vector<ll> a(S.size() + 1);
rep(i, S.size()) {
if (S[i] == '<') {
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
int main(void){
string s;
cin>>s;
int n = (int)s.size()+1;
vi a(n, 0);
for(int i=1; i<n; i++){
if(s[i-1]=='<')
a[i] = max(a... | 1 | 47,722,288 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1e9 + 7;
int main()
{
vector<int> n(4);
rep(i, 4) cin >> n[i];
sort(ALL(n));
if (n[0] == 1 && n[1] == 4 && n[2] == 7 && n[3] == 9)
... | 1 | 99,316,131 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m, d;
cin >> n >> m >> d;
double beauty;
if (d == 0) beauty = n;
else beauty = max(0LL, n-d) * 2;
double ans = beauty / (n * n);
for (int i=3; i<=m; i++) {
ans = ans + beauty / (n * n);
}
cout << fixed << setprecision(10);... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ldb n, m, d; cin >> n >> m >> d;
if (d == 0) printf... | 1 | 34,579,735 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,t;
cin >> n >> t;
vector<int> a(n);
for(int i=0;i<n;i++) cin >> a.at(i);
int ans=t;
for(int i=1;i<n;i++){
ans+=min(t,a.at(i)-a.at(i-1));
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N,T;
cin>>N>>T;
vector<int> t(N);
for(int i=0;i<N;i++){
cin>>t[i];
}
int ans=T;
for(int i=0;i<N-1;i++){
if(t[i+1]-t[i]>=T) ans+=T;
else ans+=(t[i+1]-t[i]);
}
cout<<ans<<endl;
return 0;
} | 1 | 57,553,345 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int ans = 1001001001;
for(int i = 0; i+2 < s.size(); i++) {
string t = s.substr(i, 3);
ans = min(ans, abs(753-stoi(t)));
}
cout << a... | #pragma region header
#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>
#inc... | 1 | 86,636,997 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) {cout << x[i] << " "; cout << endl;}
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
#define REP(i,a,b) for(in i=(in)(a);i<(in)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
co... | 1 | 3,103,355 |
#include <iostream>
int main() {
int m, f, r;
while(true){
std::cin >> m >> f >> r;
if (m==-1 && f==-1 && r==-1) break;
if (m==-1 || f==-1) std::cout << 'F' << std::endl;
else if (m+f >= 80) std::cout << 'A' << std::endl;
el... | #include <iostream>
using namespace std;
int main(){
int m,f,r;
cin >> m >> f >> r;
while (m+f!=-2){
if (m==-1 || f==-1){
cout << "F" << endl;
}else if (m+f>=80){
cout << "A" << endl;
}else if (m+f>=65){
cout << "B" << endl;
}else if (m+f>=50 || (m+f>=30 && r>=50)){
cout << "C" <<... | 1 | 37,901,592 |
#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(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int total = N % 10;
int base = 10;
int x = 1;
while (N / base != 0) {
x += 1;
base *= 10;
}
base = 10;
for (int i = 1; i < x; i++) {
total = total + (N % (base * 10) - N % base) / base;
base *= 10;
}
if (... | 1 | 11,827,814 |
#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;
const int mod = 1000000007;
const int inf = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
for (ll i = k; i <= n + 1; i++) {
ans += ((i * (2 * n - i + 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
#define ff first
#define ss second
#define pb ... | 1 | 41,784,333 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int (i) = 0; (i) < (N); ++(i))
#define READALL(c) for (auto &e : c) { cin >> e; }
#define PRINTALL(c) for (const auto &e : c) { cout << e << "\t"; } cout << "\n";
template <typename T>
using V = vector<T>;
typedef long double ld;
int N;
string S;
int ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pair;
const int INF = 0x3fffffff;
int N;
char S[200001];
int type[200001];
int dp[200001];
int nxt[200001];
queue<int> qs[200001];
vector<int> es[200001];
map<int, vector<int>> belong;
int main() {
scanf("%s", S);
N = strlen(S);
type[0] = 0;
b... | 1 | 6,890,827 |
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ii pair<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fore(i,a,b) for(int i = a;i < b; i... | #include<stdio.h>
#include<string.h>
int main(void)
{
char A[11],B[11],C[11];
scanf("%s%s%s",A,B,C);
int ae = strlen(A);
int be = strlen(B);
if(A[ae-1]==B[0]&&B[be-1]==C[0])
printf("YES\n");
else
printf("NO\n");
return 0;
} | 1 | 72,645,969 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 1 | 3,685,812 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int arr[1000][3];
void solve(int n,int m){
int ans=INT_MIN;
for(int i=0;i<8;i++){
bitset<3> bits(i);
vector<int> temp;
for(int j=0;j<n;j++){
int val=0;
for(int k=0;k<3;k++){
if(bits[k]){
val+=arr[j][k];
}
else
va... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int n,m;
cin >> n >> m;
ll x, y, z;
vector<ll> vec... | 1 | 80,946,043 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
#define ll long long
ll n,a,b;
int main(){
scanf("%lld%lld%lld",&n,&a,&b);
if (n>1&&b>=a||n==1&&a==b) printf("%lld\n",(n-2)*(b-a)+1);
else puts("0");
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
ll N,A,B; cin >> N >> A >> B;
ll ans;
if(N==1&&(A!=B)) ans=0;
else if(A>B) ans=0;
else ans=(N-1)*B+A-(N-1)*A-B+1;
cout << ans << endl;
} | 1 | 29,364,711 |
#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 <bits/stdc++.h>
using namespace std;
int main(){
string S;cin>>S;
if(count(S.begin(),S.end(),'x')<8)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | 1 | 52,726,821 |
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<int,ii>
#define iiii pair<ii,ii>
#define sz(x) ((int)... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <vector>
#include <cstring>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <list>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <bitset... | 1 | 61,929,786 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begi... | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
const int kN = 500 + 5;
int n, m, d;
int a[kN][kN];
int main()
{
scanf("%d%d%d", &n, &m, &d);
int mod = d + d;
for (int i = 0; i < n; ++ i) {
for (int j = 0; j < m; ++ j) {
int x = (i + j) % mod;
in... | 1 | 26,517,387 |
#include <iostream>
#include <stack>
int main(void){
std::stack<int> st;
int num;
while(std::cin >> num){
if(num != 0){
st.push(num);
}else{
std::cout << st.top() << std::endl;
st.pop();
}
}
return 0;
} | #include <iostream>
#include <stack>
using namespace std;
int main(void) {
int n;
stack<int> s;
cin >> n;
s.push(n);
while(cin >> n) {
if(n == 0) { n = s.top(); s.pop(); cout << n << endl; }
else s.push(n);
}
return 0;
} | 1 | 21,732,494 |
#include <iostream>
#include <algorithm>
using namespace std;
class Vec2
{
public:
double x, y;
Vec2(double x = 0, double y = 0) : x(x), y(y){}
Vec2(const Vec2& v) : x(v.x), y(v.y){}
Vec2 operator+(const Vec2& other) const
{
return Vec2(x + other.x, y + other.y);
}
Vec2 operator-(const Vec2& other) const
{
... | #include <stdio.h>
#include <math.h>
double eps = 1e-10 ;
int main()
{
double x1, x2, x3, y1, y2, y3, xp, yp;
double s, s1, s2, s3;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp) != EOF){
s = ((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)) / 2;
s1 = ((xp - x1) * (y2 - y1)... | 1 | 52,761,216 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
void newline() {cout << endl;}
template <typename T> void display(T input){cout << input;}
template <typename T> void put(T input){display(input); newline();}
void iput(int input) {put(... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <cmath>
#include <map>
#include <set>
#define rep(i, m, n) for(int i = m;i < n;i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define ll long long
#define ull unsigned long long
#... | 1 | 32,657,599 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, d; cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
int ans = 0;
rep(i,n) rep(j,d) {
ci... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, d; cin >> n >> d;
int a[n][d];
for(int i = 0; i < n; i++)
for(int j = 0; j < d; j++)
cin >> a[i][j];
int cnt = 0;
for(int i = 0; i < n; i++) {
fo... | 1 | 60,028,121 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int N, K;
scanf("%d %d", &N, &K);
int l[50];
for (int i = 0; i < N; i++) {
scanf("%d", &l[i]);
}
sort(l, l + N, greater<int>());
int ans = 0;
for (int i = 0; i < K; i++) {
ans += l[i];
}
printf("... | #include <iostream>
using namespace std;
#include <algorithm>
int main(void){
int n,k;
cin >> n >> k;
int sum = 0;
int a[60];
for(int i=0; i<n; i++) cin >> a[i];
sort(a, a + n, greater<int>());
for(int i=0; i<k; i++) sum+= a[i];
cout << sum << endl;
} | 1 | 87,295,976 |
#include <bits/stdc++.h>
#define for0(i,n) for (int i=0; i<n; i++)
#define iter(c) for(auto it=c.begin(); it!=c.end(); it++)
#define iter2(c) for(auto it2=c.begin(); it2!=c.end(); it2++)
#define pb push_back
#define ms(a,z) memset(a,z,sizeof(a));
#define mp make_pair
#define X first
#define Y second
#define max(a,b) ((... | #include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>... | 1 | 74,088,359 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0;i < (int)n;i++)
#define repb(i, n) for(int i = (int)n;i >= 0;i--)
#define reps(i, m, n) for(int i = (int)m;i < (int)n;i++)
#define repsb(i, m, n) for(int i = (int)m;i >= (int)n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#defin... | #include <stdio.h>
int main(void){
int x,y,a;
scanf("%d %d",&x,&y);
while (x!=0 || y!=0) {
if (x > y) {
a = x;x = y;y = a;
}
printf("%d %d\n",x,y);
scanf("%d %d",&x,&y);
}
return 0;
} | 1 | 26,460,494 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int main(){
string s;
cin >> s;
int ans=0,memo=0;
int now = 0;
int n = s.size();
rep(i,n){
if(s[i]-'0' != now) ans++;
n... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = v... | 1 | 95,778,063 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(c>=a && c<=a+b){
printf("YES");
}
else{
printf("NO");
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x;
while(cin >> a >> b >> x){
if(a>x){
puts("NO");
}
else if(a+b-1>=x)puts("YES");
else puts("NO");
}
} | 1 | 72,914,880 |
#include <iostream>
#include <map>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int N, K;
cin >> N >> K;
map<ll, ll> m;
for(int i=1; i<=N; i++){
int d = i % K;
if(m.count(d) == 0) m[d] = 1;
else m[d]++;
}
ll... | #include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i,n) ;for( int i =0; i < n ; i ++)
#define all(a) a.begin(),a.end()
#define f(i,a,b) for(int i=a;i<b;i++)
b... | 1 | 44,310,778 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
ll dp[100100][2];
int main()
{
string s;
cin >> s;
int n = s.size();
rep(i,100100)rep(j,2) dp[i][j] = 0;
dp[0][0] = 1;
for (int i=1; i<=n; i++) {
if... | 1 | 9,524,587 |
#include <iostream>
using namespace std;
int main(){
int m,f,r,i;
while(1){
cin>>m>>f>>r;
if (m==-1&&f==-1&&r==-1)break;
else if (m==-1||f==-1)cout<<'F'<<endl;
else if (m+f>=80)cout<<'A'<<endl;
else if (m+f>=65)cout<<'B'<<endl;
else if (m+f>=50||r>=50)cout<<'C'<<endl;
else if (m+f>=30)co... | #include <iostream>
#define LIST_MAX 1000
using namespace std;
struct test
{
int tyukan;
int kimatsu;
int Tsuishi;
char seiseki;
};
int main()
{
test in[1000];
int m, f, r;
int count = 0;
while (1)
{
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
{
break;
}
in[count].tyukan = m;
in[count... | 1 | 27,359,488 |
#include<bits/stdc++.h>
#include<cstdlib>
#include<cmath>
using namespace std;
int main(){
int r; int d; int z; cin>>r>>d>>z;
for(int i=0; i<10; i++){
cout<<r*z-d<<endl;
z=r*z-d;
}
} | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int r,d,x,y;
cin>>r>>d>>x;
for(int i=0;i<10;i++)
{
y=x*r-d;
x=y;
cout<<y<<endl;
}
return 0;
} | 1 | 88,917,831 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
int K = 0;
cin >> K;
vector<int> A(N,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
}
int ans = 0;
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
for (size_t i = 0; i < K; i++)
{
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int n,k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end())... | 1 | 49,803,797 |
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ld> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<ll>> vvll;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll;... | 1 | 1,748,029 |
#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... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
int main(){
int a, b, angle;
double s, l, h;
scanf("%d %d %d", &a, &b, &angle);
h=b*sin(angle*M_PI/180.0);
s=a*h/2;
l=a+b+sqrt((a*a+b*b-2*a*b*cos(angle*M_PI/180.0)));
printf("%f\n", s);
printf("%f\n", l);
printf("%f\n", h... | 1 | 41,666,773 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
int main()
{
int n,m;
while(cin >> n && n)
{
map<char, char> f;
char key,value;
REP(n)
{
cin >> key >> value;
f.insert( map<char, char>::value_type(key,valu... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int convert_num,convert_strings;
char hairetsu[100000][2];
while(cin >> convert_num && convert_num != 0){
for(int i=0;i<convert_num;i++){
cin >> hairetsu[i][0] >> hairetsu[i][1];
}
cin >> convert_strings;
for(int j=0;j... | 1 | 14,613,785 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
using namespace std;
void dfs( int W, int H, int w_index, int h_index, vector< vector<char> > &V, int &ans );
int main(int argc, char const *argv[]) {
vector< vector<char> > vec;
int w, h, w_index, h_index, ans;
ve... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int w, h, ans;
int d[4][2] = { { 1, 0 }, { -1, 0 }, {0, 1}, {0, -1} };
char map[20][20];
void search_dfs(int x, int y){
if( x < 0 || x >= w || y < 0 || y >= h ) return;
if( map[y][x] != '.' ) return;
ans ++;
map[y][x] = '*';
for(int i = ... | 1 | 44,937,099 |
#include <iostream>
using namespace std;
int res(int n){
int count = 0;
for(int i=0; i<10; i++)
for(int j=0; j<10; j++)
for(int k=0; k<10; k++)
for(int l=0; l<10; l++)
if(i + j + k + l == n) count++;
return count;
}
int main()
{
int n;
while(cin >> n)
cout << res(n) << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n, t, cnt;
while (cin >> n)
{
cnt = 0;
for (int i = 0; i < 10; i++)
{
for (int j = 0; j < 10; j++)
{
for (int k = 0; k < 10; k++)
{
t = n - (i + j + k);
if (0 <= t && t < 10) { cnt++; }
}
}
}
cout << cnt << endl;
}
r... | 1 | 59,773,282 |
#include <bits/stdc++.h>
using namespace std;
const int N=1e6+3;
const double eps=0.000000001;
#define pb push_back
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const int dx[]={1,-1,0,0},
dy[]={0,0,1,-1};
const int inf=1e9;
int n,m,a[N],b[N],k,q,u,v,x,y,tc,c,l,r,ans;
char s[N];
void IO(){
ios::sync_w... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using Graph = vector<vector<bool>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
... | 1 | 5,412,381 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <utility>
using namespace std;
int a[100000];
int main() {
int n, k;
while (cin >> n >> k && n != 0) {
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int sum = 0, ans = 1 << 31;
for (int l = 0, r = 0; ... | #include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main(void){
int a[100001];
int n,k,sum,t;
for(;;){
scanf("%d%d",&n,&k);
if(n==0&&k==0)return 0;
sum=t=0;
for(int i=0;i<n;i++){
scanf("%d",a+i);
t+=a[i];
if(i>=k){
t-=a[i-k];
sum=max(sum,t);
}
}
printf("%... | 1 | 45,879,772 |
#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>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | 1 | 12,536,261 |
#include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
double T, X;
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | 1 | 3,045,549 |
#include<iostream>
using std::cin;
using std::cout;
using std::endl ;
int main()
{
int b[10];
int i=0,j;
for(;i<10;i++)
cin>>b[i];
int t;
for(i=0;i<3;i++)
{
for(j=0;j+i<9;j++)
while(b[j]>b[j+1])
{ t=b[j];b[j]=b[j+1];b[j+1]=t;}
cout<<b[j]<<endl;
}
return 0;
} | #include<iostream>
using namespace std;
int number[10];
int count = 0;
int flag = 0;
int temp = 0;
int main(){
for(count=0;count<10;count++){
cin >> number[count];
}
count = 0;
while(flag<10){
for(count=0;count<9;count++){
i... | 1 | 22,175,293 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
if(k > (n - 1) * (n - 2) / 2) {
cout << -1 << '\n';
return 0;
}
vector<pair<int,int>> ans;
for (int i = 2; i <= n; i++) {
ans.emplace_back(1, i);
}
int tot = (n - 1) * (n - 2) / 2;
for ... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v... | 1 | 19,670,830 |
#include<stdio.h>
#include<string.h>
int main(void){
char s[100000];
int l;
int i,j;
int n[26] = {};
int th;
int num;
scanf("%s",s);
l = strlen(s);
for(i=2;i<=2;i++){
th = i / 2 + 1;
for(j=0;j<26;j++){
n[j] = 0;
}
for(j=0;j<i;j++){
num = s[j] - 'a';
n[num]++;
if(n[num] >= th){
printf("%... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ii pair<int ,int >
#define S second
#define F first
#define PI 3.1415926535897932384626
#define SPEED std::ios_base::sync_with_stdio(false);
int main(){
SPEED
string s;
cin>>s;
int n = s.size();
for(int ... | 1 | 61,843,360 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string s;
ll k;
cin >> s;
cin >> k;
if (s.size() >= k) {
for (ll i = 0; i < k; i++) {
if (s.at(i) - '0' != 1) {
cout << s.at(i) << endl;
return 0;
}
... | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout << x << endl; return... | 1 | 83,801,711 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #include <iostream>
int main()
{
int A, B, C;
std::cin >> A >> B >> C;
if(A + B >= C){
std::cout << "Yes";
}else{
std::cout << "No";
}
return 0;
} | 1 | 4,541,956 |
#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 Graph = vector<vector<int>>;
int main(void) {
ll n, k;
cin >> n >> k;
vector<P> a(n);
rep(i, n) {
cin >> a[i].first >> a[i].second;
}
sor... | #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() {
ll n, k;
cin >> n >> k;
map<ll, ll> mp;
rep(i, n) {
ll a, b;
cin >> a >> b;
mp[a] += b;
}
ll ans, cnt = 0;
for (auto x : mp) {
cnt += x.s... | 1 | 15,151,763 |
#include <iostream>
using namespace std;
int P[10010];
int n,q;
int comp[100000 + 10];
int x[100000 + 10];
int y[100000 + 10];
void init(int N)
{
for(int i = 1; i <= N; ++i)
{
P[i] = i;
}
}
int root(int a)
{
if(P[a] == a)
{
return a;
}
return (P[a] = root(P[a]));
}
bool is_sa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define PB push_back
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
const ll INF = (1ll << 60);
typedef pair<ll,ll> pii;
using namespace std;
struct UnionFind {
ll size,*par,*... | 1 | 37,855,982 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
int h,m,s;
cin >> a >> b >> c;
if(a < b){
if(b < c){
cout << a << " " << b << " " << c << endl;
}else{
if(a < c){
cout << a << " " << c << " " << b << endl;
}else{
cout << c << " " << a << " " << b << endl... | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int max, mid, min;
if (a > b) {
max = a;
mid = b;
if (c > a) {
max = c;
mid = a;
min = b;
} else if (c > b) {
mid = c;
min = b;
} else {
min = c;
}
}
else if (b > a) {
max = b;
mid = a;
if (c... | 1 | 73,082,918 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i,mn=1000,p=0,dif=0;
string a;
cin>>a;
for(i=0; i+2<a.size(); i++)
{
p=0;
dif=0;
p=p*10+(a[i]-'0');
p=p*10+(a[i+1]-'0');
p=p*10+(a[i+2]-'0');
dif=abs(p-753);
mn=min(mn,dif);
}
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end... | 1 | 11,787,055 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
string s, t;
cin >> s >> t;
int i;
for(i = 0; i < n; i++){
bool flag = true;
for(int j = i; j < n; j++){
if(s[j] != t[j-i]) flag = false;
}
if(flag) break;... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int solve(string s, string t, int n){
for (int i = 0; i < n; i++){
if (s.substr(i) == t.substr(0,n-i)) return n + i;
}
return 2*n;
}
int main(){
int n;
cin >> n;
string s,t;
cin >> s >> t;
cout << solve(s,t,n) << e... | 1 | 39,386,923 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <cassert>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <cti... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 1 | 27,776,709 |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int a,b,c,d;
while(~scanf("%d%d",&a,&b))
{
c=b/2;
printf("%d\n",a+c);
}
return 0;
} | #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 x,y;cin>>x>>y;
cout<<x+y/2;
} | 1 | 26,627,516 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout << #x << " = " << (x) << endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using M = map<int,int>;
using PQ = priority_queue<int>;
using ... | #include<iostream>
using namespace std;
#include<map>
#include<vector>
#include<cmath>
#define int long long int
int power(int a,int b)
{
int x=pow(a,b);
return x;
}
int solve(int val)
{
int j;
if(val>0)
{
int sum=0;
for(j=0;;j+=2)
{
sum+=power(2,j);
if(sum>=val)
{
return j;
}
}
}
else
{... | 1 | 88,970,020 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.