code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline voi... | #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();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typed... | 0 | 53,585,718 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define mst(a, b) memset(a, b, sizeof(a))
#define X first
#define Y second
#define lowbit(x) (x&(-x))
const int maxn = 100+10;
const int maxm = 10000+10;
const int inf = 0x... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
string t_cade,h_cade;
int t_point=0,h_point=0;
cin >>n;
for(int i=0;i<n;i++)
{
cin>>t_cade>>h_cade;
if(t_cade==h_cade)
{
t_point++;
h_point++;
}else
{
... | 0 | 51,436,993 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; i... | #include<string>
#include<iostream>
using namespace std;
class Dice{
int dn[6];
int up, front;
string qu;
public:
Dice(int d1, int d2, int d3, int d4, int d5, int d6){
dn[0] = d1;
dn[1] = d2;
dn[2] = d3;
dn[3] = d4;
dn[4] = d5;
dn[5] = d6;
}
void Result(string m){
int w;
qu = m;
for (int i = 0; ... | 0 | 25,771,373 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define RREP(i,a) for(int i = a;i >= 0;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(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"Yes"<<endl
#define cno cout<<"No"<<endl
#define sp <<" "<<
#define CST(x) cout<<fixed<<setprecision(x)
#define PI 3.14159265359
using namespace std;
using ll = long long;
using ld = long double;
int m... | 0 | 29,368,509 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=(... | #include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
#include<map>
using namespace std;
#define int long long int
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define... | 0 | 46,754,207 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int S = s.length();
vector<int> num(S + 1);
s = '>' + s + "<";
rep(k, 2) {
rep(i, S) {
if (s.substr(i, 2) == "><") {
... | 0 | 26,638,708 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const string YES = "Yes";
const string NO = "No";
void solve(long long X, long long Y){
bool check = false;
for(ll i = 0; i <= 100; ++i){
for(ll j = 0; j <= 100; ++j){
if(2*i + 4*j == Y && i + j == X) check = true;
}... | #include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<math.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
string s;
int k;
cin >> k >> s;
if (s.size() <= k)
{
cout << s << "\n";
}
else
... | 0 | 91,689,031 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tii;
typedef long long ll;
#define rep(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
int N,M;
int pre[100010];
int dist[100010];
int INF = 200010;
vector<int> path[100010];
void bfs(){
dist[1] = 0;
pre[1] = 0;
queue<in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 0 | 3,663,524 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typed... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#defin... | 0 | 75,834,852 |
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n,l;
cin>>n>>l;
vector<str> s;
for(int i=0;i<n;i++)
{
str is;
cin>>is;
s.push_back(is);
}
sort(s.begin(),s.end());
... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii... | 0 | 58,306,730 |
#include<bits/stdc++.h>
using namespace std;
typedef string ll;
int main ()
{
ll a,b,c; cin>>a>>b>>c;
if((a[a.size()-1]==b[0])&&(c[0]==b[b.size()-1])){
cout<<"YES"<<endl;
}
else
cout<<"NO"<<endl;
} | #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 int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
int n,m;
cin>>n>>m;
map<int... | 0 | 62,091,334 |
#include <stdio.h>
int main()
{
int A, B;
scanf("%d %d", &A, &B);
if ((A == 1 && B == 2) || (A == 2 && B == 1))
{
printf("3");
} else if ((A == 1 && B == 3) || (A == 3 && B == 1))
{
printf("2");
} else if ((A == 2 && B == 3) || (A == 3 && B == 2))
{
printf("1");
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int A,B,C;
cin >> A >> B >> C;
if(C-(A-B)<0) {
cout << 0 << endl;
}
else{
cout << C-(A-B) << endl;
}
return 0;
} | 0 | 42,995,991 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s,d[10];
cin>>s;
int i,j,a,b;
a=s.size();
int c[a-2];
for(i=0;i<a-2;i++)
{
for(j=i;j<i+3;j++)
{
d[i]=d[i]+s[j];
}
c[i]=abs(753-stoi(d[i]));
}
sort(c,c+(a-2));
cout<<c[0]<<endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
const int INF = 1000000007;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N+1);
rep(i, ... | 0 | 84,405,769 |
#include <iostream>
using namespace std;
int main() {
int X, Y; cin >> X >> Y;
if (X <= 8 && Y <= 8) cout << "Yay!" << endl;
else cout << ":(" << endl;
return 0;
} | #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 debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | 0 | 100,671,241 |
#include<cstdio>
using namespace std;
typedef long long LL;
LL a[55];
int main(){
LL n, ans = 0;
scanf("%lld", &n);
for (int i = 0; i < n;i++){
scanf("%lld", a + i);
}
while(true){
LL ma = a[0], pos = 0;
for (int i = 1; i < n;i++){
if(a[i]>ma){
ma ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,k;cin>>n>>k;
long a[n];
for(long i=0;i<n;++i){
a[i] =0;
}
long tmp;
for(long i=0;i<n;++i){
cin>>tmp;
a[tmp-1] +=1;
}
sort(a, a+n, greater<long>());
long ans=0;
for(long i=k;i<n;++i){
... | 0 | 45,724,491 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,y,a,b,c;
cin >> x >> y >> a >> b >> c;
vector<int> p(a);
for(int i=0; i<a; i++){
cin >> p[i];
}
vector<int> q(b);
for(int i=0; i<b; i++){
cin >> q[i];
}
vector<int> r(c);
for(int i=0; i<c; i++){
cin >> r[i];
}
sort(p.be... | #include <iostream>
#include <string>
#include <map>
int main()
{
std::map<std::string, int> count_map;
std::string str{};
int max_length = 0;
std::string max_str{};
int hist_max_count = 0;
std::string hist_max_str{};
while (std::cin >> str)
{
if (count_map.count(str) == 0)
{
count_map[str] = 1;
}
el... | 0 | 67,199,116 |
#include<iostream>
#include<map>
#include<string>
#include<stdio.h>
using namespace std;
int main (void){
string str,maxByLength("");
map<string,int> Y;
while (cin>>str){
if (str.size()>maxByLength.size()) maxByLength=str;
Y[str]++;
}
string maxByCount("");
int cnt = 0;
for(map<string, int>::iterator it = Y... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath... | 0 | 57,196,209 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
string S;
cin >> S;
ll K;
cin >> K;
ll len = S.size();
ll sub_count = 0;
ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<bool> a(26,false);
string s; cin >> s;
if(s.size()<26){
for(int i = 0; i < s.size(); i++) {
a[(int)s[i]-97]=true;
}
for(int i = 0; i < 26; i++) {
if(a[i]==false){
... | 0 | 94,630,156 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
... | #include<queue>
#include<algorithm>
#include<cstdio>
#include<vector>
#include <iomanip>
#include<cstring>
#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
vector<P>v;
bool cmp(P a,P b)
{
return atan2(a.second,a.first)<atan2(b.second,b.first);
}
int main()
{
... | 0 | 80,346,307 |
#include <bits/stdc++.h>
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 32,659,299 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1001001001;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
ll g... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
const long long INF = 1LL << 60;
ll mod = 1e9 + 7;
long long modinv(long long a, long long m)
{
long long b = m, u = 1, v = 0;
while (b)
{
long long t = a / b;
a -= t * b;
... | 0 | 91,528,938 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<N;i++)
#define rep2(i,N) for(int i=1;i<=N;i++)
using namespace std;
long long INF=1e18;
long long mod=1e9+7;
int main(){
long long n,m,v,p;
cin>>n>>m>>v>>p;
vector<long long> a(n);
rep(i,n)cin>>a[i];
sort(a.begin(),a.end());
reverse(a.begin... | #include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <limits>
#include <functional>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <queue>
#define LOG(FMT...) fprintf(stderr, FMT)
using namespace std;
typede... | 0 | 18,702,817 |
#include <bits/stdc++.h>
#include <fstream>
#include <string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long double ld;
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
#include <list>
#in... | 0 | 75,299,053 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
string a,b,c; cin>>a>>b>>c;
if(a[a.size()-1]!=b[0]){
cout<<"NO"<<end... | #include<iostream>
using namespace std;
int main(){
int s, t;
int n;
s = 0;
t = 0;
for(int i=0;i<4;i++){
cin >> n;
s += n;
}
for(int i=0;i<4;i++){
cin >> n;
t += n;
}
if(s > t){
cout << s << endl;
}else{
cout << t << endl;
}
} | 0 | 658,177 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
l... | 0 | 79,775,276 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N, p;
cin >> K >> N;
vector<int> A(N+1);
for (int i=1; i<=N; i++) {
cin >> p;
A[i]=p;
A[0]=p;
}
int m=0;
for (int i=1; i<=N; i++) {
if (i==1) {
m=K-(A[0]-A[1]);
}
else {
m=max(m, A[i]-A[i-1]);
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a... | 0 | 36,112,016 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <ra... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#... | 0 | 55,965,354 |
#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;
}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n; cin>>n;
if(n==0)break;
int score[n]; for(int i=0;i<n;i++)cin>>score[i];
for(int i=0;i<n;i++){
bool flag=false;
for(int j=i;j<n;j++){
int minj=i;
if(sco... | 0 | 33,692,135 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #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 | 78,832,996 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
string a;
char buf;
while(scanf("%c",&buf)){
if(buf == '\n'){
break;
}
if(!isalpha(buf)){
a.push_back(buf);
}else if(isupper(buf)){
a.push_back(tolower(buf));
}... | #include <iostream>
#include <algorithm>
#include <vector>
#include <climits>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repR(i, n) for(int i = (n) - 1; i > -1; i--)
#define rep1(i, n) for(int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) for(int i = (n); i > 0; i--)
using namespace std;
int H = 0;... | 0 | 46,290,981 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main(int argc, char **argv)
{
int n, m, *a, t, p;
while(1){
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0){
break;
}
a = (int *)calloc(n+1, sizeof(int));
t = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
t +... | #include <bits/stdc++.h>
#define _sel(_1, _2, x, ...) x
#define repn(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, ...) _sel(__VA_ARGS__, reps, repn)(i, __VA_ARGS__)
#define reppn(i, n) for (ll i = 1; i <= (n); i++)
#define repps(i, a, b) for (ll i = (a); i <= (b... | 0 | 3,973,059 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int xg=x;
for(int i=0;i<n;i++){
int xi;
cin>>xi;
xg=max(xg,xi);
}
int yl=y;
for(int i=0;i<m;i++){
int yi;
cin>>yi;
yl=min(yl,yi);
}
cout<<(xg<yl?"No War":"War")<<endl;
} | #include <iostream>
using namespace std;
void print(int a, int b, string str) {
cout << str.substr(a, b - a + 1) << endl;
}
string reverse(int a, int b, string str) {
string tmp = "";
for (int i = 0; i < str.length(); ++i) {
if (i < a || b < i) {
tmp.append(1, str[i]);
} else {
... | 0 | 55,472,578 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define S size()
#define E end()
#define B begin()
#define L length()
#define endl "\n"
#define cnt count
#define in insert
#define er erase
#define fi first
#define se second
#define fl float
#define ld long double
#define ll long long
#define gcd __gcd
#define mp make_pai... | 0 | 49,556,371 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <functional>
#include <iomanip>
using namespace std;
void function()
{
}
int main()
{
string s;
int sum;
while (cin >> s)
{
if (... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(),a.end()
typedef pair<int,int>pint;
typedef v... | 0 | 36,281,191 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
string V="AB";
cin>>S;
if(S.length()==3){
if((S[0]==V[0]||S[1]==V[0]||S[2]==V[0])&&(S[0]==V[1]||S[1]==V[1]||S[2]==V[1])){
cout<<"Yes";
}
else{
cout<<"No";
}
}
return 0;
} | #include <iostream>
#include <cstring>
using namespace std;
int main(){
int n;
char ans[100];
char s[1100];
int value;
int h = 0,w,cnt;
bool judge;
char tmp[9][6] = {{".,!? "},{"abc"},{"def"},{"ghi"},{"jkl"},{"mno"},{"pqrs"},{"tuv"},
{"wxyz"}};
cin >> n;
while(n--){
v... | 0 | 39,549,949 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,a,b;
vector<int> V[100005];
const ll MOD=1000000007;
int bio[100005];
ll dpW[100005];
ll dpB[100005];
pair<ll,ll> dfs (int a) {
dpW[a]=1;
dpB[a]=1;
for (int b : V[a]) {
if (bio[b]==1) {continue;}
bio[b]=1;
pair<l... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int n;
cin >> n;
std::map<int, int> even;
std::map<int, int> odd;
rep(i, n)
{
int v;... | 0 | 33,705,052 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
const int INF=1e9;
int main(){
int n,m,R;
cin>>n>>m>>R;
vector<int> r(R);
rep(i,R){
cin>>r[i];
r[i]--;
}
vector<vector<int>> d(n,vector<int>(n,INF));
rep(i,n) d[i][i... | 0 | 84,722,324 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long gcd(long long a, long ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.14159265358979
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1e9+7LL;
long long dp0[101][4];
long long dp1[101][4];
int main() {
string N; cin >> N;
i... | 0 | 97,593,455 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int dice[6],q;
char c;
for(int i=0;i<6;i++){
scanf("%d",&dice[i]);
}
scanf("%d",&q);
for(int i=0;i<q;i++){
int x,y;
scanf("%d %d",&x,&y);
i... | 0 | 36,751,631 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng... | #include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
using namespace std;
struct stu
{
int x;
int y;
};... | 0 | 26,593,090 |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 0 | 9,003,702 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll h,n;
... | #include<bits/stdc++.h>
using namespace std;
#define flash ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define endl "\n"
#define int long long int
#define ll long long
#define ld long double
#define Yes() cout << "Yes" ... | 0 | 5,541,813 |
#include <iostream>
#include <string>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, a;
cin >> n >> a;
int amari = n / 500;
if(n % 500 <= a) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
} | #include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <tuple>
#include <queue>
#include <chrono>
#include <ctime>
#include <random>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll SIZE = 1e5 + 10, INF = 1e9, K = 3... | 0 | 76,282,807 |
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf... | #include<iostream>
#include<vector>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
void solve(){
int m,mn,mx;
cin>>m>>mn>>mx;
if(m==0){
exit(0);
}
vector<int>P(m);
REP(i,m){
cin>>P[i];
}
int mx_d=0;
int ans=0;
for(int i=mn;i<=mx;i++){
int dif=P... | 0 | 2,319,175 |
#include <iostream>
using namespace std;
int main(void){
int N, K;
cin >> N >> K;
if(K == 1){
cout << "0" << endl;
return 0;
}
int n = N - K;
cout << n << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double d;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (abs(a*b)/gcd(a,b))
#define sqr(a) (a*a)
#define tt int t; cin>>t; while(t--)
#define lo(i, a, b) for(int i=a; i<=b; i++)
#define rlo(i, a) for(int i=a; i>0; i--)
#define be(a) a.begin(),a.e... | 0 | 83,503,259 |
#include<iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int m,f,r,sum;
while(1) {
cin >> m >> f >> r;
sum = m + f;
if(m==-1 && f==-1 && r==-1) break;
else if(m==-1 || f==-1) cout << 'F' << endl;
else if(sum>=80) cout << 'A' << endl;
else i... | #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 rep(i, n) for... | 0 | 88,077,502 |
#include<iostream>
#define rep(i,n) for(int i=0; i<(n); ++i)
int main(){
int n,m; std::cin >> n >> m;
int a, total=0;
rep(i,m){
std::cin >> a;
total += a;
}
std::cout << (total > n ? -1 : n-total) << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a_max, tmp = 0;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) cin >> vec.at(i);
sort(vec.begin(), vec.end());
a_max = vec.back();
vector<bool> bl(a_max + 1, true);
for (size_t i = 0; i < vec.size(); i++) {
... | 0 | 57,575,632 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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() {
string s;
ci... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 0 | 47,280,882 |
#include <stdio.h>
int main(){
char arr[20];
scanf ("%[^\n]", arr);
for (int i = 0; arr[i] != '\0'; i++)
if (arr[i] == ',') arr[i] = ' ';
puts (arr);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll P[100005];
ll modpow(ll n, ll r) {
ll p = n;
... | 0 | 11,059,297 |
#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>
#includ... | #include <bits/stdc++.h>
#define __STDC_FORMAT_MACROS
#define p64 PRId64
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define ALL(f, x, ...) \
([&] (decltype ((x)) ALL) { \
... | 0 | 69,303,725 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int 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 = ve... | #include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <math.h>
#include <tuple>
#include <string.h>
#include <map>
#include <iomanip>
#include <time.h>
using namespace std;
typedef long long ll;
int n, m;
bool vis[100010] = {};
vector<int> G[100010], tp;
void dfs(int v) {
... | 0 | 81,092,365 |
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 79,117,401 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size())cout << a[i] << " ";cout << "\n"
#define vecvec(a) vector<vector<(... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 75,417,946 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJK... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s; cin>>s;
vector<char> vec1(s.size()),vec2(s.size());
for(int i=0;i<s.size();i++){
vec1[i]=s[i];
vec2[i]=s[i];
}
reverse(vec1.begin(),vec1.end());
bool a=true;
for(int i=0;i<s.size();i++){
if(vec1[i]!=vec2[i]){
a=false;
... | 0 | 17,973,715 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 52,368,147 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg... | #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 rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 79,673,779 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int a,count=0,count2=0;
cin>>a;
int b=a;
while(b!=0){
int rem=b%10;
count++;
b=b/10;
}
if(count==1){
for(int i=1;i<=a;i++){
count2++;
}
cout<<count2<<endl;
}
... | 0 | 64,411,919 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
char x, y;
cin >> x >> y;
if(x == y) cout << "=" << endl;
else if(x > y) cout << ">" << endl;
else if(x < y) cout << "<" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> csum_a(n + 1,0), csum_b(n + 1,0);
for (int i = 1; i <= n; ++i) {
long long tmp;
cin >> tmp;
csum_a[i] = csum_a[i - 1] + tmp;
csum_b[i] = csum_b[i - 1] + max(tmp, 0LL);
... | 0 | 61,001,681 |
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <utility>
using namespace std;
int N;
int cost[10][10];
pair<int, int> getMinCost() {
for (int k = 0; k < N; ++k) {
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
if (k == i || k == j) {
... | #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;}
char... | 0 | 82,948,754 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n)... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
typedef pair<int, int> P_i;
typedef pair<double,double> P_d;
#define rep(i,n) for(int i=0;i<(n);++i)
#define alrep(i,j,n) for(int i=0;i<(n);++i)for(int j=i+1;j<(n);++j)
#define Yes cout << "Yes" << endl;
#define No cout << "No... | 0 | 37,453,772 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int ans = 0;
n += 1;
bool *p = new bool[n];
fill(p, p + n, true);
p[0] = p[1] = false;
for (int i = 2; i * i < n; i++)
if (p[i] == true)
for (int j = i * i; j < n; j += i)
p[j] = false;
for (int i = 0; i < n; i++... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | 0 | 28,887,355 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 0 | 81,220,426 |
#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_c... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
using namespace std;
long long A[100000];
long long diff_A[100000];
long long x[100000];
long long y[1000... | 0 | 45,070,753 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N);
for (int64_t i = 0; i < N; i++) {
cin >> A.at(i);
}
int64_t inner_inv = 0;
for ... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<b;i++)
#defin... | 0 | 75,381,311 |
#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 M = 10000001;
int main()
{
int n, m;
cin... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int a[maxn];
int main() {
int n;
cin>>n;
for(int i=1;i<=n;i++)
scanf("%d", &a[i]);
if(a[n] != 2){
cout<<-1<<endl;
return 0;
}
long long mn = 2, mx = 2;
for(int i=n;i;i--) {
long long x = ... | 0 | 90,147,612 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main(){
int n; cin>>n;
string ans="Yes";
vector<vector<int>> v(n,vector<int>(3));
rep(i,n){
cin>>v[i][0]>>v[i][1]>>v[i][2];
}
int t,x,y;
rep(i,n){
... | #include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
long long mod = 1000000007;
long long mymod(long long num){
if (num< 0 && !(num%mod == 0)){
if (mod == 1){
return 0;
}
return mod-abs(num)%mod;
}else{
r... | 0 | 15,211,313 |
#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_c... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> P;
const int M = 1e9;
int h, w, n;
unordered_set<int> black, used;
int ans[10], C;
void check(P point){
for(int i=-2;i<=2;i++){
for(int j=-2;j<=2;j++){
int y1 = point.first + i;
int x1 = point.second + j;
i... | 0 | 29,056,579 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i< (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main(){
int n;cin>>n;
int a=(1<<30);
int ans=0;
rep(i,n){
int b=0;
cin>>b;
if(b<a){
ans++;
}
a=min(a,b);
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int h,n;cin >> h >> n;
vector<P> magic(n);
vector<int> dp(h+1,INF);
rep(i,n){
int a,b;cin >> a... | 0 | 34,635,498 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<map>
#include<utility>
#include<string>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
tem... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
ll n,i,j,p,k,m,ans=0;
string s;
cin>>s;... | 0 | 95,129,912 |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 1011, inf = 1000111222;
long long mabs(long long x) {
if (x < 0) {
return -x;
}
return x;
}
int n;
long long x[max_n], y[max_n];
int f[2];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
using namespace std;
typedef struct info{
int nx;
int ny;
int cost;
int target;
info(int a,int b,int c,int d){
nx = a;
ny = b;
cost = c;
target = d;
}
... | 0 | 70,703,281 |
#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;
typedef pair<int,int> P;
const ll mod=1000000007;
int ketatume(int a){
if(a<10)cout<<"00000"<<a;
else if(a<100)cout<<"0000"<<a;
else if(a<1000)cout<<"000"<<a;
else if(a<10000)cout<<"00"<<a;
else if(a<10... | #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(... | 0 | 51,056,822 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n];
for (int i = 0; i < n; i++)
cin >> x[i];
sort(x, x+n);
int beg = x[0], end = x[n-1];
int ans;
for (int i = 0; i < end-beg+1; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
sum += pow((x[j]-(beg + i... | #include <bits/stdc++.h>
typedef unsigned long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
map<ll, ll> mp;
for (ll i = 0; i < n; ++i) {
ll x;
cin >> x;
mp[x]++;
}
vector<ll> a;
for (auto p : mp) {
if (p.second >= 4) for (int i = 0; i < 2; ++i) a... | 0 | 100,348,224 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define xrep(i,a,b) for(int i=int(a);i<int(b);++i)
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
xrep(i, 1, 10000) {
if((int)(i*0.08)==A && (int)(i*0.1)==B) {
cout << i ... | #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... | 0 | 60,860,051 |
#include<iostream>
using namespace std;
#define MAX 100005
#define NIL -1
class Node{
public:
int p,l,r,d;
};
Node T[MAX];
int n;
void print(int u){
cout << "node " << u << ": ";
cout << "parent = " << T[u].p << ", ";
cout << "depth = " << T[u].d << ", ";
if(T[u].p == NIL) cout << "root, ";
... | #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 | 91,409,498 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i,a,b) for (ll i=(a);i<(ll)b; i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define INF 1LL << 60
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll,ll> p;
const long long MOD=1000000007;... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 59,281,873 |
#include <bits/stdc++.h>
using namespace std;
int n, a[201], ans;
int main() {
scanf("%d", &n); n <<= 1;
for(int i = 1;i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
for(int i = 1;i <= n; i += 2)
ans += a[i];
printf("%d\n", ans);
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <stack>
#define Endl endl
#define mp make_pair
#define ll long long
#define pii pair<int,int>
#define pll pair... | 0 | 41,338,142 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mod 1000000007
void solve()
{
ll n,m;
cin>>n>>m;
vector<pair<ll,ll>> a(m);
vector<ll> v,k;
for(ll i=0;i<m;i++)
{
cin>>a[i].first>>a[i].... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 33,320,901 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#include <bitset>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
while(1){
int n;
cin>>n;
if(n==0)break;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
sort(a.begin(),a.end());
int ans=INF;
... | 0 | 98,436,359 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) f... | #include<iostream>
using namespace std;
int main(){
while(1){
int a,c,b,n,x,y[100];
cin>>n>>a>>b>>c>>x;
if(n+a+b+c+x==0)break;
for(int i=0;i<n;i++){
cin>>y[i];
}
int cnt=0,count=0;
while(1){
if(x==y[cnt]){
cnt++;
}
if(cnt==n){
cout<<count<<endl;
break;
}
if(c... | 0 | 20,586,875 |
#include <stdio.h>
int main(void) {
int a[3]={0}, i, n;
for (i = 1; i <= 10; i++){
scanf("%d",&n);
if (a[0] < n){
a[2] = a[1];
a[1] = a[0];
a[0] = n;
}
else if (a[1] < n){
a[2] = a[1];
a[1] = n;
}
else if (a[2] < n){
a[2] = n;
}
}
printf("%d\n%d\n%d\n", a[0], a[1], a[2... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
long long int n,m,a,b,c,d,e,f,g,sum;
cin>>n>>m;
a=n*(n-1)/2;
b=m*(m-1)/2;
sum=a+b;
cout<<sum<<endl;
return 0;
} | 0 | 724,332 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
#define int long long
#define P pair<int,int>
signed main() {
int a,b,c,k;
cin >> a >> b >> c >> k;
int ans = 0;
if(k % 2 == 0){
cout << a - b << endl;
} else {
cout <... | #include <stdio.h>
int main(){
char X[3];
scanf("%s",&X);
if(X[0]=='7'){
printf("Yes\n");
}
else if(X[1]=='7'){
printf("Yes\n");
}
else if(X[2]=='7'){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | 0 | 41,665,564 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ull= unsigned long long;
const ll K_MAX=1e5+5;
const int INF=1e9;
int main(){
int h,n;
cin>>h>>n;
int tot=0;
rep(i,n)... | #include <bits/stdc++.h>
using namespace std;
int main()
{
char c1, c2;
cin >> c1 >> c2;
if (c1 == c2)
{
cout << "=" << endl;
}
else if (c1 < c2)
{
cout << "<" << endl;
}
else
{
cout << ">" << endl;
}
return 0;
} | 0 | 59,747,280 |
#include <bits/stdc++.h>
using namespace std;
string s;
int N,w,i;
int main(){
cin>>s>>w; N = s.size();
for(i=0;i<N;i+=w){printf("%c",s[i]);}
} | #include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... | 0 | 74,747,098 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include<iostream>
#include<queue>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
typedef long long ll;
#define pi 3.141592653589793238462... | 0 | 8,265,422 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, num;
int tmpW, tmpH, que;
int cnt = 0;
cin >> w >> h >> num;
vector<vector<int>> data(w, vector<int>(h));
for (int i = 0; i < w; i++) {
for (int j = 0; j < h; j++) data.at(i).at(j) = 0;
}
for (int i = 0; i < num... | 0 | 63,794,147 |
#include <bits/stdc++.h>
int main() {
std::string S, T;
std::cin >> S >> T;
if (S.size() + 1 != T.size()) {
std::cout << "No" << std::endl;
return 0;
}
for (int i = 0; i < S.size(); i++) {
if (S[i] != T[i]) {
std::cout << "No" << std::endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
double f(double x, int *v, int *l, int *r, int N) {
double V = INT_MAX;
for (int i = 0; i < N; i++) {
if (x < l[i]) {
V = min(V,v[i]+l[i]-x);
} else if (x <= r[i]) {
V = min(V,1.0*v[i]);
} else {
V = min(V,v[i]+x-r[i]);
}
}
return V... | 0 | 91,580,525 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main() {
int h,w,a,b;
cin>>h>>w>>a>>b;
int ans[h][w];
rep(i,b){
rep(j,a){
ans[i][j]... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin>>a;
int max=0,flag=0,temp=0;
for(int i=0;i<a.size();i++){
if(a[i]=='R'){
if(flag==0){
flag=1;
temp=1;
}
else
temp++;
}
else{
if(max<temp)
max=temp;
... | 0 | 100,189,751 |
#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main(){
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
int a, b; cin >> a >> b;
double x =((double)a + b) / 2;
cout <<ceil(x) << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--... | 0 | 83,374,821 |
#include <bits/stdc++.h>
typedef long long ll;
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define AA(i) cout << i << endl;
#define AS(i) cout << i << " ";
const int INF = 1001001001;
const double PI = 3.14159;
using namespace std;
int main() {
cha... | #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<int, int>;
using namespace std;
#define INF ((1<<30)-1)
#define LLINF (1LL<<60)
#define EPS (1e-10)
ll f(ll x, ll m) {
return x % m;
}
ll sums[201010], vis[202020];
int main() {
... | 0 | 57,341,378 |
#include<bits/stdc++.h>
using namespace std;
int read()
{
int s=0;
char c=getchar(),lc='+';
while (c<'0'||'9'<c) lc=c,c=getchar();
while ('0'<=c&&c<='9') s=s*10+c-'0',c=getchar();
return lc=='-'?-s:s;
}
void write(int x)
{
if (x<0)
{
putchar('-');
x=-x;
}
if (x<10) putchar(x+'0');
else
{
write(x/10);
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
class dice {
public:
dice(int* a) {
set(a[0], a[1], a[2], a[3], a[4], a[5]);
}
dice(int& a, int& b, int& c, int& d, int &e, int& f) {
set(a, b, c, d, e, f);
}
void turn(int n) {
if (n < 4)
{
turndice(n);
return;
}
switch... | 0 | 71,684,788 |
#include<stdio.h>
struct STACK
{
int num[ 10 ] ;
int p ;
int Top( void ) ;
void Push( int ) ;
void Pop( void ) ;
void Init( void ) ;
} stack ;
int main( void )
{
stack.Init() ;
int kale ;
while( scanf( "%d" ,&kale ) != EOF )
{
if( kale == 0 )
{
printf( "%d\n" ,stack.Top() ) ;
stack.Pop() ;
}
el... | #include <bits/stdc++.h>
using namespace std;
int main(){
string o,e;
cin>>o>>e;
string password;
for(int i=0; i<o.size(); i++){
password.push_back(o[i]);
if(e.size()==i){
continue;
}
password.push_back(e[i]);
}
cout<<password<<endl;
} | 0 | 33,609,803 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T&... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | 0 | 68,982,526 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
int ans = 1;
while (ans <= n) {
ans *= 2;
}
cout << ans / 2 << endl;
return 0;
} | #include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
char a[15]={'a','b','c','d','e','f','g','q','r','s','t','v','w','x','z'};
using namespace std;
int main(){
char str[33]={0};
while(1){
scanf("%s",str);
if(str[0] == '#')break;
int len = 0;
len = strlen(str);
... | 0 | 92,094,341 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template <class Abel> struct BIT {
vector<Abel> dat[2];
Abel UNITY_SUM = 0;
BIT(int n) { init(n); }
void init(int n) { for (int iter = 0; iter < 2; ++iter) dat[iter].assign(n + 1, UNITY_SUM); }
inlin... | #include <bits/stdc++.h>
using namespace std;
const char itos[2] = {'S', 'W'};
int id[256];
bool dif(char A, char T) {
return (A == 'S' && T == 'x') || (A == 'W' && T == 'o');
}
string solve(int N, const string &S, int a, int b) {
int M = S.size();
string res(M, 'A');
res[0] = itos[a], res[1] = itos[b];... | 0 | 85,020,530 |
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 2e5 + 10 ;
long long A[MAX] , B[MAX] ;
int n ;
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n ;
long long sum1 = 0 , sum2 = 0 , sum = 0 ;
for(int i = 0 ; i < n ; ++i)
{
cin>>A[i]>>B[i] ;
if(A[i] > B[i])
sum1 += A[i] - B[i] ;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5;
inline bool cek_bit(ll mask, int x){
return mask&(1ll<<x);
}
int n;
ll li[N+5];
int depan[65];
int urut = 0;
int matrix[65][N+5];
bool masuk(int bit){
urut++;
for(int i=1;i<=n;i++){
if(cek_bit(li[i],bit)){
matrix[urut][i] = 1;... | 0 | 60,780,812 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a + b == 15) {
cout << '+' << "\n";
}
else if(a * b == 15) {
cout << '*' << "\n";
}
else {
cout << 'x' << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 30,182,801 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<... | #include <bits/stdc++.h>
#define pragma
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define aisort sort(a,a+n)
#define adsort sort(a,a+n,greater<ll>())
#define PI 2 * acos(0)
typedef pair<ll, ll> pii;
typedef pair<ll, pii> piii;
typedef vector<ll> vi;
type... | 0 | 56,729,279 |
#include <iostream>
int main() {
int n, x;
int sum, count;
do{
count = 0;
std::cin >> n >> x;
for(int i = 0; i < n; i++){
for(int j = 1+i; j < n; j++){
for(int k = 1+j; k < n; k++){
sum = (n-i)+(n-j)+(n-k);
if(sum == x) {
count += 1;
}
}
}
}
if(!(n == 0 && x == 0)){
std::cout << count <<std::endl;
}
} while(!(n == 0 &&... | #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... | 0 | 23,263,740 |
#include<iostream>
using namespace std;
int main(){
int a, b;
std::cin >> a >> b;
if((a*b)%2==1){
std::cout << "Odd";
}else{
std::cout << "Even";
}
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int n;
void Counting_Sort(int A[],int B[],int k){
int *C = new int[k+1];
for(int i=0;i<=k;i++)C[i]=0;
for(int j=1;j<=n;j++)C[A[j]] = C[A[j]] + 1;
for(int i=1;i<=k;i++)C[i]=C[i]+C[i-1];
for(int j=n;j>=1;j--){
B[C[A[j]]] = A[j];
C[A[j]] = C[A[j]]-... | 0 | 88,938,612 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a, b, k;
cin >> a >> b >> k;
if(k <=a){
cout << a-k << " " << b << endl;
} else {
cout << 0 << " " << max((long long)0,a+b-k) << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | 0 | 93,646,164 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.