code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
int main() {
string s;
cin >> s;
if (s[0] != 'A') {
cout << "WA" << endl;
return 0;
}
int num = 0;
for (int i = 2; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const string EMP = " ";
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
int m... | 1 | 93,382,131 |
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long N, K;
cin >> N >> K;
cout << ((unsigned long long)(K * pow((K - 1), (N - 1)))) << endl;
getchar();
} | #include <iostream>
#include <algorithm>
using namespace std;
void solve() {
int n, k, ans;
cin >> n >> k;
ans = k;
for (int i = 0; i < n-1; ++i ) {
ans *= k-1;
}
cout << ans;
}
int main() {
solve();
return 0;
} | 1 | 95,108,524 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
const int N = 2e5+5, M = 1e6+6, OO = 0x3f3f3f3f;
int tc;
int main()
{
FIO
ll n; cin>>n;
ll ans = 0;
for(ll i = 1 ; i<= n ; i++)
ans += (i * (n-i+1));
for(int i = 0 ; i< n ... | 1 | 75,255,758 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int mod = 1e9 + 7;
int main(){
int n, m;
cin >> n >> m;
vector<int> s(n), t(m);
rep(i,n) cin >> s[i];
rep(i,m... | #include <bits/stdc++.h>
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define ll long long
using namespace std;
void file(){
#ifndef ONLINE_JUDGE
freopen("tst.txt", "r", stdin);
#endif
}
int tc;
const int N=3e5+5,M=3e5+5,MOD=1e9+7,OO=1e9;
int main()
{
ios::sync_wit... | 1 | 79,045,836 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int N, K;
vector<ll> H;
ll INF = 1145141919810893;
vector<ll> pressAr;
void press() {
for (int i = 0; i < H.size(); i++) {
pressAr.push_back(H[i]);
}
sort(pressAr.begin(), pressAr.end());
pressAr.erase(unique(pressA... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
int N, K;
cin >> N >> K;
vector<LL> H(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> H[i + 1];
}
H.push_back(0);
LL INF = 1LL << 60;
vector<vector<LL>> dp(N + 2, vector<LL>(N + 2, INF));
dp[0][0] = 0;
for (int i = ... | 1 | 85,073,081 |
#include <iostream>
using namespace std;
int N, freq[100100], bil, total, maks=0;
int main() {
cin >> N;
for (int i = 1; i<= N; i++ ){
cin >> bil;
freq[bil]++;
}
for (int i= 1;i<=100000; i++){
total = freq[i] + freq[i+1]+ freq[i-1];
if (maks < total){
maks=tot... | #include<bits/stdc++.h>
using namespace std;
map<int,int>mp;
int count(int x) {
if (mp.count(x) == 0) return 0;
return mp[x];
}
int main() {
int n;cin>>n;
for(int i=0;i<n;i++){
int a;cin>>a;mp[a]++;
}
int ans=0;
for(auto it=mp.begin();it!=mp.end();it++){
int x;
x=... | 1 | 15,844,899 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
template<typename T> bool chm... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef... | 1 | 95,530,192 |
#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<iostream>
using namespace std;
int main()
{
string s, p = "";
int k;
cin >> k >> s;
if(s.size() <= k)
cout << s;
else
{
for(int i = 0; i < k; i++)
{
p = p + s[i];
}
cout << p << "...";
}
return 0;
} | 1 | 51,195,943 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
printf("%lf\n",a*b*sin(c/180.0*M_PI)/2.0);
printf("%lf\n",a+b+sqrt(a*a+b*b-2.0*a*b*cos(c*M_PI/180.0)));
printf("%lf\n",b*sin(c*M_PI/180.0));
return 0;
} | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main(void) {
double a, b, c;
double C;
double S, L, h;
double pi = acos(-1);
cin >> a >> b >> C;
C = pi * C / 180;
S= a * b * sin(C) / 2;
c = sqrt(a*a + b*b - 2*a*b*cos(C));
L = a + b + c;
h = S * 2 /... | 1 | 1,550,794 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
vector<vector<int>> E;
vector<int> P, A;
void DFS(int cur, int p, int t) {
for (int i = 0; i < E[cur].size(); i++) {
int n = E[cur][i];
if (n == p) cont... | #include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long long i = (long long)(a); i <= (long long)(n); i++)
#define irrep(i,n) for(int i = (in... | 1 | 87,412,030 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,p;
while(cin>>n>>m>>p,n||m||p){
vector<int> x(n+1);
int total=0;
for(int i=1;i<=n;++i){
cin>>x[i];
total+=x[i];
}
total=total*(100-p);
if(x[m]==0)
cout<<0<<endl;
else
cout<<total/x[m]<<endl;
}
} | #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#define mp make_pair
#... | 1 | 16,823,074 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
const int MOD = 1e9 + 7;
signed main(){
int n; cin >> n;
string s; cin >> s;
int left = 0,ans = 1;
for(int i = 0; i < n*2; i++){
if(i%2 == 0 && s[i] == 'W' || i%2 == 1 && s[i] == 'B'){
... | #include<iostream>
#include<algorithm>
using lint=int64_t;
using namespace std;
constexpr lint mod=1e9+7;
int main()
{
int N;
string S;
cin >> N >> S;
if(S[0]=='W')
{
cout << 0 << endl;
return 0;
}
lint ans=1;
lint sec=0;
for(int i=0;i<S.size();i++)
{
if((S[i]=='W' && sec%2==0) || (S[i]=='B' && sec%2==1... | 1 | 73,517,836 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
long long GCD(long long x, long long y) {
if (x % y == 0) return y;
else return GCD(y, x % y);
}
long long LCM(long long x, long... | #include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e5+10;
typedef long long ll;
ll a[N],n,m,ans;
int main(){
scanf("%lld%lld",&n,&m);
for(int i=0;i<n;i++) scanf("%lld",&a[i]);
ans=a[0];
for(int i=1;i<n;i++){
ans=ans*a[i]/__gcd(ans,a[i]);
}
for(int i=0;i<n;i++){
if((ans/a[i])%2==0){
... | 1 | 33,216,025 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s; cin >> s;
bool p = (s[0] == '7');
bool q = (s[1] == '7');
bool r = (s[2] == '7');
if (p || q || r)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#include <algorithm>
#include <bits/stdc++.h>
#define MOD 1000000007
#define ll long long
#define mm(arr) memset(arr, 1, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
using namespace std;
int main(... | 1 | 18,444,725 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 1 | 22,633,923 |
#include <bits/stdc++.h>
using namespace std;
int n;
long long res = 0;
int main() {
scanf("%d", &n);
res = 1ll * n * (n + 1) * (n + 2) / 6ll;
for (int i = 1; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
if (x > y) swap(x, y);
res -= 1ll * x * (n - y + 1);
}
printf(... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define debug(var) do{std::cerr << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cerr << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cerr << e << " "; } std::cerr << std::endl;}
te... | 1 | 97,173,035 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_RE... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int switches[n]={0};
int current_state = 0;
for(int i=0; i<m; i++){
int connected;
cin>>connected;
while(connected--){
int swt;
cin>>swt;
swt--;
switches[swt]|=(1<<i);
}
}
for(int i=0; i<m; i++){
bool turned;
cin... | 1 | 19,313,605 |
#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] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
ll N, x;
cin >> N;
set<ll>s;
for (int i = 0; i < N; i++) {
cin >> x;
s.insert(x);
}
if (s.size() % 2 == 0) {
cout << s.size() - 1 << endl;
} else {
cout... | 1 | 80,688,437 |
#include <array>
#include <vector>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iterator>
#include <tuple>
#include <utility>
#include <limits>
#include <iostream>
#include <cstd... | #include <stdio.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
int main(void) {
int n, i, j;
scanf("%d", &n);
char r[n][n];
rep(i, n) rep(j, n) r[i][j] = 0;
rep(i, n) {
int u, k;
scanf("%d%d", &u, &k);
u--;
rep(j, k) {
int v;
scanf("%d", &v);
v--;
r[u][v] = 1;
}
... | 1 | 7,527,462 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main(){
int dp[17][17];
bool flag[17][17];
int W, H;
while(cin >> W >> H){
if(W == 0 && H == 0) break;
memset(flag, 1, sizeof(flag));
memset(dp, 0, sizeof(dp));
int n; cin >> n;
int x, y;
... | #include <iostream>
#include <string>
using namespace std;
int main(){
int a;
int b;
int n;
int d;
int e;
int f;
int g;
while(cin >>a){
cin >> b;
if(a==0){break;}
cin >> n;
int c[a][b];
d=0;
while(d<a){
g=0;
while(g<b){
c[d][g]=-1;
g=g+1;}
d=d+1;}
d=0;
while(d<n){
cin >>e;
cin >>f;
c[e-1][f-1]=0;
d=d+1;}
c[0][0]=1;
d=1... | 1 | 35,607,801 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int ignore;
cin >> ignore;
int fi;
int se;
int th;
vector<int> v;
while(cin >> fi >> se >> th)
{
v.push_back(fi);
v.push_back(se);
v.push_back(th);
sort(v.begin(),... | #include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
int N,i;
int count=0;
int a[3];
scanf("%d ",&N);
while(count!=N){
for(i=0;i<3;i++){
scanf("%d ",&a[i]);
}
sort(a,a+3);
if(a[2]*a[2]==a[0]*a[0]+a[1]*a[1]){
printf("YES\n");
count++;
}
else{
printf("NO\n");
count++;
}
}
retur... | 1 | 25,056,853 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
ll INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
ll N,Z,W;
cin >> N >> Z >> W;
vector<ll> V(N);
rep(i,0,N)cin >> V[i];
if(N == 1){
cout << abs(V[0] - W) << endl;
ret... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | 1 | 67,100,295 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int A,B;
scanf("%d %d",&A,&B);
if((A%3 ==0) || (B%3 ==0) || ((A+B)%3 == 0)){
printf("... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int ... | 1 | 32,284,974 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int N;
cin >> N;
int t[100001], x[100001], y[100001];
for(int i = 1; i <= N; i++) cin >> t[i] >> x[i] >> y[i];
t[0] = 0;
x[0] = 0;
y[0] = 0;
bool plan ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const ll INFS=1e18;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main() {
int n;
c... | 1 | 48,300,699 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i,n) for(int i=0;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
using lint = long int;
using llint = long long int;
using namespace std;
int main() {
fastIO;
int n;
cin >> n;
vector... | 1 | 10,497,285 |
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
c... | #include <iostream>
using namespace std;
int main() {
char p;
cin>>p;
char z=p+1;
cout<<z<<endl;
return 0;
} | 1 | 61,042,158 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int ans{753};
for (size_t i = 0; i != S.size() - 2; ++i) {
ans = min(ans, abs(753 - stoi(S.substr(i, 3))));
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | 1 | 6,928,501 |
#include <bits/stdc++.h>
using namespace std;
#define pb insert
#define eb emplace_back
#define ff first
#define ss second
typedef long long int ll;
typedef long double ld;
#define all(a) a.begin(), a.end()
#define show(x) cerr << #x << " is " << x << "\n"
#define show2(x, y) cerr << #x << " " << #y << " " << x << " " ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | 1 | 28,671,109 |
#include <iostream>
#include<string>
#include<cmath>
#include<ciso646>
#include<cstring>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
int main()
{
int n, m;
cin >> n >> m;
vecto... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 1 | 6,801,120 |
#include <bits/stdc++.h>
using namespace std;
long long n, sol, p;
int main() {
cin >> n;
if(n % 2) {
cout << 0;
} else {
p = 10;
while(p <= n) {
sol += n / p;
p *= 5;
}
cout << sol;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll dep(ll a, ll b){
if(b==0){
return a;
}
return dep(b,a%b);
}
int main() {
ll n;
cin>>n;
if(n%2!=0){
cout << 0;
return 0;
}
ll now=10;
ll ans=0;
while(now<=n){
ans+=n/now;
now*=5;
}
cout... | 1 | 19,955,494 |
#include <bits/stdc++.h>
using namespace std;
int n;
int t[100010];
int x[100010];
int y[100010];
int main(){
cin >> n;
for(int i = 1; i <= n; ++i){
cin >> t[i] >> x[i] >> y[i];
}
t[0] = 0;
x[0] = 0;
y[0] = 0;
string res = "Yes";
for(int i = 1; i <= n; ++i){
if((t[i] - t[i-1]) < (abs(x[i] - x[i-... | #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 =(1e9)+7;
using P = pair<ll,ll>;
int main(){
ll n;cin >>n;
bool flg=true;
ll pretime;
ll pre;
for (int i = 0; i < n; ++i) {
ll t,x,y... | 1 | 88,086,279 |
#include <iostream>
using namespace std;
int main() {
int A=0,B=0;
for(int i=0;i<4;i++){
int temp;
cin >> temp;
A+=temp;
}
for(int i=0;i<4;i++){
int temp;
cin >> temp;
B+=temp;
}
if(A<B)
cout << B << endl;
else
cout << A << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,s=0,t=0;
for(int i=1; i<=4; i++){
cin>>a;
s+=a;
}
for(int i=1; i<=4; i++){
cin>>b;
t+=b;
}
if(s>=t)
cout<<s<<endl;
else
cout<<t<<endl;
return 0;
} | 1 | 77,183,150 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using VE = vector<T>;
template<class T> using P = pair<T, T>;... | 1 | 17,892,321 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | #include<bits/stdc++.h>
#define int long long
using namespace std;
main(){
int n;
cin>>n;
int A[n];
for(int i=0 ; i<n ;i++)
cin>>A[i];
sort(A , A+n);
vector<int>sides;
for(int i=n-1 ; i>=1 ; i--){
if(A[i] == A[i-1])
sides.push_back(A[i]) , i--;
}
if(sides.size()>=2){
cout<<sides[0] * sides[1]<<endl;
}
e... | 1 | 64,967,655 |
#include<bits/stdc++.h>
#define ll long long int
#define fr(i,n) for(ll i=0; i<n; i++)
#define fre(i,n) for(ll i=1; i<=n; i++)
#define pb push_back
#define mp(i,j) make_pair(i,j)
#define fi first
#define se second
#define pii pair<ll,ll>
#define ve vector
#define piii pair<pii, ll>
#define FAST ios_base::sync_with_std... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const ll MOD = 1e9 + 7;
int N, K;
int a[109];
ll dp[100009], pre[100009];
int main()
{
ios_base::sync_with_stdio(0);
cin... | 1 | 22,296,164 |
#include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
signed main()
{
int a... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
yorn (a ... | 1 | 32,404,292 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n,m;
ll a[100005];
ll ans;
int main(void){
cin>>n>>m;
priority_queue<ll,vector<ll>,less<ll>> q;
for(int i=0;i<n;i++){
cin>>a[i];
q.push(a[i]);
}
for(int i=0;i<m;i++){
ll t=q.top();
... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define MOD 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(var) (var).begin(), (var).end()
#define MAXX 9000000000000000000
#define pii pair<int,int>
#defi... | 1 | 53,764,770 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ss(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
using ll = long long;
using namespace std;
const int N = 100111;
int n;
ll m[N];
int main() {
scanf ("%d", &n);
for (int i = 1; i <= n; ++i... | 1 | 71,407,891 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
int... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int n;... | 1 | 87,808,482 |
#include <iostream>
#include <queue>
using namespace std;
namespace {
struct State {
int top;
int bottom;
int front;
int back;
int left;
int right;
void Init() {
top = 1;
bottom = 6;
front = 2;
back = 5;
left = 4;
right = 3;
}
};
State Next(const State& s, char c) {
State o;
... | #include<iostream>
#include<algorithm>
#include<string>
class DICE {
private:
int label[6];
public:
DICE();
void RotateLabel(char DIRECTION);
void SpinLabel(void);
int ReturnTopLabel(void);
int ReturnRightLabel(int Top, int Front);
};
DICE::DICE() {
for (unsigned int i = 0; i < 6; ++i) {
std::cin >> label[i];
... | 1 | 93,278,157 |
#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 { \... | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
ll a[MAXX];
multiset<ll> ms;
multiset<ll>::iterator it;
signed main()
{
FAST;
string s;
cin >> s... | 1 | 9,935,630 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x=n/15;
cout<<n*800-x*200<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int a;
cin>>a;
cout<<a*800-(a/15)*200<<endl;
return 0;
} | 1 | 64,748,323 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
long long n,ans=0,d;
cin>>n;
long long a[n+1],b[n],f[n+1][n+1];
f(i,0,n+1){
cin>>a[i];
}
f(i,0,n+1){
cin>>b[i];
}
f2(i,n-1,-1){
d... | #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... | 1 | 36,413,436 |
#include<bits/stdc++.h>
using namespace std;
const int N=100100;
int n;
vector<int>g[N];
int dfs(int x,int fa=-1){
int ret=0;
for(int i:g[x])if(i!=fa)ret^=dfs(i,x)+1;
return ret;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<n;++i){
int x,y;cin>>x>>y;
g[x].push_back(y);
... | #include<bits/stdc++.h>
using namespace std;
#define N 1111116
#define next nxt
int n,x[N],y[N],next[N],p[N],f[N];
int travel(int x){
int ans=0;
for (int t=p[x];t;t=next[t])
if (y[t]!=f[x])
f[y[t]]=x,ans^=travel(y[t])+1;
return ans;
}
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) ... | 1 | 72,415,751 |
#include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
ll n;
cin>>n;
vector<pair<int... | #include <bits/stdc++.h>
using namespace std;
#define _rep(n, a, b) for (ll n = (a); n <= (b); ++n)
#define _rev(n, a, b) for (ll n = (a); n >= (b); --n)
#define _for(n, a, b) for (ll n = (a); n < (b); ++n)
#define _rof(n, a, b) for (ll n = (a); n > (b); --n)
#define oo 0x3f3f3f3f3f3f
#define ll long long
#define db lo... | 1 | 72,833,420 |
#include <iostream>
using namespace std;
#define N_MAX 100
int main()
{
int n, i, j, u, k, v;
int Adj[N_MAX][N_MAX] = {};
cin >> n;
for (i = 0; i < n; i++) {
cin >> u >> k;
while (k-- > 0) {
cin >> v;
Adj[u-1][v-1] = 1;
}
}
for (i = 0; i < n; i++) ... | #include <iostream>
using namespace std;
int main(){
int a[100][100];
int n,u,k,v;
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
a[i][j]=0;
}
}
for(int j=0;j<n;j++){
cin>>u>>k;
for(int i=0;i<k;i++){
cin >>v;
a[u-1][v-1]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout<<a[i][... | 1 | 75,224,784 |
#include<iostream>
using namespace std;
int a[251];
int main(void) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
int parent = i / 2;
int left = i * 2;
int right = i * 2 + 1;
cout << "node " << i << ": key = " << a[i]<<", ";
if (parent) {
cout << "pa... | #include <bits/stdc++.h>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int main() {
int h;
cin >> h;
vector<int> a(h+1);
for (int i=1; i<=h; i++)
cin >> a[i];
for (int i=1; i<=h; i++) {
cout << "node " << i << ": ";
cout << "key = " << a[i] << ", ";
if... | 1 | 21,842,950 |
#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... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const ll INFS=1e18;
const int MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
cons... | 1 | 27,122,837 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>
#include <bitset>
#include <cassert>
using namespace std;
using ll = long long;
const long long INF = ... | #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 << 25;
const int MOD = 1e9+7;
ll six[10], nine[10];
int dp[100010];
int main() {
int n;
cin >> n;
rep(i,10)... | 1 | 50,154,717 |
#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;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int x;
cin>>x;
int c=(x%100)/5;
c+=((x%100)%5+4)/5;
puts(c<=(x/100)?"1":"0");
return 0;
} | 1 | 13,112,697 |
#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;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
using Graph = V<V<int>>;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
int main() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
if(k & 1) cout <<... | 1 | 34,652,407 |
#include <iostream>
using namespace std;
int gcd(int a, int b) {
return (b ? gcd(b, a % b) : a);
}
int main() {
int n; cin >> n;
cout << n / gcd(360, n) * 360 / n;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
us... | 1 | 6,738,704 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int h, w, n, x, y;
cin >> h >> w >> n;
auto inside = [&](int x, int y) {
return 0 < x && x < h - 1 && 0 < y && y < w - 1;
};
map< pair<int,int>, int > g;
for (int i = 0; i < n; i++) {
cin >>... | #include<bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
using LL = long long;
const LL LINF = 1e18;
using namespace std;
#define COUT(v) cout<<(v)<<endl
#define CIN(n) int(n);cin >> (n)
#define LCIN(n) LL(n);cin >> (n)
#define SCIN(n) string(n);cin >> (n)
#define YES(n) cout<<((n)? "YES" : "NO")<<endl
#def... | 1 | 97,116,589 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int k;
cin>>k;
vector<ll> a(k);
rep(i,k) cin>>a[i];
ll min_n=2,max_n=2;
for(int i=k-1;i>=0;i--... | 1 | 11,180,180 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int gcd(int a,int b){
if(a%b==0){
return b;
}
else{
return gcd(b,a%b);
}
}
int main(){
int N,X;
cin>>N>>X;
vector<int> x(N);
for(int i=0;i<N;i++){
cin>>x[i];
}
int a=abs(X-x[0]);
for(int i=1;i<N;i++){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin>>N;
vector<long> x(N+1);
for(int i=0;i<N+1;i++) cin>>x[i];
long X=x[0];
if(N==1){
cout<<abs(x[1]-x[0])<<endl;
return 0;
}
sort(x.begin(),x.end());
long ans=gcd(x[1]-x[0],x[2]-x[1]);
for(int i=0;i<N-2;i++){
long tmp=gcd(x[i+1]-x[i],x[i+2]-x[1])... | 1 | 45,211,253 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n, m, t;
int A[N];
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll c = gcd(a, b);
return a * b / c;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
#define INF (1e9)
ll gcd_func(ll a, ll b) {
if (a < b) return gcd_func(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm_func(ll a, ll b) {
retur... | 1 | 68,708,654 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
int main(){
int x; cin >> x;
int _x = x % 100;
rep(a, 100)rep(b, 50)rep(c, 33)rep(d, 25)rep(e, 20){
int sum = a + 2 * b + 3 * c + 4 * d + 5 * e;
if(_x != sum % 100) contin... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X;
cin >> X;
for (int i = 1; i <= X; i++) {
int r = X - 100 * i;
if (0 <= r && r <= 5 * i) {
cout << 1 << endl;
return 0;
}
}
cout << 0 << endl;
return 0;
} | 1 | 92,063,888 |
#include <stdio.h>
int main(){
int K, X, yen;
scanf("%d %d", &K, &X);
yen = K * 500;
yen >= X ? printf("Yes") : printf("No");
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | 1 | 30,255,414 |
#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() {
string s;
cin >> s;
if (s[0] > s[1]) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans *= A - i;
}
for (int i = 0; i < B; i++) {
ans /= i + 1;
}
return ... | 1 | 30,830,315 |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
template<typename T1,typename T2> inline void chmin(T1 ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "... | 1 | 99,984,396 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int N;
cin >> N;
vector<int> C(N), S(N), F(N);
for(int i = 1; i < N; i++){
cin >> C.at(i) >> S.at(i) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
vector<ll> C(N-1), S(N-1), F(N-1);
R... | 1 | 73,455,035 |
#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... | #include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 1e5 + 1;
vector<int> edges[MAX_N];
bool check[MAX_N];
int dfs( int u ) {
check[u] = 1;
int ans = 0;
for ( int v : edges[u] )
if ( !check[v] ) {
ans ^= 1 + dfs( v );
}
return ans;
}
int main() {
i... | 1 | 75,131,620 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
s[5] = ' ';
s[13] = ' ';
cout << s << endl;
return 0;
} | #include <stdio.h>
int main(){
char string[30];
scanf("%s",&string);
string[5]=' ';
string[13]=' ';
printf("%s\n",&string);
return 0;
} | 1 | 1,710,692 |
#include<bits/stdc++.h>
using namespace std;
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putchar(x%10+48);
}
void wr... | #include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
... | 1 | 46,359,506 |
#include<iostream>
#include<algorithm>
#include<sstream>
#include<vector>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cctype>
using namespace std;
int main(void){
int n=0;
while(1){
int n=0;
... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define foreac... | 1 | 16,399,995 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i=s;i<n;i++)
#define repe(i,s,n)for(ll i=s;i<=n;i++)
#define rep_r(i,s,n)for(ll i=n-1;i>=s;i--)
#define repe_r(i,s,n)for(ll i=s;i<=n;i++)
static const ll MOD = 1e9 + 7;
static... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int MOD=1e9+7;
ll INF=1e18;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int main(){
int a, b; cin>>a>>b;
a--, b--;
char g[100][100];
for(int i=0; i<100; i++){
for(int ... | 1 | 83,137,676 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define MOD 1000000007;
#define loop(i, a, n) for (int i = a; i < n; i++)
#define loop1(i, b, n) for (int i = b; i <= n; i++)
#define loopit(a) for (auto it = a.begin(); it != a... | #include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <t... | 1 | 57,571,283 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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 99824435... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using lint = long long;
lint n, x, m, w, cnt1, cnt2, sum1, res;
vector<lint>vec;
bool used[100010];
int main() {
cin >> n >> x >> m;
lint a1 = x;
while (true) {
used[a1] = true;
vec.push_back(a1);
a1 = a1 * a1 % ... | 1 | 96,438,284 |
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main(void){
int n;
int i;
int temp;
int sum[5000];
int num;
while(1){
for(i=0; i<5000; i++){
sum[i] = -100001;
}
sum[0] = 0;
num = 0;
scanf("%d", &n);
if(n == 0) break;
for(i=0; i<n; i++){
scanf("%d", &temp... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int n;
int a[50001];
int S[50001];
int main(){
while(cin >> n && n > 0){
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
S[0] = 0;
for (int i = 0; i < n ; ++i)
{
S[i + 1] = S[i] + a[i];
}
int max = -100000;
for (int i =... | 1 | 65,489,956 |
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unorde... | #include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const int maxn=2e5+10;
int f[maxn];
int q(int a, int b){
int ans = 1;
while(b){
if(b&1)ans = 1ll*ans*a%mod;
a=1ll*a*a%mod;
b>>=1;
}
return ans;
}
int main(){
ll ans, n, k;
cin >> n >> k;
ans=0;
for(ll i=k;i... | 1 | 72,400,626 |
#include <bits/stdc++.h>
using namespace std;
long long arr[100005];
int main(){
long long n;
scanf("%lld",&n);
long long sum=0;
for (int x = 0; x<n; x++){
scanf("%lld",&arr[x]);
sum += arr[x];
}
if (sum%((n*(n+1LL))/2LL)!=0LL){
printf("NO");
return 0;
}
long long t = sum/((n*(n+1))/2);
for (int x = 0; ... | #include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#include<cmath>
#define il inline
#define ll long long
#define rep(i,s,t) for(register int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(register int i=(s);i>=(t);i--)
#define each(i,u) for(int i=head[u];i;i=bow[i].nxt)
#define file(s) freopen(s".in... | 1 | 13,076,408 |
#include <stdio.h>
#define INF 10000000
int k[101];
int list[101][101];
int dist[101];
int n;
void walk(int id,int step){
dist[id-1]=step;
for(int i=0;i<k[id];i++){
if(dist[list[id][i]-1]>step+1) walk(list[id][i],step+1);
}
}
int main(void){
int w;
int num;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d... | #include <iostream>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
int n;
int g[101][101] = {};
int sp[101] = {};
void bfs(){
queue<int> q;
q.push(1);
while( !q.empty() ){
int v = q.front(); q.pop();
for(int i=1; i<=n; i++){
if(g[v][i] == 1 && sp[i] == -1){
q.push(i);
s... | 1 | 66,436,181 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
vector<int64_t> a_vec(N);
for (int i = 0; i < N; ++i)
cin >> a_vec.at(i);
int64_t min_cost = -1;
for (int i = 1; i < (1 << N); ++i) {
bitset<15> visible(i);
if (static_cast<int>(visible.co... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll& a : A) {
cin >> a;
}
ll ans = 1e18;
for (int i = 0; i < (1 << N); i++) {
int n = i;
vector<bool> visible(N, fals... | 1 | 59,509,107 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
ll x,y;
while(cin>>x>>y){
if(x%y==0)cout<<"-1"<<endl;
else cout<<x<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int x,y;
cin>>x>>y;
if(x%y==0)cout<<-1;
else cout<<x;
} | 1 | 3,484,142 |
#include <bits/stdc++.h>
using namespace std;
int m, k;
int main() {
cin >> m >> k;
int sum = 0;
for(int i = 0; i < (1 << m); ++i) if(i != k) sum ^= i;
if(!k) {
for(int i = 0; i < (1 << m); ++i) printf("%d %d ", i, i);
puts("");
return 0;
}
if(m == 1) {
if(k >= 1) puts("-1");
else puts("0 0 1 1");
ret... | #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 | 39,525,201 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
while(true) {
ll n, m; cin >> n >> m;
if (n == 0 && m == 0) break;
vector<pair<ll, ll>> roads;
for(ll i = 0; i < n; i++) {
int d, p; cin >... | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main(){
while(true){
int n, m;
cin >> n >> m;
if(n == 0){
break;
}
vector< pair<int, int> > pd(n);
for(int i=0; i<n; i++){
cin >> pd[i].secon... | 1 | 14,078,209 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod=1000000007;
constexpr ll INF=(1ll<<60);
constexpr double pi=3.14159265358979323846;
template<typename T> inline... | #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() {
string S;
cin >> S;
string T;
cin >> T;
T += S;
cout << T <... | 1 | 21,396,499 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n,m,sum1,sum2,sum3,val1,val2,val3,val4,mn=1e18;
cin>>n>>m;
for(long long i=1;i<n;i++)
{
vector<long long> v;
sum1=m*i;
if(m%2==0)
{
... | 1 | 79,309,333 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
priority_queue<int, vector<int>, greater<int>> train;
priority_queue<int, vector<int>, greater<int>> bus;
vector<int> tmp(4);
for (int i = 0; i < 4; i++)
cin >> tmp.at(i);
for (int i = 0; i < 4; i++)
{
if (i < 2)
train.p... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | 1 | 48,347,034 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100020;
int n,q,f[N][30]; long long x[N],L;
int main(void)
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%lld",&x[i]);
scanf("%lld\n%d",&L,&q);
for (int i=1;i<=n;i++)
f[i][0] = upper_bound( x+1 , x+n+1 , x[i] + L ) - x - 1;
for (i... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n;
cin >> n;
vector<int> v(n);
rep(i,n)cin >> v[i];
int L,Q;
ci... | 1 | 3,395,715 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define ll long long
#define for(i,a,b) for (i=a; i<b; i++)
#define forb(i,a,b) for (i=a; i>b; i--)
#define all(S) S.begin(),S.end()
#define sort(S) sort(all(S))
const int inf = 1e9;
const ll INF = 1... | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (long lo... | 1 | 10,663,451 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
int main() {
ll n,k;
cin >> n >> k;
ll ans = k;
ans *= pow(k-1,n-1);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll MOD = 1000000007;
int main() {
int N, K; cin >> N >> K;
ll ans = K;
rep(i,N-1) an... | 1 | 92,730,444 |
#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<string,int>;
int main(){
ll N, K;
cin >> N >> K;
vector<ll>H(N);
rep(i,N)cin >> H[i];
sort(H.begin(),H.end());
ll ans = 0;
rep(i,N-K){
ans+=H[i];
}
cout << ans <<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 1 | 25,834,546 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int a, b;
cin >> a >> b;
if(a+b == 3) cout << 3 << endl;
else if(a+b == 5) cout << 1 << endl;
... | 1 | 1,237,333 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main(void)
{
int num, cnt;
unsigned int i, j, k, data_num;
int data[50];
unsigned int sq_num;
unsigned int *prime;
for (data_num = 0; data_num < 50; data_num++) {
data[data_num] = -1;
scanf("%d", &data[data_num]);
i... | #include <bits/stdc++.h>
using namespace std;
bool a[1000000];
int main()
{
memset(a, true, sizeof(a));
for (int i = 2; i < 1000000; i += 1 + (i & 1)) {
if (!a[i]) continue;
for (int j = i*2; j < 1000000; j += i) a[j] = false;
}
int n;
while (~scanf("%d", &n)) {
int cnt = 0;
... | 1 | 95,760,802 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define INF 0x33433433
int len1;
int len2;
char s1[1001];
char s2[1001];
int dp[1001][1001];
int main() {
scanf("%s", s1);
scanf("%s", s2);
len1 = strlen(s1);
len2 = strlen(s2);
for (int i=0; i<=len1; i++) {
for (... | #include<bits/stdc++.h>
using namespace std;
#define INF 100000000
int main()
{
string S1,S2;
int n,m;
cin >> S1 >> S2;
n=S1.size();m=S2.size();
vector<vector<int>> dp(n+1,vector<int> (m+1,0));
dp[0][0]=0;
for (int i=1;i<n+1;i++) dp[i][0]=i;
for (int i=1;i<m+1;i++) dp[0][i]=i;
for (i... | 1 | 79,342,757 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define foreach(i,n) for(auto &&i:n)
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define GSORT(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | 1 | 92,012,404 |
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define scn(n) scanf("%d",&n)
const int N=1e7+2;
using namespace std;
int main() {
int n;
cin>>n;
ll ans=0;
for(int i=1;i<=n;i++)
{
ll cnt=n/i;
cnt=cnt*(cnt+1);
cnt/=2;
ans+=(cnt*i);
}
... | #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.... | 1 | 7,857,387 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n,t;
cin >> n >> t;
vector<ll>time(n);
for(ll i=0;i<n;i++){
cin >> time[i];
}
ll ans=0;
for(ll i=1;i<n;i++){
if(time[i]-time[i-1]>t){
ans+=t;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<n;i++)
#define ll long long int
int main(){
int n;
cin>>n;
ll T,t[n];
cin>>T;
ll count=T;
cin>>t[0];
for(int i=1;i<n;i++){
cin>>t[i];
if(t[i]-t[i-1]>T){
count+=T;
}
else
{
count+=t[i]-t[i-1];
}
}
cout<<count<<endl;
return 0;
} | 1 | 89,031,529 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9+1;
const ll INFll = 2e18+1;
ll MOD=1e9+7;
ll gcd(ll a, ll b) { return __gcd(a,b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
int main() {
int cnt[5] = {0};
for(int i(0);i<3;i++){
int a,b;
cin>>a>>b;
cnt[a]++;... | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i = 0; i < n; i++)
int main(void)
{
int a[10],w;
int m = 0;
REP(i,6) a[i] = 0;
REP(i,6) {
cin >> w;
a[w] ++;
m = max(m,a[w]);
}
if(m >= 3) {
cout << "NO" <<... | 1 | 1,222,093 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
ll gcd(ll a, ll b){
if(a < b) return gcd(b, a);
ll r = a % b;
while(r != 0){
a = b;
b = r;
r = a % b;
}
return b;
}
ll lcm(ll a, l... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
ll gcd (ll x, ll y){
if(x % y == 0) return y ;
... | 1 | 49,077,709 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main() {
ios
#ifndef ONLINE_JUDGE
in;
out;
#endif
int n;
cin>>n;
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
long long ans = 0;
unordered_map<string, int> dict;
for (size_t i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (dict[s] == 0) dict[s]++;
... | 1 | 74,606,818 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll x, y, cnt = 0;
cin >> x >> y;
ll buf = x;
while (buf <= y)
{
buf *= 2;
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
int main(){
ll x, y;
cin >> x >> y;
ll res = 1;
while(x * 2 <= y){
x *= 2;
res++;
}
cout << res << endl;
} | 1 | 51,868,214 |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
double di(double a,double b,double c,double d){return sqrt((c-a)*(c-a)+(d-b)*(d-b));}
int main(){
double pai=3.141592653589;
double x1,y1,x2,y2,ans;
scanf("%lf %lf %lf %lf",&x1,&y1,&x2,&y2);
printf("%lf\n",di(x1,y1,x2,y2))... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string>
#include <vector>
#include <cctype>
#include <cstdio>
#include <iomanip>
using namespace std;
string in, t;
double a, b, c, d;
int main(){
cin >> a >> c >> b >> d;
cout << fixed << setprecision(5)... | 1 | 24,534,189 |
#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()
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if((A > 8) || (B > 8)) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
return 0;
} | 1 | 34,250,905 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
int a, b;
cin >> a >> b;
int t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,c) for(int i=0;i<c;++i)
#define PI 3.14159265358979323846264338327950L
typedef unsigned long long uint64;
using namespace std;
using ll = long long;
int main(){
int a,b;
cin >> a >> b;
if(a>b){
for(int i = 0;i<a;i++){
cout << b;
}
cout ... | 1 | 93,554,183 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int min1 = min(a, b);
int min2 = min(c, d);... | #define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | 1 | 79,018,311 |
#include <vector>
#include <math.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <deque>
#include <cctype>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<long, lo... | #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<pii>>;
const int MOD = 1e9 + 7;
struct UnionFind {
vector<int> par, rnk;
UnionFind(int N) : par(N), rnk... | 1 | 64,502,264 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=20010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
retu... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | 1 | 71,808,729 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
int x, y;
cin >> x >> y;
cout << x + y/2 << endl;
return 0;
} | #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 | 89,437,655 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.