code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | #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
vector<ll> lnln ;
void dfs(ll x, ll y){
lnln.push_back(x) ;
string ... | 0 | 15,069,550 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#ifdef DEBUG
#define DEBUG_PRINT(fm, ...) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);std::cout << "DEBUG PRINT ";std::printf(fm, __VA_ARGS__);}while(0)
#define DEBUG_VAL(a, b) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);... | 0 | 86,022,797 |
#include<bits/stdc++.h>
#define ll long long
const long double pi=acos(-1);
const int N=2e5+10;
using namespace std;
int arr[N];
int main()
{
ll n;
ll sum1=0,sum=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>arr[i];
sum+=arr[i];
}
if(sum%n==0)
{
ll tmp=sum/n;
for(int i=0;i<n;i++)
{
ll k=(arr[... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <t... | 0 | 98,156,084 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans=(1<<25);
cin >> n;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a,a+n);
for(int i=a[0];i<=a[n-1];i++){
int sum=0;
for(int j=0;j<n;j++){
int s=abs(a[j]-i);
sum+=s*s;
}
ans=min(ans,sum);
}
cout << a... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int X, N;
cin >> X >> N;
vector<bool> ans(210, true);
rep(i, N) {
int p;
cin >> p;
if (p - X >= 0) {
int a = (p - X) * 2;
ans.at(a) = ... | 0 | 70,985,696 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | 0 | 80,601,753 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
int main() {
int N,M;
cin >> N >> M;
vector<int> A(M);
rep(i,N) cin >> A[i];
for(int i=0; i<M; i++) {
N -= A[i];
if(N<0) {
cout << -1 << endl;
return 0;
}
}
cout << N << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >>S;
vector<long long>aaa(S.size()+1,0);
long long answer=0;
for(long long i=0;i<S.size();i++){
if(S.at(i)=='<'){
aaa.at(i+1)=aaa.at(i)+1;
}
}
for(long long i=S.size()-1;0<=i;i--){
if(S.at(i)=='>'){
if(aaa.a... | 0 | 9,287,899 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;r... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX=1e5+5;
ll ara[MX], csm[MX];
int main(){
ll i, j, k;
ll n;
cin >> n;
for(i=0; i<=n; ++i) cin >> ara[i];
for(i=n; i>=0; --i) csm[i]=csm[i+1]+ara[i];
ll cur=1, ans=1;
for(i=0; i<=n; ++i){
cur-=ara[i... | 0 | 86,124,792 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,M,A;
cin>>N>>M;
vector<int> D(N+100,-1000000),Z(0,0);
D[0]=0;
int set[10]={0,2,5,5,4,5,6,3,7,6};
unordered_map<int,int> MtoP;
for(int i=0; i<M; i++){
int A;
cin>>A;
MtoP[set[A]]=max(MtoP[set[A]],A);
Z.push_b... | #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<ll, ll>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
ll H, W;
cin >> H >> W;
ll s1, s2, s3, s4, s5, s... | 0 | 80,762,383 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 34,221,040 |
#include <cstdio>
int main() {
int a,b,c;
std::scanf("%d %d %d",&a,&b,&c);
if(a < b&&b < c){
std::printf("Yes\n");
}
else if(a >= b){
std::printf("No\n");
}
else if(a >= c){
std::printf("No\n");
}
else if(b >= c){
std::printf("No\n");
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cassert>
#include <set>
#include <vector>
#include <cmath>
#include <bitset>
#include <functional>
#include <limits>
#include <map>
using namespace std;
typedef long long ll;
#define rep1(i, n) for(ll i = 1; i <=(ll)(n); i++)
#define rep0(i, n) for(ll... | 0 | 8,855,647 |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
using namespace std;
using P = pair<int,int>;
int main(){
string S;
cin >> S;
S.erase(S.size()-1);
int n =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> S(H);
for (int i = 0; i < H; i++){
cin >> S[i];
}
vector<vector<int>> w(H,vector<int>(W));
vector<vector<int>> countW(H);
for (int i = 0; i < H; i++){
int count = 0;
int current = 0;
for (i... | 0 | 49,717,018 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = 10000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
#define rreps(i, n) for(int i=((int)(n)); i>0; --i)
#define all(x) (x).begin(), (x).end()
#define ... | 0 | 87,484,921 |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n,t,l,x[N],w[N],ans[N],q[N];
typedef pair<int,int> pii;
pii p[N];
bool cmp(int a,int b){return p[a]<p[b];}
int main()
{
scanf("%d%d%d",&n,&l,&t);
for (int i=1;i<=n;i++){
scanf("%d%d",&x[i],&w[i]);
if (w[i]==2) w[i]=-1;
p[i]=pii((l+(x[i]+w[i]*t... | #include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#includ... | 0 | 33,871,435 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (b) - 1; i >= (a); i--)
#define REP(i, n) for(int i = 0; i < (n); i++)
#define RREP(i, n) for(int i = (n) - 1; i >= 0; i--)
#define all(i) (i).begin(),(i).end()
#define pb push_back
#defi... | #include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#includ... | 0 | 47,162,496 |
#include <iostream>
using namespace std;
int s,t,a;
int main(){
for(int i = 0; i < 4; i++){
cin >> a;
s += a;
}
for(int i = 0; i < 4; i++){
cin >> a;
t += a;
}
cout << max(s,t) << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <LL,LL>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
LL n,x,y,ans=0;
int main()
{
cin>>n;
repn(i,n) ans... | 0 | 79,584,867 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stdexcept>
#include<cmath>
#include<fstream>
#include<memory>
#include<algorithm>
#include<cstring>
#include<ctime>
#include<deque>
#include<sstream>
#include<iomanip>
#include<sstream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#incl... | 0 | 64,468,055 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <fstream>
using names... | #include<iostream>
using namespace std;
int main(){
int h,w,i,j;
for(;;){
cin>>h>>w;
if(h==0)exit(0);
for(i=0;i<h;i++){
for(j=0;j<w;j++){
if(i==0||i==h-1){cout<<"#";}
else if(j==0||j==w-1){cout<<"#";}
else{cout<<".";}
}
cout<<endl;
}
... | 0 | 55,694,810 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv)
{
int A, B;
cin >> A >> B;
if (A > 8 || B > 8)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i... | 0 | 845,103 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
int cnt = 0;
vector<vector<ll>> vac;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin>>N;
vac.resize(N);
for(int i=0;i<N;i++){
vac[i].resize(3);
}
for(int i=0;i<N;i++){
for(int j=0;j<3;j++... | #include<iostream>
using namespace std;
class Cube{
public:
int f[6];
Cube(){}
void roll_z(){ roll(1, 2, 4, 3);}
void roll_y(){ roll(0, 2, 5, 3);}
void roll_x(){ roll(0, 1, 5, 4);}
void roll(int i, int j, int k, int l){
int t = f[i]; f[i] = f[j]; f[j] = f[k]; f[k] = f[l]; f[l] = t;
}
void move(ch... | 0 | 13,035,461 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 998244353;
long long int mod_pow(long long int x, long long int n, long long int p) {
long long int res = 1;
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 123;
#define int long long
int n, m;
pair <int, int> a[maxn];
string s[60], t[60];
main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i = 0; i < n; i++)
cin >> s[i];
for(int i = 0; i ... | 0 | 41,112,508 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
#define pii pair<int,int>
#define pll pair<long long,long long>
#define usi unordered_set<int>
#define usl unordered_set<long long>
#define umii unordered... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int mod = 1000000007;
const double PI=acos(-1);
int main(){
... | 0 | 83,923,932 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const ll INF = ll(1e18);
int main(){
ll n;
cin >> n;
ll ans = INF;
for(ll i = 1; i * i <= n;i++){
if(n % i == 0){
ll j = n / i;
ans = min(ans,i+j-2);
... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int h, w;
cin >> h >> w;
rep(i,... | 0 | 7,664,086 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
int main(){
while(1){
char buf[1100];
scanf("%s",buf);
if(buf[0]=='0') break... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
int main(){
int N; std::cin >> N;
std::vector<int> a(N);
for (auto& r : a) {
int t; std::cin >> t;
r = t - 1;
}
int count = 0;
for (int i = 0; i < N; ++i)
if (a[a[i]] == i)++cou... | 0 | 68,079,944 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii... | #include <bits/stdc++.h>
using namespace std;
int main(){
string x,y,l,n;
cin>>x;
int z=0;
y=x;
l=x;
n=x;
int o,j,a,s;
o=x.size()-1;
j=x.size()-1;
a=(x.size()-1)/2-1;
s=(x.size()+3)/2-1;
for(int i=0;i<j;i++){
swap(x[j],x[i]);
j--;
}
if(x==y){
z++;}
for(int i=0;i<=a;i++){
if(a==1){
... | 0 | 66,730,549 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
ll n,y; cin >>n >>y;
rep(i,n+1){
rep(j,n-i+1){
int k = n-i-j;
if(10000*i+5000*j+1000*k==y){
cout << i << " " << j << " " << k << endl;
return 0;
}
... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | 0 | 70,309,128 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;
#define fr first
#define sc second
#de... | #include <bits/stdc++.h>
#include <cmath>
#include <assert.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = LONG_LONG_MAX;
const ll MINF = -10e10;
#define cmin(x, y) x = min(x, y)
#def... | 0 | 46,155,274 |
#include <iostream>
#include <cstdio>
using namespace std;
int H, W, d;
int main(){
scanf("%d%d%d", &H, &W, &d);
for(int i=1; i<=H; i++)
for(int j=1; j<=W; j++){
int x=(i+j)/d%2, y=(i-j+W)/d%2;
if(x==1 && y==1) putchar('R');
if(x==1 && y==0) putchar('G');
if(x==0 && y==1) putchar('B');
if(x==0 && y==... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 28,878,951 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define SZ(x) ((int)(x).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define fore(i,a) for(auto &i:a)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define Yes cout << "Yes" << endl;
#define No cou... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi firs... | 0 | 97,473,213 |
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace std;
const int NMAX = 10000;
void print(int* A, int N)
{
cout << A[0];
for (int k = 1; k < N;k++) {
cout << " " << A[k] ;
}
cout << endl;
}
bool isPrime(int n)
{
int k = 2;
while (k * k < n + 1) {
if (n % k == 0) {
... | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include... | 0 | 20,173,919 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
int main(){
ll n, c, k;
cin >> n >> c >> k;
vector<ll> t(n);
rep(i, n) cin >> t[i];
sort(t.begin(), t.end());
ll cnt = 1, p = 0, lim = 0;
rep(i, n){
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<strin... | 0 | 94,224,100 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(3),b(3),c(4);
for(int i=0;i<3;i++){
cin >> a[i] >> b[i];
c[a[i]-1]++;
c[b[i]-1]++;
}
bool t=true;
for(int i=0;i<4;i++){
if(c[i]==3){
t=false;
}
}
if(t){
cout << "YES" << endl;
}
else{
cout << "NO" ... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#in... | 0 | 5,547,527 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int sum = 0;
for(int i = 0;i < m;i ++){
int x;
cin >> x;
sum += x;
}
if(sum > n){
cout << -1 << endl;
}
else{
cout << n - sum << endl;
}
} | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main() {
int N, K; cin >> N >> K;
int A[N]; REP(i, N) cin >> A[i];
int dp1[N][K];
REP(i, K) dp1[0][i] = 0;
dp1[0][... | 0 | 34,293,761 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
using ll = long long;
int main() {
int x, t;
cin >> x >> t;
if (x >= t) cout << x - t << endl;
else cout << "0" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define mes(a,b) memset((a),(b),sizeof((a)))
#define syio std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0);
#define lson l, mid, rt << 1
#define rson mid+1, r, rt << 1 | 1
typedef long long ll;
typedef long double real;
typedef pair<... | 0 | 74,308,889 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
const int AMAX = 100000;
long long int cnt[AMAX + 1];
int main()
{
int N;
long long K;
cin >> N >> K;
for(int i = 0; i < N; i++)
{
int a, b;
cin >> a >> b;
cnt[a] +... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector< pair<int,int> > sushi(N);
for(int i=0; i<N; i++) {
cin >> sushi[i].second >> sushi[i].first;
sushi[i].second--;
}
sort(sushi.rbegin()... | 0 | 26,939,797 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
auto s = [](int n){
int sum = 0;
while(n != 0){
sum += n % 10;
n /= 10;
}
return sum;
};
int sum = s(n);
if (n ... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#include <functional>
#define mod 998244353
#define int long long
#define ld long double
#... | 0 | 95,563,297 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(){
ll n;
cin >> n;
ll a[n];
ll cal[n+1];
cal[0]=0;
for(ll i=0;i<n;i++) cin >> a[i];
sort(a,a+n);
for(ll i=0;i<n;i++) cal[i+1]=cal[i]+a[i];
ll memo=0;
for(ll i=0;i<n-1;i++){
... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> ... | 0 | 74,403,686 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <cstring>
#include <map>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2,29);
const int MOD... | #include <iostream>
using namespace std;
int main(void){
int n;
int b, f, r, v;
int count[4][3][10];
for(int i=0;i<4;i++)
for(int j=0;j<3;j++)
for(int k=0;k<10;k++)
count[i][j][k]=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>b>>f>>r>>v;
count[... | 0 | 100,726,827 |
#include <bits/stdc++.h>
using namespace std;
const long inf = 1e18;
int n, r;
long a[300];
long b[300];
long dp[300][300][300];
long dq[300][300][300];
long dr[300][300][300];
void modify(int i) {
for (int j = 0; j < n; ++j) {
long q = inf;
for (int k = n - 1; k >= 0; --k) {
q = min(q, dp[i][j][k]);
... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<list>
using namespace std;
const int maxn = 100000;
const int infly = (1<<29);
vector <int> G[maxn+5];
list <int> out;
bool c[maxn];
int N;
int indge[maxn];
void bfs(int s)
{
queue <int> q;
q.push... | 0 | 80,470,940 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll q, h, s, d;
cin >> q >> h >> s >> d;
ll n;
cin >> n;
ll ... | #include <bits/stdc++.h>
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define iter_(i,n) for (int i = 0; i < int(n); i++)
#define for_n(i, n) for (int i = 1; i <= int(n); i++)
#define ... | 0 | 10,057,917 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
struct edge {int to; ll cost; };
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
ll GCD(ll a, ll b){
if(b==0) return a;
else return GCD(b, a%b);
}
ll LCM(ll a, ll b){
if(a<b) swap(a,b);
return a/GCD(a,b)*b;
}
int... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int m;
char a[33];
char b1[11]={'y','u','i','o','p','h','j','k','l','n','m'},b2[15]={'q','w','e','r','t','a','s','d','f','g','z','x','c','v','b'};
while(1){
int count=0;
scanf("%s",a);
m=strlen(a);
for(int i=0... | 0 | 99,753,432 |
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <complex>
typedef long long int LL;
using namespace std;
LL a[100005];
LL prefix[100005];
int main() {
LL n, m;
scanf("%lld%lld", &n, &m);
for (int i = 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... | 0 | 70,218,553 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
void dijkstra(const int n, vector<vector<int>> &min_path, const vector<vector<pair<int, int>>> &G, const vector<int> &R) {
for (int i = 0; i < R.size(); i++) {
int start = R[i];
vector<int> cost(n + 1, INF);
priority_... | 0 | 55,300,268 |
#include<iostream>
using namespace std;
int main(void){
int n;
cin >> n;
int a;
int M = -1000000;
int m = 1000000;
long long int S = 0;
for(int i = 0; i < n; i++){
cin >> a;
if(M < a)M = a;
if(m > a)m = a;
S = S + a;
}
cout << m << " " << M << " " << S <<... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 2,839,914 |
#include <iostream>
#include <cmath>
using namespace std;
int main(int argc, char* argv[]) {
long long x, y;
cin >> x >> y;
long long ret = 0;
if (abs(x) > abs(y) && x > 0) {
++ret;
x *= -1;
ret += abs(x) - abs(y);
x -= abs(x) - abs(y);
} else if (abs(x) > abs(y) && x <= 0) {
ret += abs(x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n,k;
cin >> n >> k;
string s;
cin >> s;
vector<int> cnt(n,0);
int idx = 0;
int c = 1;
if (s[0] == '0') {
cnt[0] = 0;
... | 0 | 33,265,402 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define MAX 0x7f7f7f7f
#define maxn 200000+10
LL a[maxn];
LL sum[maxn];
int main()
{
int n;
scanf("%d",&n);
LL s=0;
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
s+=a[i];
sum[i]=sum[i-1]+a[i];
}
LL minn=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll cnt[100010];
int main() {
ll n,k;
cin>>n>>k;
ll r,s,p;
cin>>r>>s>>p;
string t;
cin>>t;
for(ll i=0;i<n;i++){
char now=t[i];
if(i-k>=0){
if(cnt[i-k]!=0&&t[i-k]==now){
continue;
}
}
if(... | 0 | 18,814,879 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
usin... | #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 P = pair<int,int>;
using Graph = vector<vector<int>>;
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void... | 0 | 47,260,058 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
for(int i = 0; i < (s.size()-1)/4; i++){
if(s[i] != s[(s.size()-1)/2 - 1 - i]){
cout << "No" << endl;
return 0;
}
}
for(int i = (s.size()+3)/2 - 1; i < (s.size(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll N; cin >> N;
vector<ll> a(N, 0);
map<ll, ll> m;
for (int i = 0; i < N; ++i) {
cin >> a[i];
m[a[i]]++;
}
vector<ll> T;
for (a... | 0 | 31,047,661 |
#include<bits/stdc++.h>
using namespace std;
string t[]={"qazwsxedcrfvtgb","yhnujmikolp"};
int tp(string s){
int rl,cnt=0;
for(int i=0;i<2;++i)
if(t[i].find(s[0])!=string::npos) rl=i;
for(int i=1;i<s.size();++i)
for(int j=0;j<2;++j)
if(t[j].find(s[i])!=string::npos)
if(j!=rl) cnt++, rl=j;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | 0 | 38,909,103 |
#include<iostream>
#include<algorithm>
#include<string.h>
#include<map>
#include<string>
#include<math.h>
#include<stdio.h>
#pragma GCC optimize(2)
#define Swap(a,b) a ^= b ^= a ^= b
using namespace std;
typedef long long ll;
inline ll read() {
ll c = getchar(), Nig = 1, x = 0;
while (!isdigit(c) && c != '-')c = get... | #include<bits/stdc++.h>
#define pi acos(-1)
#define ll long long
#define pii pair<ll,ll>
#define debug(a) cout<<a<<'\n'
#define maxn 100009
#define MOD 1000000007
#define F first
#define S second
#define rep(i, a, b) for(ll i = a; i < (b); ++i)
#define per(i, b, a) for(ll i = b-1; i>=a ; i--)
#define trav(a, x) for(au... | 0 | 40,334,448 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int c(int x, int n, vector<int> p) {
set<int> ban;
for(auto i: p) {
ban.insert(i);
}
for(int i=0;i<x;i++) {
int minus = x-i;
if(ban.find(minus) == ban.end()) {
return minus;
}
int plus = x + i;
if(ban.find(plus) == ... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typed... | 0 | 16,896,898 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <iostream>
using namespace std;
struct node {
node():p(-1),b(-1),c(-1),d(-1){}
int p;
int b;
int c;
int d;
};
void setdepth(node t[], int id, int d) {
t[id].d=d;
if(t[id].c!=-1) setdepth(t, t[id].c, d+1);
if(t[id].b!=-1) setdepth(t, t[id].b, d);
}
int main()
{
ios::sync_with... | 0 | 96,687,057 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using name... | 0 | 89,532,768 |
#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;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "P... | 0 | 78,243,065 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <functional>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
const int inf = 3000;
int main(){
string s;
string t;
cin >> s >> t;
vector<vector... | 0 | 22,832,340 |
#include <algorithm>
#include <deque>
#include <iostream>
#include <functional>
using namespace std;
int main()
{
int i, num;
deque< int > index;
int d[5];
cin >> d[0] >> d[1] >> d[2] >> d[3] >> d[4];
for ( i = 0; i < 5; i++ ) {
index.push_back( d[i] );
}
sort( index.b... | #include <iostream>
#include <climits>
using namespace std;
int main(){
int n, a;
long sum = 0; int max = INT_MIN; int min = INT_MAX;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a;
sum += a;
if(max < a){
max = a;
}
if(min > a){
min = a;
}
}
cout << min << " " << max << " " << sum << endl;
retu... | 0 | 2,605,746 |
#include <iostream>
#include <string>
using namespace std;
int main(){
char list[][6]={
{" "},
{".,!? "},
{"abc "},
{"def "},
{"ghi "},
{"jkl "},
{"mno "},
{"pqrs "},
{"tuv "},
{"wxyz "} };
int m[10] = {1,5,3,3,3,3,3,4,3,4};
int count,n,i,buf;
string str;
cin >> n;
while(n--){
cin >> str;
... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <limits>
using namespace std;
using ull = unsigned long long int;
ull f(ull a, ull b)
{
auto g = [](ull x) {
int cnt;
for (cnt = 0; x != 0; cnt++)
{
x = x / 10;
}
return cnt;
... | 0 | 97,039,244 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (int)c.size()
#define fr first
#define ... | #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... | 0 | 49,853,753 |
#include <iostream>
using namespace std;
int main(){
long long int N, A, B, C, X, Y[105];
long long int ans;
while(true){
cin >> N >> A >> B >> C >> X;
if( 0==(N|A|B|C|X) )
break;
ans = 0;
for(int i=0; i<N; i++){
cin >> Y[i];
}
for(int i=0; i<N&&ans<10002; ans++){
if( X == Y[i] ){
i++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<string> WIN(N);
for (int i=0;i<N;i++){
cin >> WIN.at(i);
}
cin >> M;
vector<string> LOSE(M);
for (int i=0;i<M;i++){
cin >> LOSE.at(i);
}
string ANS;
int max = 0;
for (int i=0;i<N;i++){
string s = WIN.... | 0 | 75,374,262 |
#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
const ll INF = LLONG_MAX;
using edge = std::vector<long long>;
bool warshall_floyd(
long long V,
long long E,
std::vector<edge>& edges,
std::vector<std::vector<long long>>& dist
) {
for (long long i = 0; i < V... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | 0 | 72,041,839 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rp(i,n) for (int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) sort(a.begin(), a.end(), [](int i, int j... | #include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 10000000... | 0 | 75,696,381 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if (a > b) swap(a,b);
if (b > c) swap(b,c);
int count = 0;
if ((c-b)% 2 == 0 && (c-a)%2 == 0){
count += (c-b)/2 + (c-a)/2;
}
else if ((c-b)%2 == 1 && (c-a)%2 == 1){
count += (c-b)/... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void... | 0 | 89,799,508 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
string s; ll k;
cin >> s >> k;
ll n = s.size();
ll ans = 0;
int cnt = 1;
rep(i... | #include<cstdio>
#include<cstring>
using namespace std;
int main(){
int n,k,a,max;
int set[100001];
while(1){
scanf("%d %d",&n,&k);
if(n==0 && k==0)break;
max=0;
for(int i=0;i<n;i++){
scanf("%d",&set[i]);
}
for(int i=0,sum=0;i<n-k+1;i++,sum=0){
if(set[i-1]<set[i+k-1] || i==0){
for(int ... | 0 | 14,384,738 |
#include <iostream>
#include <cmath>
#define llint long long
#define inf (llint)1e16
using namespace std;
llint N;
llint a[200005];
int main(void)
{
cin >> N;
for(int i = 0; i < N; i++) cin >> a[i];
llint y = 0;
for(int i = 0; i < N; i++) y += a[i];
llint ans = inf, x = 0;
for(int i = 0; i < N-1; i++){
x += a[... | #include <iostream>
using namespace std;
const int maxn=100000;
struct Tree {
int parent,left,right;
};
Tree tree[maxn]; int depth[maxn];
void print(int u) {
cout<<"node "<<u<<": "<<flush;
cout<<"parent = "<<tree[u].parent<<", "<<flush;
cout<<"depth = "<<depth[u]<<", "<<flush;
if (tree[u].parent==(-1)) {
... | 0 | 77,320,977 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,d;
cin>>n>>d;
vector<vector<float>> t(n,vector<float>(d,0));
for(int i = 0;i<n;++i){
for(int j = 0;j<d;++j){
cin>>t[i][j];
}
}
int ans = 0,dist;
for(int i = 0;i<n-1;++i){
for(int j = i+1;j<n;++... | #include<stdio.h>
int main()
{
int n;
long long int s=100000;
scanf("%d",&n);
for(int i=0;i<n;i++){
s*=1.05;
s+=999;
s/=1000;
s*=1000;
}
printf("%d\n",s);
return 0;
} | 0 | 42,804,832 |
#include<iostream>
using namespace std;
int dp[17][17];
int main(){
int a, b ,i, j, x, y;
while(cin>>a>>b){
if(a == 0 && b == 0) { break; }
int n;
cin>>n;
for(i=1;i<=16;i++)for(j=1;j<=16;j++){dp[i][j]=0;}
for(i=1;i<=n ;i++){
cin>>x>>y; dp[y][x]=-1;
}
dp[1][1]=1;
for(i=1;i<=b;i++){
for(j=1;j<=a;j... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<deque>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef pair<int,int> P;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int main(){
... | 0 | 42,455,950 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i, n) FOR(i,0,(n))
class B1DimensionalWorldsTale {
public:
void solve(std::istream &in, std::ostream &out) {
int n, m, x, y;
in >> n >> m >> x >> y;
vector<int> ... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef double db;
typedef long long ll;
#define pb push_back
#define FAST cin.sync_with_stdio(0); cin.tie(0);
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define arep(i, a, n) for(int i = a; i <= (n); ++i)
#define drep(i, a, n) for(int i =... | 0 | 7,373,485 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int n ,m ,c;
int main()
{
cin>>n>>m>>c;
if(n!=m&&n==c)cout<<m;
else if(n!=c&&n==m)cout<<c;
else cout<<n;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i < int(n); ++i)
#define repx(i, x, n) for (int i = int(x); i < int(n); ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) ((... | 0 | 3,701,833 |
#include<bits/stdc++.h>
using namespace std;
#define fi(a) scanf("%d",&a);
#define fli(a) scanf("%ld",&a);
#define fll(a) scanf("%lld",&a);
#define pi(a) printf("%d\n",a);
#define ppi(i,a) printf("Case %d: %d\n",i,a);
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
voi... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
ll n,m;
ll dp[6500][6500]={0};
void solve(ll *s, ll *t){
memset(dp, 0,sizeof dp);
for(ll i=1;i<=n;i++){
for(ll j=1;j<=m;j++){
if(s[i-1]==t[j-1])
dp[i][j] = (1 + dp[i-1][j]%mod + dp[i... | 0 | 85,187,042 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, b) for (int i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v... | 0 | 76,918,347 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <numeric>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
int MOD = 1000000007;
temp... | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<utility>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include <map>
using namespace std;
typedef long long int ll;
#define repi(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,a) repi(i,0,a)
#define all(u) u.... | 0 | 14,783,117 |
#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 ll INF = (1LL << 60);
int main(){
string s, t;
cin >> s >> t;
int n = s.size();
map<char, char> ss, tt;
bool ... | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20)
#define int long long
#define double long double
const int INF = 1e18, MOD = 1e9 + 7;
int h, w;
string b[2222];
int
l[2222][2222] = {},
r[2222][2222] = {},
u[2222]... | 0 | 70,217,333 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using Graph = vector<vector<int>>;
int c=0;
vector<bool> seen;
vector<vector<int>> s;
void dfs(const Graph &G, int v) {
seen.at(v) = 1;
for(auto nv : G.at(v)) {
if(seen.at(nv))
continue;
s.at... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<ctime>
using namespace std;
typedef long long ll;
const int MAX=1e5+10;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const int d[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
const string mode[4]={... | 0 | 1,166,890 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, x, first;
cin >> n >> x >> first;
int ret = abs(x - first);
for (int i = 1; i < n; i++) {
int a;
cin >> a;
ret = __gcd(ret, abs(x - a));
}
cout << ret << endl;
return 0... | #include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int h, m, d;
int a, b;
while (cin >> a >> b)
{
if (((-1000 <= a) && (a <= 1000)) && ((-1000 <= b) && (b <= 1000)))
{
if (a < b)
{
cout << "a < b" << endl;
}
... | 0 | 86,706,826 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
bool ans = false;
for(int i = 0; i <=25; ++i){
for(int j = 0; j <=14; ++j){
int x = (4*i) + (7*j);
if(x == n){
ans = true;
break;
}
}
}
cout << (ans ? "Yes":"No") << '\n';
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int is_succeed(vector<int> Scores, int X)
{
bool result = true;
rep(i, Scores.size())
{
if (Scores.at(i) < X)
{
result = false;
break;
}
... | 0 | 65,070,072 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
using namespace std;
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vecto... | #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;
int main(){
int N;
cin>>N;
string s[300];
for(int i(0);i<N;i++){
cin>>s[i];
}
ll ans(0);
for(int i(0);i<N;i++){
bool flag = true;
for(int i(0);i<N;i++){
ch... | 0 | 79,493,896 |
#include <stdio.h>
#include <math.h>
int main(void) {
double a, b, c, d;
scanf("%lf%lf%lf%lf", &a, &b, &c, &d);
printf("%f\n", sqrt((a - c) * (a - c) + (b - d) * (b - d)));
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int p=1e9;
inline ll read(){
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
ll S,X1,Y1,X2,Y2... | 0 | 34,910,496 |
#include <bits/stdc++.h>
#define int long long
#define ci(m) for(int i=0;i<m;i++)
#define cj(m) for(int j=0;j<m;j++)
#define ck(m) for(int k=0;k<m;k++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 41,452,752 |
#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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <iomanip>
using namespace std;
int n, k;
int main(){
while(cin >> n, n){
int res=0;
int rest=1000-n;
while(rest){
if(rest-500>=0){
res++;
rest-=500... | 0 | 31,068,007 |
#include<iostream>
using namespace std;
int main(int argc, char* argv[])
{
char a[1200];
cin.getline(a, sizeof(a));
for(int i=0;i<sizeof(a);i++)
{
if(a[i]=='\0')
{
cout << endl;
break;
}
if(islower(a[i])) a[i]=toupper(a[i]);
else if(isupper(a[i])) a[i]=tolowe... | #include <iostream>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);++i)
const int MOD = 1e9 + 7;
const int MAX=10000000;
long long fac[MAX], finv[MAX], inv[MAX];
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
... | 0 | 7,251,721 |
#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#def... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 74,032,092 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
vector<ll>a(n);
for(ll i=0;i<n;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
ll cost=1e15;
for(ll i=-100;i<=100;i++){
ll x=0;
for(ll j=0;j<n;j++)... | 0 | 53,408,285 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n; cin >> n;
string s1, s2; cin >> s1 >> s2;
for (int i = 0; i < n; i++)
if (s1[i] == s2[0]) {
bool g = 1;
for (int j = i + 1, k = 1; j < n; j++, k++)
if(s1[j] != s2[k])
g = 0;... | #include <bits/stdc++.h>
#include <sstream>
#include <iomanip>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std... | 0 | 28,002,709 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int h,w,k,ans=0;
cin>>h>>w>>k;
char c[h][w];
for(int i=0; i<h; i++)
{
for(int j=0; j<w; j++)
{
cin>>c[i][j];
}
}
for(int maskR=0; maskR<(1<<h); maskR++)
{
for(int maskC=0; maskC<(1<<w);... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n,m,x,y;cin>>n>>m>>x>>y;
int a[n],b[m];
for(int i=0;i<n;++i){
cin>>a[i];
}
for(int i=0;i<m;++i){
cin>>b[i];
}
sort(a,a+n);
sort(b,b+m);
int ans=0;
if(a[n-1]<b[0]){
for(int i=a[n... | 0 | 19,398,566 |
#include <bits/stdc++.h>
using namespace std;
const long longN = 1e2+5;
long long n;
long long k;
vector < pair < long long, long long> > xy;
long long getA(long long a , long long b , long long c , long long d){
long long X1 = min( min(xy[a].first , xy[b].first) , min(xy[c].first , xy[d].first));
long long X2 ... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;} else return false;}
int tb[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main(){
int n, m; cin >> n >> m;
vector<int> dp(11000, -INT_MAX);
vector<int> A(m);
for(int i = 0; i < m; i++){
cin... | 0 | 35,074,573 |
#include <iostream>
using namespace std;
int main() {
int a , b ;
string op ;
cin >> a >> op >> b;
if ( op == "+")
cout << a + b << endl;
else
cout << a - b << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int red, green, blue;
cin >> red >> green >> blue;
int k;
cin >> k;
while (true) {
if (red < green) {
break;
}
green *= 2;
k--;
}
while (true) {
if (green < blue) {
... | 0 | 66,129,595 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define DL double
#define MLL map<LL,LL>::iterator
#define MSL map<string,L>::iterator
#define MLS map<LL,string>::iterator
#define MSS map<string,string>::iterator
#define MCL map<char,LL>::iterator
#define SL set<LL>::iterator
#define SS set<string... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
#include <set>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main()
{
string S;
cin >>... | 0 | 63,923,727 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string A,B;
cin>>A>>B;
char a=0;
char b=0;
if(A.length()>B.length()){
cout<<"GREATER";
return 0;
}
else if(A.length()<B.length()){
cout<<"LESS";
return 0;
}
for(size_t i=0;i<=A.length()-1;i++){
a=A[i];
b=B[i];... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,ll >
#define vps vector<... | 0 | 72,203,626 |
#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... | #include <iostream>
using namespace std;
int main()
{
int n, t;
cin >> n >> t;
int a, pa;
cin >> a;
pa = a;
int ans = 0;
for (int i = 1; i < n; i++) {
cin >> a;
ans += (a - pa > t) ? t : a - pa;
pa = a;
}
cout << ans + t << endl;
return 0;
} | 0 | 16,389,690 |
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int S, M, inputLength;
string input, next;
while(true) {
cin >> input;
if(input == "-") break;
inputLength = input.size();
cin >> M;
for(int i=0; i < M; i++) {
cin >> S;
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string a,b;
cin >> a >> b;
if(a.size() > b.size()){
cout << "GREATER" << endl;
}
else if(a.size() < b.size()){
cout << "LESS" << endl;
}
else{
string ans = "EQUAL";
int size = a.size();
for(int i=0;i<si... | 0 | 36,542,782 |
#include <iostream>
using namespace std;
static const int MAX = 100;
int main(void)
{
int N, A[MAX];
int minj, count = 0;
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
for(int i=0;i<N;i++){
minj = i;
for(int j=i+1;j<N;j++){
if (A[minj] > A[j]){
minj = j;
}
}
if (i != minj){
swap(A[i], A[minj]);
... | #include<iostream>
using namespace std;
int main(){
int n, y, m, d;
cin>>n;
for(n;n;n--){
cin>>y>>m>>d;
int ans=0;
for(int i=y+1;i<1000;i++){
if(i%3==0) ans+=20*10;
else ans+=(20+19)*5;
}
if(y%3==0) ans+=20*(10-m);
else{
for(int i=m+1;i<=10;i++){
if(i%2) ans+=20;
else a... | 0 | 8,015,011 |
#include <iostream>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector< string > keitai;
keitai.push_back(".,!? "); keitai.push_back("abc"); keitai.push_back("def"); keitai.push_back("ghi"); keitai.push_back("jkl");
keitai.push_back("mno"); keitai.push_... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
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, s, n) for(int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
void llchmin(ll &a, ll b){
if(a > b)
a = b;
}
... | 0 | 49,480,299 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,c,ans=0;
string s,x;
map<string,int>a;
cin >> n >> s;
for(int i=0;i<1000;i++){
x=to_string(i);
while(x.size()!=3) x='0'+x;
c=0;
for(int j=0;j<n;j++){
if(s.at(j)==x.at(c)) c++;
if(c==3) break;
}
if(c==3) ans++;
... | #include<iostream>
using namespace std;
int main(){
int H,W;
bool flag= true;
cin>>H>>W;
if(H==0&&W==0){
flag = false;
}
while(flag==true){
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
cout<<"#";
if(1<i&&i<H&&0<j&&j<W){
for(int k=1;k<W-1;k++){
cout<<".";
j=W-1;
}
... | 0 | 80,092,878 |
#include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define all(x) (x).begin(), (x).end()
usi... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inlin... | 0 | 14,600,051 |
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int MAX_HW = 1000;
int n, h, w, rat, s[2], g[2], flag[MAX_HW+1][MAX_HW+1][2];
int town[MAX_HW+1][MAX_HW+1];
char town2[MAX_HW+1][MAX_HW+1];
queue <P> que;
P p;
void bfs(int sy, int sx){
que.push(P(sy, sx));
flag[sy][sx][0]=rat;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2... | 0 | 78,424,481 |
#include <iostream>
#include <vector>
using namespace std;
int solve() {
int n, k; cin >> n >> k;
vector<int> nums;
int a;
for (int i = 0 ; i < n; ++i) {
cin >> a;
nums.push_back(a);
}
sort(nums.begin(), nums.end());
int res = 0;
for (int i = 0; i < k; ++i) {
res ... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define Q int t,q; cin>>t ;for(q=1;q<=t;q++)
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main()
{
ll n,i,a,mx=0;
vector<ll>v(100001);
cin>>n;
for(i=0;i<n;i++)
{
cin>>a;
v[a]++;
}
for(... | 0 | 58,790,607 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
int N;
cin >> N;
vector<pair<double,string>> vec(N);
for (int i = 0;i < N;i++) {
cin >> vec.at(i).first >> vec.at(i).second;
}
double ans = 0;
for (int i = 0;i < N;i++) {
if (vec.at(i).second == "BTC") {
ans += vec.at(i).firs... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | 0 | 68,616,780 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long,long long>
#define all(a) a.begin(),a.end()
#define INF 10000000000000000
#define endl '\n'
template<class T> inline bool c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 11,948,703 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int n, m, l, r;
cin >> n >> m;
int imos[100005];
fill(imos, imos + 1... | #include <stdio.h>
long long n, k, s, x, z, y, m, b, l;
long long p[5000];
long long c[5000];
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", p + i);
p[i]--;
}
for (int i = 0; i < n; i++) {
scanf("%lld", c + i);
}
m = -1000000000;
for (int i = 0; i < n; i++) {
s = i;
... | 0 | 48,900,369 |
#include<bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
typedef long long ll;
const ll mod=1000000007;
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
int main() {
string s;cin >> s;
if(s[0]==s[1]&&s[1]==s[2]){
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, int> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ... | 0 | 79,087,710 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
typedef long long ll;
typedef vector<ll> vl;
#define rp(i, f, t) for (long long int i = f; i < t; i++)
#define pr(i, f, t) for (long long int i = t - 1; i >= f; i--)
#define ca(n, a) rp(ca_i, 0, n) cout << a[ca_i] << ((ca_i == n - 1) ? "\n" : " "... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
int main() {
string ans;
cout << "? 1" << string(9, '0') << endl;
cin >> ans;
if (ans == "Y") {
for (int i = 9; i > 0; i--) {
c... | 0 | 28,558,286 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.