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 long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include <stdio.h>
#include <stdlib.h>
#define MAX_N (100000L)
int main(int argc, char *argv[]) {
long N, as[MAX_N];
scanf("%ld", &N);
for (long i = 0; i < N; i++) {
scanf("%ld", &as[i]);
}
long xs[MAX_N];
long sum_a = 0, sum_i = N * (N + 1) / 2;
for (long i = 0; i < N; i++) {
sum_a += as[i];
}
... | 0 | 39,712,436 |
#include <bits/stdc++.h>
using namespace std;
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& a, T b) { if (a > b) { a = b; return true; } return false; }
int n;
const int MAX = 100100;
int calctime(string s) {
int hh, mm, ss... | #include<iostream>
using namespace std;
int main(void){
int i,a[3],tmp,b,c;
for(i=0;i<3;i++)cin>>a[i];
for(b=0;b<3;b++){
for(c=b+1;c<3;c++){
if(a[b]>a[c]){
tmp=a[b];
a[b]=a[c];
a[c]=tmp;
}
}
}
cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
return 0;
} | 0 | 3,511,823 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
const int mod = 1e9 + 7;
bool checked[1000010];
int main(){
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a1, b1, a2, b2, a3, b3;
cin >> a1 >> b1 >> a2 >> b2 >> a3 >> b3;
int town[4] = {};
town[a1 - 1]++, town[b1 - 1]++, town[a2 - 1]++, town[b2 - 1]++, town[a3 - 1]++, town[b3 - 1]++;
int one = 0, two = 0;
if (town[0] == 1) one++; if (town[0] == 2) t... | 0 | 29,258,038 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
string s, p, ans = "No";
int init;
cin >> s >> p;
init = s.length();
s.append(s);
for(int i=0; i<init; i++){
bool flag = true;
for(int j=0; j<p.length(); j++){
if(p[j] != s[j+i]){
flag = false;
break;
}
}
if... | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
long long n, i, k, j, a[100001] = {0}, s = 0, dp[100001] = {0}, sum[100001][2] = {0};
int main()
{
cin >> n >> k;
for(i = 0; i < n; i++)
{
cin >> a[i];
}
for(i = 0; i <= a[0]; i++)
{
sum[i][0] = 1 + i;
dp[i] = 1;
}
s = a[0];
for(i = a[0]... | 0 | 49,465,208 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
string a,b;
cin >> a >> b;
for (int i=0;i<max(a.length(),b.length());i++) {
if (a.length()>i) cout << a[i];
if (b.length()>i) cout << b[i];
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x,y,z,k;
cin >> x >> y >> z >> k;
vector<ll> a(x);
vector<ll> b(y);
vector<ll> c(z);
for(ll i = 0; i < x; i++) {
cin >> a[i... | 0 | 83,865,648 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int n, m;
map<string, int> ma;
cin >> n;
... | #include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <memory>
#include <string>
#include <map>
using namespace std;
#define MAX 1003
char A[MAX];
char B[MAX];
void print(){}
int DP[MAX][MAX];
int dp(int i,int j){
if(i<0||j<0) return 0;
if(DP[i][j]!=-1) return DP[i][j];
if(A... | 0 | 81,265,228 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using pll=pair<ll,ll>;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i,l,r) for(ll i = (l); i <= (ll)(r); i++)
#define rep3(i,l,r) for(ll i = (l); i >= (ll)(r); i--)
#define du... | #include<bits/stdc++.h>
using namespace std;
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; }
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <=... | 0 | 17,346,334 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1001001001;
int n, ans = INF;
int x, y, z;
vector<int> l;
void dfs(int cur, int A, int B, int C, int a, int b, int c) {
if(cur==n... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#define FILL(a, n, x) memset((a), (x), sizeof ((a)[0]) * (n))
#define COPY(a, n, b) memcpy((b), (a), sizeof ((a)[0]) * (n))
using namespace std;
const int mod = 1e9 + 7;
typedef long long li;
inline int Add(int x) { return x >= mo... | 0 | 94,960,088 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<functional>
#include<queue>
#include<map>
#include<limits>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<utility>
#include<complex>
#include<cstdlib>
#include<set>
#include<cctype>
#define DBG cerr << '!' << endl;
#define REP... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<int,int> P;
const LL mod=1000000007;
const LL LINF=1LL<<60;
const int ... | 0 | 37,522,078 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
string s = to_string(i);
int size = (int) s.size();
if (size % 2 == 1) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--... | 0 | 75,460,543 |
#include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
using namespace std;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef pair <int,int> pi;
typedef tuple <int,int,int> ti;
#define forn(i,a,n) for(int i = a; i < n ; i++)
#define mem(str,a) memset(str, a, sizeof(str));
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(nullptr)
con... | 0 | 21,532,556 |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int i = 1;
while(true)
{
if(N < i) break;
i *= 2;
}
cout << i / 2 << endl;
} | #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... | 0 | 88,493,188 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,x=0;
cin>>n;
ll a[n];
for(ll i=0;i<n;i++)
{
cin>>a[i];
a[i]-=i+1;
}
sort(a,a+n);
for(ll i=0;i<n;i++)
{
x+=abs(a[i]-(a[n/2]));
}
cout<<x;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#define REP(i,a) for (int i = 0;i < (a);++i)
#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 ALL(obj) (obj).begin(),(obj).end()
#define SORT(... | 0 | 21,073,215 |
#include <cstdio>
#include <algorithm>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
vector<P> t;
bool comp(P a,P b){
if(a.first > b.first) return true;
else if(a.first == b.first && a.second < b.second) return true;
return false;
}
int main(){
int n,h,m,s,ar,check;
while(scan... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
int main() {
int n, s;
while (cin >> n >> s, n) {
int cnt = 0;
for (int i = (1 << n) - 1; i < 1 << 10; i++) {
int use = 0, sum = 0;
for (int j = 0; i >> j; j++) {
if ((i >> j... | 0 | 50,434,455 |
#include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define vi vector<int>
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
const int N = 105;
int n, a[N];
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#defin... | 0 | 52,475,016 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
char a1, a2, a3;
char b1, b2, b3;
cin >> a1 >> a2 >> a3;
cin >> b1 >> b2 >> b3;
int ans = int(a1 == b1) + int(a2 == b2) + int(a3 == b3);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
#define vprint(x) for(auto a:(x)) cout << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll... | 0 | 16,501,222 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int,int>;
bool f(vector<int> nums, int sum, int i,vector<char> op)
{
if (i > 3)
{
if(sum == 7)
{
cout << nums.at(0) << op.at(1) << nums.at(1) << op.at(2)
<< nums.a... | 0 | 77,015,254 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll mini = min(n, m);
ll maxi = max(n, m);
ll ans;
if(mini==1) {
if(maxi==1) ans = 1;
else ans = maxi-2;
}
else ans = (mini-2)*(maxi-2);
cout << ans << "\n";
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | 0 | 13,888,583 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | #include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI acos(... | 0 | 61,324,604 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VE... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 0 | 24,361,890 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define all(a) (a).begin(), (a).end()
int main(){
int N;
cin >> N;
int count = 0;
for(int i = 1; i <= N; i++) if(to_string(i).size() % 2) count++;
cou... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define S... | 0 | 58,519,969 |
#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;
vector<int> A(N+1);
for(int i(1);i<=N;i++){
cin>>A[i];
}
vector<bool> used(N+1,0);
int cnt(0);
for(int i(1);i<=N;i++){
if(used[i] == fal... | #include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int>pi;
typedef pair<long long, long long>pl;
#define F first
#define S second
#define pb push_back
#define ... | 0 | 49,684,167 |
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const double PI = 3.14159265358979323846;
int map[16][16];
inline int get(int x, int y) {
if (map[x][y] == -1) {
return -1;
}
int r = 0;
if ((0 < x) && (map[x - 1][y] != -1)) {
r += map[x - 1][y];
}
if... | #include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <ioman... | 0 | 98,278,333 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long LL;
#define y0 Sword_Art_Online
#define y1 Your_lie_in_April
#define yn Darling_in_the_Franxx
#define tm Plastic_Memories
#define lr Charlotte
#define no... | 0 | 21,233 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n;
cin >> n;
ll d[n];
for(int i=0;i<n;i++)cin >> d[i];
ll s=0;
for(ll i=0;i<n-1;i++){
for(ll j=i+1;j<n;j++){
s+=d[i]*d[j];
}
}
cout << s << endl;
} | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <map>
const int MOD = 1e9+7;
typedef long long ll;
using namespace std;
ll dp[100001][2];
int main(){
string s;
cin >> s;
dp[0][0] = 1;
dp[0][1] = 2;
for (int... | 0 | 99,377,532 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define pb push_back
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int a, b;
cin >> a >> b;
cout << (a * b)/ (__gcd(a, b));
return 0;
} | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a... | 0 | 47,667,493 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
string a,b; cin >> a >> b;
bool equal = false;
if(a.size()<b.size()){
cout << "LESS" << endl;
return 0;
}
... | #include<iostream>
#define int long long
using namespace std;
const int maxn=200010;
int n;
int a[maxn];
signed main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
int ans=0;
int l=0,sum=0,yihuo=0;
for(int i=1;i<=n;i++)
{
while(l+1<=n && (yihuo^a[l+1])==(sum+a[l+1]))
... | 0 | 73,183,794 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 2e5 + 100;
int n, d[N];
int main() {
cin >> n;
for(int i = 1; i <= n; i++) {
int x; scanf("%d", &x);
d[x]++;
}
int ans = 0;
for(int i = 1; i <= 1e5; i++) {
d[i] += d[i-1];
if(d[i] == n/2) ans++;
... | #include <iostream>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <stack>
#include <math.h>
#include <algorithm>
#define ll long long
#define add push_back
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
i... | 0 | 79,128,116 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, int num=0){
if(num == 0) num = (int)v.size();
if(is_reverse) for(int i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(int i=0; i<num; i++){ cout<<v[i]; ... | 0 | 76,816,152 |
#include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a + b == 15){
cout<<("+")<<endl;
}
else if(a * b == 15){
cout<<("*")<<endl;
}
else{
cout<<("x")<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define l... | 0 | 72,700,698 |
#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 mp make_pair
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll i... | #include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll n,i,j;
cin>>n;
ll a[n];
for( i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
bool ok=1;
for( i=0;i<n-1;i++)
{
if(a[i]==a[i... | 0 | 4,049,278 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
int mx1, mx2, n1, n2;
mx1 = mx2 = 0;
n1 = n2 = 0;
rep(i,n) {
int a;
cin >> a;
if(a > mx1) {
... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
ll n, m, x;
void solve(){
cin>>n>>m>>x;
vector<vector<int>> vec(n, vector<int>(m+1));
for(int i = 0; i < n;... | 0 | 12,769,671 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, A[100001], L[100001];
int lis(){
L[0]=A[0];
int length=1;
for(int i=1; i<n; i++){
if(L[length-1]<A[i]){
L[length++]=A[i];
}else{
*lower_bound(L,L+length, A[i])=A[i];
}
}
return ... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,s,e) for (int i=s;i<(e);i++)
#define All(v) (v).begin(),(v).end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
using namespace std;
typedef long long llint;
typedef pair<int, int> P;
const int MOD = (int)1e9 + 7;
const int INF ... | 0 | 12,679,812 |
#include <bits/stdc++.h>
using namespace std;
int main( ){
int N;
int K;
int x;
x = 1;
cin >> N >> K;
for ( int i = 1; i <= N ; i++){
if( x*2-x > K){
x += K;
continue;
}
else {
x *= 2;
continue;
}
}
cout << x << endl;
} | #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 ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr<<" "<<(hoge)<<endl;
#define DBG cerr<<"!... | 0 | 75,065,396 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define vll vector... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Yen;
cin >> N >> Yen;
int a, b, c;
int r = 0;
for (int i = 0; i <= N; i++) {
if (Yen == 10000*i) {
if (N == i) {
a=i, b=0, c=0;
r++;
goto SKIP;
}
}
for (int j = 0; j <= N-i; j++) {
if (j == N-i) {... | 0 | 62,073,883 |
#include<iostream>
using namespace std;
const int BUF = 6;
int row, col, nRemain;
string b[BUF];
void read() {
cin >> row >> col >> nRemain;
for (int i = 0; i < row; ++i) {
cin >> b[i];
}
}
void work() {
int ans = 0;
for (int rMask = 0; rMask < (1 << row); ++rMask) {
for (int cMask =... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(int... | 0 | 35,988,663 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
int main(int argc,char* argv[]){
int dis[101],flag[101];
vector<queue<int> > vec(101);
int n,id,cnt,x,val=0;
memset(dis,255,sizeof(dis));
memset(flag,0,sizeof(flag));
cin>>n;
for(int i=0;i<n;i++){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
void solution(){
ll n,r;
cin>>n>>r;
if(n < 10)
cout<<r+(100*(10-n))<<'\n';
else
cout<<r<<'\n';
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
s... | 0 | 12,005,844 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
const double PI = acos(-1.0);
const long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
int n,m,a[10][10];
cin >> n >> m;
for... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
ll n,m;
cin>>n>>m;
set<int> broken;
for (int i = 0; i < m; ++i)
{
int tmp;
cin>>tmp;
broken.insert(tmp);
}
vector<ll> pattern(n+1);
pattern[0]=1;
pattern[1]=
(broken.find(1)!=broken.en... | 0 | 9,666,028 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
typedef vector<char> vc;
typedef vector <vc> vvc;
typedef vector <vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector <int> vi... | 0 | 21,753,912 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <iostream>
using namespace std;
int main(void)
{
int x;
int i=0;
while (1)
{
cin >> x;
if (x == 0)break;
cout << "Case " << i+1 << ":" << " " << x << endl;
i++;
}
return 0;
} | 0 | 67,398,613 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
#define MAX 30
signed main(){
int n;
ll k;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define rep(i,N) for(ll i=0;i<(N);i++... | 0 | 51,290,206 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int x,y;cin>>x>>y;
int ans=abs(abs(x)-abs(y));
if(abs(x)>abs(y))ans+=(x>0?1:0)+(y>0?1:0);
else if(abs(x)<abs(y))ans+=(x<0?1:0)+(y<0?1:0);
else ans++;
cout<<ans<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline void write(ll x)
{
char F[200];
int tmp = x > 0 ? x : -x;
if (x < 0)
putchar('-');
int cnt = 0;
while (tmp > 0) {
F[cnt++] = tmp % 10 + '0';
tmp /= 10;
}
while (cnt > 0)
putchar(F[--cnt... | 0 | 78,278,556 |
#include<bits/stdc++.h>
#define test int t; cin>>t; while(t--)
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
typedef long long ll;
using namespace std;
int main()
{
long long a,b,c;
cin>>a>>b>>c;
if(a+b>=c) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <iostream>
#include <queue>
using namespace std;
const int N = 1000;
char grid[N][N];
int w, h, n;
int d[N][N];
const int direct[4][2] = {
{ -1, 0 },
{ 1, 0 },
{ 0, -1 },
{ 0, 1 },
};
int factory[10][2];
typedef pair<int, int> P;
int bfs(const int& sx, const int& sy, const int& gx, const int& g... | 0 | 9,840,730 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,x;
scanf("%d %d %d",&a,&b,&x);
if((a+b) < x)
printf("NO");
else if(a>x)
printf("NO");
else
printf("YES");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
vector<long long>v;
int f(int x)
{
int ans=0;
for(int i=1;i<=100;i++)
{
ans+=i;
if(ans>x)
{
return i-1;
}
}
}
int main()
{
int ans=0;
long long x;
cin>>x;if(x==1)
{
cout<<"0"<<endl;
return 0;
}
for(int i=2;i<=sqrt(x);i++)
{
... | 0 | 28,145,113 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> d(n);
for(int i=0;i<k;i++){
int s;
cin>>s;
for(int j=0;j<s;j++){
int a;
cin>>a;
d[a-1]=1;
}
}
int ans=0;
for(int i=0;i<n;i++){
if(d[i]==0){
ans++;
}
}
cout<<ans<<end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
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; ret... | 0 | 10,025,231 |
#include <bits/stdc++.h>
using namespace std;
map<int,int> m;
map<int,int> mp;
int main(){
int N;
cin >> N;
for(int i=0;i<N;i++){
int A;
cin >> A;
A--;
if(m.find(A)!=m.end())m[A]++;
else m.insert(make_pair(A,1));
}
for(auto it=m.begin();it!=m.end();it++){
int B=it->second;
if(mp.find(B)!=mp.end())mp[... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | 0 | 9,843,054 |
#include <stdio.h>
#include <math.h>
int main(){
double a,b,c;
double d , h, ang;
double PI=acos(-1);
scanf("%lf%lf%lf",&a,&b,&c);
ang=c/180*PI;
h = b * sin(ang);
d = sqrt(pow(a,2) + pow(b,2) - 2 * a * b * cos(ang));
printf("%f\n", a * h / 2);
printf("%f\n",a + b + d);
printf("%f\n",h);
return 0;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a.at(i);
a.at(i) -= i+1;
}
sort(a.begin(), a.end());
ll ans=pow(10,18);
int s;
s=a.at(n/2);
ll cnt=0;
for(int i=0; ... | 0 | 56,897,338 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define scan(argument) cin... | #include <iostream>
void countingSort(int *A, int *B, int k, int n){
int i;
int *C;
C = new int[k+1];
for(i=0;i<k+1;i++){
C[i] = 0;
}
for(i=0;i<n;i++){
C[A[i]]++;
}
for(i=1;i<k+1;i++){
C[i] = C[i] + C[i-1];
}
for(i=n-1;i>=0;i--){
B[C[A[i]]-1] = A[i... | 0 | 3,238,967 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
#define REP(i,s,e) for(int i=(s); i<(e);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n)
#define repe(i,n) for(auto &&i:n)
#define all(v) (v).begin(),(v).end()
#define decimal fixed<<setprecision(20)
#define fastcin() cin.tie(0);ios::sync_with_stdio(false)
using LL = long long;
usi... | 0 | 37,638,199 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
char X,Y;
cin >> X >> Y;
if((int)X > (int)Y){
cout << ">" <<endl;
}
else if((int)X == (int)Y){
cout << "=" <<endl;
}
else{
cout << "<" <<endl;
}
} | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long LL;
LL n;
int main()
{
bool tf=true;
LL ans=0,lalal=(1<<30);
scanf("%lld",&n);
for (LL u=1;u<=n;u++)
{
LL a,b;
scanf("%lld%lld",&a,&b);
if (a!=b) tf=false;
... | 0 | 97,723,847 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using... | #include<iostream>
using namespace std;
int main(){
double p[4][2];
while(cin>>p[0][0]>>p[0][1]){
for(int i=1; i<4; i++)
for(int j=0; j<2; j++)
cin >>p[i][j];
for(int i=1; i<4; i++)
for(int j=0; j<2; j++)
p[i][j]-=p[0][j];
double det,im[2][2],s[2];
det = p[1][0]*p[2][1]-p[1][1]*p[2][0]... | 0 | 67,586,983 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N;
long long A[100000];
vector<pair<int, int> > adj[100000];
long long edge_label[100000];
bool visited[100000], visited2[100000];
long long make_edge_label(int now){
visited[now] = true;
long long ret = 0;
for(int i = 0; i < a... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
long long max(int a, int b){
if(a>=b) return a;
else return b;
}
long long min(int a, int b){
if(a<=b) return a;
else return b;
}
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i... | 0 | 16,887,186 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define fastio \
std::ios::sync_with_stdio(false); \
std::cin.tie(NULL);
#define pb push_back
#define mp make_pair
typedef long long ll;
using namespace std;
int main()
{
fastio;
int n, k;
cin>>n>>k;
if((n-1)%(k-1)==0)
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using Graph=vector<vector<int>>;
vector<int> cnt;
void dfs(Graph& G, int v, int p){
for(auto nv:G[v]){
if(nv==p) continue;
cnt[nv]+=cnt[v];
dfs(G,nv,v);
}
}
int main(){
int n,q;
cin>>n>>q;
Graph G(n)... | 0 | 86,825,005 |
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define pf push_front
#define F first
#define S second
#define ll long long
#define f(i) return cout<<i<<"\n",0;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long long unsigned llu;
typedef pair<long long, long long> pll;
const long long inf = 2000000000000000000LL;
#define pi acos(-1.0)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);c... | 0 | 38,406,013 |
#include <iostream>
#include <map>
using namespace std;
int main(){
long long n, k;
cin >> n >> k;
long long a, b, tmp=0;
map<long long,long long>mp;
for(int i=0; i<n; i++){
cin >> a >> b;
mp[a] += b;
}
for(auto itr = mp.begin(); itr != mp.end(); ++itr){
tmp += itr->s... | #include<iostream>
using namespace std;
int main()
{
long long n, p = 1;
cin >> n;
long long a[n];
for(int i = 0; i < n; i++)
{
cin >> a[i];
if(a[i] == 0)
{
cout << 0;
return 0;
}
}
for(int i = 0; i < n; i++)
{
if(a[i] <= 10... | 0 | 38,251,222 |
#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) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
const ll ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> V(H+1, vector<char>(W+1));
for(int i = 1; i <= H; ++i){
for(int j = 1; j <= W; ++j){
cin >> V[i][j];
}
}
for(int i = 1; i <= H; ++i){
for(int j = 1; j <= W; ... | 0 | 69,878,861 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int (i) = (a); (i) < (b); ++(i))
#define per(i, a, b) for (int (i) = (a); (i) >= (b); --(i))
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define ff first
#define ss second
#define sz(x) ((int) x.size())
#... | #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 | 51,169,648 |
#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... | #include <iostream>
#include <cmath>
using namespace std;
void koch(double x0, double y0, double x1, double y1, int n){
if(n == 0){
cout << x0 << " " << y0 << endl;
} else {
double x01 = x0 + (x1-x0)/3;
double y01 = y0 + (y1-y0)/3;
double x02 = x0 + (x1-x0)/2 - (y1-y0)*sqrt(3)/6;
double y02 = y0... | 0 | 2,829,639 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int sum=a+(b/2);
cout<<sum<<endl;
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
#include <iomanip>
#include<math.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll h,w,i,j,k;
cin>>h>>w;
char s[h][w];
ll dp[h][w];
for(i=0;i<... | 0 | 32,441,895 |
#include <bits/stdc++.h>
using namespace std;
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vector<vector<t>>;
typedef long long ll;
typedef vc<int> vi;
typedef vvc<int> vvi;
typedef pair<int, int> pi;
#define endl "\n"
#define k first
#define v second
#define pb push_back
#define mp make_pair... | #include<bits/stdc++.h>
using namespace std;
int main() {
string S;
long long K;
cin >> S >> K;
for (long long i=0; i<K; i++) {
if (S.at(i)!='1') {
cout << S.at(i);
return 0;
}
}
cout << "1\n";
} | 0 | 36,620,146 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(),... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define pb push_back
#define ull unsigned long long
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define mat vector<vector<ll>>
mat cn(ll n, ll m){return v... | 0 | 13,411,354 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
dunk(n / 3);
return 0;
} | #define ll long long int
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M = 1000001;
int i,j,ct;
int w=0,x;
vector<int> c(M,0);
cin >> N;
for(i=0;i<N;i++){
cin >> x;
c[x] = 1;
w = gcd(w,x);
}
if (w>1){
cout << "not coprime" << endl;
return 0;
}
for(i=2;i<M;i++){
... | 0 | 21,551,419 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
string rt(string s){
string n = s.substr(s.length()-1);
n.append(s, 0, s.length()-1);
return n;
}
int main(){
string s, t;
cin >> s >> t;
for(int i=0; i<=s.leng... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>t(N+1);
vector<int>x(N+1);
vector<int>y(N+1);
for(int i = 1; i <= N; i++) {
cin >> t[i] >> x[i] >> y[i];
if(t[i]-t[i-1] < abs(x[i]-x[i-1])+abs(y[i]-y[i-1])) {
cout << "No" << endl;
... | 0 | 15,643,425 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
int main()
{
int n,x;
cin >> n >> x;
int a[n+1];
rep(i,n) cin >> a[i];
a[n] = x;
sort(a,a+(n+1));
int dist[... | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int,int>
using namespace std;
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= ... | 0 | 25,844,844 |
#include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
#define print_vec(vec) for(int i=0;i<sz(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | 0 | 10,136,867 |
#include <iostream>
using namespace std;
int main()
{
string S;
cin >> S;
int count = 0;
for(int i = 0; i < S.size(); i++) {
if(S[i] == 'o') {
count += 1;
}
}
if(((15-S.size()) + count) >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,r;
ll memo[8];
ll dist[222][222];
int main(){
cin >> n >> m >> r;
for(ll i=0;i<r;i++) cin >> memo[i];
sort(memo,memo+r);
for(ll i=1;i<=n;i++){
for(ll j=1;j<=n;j++){
if(i!=j) dist[i][j]=1e9;
}
}
... | 0 | 29,509,763 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main()
{
int n; cin>>n;
int a[n+9];
for(int i=0; i<n; i++) cin>>a[i];
vector<int> dp(n+9, INT_MAX);
dp[0]=0;
if(n==1)
{
cout<<dp[0]<<endl;
return 0;
}
dp[1]= abs(a[0]-a[1]);
if(n==2)
{
cout<<dp[1]<<endl... | #include<iostream>
using namespace std;
int main(){
int a,b,x;
cin>>a>>b>>x;
if(x<a)
{
cout<<"NO"<<endl;
}
else
{
x-=a;
if(b>x){
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
}
} | 0 | 72,792,233 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair < ll, ll > PLL;
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll MOD = 1e9+7;
int main() {
string s;
cin >> s;
int l = 0;
int r = s.length()-1;
bool ok = true;
int cnt = 0;
while (l <=... | #include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, i... | 0 | 36,494,946 |
#include <iostream>
using namespace std;
int main()
{
int n, m, p;
while (cin >> n >> m >> p, n + m + p)
{
int winner = 0;
int total = 0;
for (int i = 1; i <= n; i++)
{
int tmp;
cin >> tmp;
total += tmp * 100;
if (i == m) winner = tmp;
}
if (winner == 0)
cout << 0 << endl;
else
cout <... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W, M;
cin >> H >> W >> M;
vector<int> rows(H, 0);
vector<int> cols(W, 0);
set<pair<int, int> > st;
for (int i=0; i<M; i++)
{
int h, w;
cin >> h >> w;
h--;
w--;
rows[h]++;
cols[w]... | 0 | 52,749,874 |
#include <iostream>
#include <string>
using namespace std;
int panjang,pnjg;
string s;
string t;
string u;
int main(){
cin>>s;
panjang=s.length();
for(int i=panjang-1;i>=0;i--){
s.erase(i,1);
pnjg=s.length();
if(pnjg%2==0){
t=s.substr(0,pnjg/2);
u=s.substr(pnjg/2,pnjg-1);
if(t==u){
i=-1;
cout<... | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 0 | 54,225,305 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mxn= 5e5+5;
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main(){
rishabh();
int n;
cin>>n;
... | #include<iostream>
int main()
{
int k,s,x,y,z,ans=0;
std::cin>>k>>s;
for(x=0;x<=k;x++){
for(y=0;y<=k;y++){
for(z=0;z<=k;z++){
if(x+y+z==s)ans++;
}
}
}
std::cout<<ans<<std::endl;
} | 0 | 39,607,063 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); ++... | 0 | 8,832,331 |
#include <bits/stdc++.h>
using namespace std;
signed main () {
int n, x;
cin >> n;
map < int64_t, int > cnt;
++cnt[0];
int64_t ans = 0, p = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
p += x;
ans += cnt[p];
++cnt[p];
}
cout << ans << '\n';
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n;
cin... | 0 | 93,602,894 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main()
{
int N;
cin >> N;
vector<int> T( N );
for( int i = 0; i < N; i++ ) {
cin >> T[i];
}
vector<int> A( N );
for( int i = 0; i < N; i++ ) {
cin >> A[i];
}
if( T[N - 1] != A[0] ) {
cout << 0 << endl;
return 0;
}
vector<int> t(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int h,w,k; cin >> h >> w >> k;
vector<vector<char>> c(h);
rep(i,h)rep(j,w){
char ch; cin >> ch;
c[i].push_back(ch);
}
auto check=[&](int i,int j){
int cnt=0;
for(int x=0;x<h;x++){
for(int y=0;... | 0 | 100,081,441 |
#include <iostream>
#include <cstdio>
int main() {
int h, w = 0;
while(true) {
std::cin >> h >> w;
if(!h && !w) break;
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
printf("#");
}
printf("\n");
}
prin... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define N 100005
#define MOD 1000000007
#define dd double
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep1(i,b) for(int i=1;i<=b;i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#de... | 0 | 18,400,936 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
using namespace std;
long long gcd(long long a,long long b){
if(b == 0) return a;
return gcd(b,a%b);
}
int main(){
long long int a,b;
cin >> a >> b;
cout <<3*(a-gcd(a,b)) << endl;
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
typedef struct list{
int key;
list *prev,*next;
}list;
list *nil;
void Insert(int num){
list *tmp = new list;
tmp->key = num;
tmp->next = nil->next;
tmp->prev = nil;
tmp->next->prev = tmp ;
nil->next = tmp;
}
void Delete(list *p){
p->prev->next = p->next;
p... | 0 | 33,402,812 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #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 | 30,360,299 |
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<ll, ll>;
const int INF = 0x3f3f3f3f;
int main() {
int k, x;
cin >> k >> x;
if (k * 500 < x)
cout << "No" <<... | #include <iostream>
using namespace std;
int main() {
int N;
long double x[4],y[4];
cin>>N;
while(N--){
for(int i=0;i<4;i++) cin>>x[i]>>y[i];
long double y1=y[1]-y[0]; long double x1=x[1]-x[0];
long double y2=y[3]-y[2]; long double x2=x[3]-x[2];
if(y1*x2==y2*x1) cout<<"YE... | 0 | 95,334,129 |
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
string isTriangle(int a[3]);
int main(){
int n;
int a[3];
cin >> n;
for(int i=0;i<n;++i){
cin >> a[0] >> a[1] >> a[2];
cout << isTriangle(a) << endl;
}
}
string isTriangle(int a[3]){
sort(a, a+3, g... | #define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) ... | 0 | 19,131,930 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
double x,sum=0;
string u;
cin>>n;
for(int i=1;i<=n;i++){
cin>>x>>u;
if(u=="JPY"){
sum+=x;
}
else if(u=="BTC"){
sum+=(x*380000.0);
}
}
cout<<sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
ll ans = 0;
vector<int> r;
vector<int> g;
vector<int> b;
for (int i = 0; i < n; i++){
if ( s[i] == 'R' ) r.push_back(i);
if ( s[i] == 'G' ) g.push_back(i);
if ( s[i] == 'B'... | 0 | 52,421,698 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
double calcSide(double a, double b, double l, double m){
double side;
double x, y;
x = fabs(l - a);
y = fabs(m - b);
side = sqrt(x * x + y * y);
return side;
}
double calcArea(double AB, double AC, double BC){
d... | #include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define ... | 0 | 28,080,987 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
struct ... | 0 | 53,886,941 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
int N;
ll L,T;
ll X[101010],W[101010],ans[101010];
int main(){
cin>>N>>L>>T;
int id=-1;
L*=2;
T*=2;
rep(i,N){
cin>>X[i]>>W[i];
X[i]*=2;
if(W[i]==1&&id==-1) id=i;
}... | 0 | 8,698,443 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
vector<pair<int, int> > adj[k];
int dist1, dist2, weight;
for (int i = 0; i < k; i++) {
dist1 = (i * 10) % k;
weight = 0;
if ( dist1 != i ) {
adj[i].push_back(make_pair(dist1, weight));
}
dist2 = (i + 1) % k;... | 0 | 57,813,718 |
/*https:
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long a, b, c, d, e, f, k;
cin >> a >> b >> c >> k;
if (a == b && a == c)
{
cout << "0";
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n; cin >> n;
ll sum = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sum -= a[0];
ll ans = abs(sum - a[0])... | 0 | 98,261,170 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main(void)
{
int N, M;
cin >> N >> M;
vector<int> stair(N+1, 1);
for (int i = 0; i < M; i++)
{
int pos;
cin >> pos;
stair[pos] = 0;
}
vector<ll> dp(N+1, 0);
dp[0] = 1;
... | #include <bits/stdc++.h>
#define fast \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e3 + 77;
int32_t main()
{
fast;
int n;
cin >> n;
int ans = 0, a = 0, b = 0, c =... | 0 | 14,942,194 |
#include <bits/stdc++.h>
int n;
std::vector<std::pair<long long, int>> a;
bool possible(const int);
bool adjust(std::vector<std::pair<long long, int>>&, const int);
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
long long tmp;
scanf("%lld", &tmp);
if (!i || a.back().first != tmp)
a.push_back({t... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
typedef long long ll ;
const ll MOD = 1000000007;
ll dp[2100][2100];
ll sum[2100][2100];
int main() {
int N,M;
cin >> N >> M;
vector< int > S(N+3),T(M+3);
REP(i,N) cin >> S[i];
REP(i,M) cin >> T[i];
dp[0][0] = 1;
sum[0][... | 0 | 56,403,079 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, m, a, x, y, t, M = 1e9 + 7, Z = 1e9;
int main()
{
ll i;
cin >> n >> m;
for (i = 1; i<= n; i++) {
scanf("%lld",&a);
a = a + Z;
x = (x + a * (i - 1)) % M;
t = (a * (n - i)) % M;
x = (x - t + M) % M;
}
for (i = 1; i<= m; ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int h, w;
cin >> h >> w;
vector<string> v(h);
for(int i=0; i<h; i++) cin >> v[i];
vector<bool> tate(h, false);
vector<bool> yoko(w, false);
for(int i=0; i<h; i++) {
for(int j=0; j<w; j++) {
if... | 0 | 11,384,608 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int N,M; cin>>N>>M;
vector<int> wa(N,0);
int ac=0;
int pena=0;
for (int i = 0; i < M; i++){
int p;cin>>p;p--;
string s;cin>>s;
if(wa[p]>=0){
if(s=="AC"){
... | #include <bits/stdc++.h>
using namespace std;
#define fast() ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define lp(i, n) for(int i = 0; i < n; i++)
#define rlp(i, n) for(int i = n-1; i >= 0; i--)
#define loop(i, a, b) for(int i = a; i <= b; i++)
#define rloop(i, a, b) for(int i = a; i >= b; i--)
#define m... | 0 | 16,621,659 |
#include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for(int (i)=0; (i)<(n); (i)++)
#define REP2(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1,) (__VA_ARGS__)
#define MOD 1000000007
template <class T> ostream& ope... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int n;
vector<int> bmb;
int a, b, c;
int ans;
void dfs(vector<int> &A){
if(A.size() == n){
int len_a = 0, len_b = 0, len_c = 0;
int cnt = 0;
for(int i = 0; i < n; i++){
if(A[i] == 0){
... | 0 | 7,185,087 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL<<60;
const double eps = 1e-9;
int main()
{
int n;
cin >> n;
map<int, int> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a[x]++;
}
int tmp = int(a.size());
... | #include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> array(n),parray(n),qarray(n);
for(int i=0;i<n;i++) cin >> parray.at(i);
for(int i=0;i<n;i++) cin >> qarray.at(i);
int num = 1;
for(int i=0;i<n;i++){
ar... | 0 | 23,335,113 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
int n,k;
cin>>n>>k;
int a[n];
map<int,int>m;
rep(i,n){
cin>>a[i];
m[a[i]]++;
}
vector<pair<int,int>>x;
for(auto i:m){
x.push_back(make_pair(i.second,i.first));
}
sort(x.begin(),x.end());
int ans=0,q=... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;... | 0 | 16,686,170 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
string S, T;
int main() {
cin >> S >> T;
vector<string> v;
for (int i = 0; i < S.size(); i++) {
bool jud... | 0 | 54,361,815 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | #include <cstdio>
#include <bitset>
#include <cmath>
#include <complex>
#include <vector>
#include <algorithm>
#include <stack>
#include <iostream>
#define EPS 1e-6
using namespace std;
typedef complex<double> coor;
double cross(coor a, coor b)
{
return a.real() * b.imag() - a.imag() * b.real();
}
double dot(coor a, ... | 0 | 40,149,422 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n, taro=0, hanako=0;
cin >> n;
for (int i = 0;i < n;i++) {
string a1, a2;
cin >> a1 >> a2;
if (a1 == a2) {
taro++;
hanako++;
}
else if (a1 > a2) {
taro += 3;
}
else
{
hanako += 3;
}
}
cout << taro << " " << ha... | #include <bits/stdc++.h>
using namespace std;
int main (){
int n;
cin >> n;
int A[n];
int B[n];
int C[n];
for(int i=0;i<n;i++){
int a,b,c;
cin >> a >> b >> c;
A[i] = a;
B[i] = b;
C[i] = c;
}
int a_happiness[n];
int b_happiness[n];
int c_hap... | 0 | 50,435,924 |
#include <bits/stdc++.h>
using namespace std;
using ll= long long;
using vi = vector<int>;
using vl= vector<ll>;
using vs=vector<string>;
ll gcd(ll a, ll b) { if (a == 0) return b; return gcd(b % a, a);}
ll max(ll a, ll b) {if (a > b) return a; else return b;}
ll min(ll a, ll b) {if (a < b) return a; else return b;}
ll... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | 0 | 2,822,604 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
#define mp(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
usi... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
const int INF=1e9;
int main(){
string s;cin>>s;
vector<bool> used(26,false);
for(int i=0;i<(int)s.size();i++){
... | 0 | 84,960,624 |
#include <bits/stdc++.h>
int main(int, char**) {
char c;
std::cin >> c;
if (c=='a' || c=='i' || c=='u'||c=='e'||c=='o') {
std::cout << "vowel" << std::endl;
} else {
std::cout << "consonant" << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int vec[n+2];
vec[0]=0,vec[n+1]=0;
for(int i=1;i<=n;i++){
cin>>vec[i];
}
int ans=0;
for(int t=0;t<5000;t++){
for(int i=0;i<n+2;i++){
if(vec[i]!=0){
while(vec[i]!=0){
vec[i]--;
i++;
... | 0 | 87,860,076 |
#include <iostream>
using namespace std;
int r(int n, int max, int s){
int sum = 0;
if(n == 1){
if(max <= s && s <= 9) return 1;
return 0;
}
for(int i = max; i <= 9; i++){
sum += r(n-1, i+1, s-i);
}
return sum;
}
int main(){
int n, s;
while(cin >> n >> s){
... | #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) ... | 0 | 17,271,485 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include<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... | 0 | 95,510,188 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.