code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
#include <utility>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long lint;
class nCk {
public:
nCk(int N)
: mod(1000*1000*1000+7)
, ps(N+1)
, rps(N+1)
{
ps[0] = rps[0] = 1;
for (int i = 1; i <= N; i++) {
ps[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
pair<ll,ll> solve(ll digit, ll num)
{
vector<ll> tmp;
ll ans = 0;
while(num > 1){
if(num%2){
tmp.push_back(digit);
--num;
if... | 0 | 33,408,538 |
#include <iostream>
#include <vector>
#include <algorithm>
struct Weighted_Union_Find {
std::vector<int> par;
std::vector<int> rank;
std::vector<long long> wdiff;
void init( int n ) {
par.resize( n );
rank.resize( n );
wdiff.resize( n );
for ( int i = 0; i < n; ++i ) {
... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | 0 | 87,092,424 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long n;
cin >> n;
printf("%ld\n", (long) (n-1)*(n)/2);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int h, w, k;
cin >> h >> w >> k;
string s[h];
rep(i, h) cin >> s[i];
int ans = 0;
for(int i=0; i < (1<<h+w); i++)
{
int cnt = 0;
bitset<12> b(i);
for(int j=... | 0 | 67,534,720 |
#include<iostream>
using namespace std;
int main() {
int a, b[] = { 500,100,50,10,5,1 }, ruio = 0;
cin >> a;
while (a != 0) {
a = 1000 - a;
for (int i = 0; i < 5; i++) {
ruio += a / b[i];
a = a%b[i];
}
cout << ruio+a << endl;
cin >> a;
ruio = 0;
}
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin()... | 0 | 29,226,924 |
#include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
int k, n;
cin>>k>>n;
vector<int> vec(n);
for(int i = 0; i< n; i++)
cin>>vec[i];
... | 0 | 98,318,631 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
void func()
{
int A,B;
cin >> A >>B;
int minB,maxB;
minB = B * 10;
maxB = (B+1) * 10;
for(int i= minB; i< maxB; i++)
{
if ((int)(i * 0.08) == ... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 97,565,680 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1,0, 1, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h, w;
cin >> h >> w;
vector<vector<bool> > s(h, vector<bool>(w, false));
REP(i,... | #include <iostream>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <math.h>
using namespace std;
void check(int w, int h, int x, int y, int map[20][20], int *ans){
if(map[x][y] != 0) *ans = *ans + 1;
if(map[x][y] == 0) return;
map[x][y] = 0;
if(x > 0) check(w,... | 0 | 56,413,020 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge
{
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
#de... | 0 | 39,504,096 |
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,k,mx;
while(cin>>n>>k,n){
int a[100000]={0},b[100000]={0};
rep(i,n)cin>>a[i]; rep(i,k)b[0]+=a[i]; mx=b[0];
rep(i,n-k)b[i+1]=b[i]+a[i+k]-a[i],mx=mx>b[i+1]?mx:b[i+1];
cout<<mx<<endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void rotation_N(int* dise){
int tmp[6];
tmp[0] = dise[1];
tmp[1] = dise[5];
tmp[2] = dise[2];
tmp[3] = dise[3];
tmp[4] = dise[0];
tmp[5] = dise[4];
for(int i = 0; i < 6; i++){
dise[i] = tmp[i];
}
}
void rotatio... | 0 | 47,375,901 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
ll n, m;
ll a[2005], b[2005];
ll dp[2005][2005], sum[2005][2005];
int main() {
cin.tie(0);
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 83,473,244 |
#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;}
cons... | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define vi vector<int>
#define vll vector<ll>
#d... | 0 | 77,048,342 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int dp[1001][1001];
int main() {
int q; scanf("%d", &q);
rep(i, q) {
string x, y; cin >> x >> y;
rep(i, x.size())rep(j, y.size()) {
if (x[i] == y[j])dp[i + 1][j + 1] = dp[i][j] + 1;
else dp[i + 1][j + 1] = max(dp[i][j + 1], dp... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define INF LLONG_MAX
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp... | 0 | 41,511,794 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int gcd(int a, int b){
if(b == 0) return a;
else return gcd(b, a % b);
}
void testCase(){
int n; cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
map<int, int> mp;
int pair = 1;
for(int i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,ll> P;
typedef tuple<int,int,int> TP;
constexpr int INF = 2e9;
ll gcd(ll a, ll b){
if(b == 0)return a;
return gcd(b,a%b);
}
ll lcm... | 0 | 30,718,725 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
ll gcd(ll a, ll b)
{
if (a < b)
{
return gcd(b, a);
}
while (b != 0)
{
ll tmp = b;
b = a % b;
a = tmp;
}
return a;
}
struct Data
{
int... | 0 | 92,961,795 |
#include<iostream>
using namespace std;
int main() {
int w, h, x, y, r,up,right,down,left;
cin >> w >> h >> x >> y >> r;
left = x - r;
right = x + r;
up = y + r;
down = y - r;
if (left < 0) {
cout << "No" << endl;
}
else if(right > w) {
cout << "No" << endl;
}
else if (up > h) {
cout << "No" << endl;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define r... | 0 | 94,973,920 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string A,B;
cin >> A >> B;
if (A[0] > B[0]) {
for (int n = 0 ;n<A[0]-'0';++n) {
cout << B;
}
}
else {
for (int n = 0; n < B[0]-'0'; ++n) {
cout << A;
}
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define FOREACH(i, c) for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define FOR(i, a, n) for (int i = (a); i < (int)(n); ++i)
#define FORE(i, a, n) f... | 0 | 4,759,438 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #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... | 0 | 92,085,197 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,k;string s;
cin>>n>>k>>s;
vector<int> a;
a.push_back(0);
int c=1;
for (int i=0;i<n;i++) {
if (i==n-1)
a.push_back(a.back()+c);
else if (s[i]==s[i+1])
c++;
else {... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 60,856,510 |
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n; cin >> n;
int d,x; cin >> d >> x;
vector<int> a(n) ;
for(int i = 0;i < n; i++) cin >> a[i];
vector<int> c(n) ;
int sum = 0;
int ans = 0;
for(int i = 0; i < n; i++){
c[i]= ((d ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"... | 0 | 23,792,549 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
ll modpow(ll a, ll n, ll mo... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 52,986,977 |
#include<iostream>
#define ll long long
using namespace std;
ll gcd(ll a, ll b){
if(b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b){
ll ans = a*b/gcd(a,b);
return ans;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll a,b;
cin >> a >> b;
cout << lcm(a,b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 0 | 22,008,637 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using graph = vector<vector<int>>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using pll = pair<ll, ll>;
int main() {
ll n; cin>>n;
vector<pll> v(n);
rep(i,n){cin>>v[i].first>>v[i].second;}
ll ans=0;
for(int i=n-1; i>=0; i--){
ll... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >... | 0 | 20,815,644 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c ,d;
cin >> a >> b >> c >> d;
if (a+b == c+d){
cout << "Balanced";
}
else if (a+b<=c+d){
cout << "Right";
}
else if (a+b>=c+d){
cout << "Left";
}
} | #include <iostream>
#include <stack>
#include <string>
using namespace std;
const int maxn = 1e5 + 10;
stack<bool> s;
string a;
int main() {
int ans = 0;
cin >> a;
int n = a.size();
for (int i = 0; i < n; i++) {
if (s.empty()) s.push(a[i] - '0');
else if (a[i] - '0' != s.top()) {
... | 0 | 28,657,122 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long ret = 0;
while (true) {
bool flag = false;
for (int i = 0; i < n; i++) {
if (a[i] >= n) {
... | 0 | 62,248,946 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int l1, l2, r1, r2;
cin >> l1 >> l2 >> r1 >> r2;
if ((l1 + l2) > (r1 + r2))
cout << "Left" << endl;
else if ((l1 + l2) < (r1 + r2))
cout << "Right" << endl;
else
cout << "Balanced" << endl;
return 0;
} | #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<ll> A(N),B(N);
for(int i(0);i<N;i++) cin>>A[i];
for(int i(0);i<N;i++) cin>>B[i];
ll suma(0),sumb(0);
for(int i(0);i<N;i++){
suma += A[i... | 0 | 91,851,250 |
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define MAX 1000001
ll prime[MAX];
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define gcd __gcd
ll rec(vector<vector<ll> >&... | 0 | 64,457,134 |
#include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) ... | 0 | 93,973,398 |
#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;
typedef vector<vector<int>> Graph;
ll n,m,x,y;
Graph G(n);
ll p[100010];
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for(int i = 0; i < N; i++... | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> X;
vector<int> Y;
for(;;){
int x, y;
cin >> x >> y;
if(x == 0 && y == 0) break;
X.push_back(x);
Y.push_back(y);
}
for(int i = 0; i < X.size(); i++){
int x = X.at(i), y = Y.at(i);
... | 0 | 66,116,369 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main(){
int n; cin >> n;
vector<string> S(n);
rep(i,n){
string s; cin >> s;
S[i] = s;
}
map<char,int> mp;
for(char c = 'a';c<='z';c++){
... | 0 | 52,867,274 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int N, M, i, A, B, A_top, B_top;
cin >> N >> M;
vector<long long int> group(N + 1);
for (i = 1; i <= N; i++)
{
group[i] = 1;
}
for (i = 0; i < M; i++)
{
cin >> A >> B;
A_top = A;
B_top =... | #include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); (i)--)
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<int> a(n); rep(i, n) cin >> a[i];
a.push... | 0 | 96,580,887 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int mario[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin>>k;
cout<<mario[k-1];
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
int n,d;
cin >> n >> d;
int x[n][d];
for(int i=0;i<n;i++){
for(int j=0;j<d;j++){
cin >> x[i][j];
}
}
int ans = 0;
for(int i=0;i<n-1;i++){
int wa = 0;
for(int j=i+1;j<n;j++){
wa = 0;
for(int k=0;k<d;k++){
wa += (x[i... | 0 | 92,584,452 |
#include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
while (true) {
int m, f, r; cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
char ans;
if (m == -1 || f == -1) ans = 'F';
else if (m + f >= 80) ans = 'A';
else if (m + f >= 65) ans = 'B';
else if (m + ... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace ... | 0 | 54,220,048 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double a,b;
cin >> a;
cin >> b;
cout << (b-a) + b << endl;
} | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | 0 | 45,974,295 |
#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
int main(){
int n;
scanf("%d",&n);
string s;
cin>>s;
int cnt=0;
bool flag=1;
ll ans=1;
for(int i=0;i<s.size();i++){
if(cnt&1){
if(s[i]=='W'){
cnt++;
}
... | 0 | 61,796,341 |
#include<bits/stdc++.h>
#define ll long long int
#define M 1000000007
using namespace std;
ll n,t,x,y,m,q;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin>>n;
string s,s1;
cin>>s>>s1;
for(int i=0;i<n;i++){
cout<<s[i]<<s1[i];
}
} | #include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 200200;
const int N = 1e9;
typedef long long ll;
const int mod = 998244353;
inline ll pow(ll a,int b,int ans = 1) {
for(;b;b >>= 1,a = a * a % mod) if(b & 1)
ans = ans * a % m... | 0 | 91,484,720 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n, m;
cin >> n >> m;
vector<ll> c(n+1,0);
rep(i, 0, m){
ll a, b;
cin >> a >> b;
c[a]++;
c[b]++;
}
rep(i... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = 1<<29;
typedef long long ll;
int dp[100][2][100];
struct UnionFind {
vi parent;
UnionFind(int N) : parent(N... | 0 | 41,233,106 |
#include <iostream>
#include <queue>
using namespace std;
int D[100];
int mat[100][100];
void bfs(int src);
int main() {
int n;
for (int i=0;i<100;++i) {
for (int j=0;j<100;++j)
mat[i][j] = 0;
D[i] = -1;
}
cin >> n;
for (int i=0;i<n;++i) {
int buf1,buf2;
cin >> buf1 >> buf2;
for (int... | #include<bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int maxn=1e5+10,mod=1e9+7;
const ll inf=1e18;
ll a[maxn],W[maxn],cnt[maxn];
vec... | 0 | 16,991,722 |
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll K,A,B;
ci... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int64_t i = 0; i < (int64_t)(n); i++)
#define mod(a) a % 1000000007;
int64_t myadd(int64_t a, int64_t b) {
int64_t a_ = mod(a);
int64_t b_ = mod(b);
return mod( a_ + b_ );
}
int64_t myprod(int64_t a, int64_t b) {
int64_t a_ = mod(a);
int64_t b... | 0 | 88,084,359 |
#include<iostream>
using namespace std;
int main(void){
long long x,y;
cin>>x>>y;
int cnt(1);
while(x*2<=y){
x *= 2;
cnt++;
}
cout<<cnt<<endl;
return 0;
} | #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; }
using ll = long long;
int main() {
int N,K; cin >> N >> K;
vector<... | 0 | 2,043,643 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>... | #include <iostream>
#include <bitset>
#include <fstream>
#include <math.h>
using namespace std;
#define NUM_LIMIT 1000000
int getNumOfPrimes(bitset<NUM_LIMIT> &isPrime, int last_limit, int limit){
int cnt = 0;
for (int i = 2; i <= limit; i++){
if (!isPrime[i]) continue;
cnt ++;
for ... | 0 | 20,362,400 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
int n;
cin>>s>>t;
n=s.size();
if(t.substr(0,n)==s)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
int count[26] = {};
while (getline(cin, s)) {
for (int i = 0; i < int(s.size()); i++) {
char c = s[i];
if (0x41 <= c && c <= 0x5a) count[c - 0x41] += 1;
else if (0x61 <= c && c <= 0x7a) count[c -... | 0 | 68,494,635 |
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
int main(void){
ll num,larg;
cin >> num >> larg;
vector<ll> lon(num);
for(int i = 0;i < num;i ++){
cin >> lon[i];
}
for(int i = 0;i < num-1;i ++){
if(lon[i]+lon[i+1]>=larg){
cout << "Possible" << endl;
for(in... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | 0 | 21,808,435 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k;
string s;
cin >> n >> s >> k;
char a = s[k-1];
for(long long i = 0; i < n; i++){
if(s[i]!=a) s[i]='*';
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,Y;
cin >> N >> Y;
bool fin=false;
for(int i=0;i<(Y/10000)+1;i++){
for(int j=0;j<((Y-10000*i)/5000)+1;j++){
if(((Y-10000*i-5000*j)/1000)+i+j==N){
cout << i << " " << j << " " << (Y-10000*i-5000*j)/1000 <<endl... | 0 | 88,827,155 |
#define DEBUG
#include <cassert>
#include <utility>
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <functional>
#include <tuple>
#include <climits>
#include <limits>
#include <deque>
#include <list>
#include <array>
#include <stack>
#include <que... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
int e;
int cnt = 0;
bool judge = true;
cin >> S;
e = S.size() -1;
if(S[0] != 'A') judge = false;
if(S[1] < 'a' || S[1] > 'z') judge = false;
if(S[e] < 'a' || S[e] > 'z') judge = false;
for(int i=2;i<e;i++) {... | 0 | 83,982,577 |
#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 intl = long long;
using itnl = long long;
using uintl = unsigned long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (i... | 0 | 7,879,595 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1000 * 1000 + 19;
int n;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
LL ans = 0, cnt = 1;
for (int i = 0; i < n; i++) {
LL a;
cin >> a;
if (i == 0)
ans += a - 1;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<int,int,greater<int>> a;
for(int i=0;i<n;i++){
int x;
cin>>x;
a[x]++;
}
vector<int> r;
vector<int> s;
for(auto x:a){
if(x.second>=2)
r.push_back(x.first);
if(x.second>=4)
s.push_back(x.first);
}... | 0 | 74,107,900 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll Pow(ll x,ll y){
ll ans = 1;
while(y){
if(y%2) ans *= x;
x *= x;
y >>= 1;
}
return ans;
}
ll to_decimal(string s,ll B){
int t = s.find("."),i,n = s.size();
if(t == string::npos) return -1;
if(s.size()-t-1 > B) return -1;
ll... | #include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int tmp = N;
int f = 0;
while (tmp > 0) {
f += tmp % 10;
tmp /= 10;
}
printf(N % f == 0 ? "Yes\n" : "No\n");
return 0;
} | 0 | 33,154,966 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const ll INF = 1LL<<60;
int main(){
int a,b,c;
cin>>a>>b;
if(a==1){
if(b==2)
c = 3;
else
c = 2;
}
else if(a==2){
if(b==1)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) ... | 0 | 56,838,969 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define pi 3.14159265359
#define mk(arr,n,type) type *arr=n... | 0 | 61,829,750 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#define rep(i, s, g) for (... | 0 | 49,717,499 |
#include<bits/stdc++.h>
using namespace std;int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1)*4
#define pb push_back
#define vpr vector<pr>
#define pr pair<int, int>
#define vi std::vector<i... | bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | 0 | 87,799,313 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | #include <iostream>
#include <vector>
#include <map>
#include <utility>
#include<stack>
#include<string>
#include<algorithm>
#include <set>
#include<list>
#include <bit>
#include <bitset>
#include <cstdint>
#include <initializer_list>
using namespace std;
int main() {
long long int N, ans=0,max_val=10000000; cin >> N... | 0 | 72,701,781 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#d... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | 0 | 87,931,297 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#d... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll T[N],A[N];
for (int i = 0; i < N; i++) {
cin >> T[i];
}
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N == 1) {
... | 0 | 9,378,493 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os,... | 0 | 74,847,881 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int,int>> p(n);
for(int i=0;i<n;i++){
int a;
cin >> a;
p.at(i) = make_pair(a,i);
}
sort(p.begin(),p.end());
for(int j=0;j<n;j++){
int a,b;
tie(a,b) = p.at(j);
cout << b+1 << " " ;
}
} | #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 | 88,059,492 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(de... | 0 | 97,795,084 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c; cin >> c;
if ((c == 'a') || (c == 'e') || (c == 'i') || (c == 'o') || (c == 'u')) cout << "vowel";
else cout << "consonant";
} | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
... | 0 | 63,991,188 |
#include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#pragma region Macros
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define int long long
#define all(x) (x).begin(),(x).end()
#define swap(a,b) (a += b,b = a - b,a... | #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;
#ifndef bhartiya
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#define int long long
typedef long long ll;
typedef long double ld;
typedef pa... | 0 | 24,208,901 |
#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; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | #include <bits/stdc++.h>
using namespace std;
#define PVAR(x) (cout << #x"=" << x << endl)
void test_case() {
int n;
cin >> n;
vector<int> A(n);
int ma = 0;
for (int &a : A) {
cin >> a;
ma = max(ma, a);
}
vector<int> pfs(ma + 1);
int pcount = 0;
iota(pfs.begin(), pfs.end(), 0);
for (int i = ... | 0 | 47,278,394 |
#include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
typedef long long int LL;
vector<int> path[100005];
int num[100005];
queue<pair<int,int> > q1;
int check(int a){
int i,j,k;
int s=0;
int b,c;
q1.push(make_pair(a,1));
while(!q1.empty()){
a=q1.front().first,b=q1.front().second,... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 0 | 29,830,038 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long LL;
int N;
int main(){
string str;
while(getline(cin,str),str!="."){
vector<string>s(1000);
int num=0;
bool check=true;
REP(i,str.size()){
... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 99,054,711 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define print(i) cout << i << endl
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
int main(void)
{
int a;
int da[3];
cin >> a;
FOR(i, 0, a){
cin >> da[0] >> da[1] >> da[2];
... | #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<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define _GLIBCXX_DEBUG
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_el... | 0 | 36,931,557 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n;cin >> n;
n /= 2;
vector<int> e(100001),o(100001);
for(int i = 0; i < n*2; i++) {
int v;cin >> v;
if(i%2==0){
o[v]++;
}
else ... | #include <iostream>
using namespace std;
int main (void){
int a, b, c, d;
cin >> a >> b >> c >> d;
if(a <= b) {
if(c < d){
cout << a + c << endl;
}else{
cout << a + d << endl;
}
}else{
if(c < d){
cout << b + c << endl;
}else{
... | 0 | 2,997,614 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int MAX = 510000;
const int INF = 1e9;
const double pi=acos(-1);
int main(){
int n;
cin >> n;
vector<ll>a(n),b(n);
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
vector<ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ld> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<ll>> vvll;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll;... | 0 | 42,368,895 |
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
long long x[N],y[N];
char ch[]={'U','D','R','L'};
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>x[i]>>y[i];
int m2=0;
if((x[0]+y[0])%2==0)
{
m2=1;
for(int i=0;i<n;i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int a[n]; for(int i = 0; i < n; ++i) cin >> a[i];
pair<int64_t, int64_t> p[n + 1];
for(int i = 0; i < n; ++i) {
p[i] = {a[i], i};
}
p[n] = {0, 0};
sort(p, p + n + 1);
reverse(p, p + n + 1);
int64_t ans[n] = {};
for(int64_t mini = 1e... | 0 | 95,069,761 |
#include<bits/stdc++.h>
using namespace std;
char c[100005];
int main()
{
scanf("%s",c+1);
int lenc=strlen(c+1);
int ans1=0,ans2=0;
for(int i=1;i<=lenc;++i)
{
if(i%2==1)
{
if(c[i]=='0')
++ans1;
}
else
{
if(c[i]=='1')
++ans1;
}
}
for(int i=1;i<=lenc;++i)
{
if(i%2)
{
if(c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | 0 | 45,812,509 |
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<cassert>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<sstream>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#i... | #include <bits/stdc++.h>
using namespace std;
double pi = 2 * acos(0.0);
int main(){
map<string, int> m;
string s1, s2;
int x1, x2;
cin >> s1 >> s2 >> x1 >> x2;
m[s1] = x1, m[s2] = x2;
string t; cin >> t;
m[t]--;
cout << m[s1] << " " << m[s2];
return 0... | 0 | 33,374,155 |
#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>
using namespace std;
int main()
{
int n, x;
while (cin >> n >> x) {
if (n == 0 && x == 0) break;
int count = 0;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
for (int k = j + 1; k < n; k++)
if (i + j +... | 0 | 50,040,802 |
#include "bits/stdc++.h"
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(i... | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
string s; cin >> s;
stack<char> st;
int ans = 0;
rep(i, s.length()){
if(st.e... | 0 | 35,163,846 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n; cin >> n;
vector<int> a(2 * n);
for (auto &i : a) cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define ipr pair<int, int>
#define pb push_back
#define ff first
#define ss second
#define fr(i, j, k) for (int i = j; i < k; i++)
#define rf(i, j, k) for (int i = j; i >= k; i--)
#define ll unsigned long long
#define int long long
#define ld long double
#define all(x) x.be... | 0 | 25,337,817 |
#include <iostream>
using namespace std;
int N;
int main(){
cin >> N;
int m = (N/3);
cout << m << endl;
return 0;
} | #include <bits/stdc++.h>
#define for0(i, n) for (long long i = 0; i < n; i++)
#define for1(i, n) for (long long i = 1; i <= n; i++)
#define forc(i, l, r) for (long long i = l; i <= r; ++i)
#define forr0(i, n) for (long long i = n - 1; i >= 0; i--)
#define forr1(i, n) for (long long i = n; i >= 1; i--)
#def... | 0 | 83,326,832 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <set>
#include <map>
#define INF 100000
using namespace std;
typedef long long int ll;
int main(){
int n;
while (cin >> n) {
... | #include <iostream>
#include <vector>
using namespace std;
int solve(int N, const vector<int>& hs)
{
int ans = 0, m = hs[0];
for (int i = 1; i < N; ++i)
{
if (hs[i] >= m)
++ans;
m = max(m, hs[i]);
}
return ans + 1;
}
int main()
{
int N;
cin >> N;
vector<int> h... | 0 | 92,811,197 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define rep2(i, s... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> A(N+2);
vector<long long> sum(N+2,0);
for(int i=1; i<=N; i++) cin>>A[i];
A[0] = A[N+1] = 0;
for(int i=1; i<=N+1; i++){
sum[i] = sum[i-1]+abs(A[i]-A[i-1]);
}
for(int i=1; i<=N; i++){
... | 0 | 38,390,120 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi acos(-1.0)
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
ll int i,n,t,j=0,p,x,a=0,b,l=0,r=0,y,k,c,sum=0,m,d;
cin>>a>>b;
if(a<b){
cout<<0<<endl;
}
else{
cout<<10<<endl;
}
re... | #include<bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 50;
char a[maxn];
int f[maxn], sum[1 << 26];
int main(){
scanf("%s", a + 1); int n = strlen(a + 1);
memset(sum, 0x3f, sizeof(sum));
int g = 0;
f[0] = 0; sum[0] = 0;
for (int i = 1; i <= n; ++i){
int x = 1 << (a[i] - 'a');
g ^= x;
f[i] = s... | 0 | 1,085,357 |
#include<bits/stdc++.h>
using namespace std;
const int N=100100;
typedef long long ll;
pair<int,int>a[N];
int n;
ll ans[N];
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;++i)cin>>a[i].first,a[i].second=i;
sort(a+1,a+n+1);
for(int i=n,mn=a[n].second;i;--i){
ans[mn]+=(ll)(a[i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 47,019,576 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | #include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, cla... | 0 | 78,320,959 |
#include<bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second
#defin... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define pb(x) push_back(x)
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define vs vector... | 0 | 22,997,571 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max({ a,b,c }) * 9 + a + b + c << e... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int H,W,K;
int main(){
cin >> H >> W >> K;
vector<vector<int> > c(H,vector<int>(W));
int all =0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
char a;
cin >> a... | 0 | 36,526,578 |
#include<bits/stdc++.h>
#define ll long long int
#define ll_MAX LLONG_MAX
#define ll_MIN LLONG_MIN
#define pi 3.14159265358979323846
#define count_1(n) __builtin_popcountll(n)
#define MOD 1000000007
#define MAX ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#pragma GCC optimize("O2")
#define sz(x) ((long long)(x).size())
#define all(x) x.begin(),x.end()
#define rall(x) (x).rbegin(), (x).rend()
#define endl "\n"
#define ff first
#define ss second
#define mp make_pair
#define pb push_... | 0 | 36,033,370 |
#include <bits/stdc++.h>
using namespace std;
#define f0r(a, b) for (long long a = 0; a < b; a++)
#define f1r(a, b, c) for (long long a = b; a < c; a++)
#define f0rd(a, b) for (long long a = b; a >= 0; a--)
#define f1rd(a, b, c) for (long long a = b; a >= c; a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, A, d;
int ans = 0;
cin >> N >> K;
vector<int> nusuke(N + 1, 0);
for (int i = 0; i < K; i++) {
cin >> d;
for (int j = 0; j < d; j++) {
cin >> A;
nusuke.at(A)++;
}
}
for (int i ... | 0 | 84,305,076 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
... | #include<iostream>
using namespace std;
int main(){
int i,n,a,b,c,m;
cin>>n;
for(i=0;i<n;i++){
m = 0;
cin>>a>>b>>c;
if(a*a == b*b+c*c)
m = 1;
else if(b*b == c*c+a*a)
m = 1;
else if(c*c == a*a+b*b)
m = 1;
if(m == 1)
cout<<"YES"<<endl;
else if(m == 0)
cout<<"NO"<<endl;
}
return 0;
} | 0 | 74,947,480 |
#include <bits/stdc++.h>
using namespace std;
long long n, a[105], k;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i){
cin >> a[i];
}
for (int i = 1; i < n; ++i){
if (a[i] == a[i + 1]){
if (a[i + 1] == a[i + 2]) {a[i + 1] = k * -1; k++;}
else {k++;}
}
}
cout << k;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
typedef long long ll;
static const ll MX = 100005;
static const ll MX_ll = 1e18;
const double PI = acos(-1);
using namespace std;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
int c... | 0 | 95,563,260 |
#include <iostream>
using namespace std;
int main(){
int debt = 100000;
int week;
cin >> week;
for(int i = 0; i < week; ++i){
debt *= 1.05;
if(debt % 1000 != 0){
debt = (debt + 999) / 1000;
debt = debt * 1000;
}
}
cout << debt << endl;
r... | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | 0 | 56,781,258 |
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
using ll = long long;
const int inf = 99999999;
using namespace std;
const ll mod = 1e9 + 7;
int main(){
int n , k;
cin >> n >> k;
int r,s,p... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
int d,t,s;
cin >> d >> t >> s;
int a=t*s;
if (a<d)
{
cout << "No" << endl;
}
else
... | 0 | 7,923,301 |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>
typedef lon... | #include <bits/stdc++.h>
template <class T>
T pow(T x, T n, T mod) {
T ret = 1;
while(n > 0) {
if ((n & 1) == 1) ret = (ret * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return ret;
}
template <class T>
T inverse(T x, T p) { return pow(x, p - 2, p); }
int main() {
constexpr auto ... | 0 | 57,887,611 |
#include <stdio.h>
int main(){
int n,k,bank = 1;
scanf("%d" , &n);
scanf("%d" , &k);
for(int i = 0 ; i < n ; i++){
if(bank * 2 > bank + k){
bank += k;
}
else{
bank *= 2;
}
}
printf("%d" , bank);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz... | 0 | 76,659,299 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
ll N,K; cin>>N>>K;
ll R,S,P; cin>>R>>S>>P;
string T; cin>>T;
vector<string> vec(K,"");
rep(i,N)
{
vec.a... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9+7
typedef long long int ll;
const int maxn = 1000000;
ll mod = INF;
int main(){
int n;
string s;
cin >> n;
cin >> s;
ll ans=0;
map<ll,ll> m;
for(int i=0;i<(int)s.size();i++){
int num=(int)s[i]-(int)'a';
m[num]++;
... | 0 | 25,255,201 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
static const int MAX_H = 2000;
static const int MAX_W = 2000;
static const int INF = 0;
int H, W;
int main(){
cin >> H >> W;
vector<vector<char>> S(H, vector<char>(W));
for (int i = 0;... | 0 | 8,153,642 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(),(v).end()
#define out(a) cout << (a) << endl
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n;
vector<string> blue(n);
rep(i, n){
cin >> blue[i];
}
cin >> m;
... | #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 | 92,161,758 |
#include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
using n... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
long long MAX = 1000000000000000000;
template<typename T>
map<T, ll> prime_factorize(T x, map<T,ll> m){
while(x%2==0){
x/=2;
m[2]++;
}
for(ll i=3;i*i<=x;i+=2){
while(x%i==0){
... | 0 | 88,979,879 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s, t;
bool ok(const string& a, const string& b)
{
for(int i=0;i<a.length();++i){
if(a[i]!=b[i]&&a[i]!='?') return false;
}
return true;
}
void solve()
{
const int n = s.length();
const int m = t.length();
string inf = string(n+1,'z');
s... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 | 44,392,757 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int p, q, r;
cin >> p >> q >> r;
int m = max(max(p, q), r);
int ans = p + q + r - m;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using p = pair<int,int>;
int main() {
string S;
cin >> S;
int a,b,c,d;
a = S.at(0) - '0';
b = S.at(1) - '0';
c = S.at(2) - '0';
d = S.at(3) - '0';
string ... | 0 | 89,108,163 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int ... | #include <iostream>
using namespace std;
class PriorityQueue
{
int max_nelem, end;
int* array;
public:
PriorityQueue(int n) : max_nelem(n), end(0){
array = new int[max_nelem];
}
void insert(int key)
{
int index = end;
array[end++] = key;
while(index > 0)
{... | 0 | 82,131,570 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl
void solve() {
ll n, m;
cin >> n >> m;
ll sm = 0;
for (ll i = 0; i < m; i++) {
ll temp;
cin >> temp;
sm += temp;... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for(auto i=(m).begin... | 0 | 93,841,323 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,add=1,ans=0,now=0;
cin >> N >> K;
string S;
cin >> S;
vector<int> sum;
bool zero;
if(S[0]=='0'){
zero = true;
}else{
zero = false;
}
for(int i=1;i<N;i++){
if(zero){
if(S[i]=='0')... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll ans = 0, sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += a;
if (a == 0) {
ans += sum / 2;
sum = 0;
... | 0 | 72,950,610 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll=long long;
using P =pair<int,int>;
int main(){
int a,b,k;
int count=0;
cin>>a>>b>>k;
for(int i=min(a,b);i>0;i--){
if(a%i==0&&b%i==0){
count++;
if(count==k){
cout<... | #include<iostream>
using namespace std;
int w,h;
char tail[21][21];
int a[]={-1,0,1,0};
int b[]={0,1,0,-1};
int cnt=0;
void func(int x,int y);
main(){
int sx,sy;
while(1){
cin>> w>> h;
if(w==0&&h==0) break;
cnt=0;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>> tail[i][j];
if(tail[i][j]=... | 0 | 96,552,429 |
#include<bits/stdc++.h>
using namespace std;
#define N 100000
int main(){
int n,m,h[N],ma[N];
cin >> n >> m;
for(int i=1;i<=n;i++){
cin >> h[i];
ma[i]=0;
}
for(int i=0;i<m;i++){
int a,b;
cin >> a >> b;
ma[a]=max(ma[a],h[b]);
ma[b]=max(ma[b],h[a]);
}
int ans=0;
for(int i=1;i<=n;i+... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
long long x[1010], y[1010];
cin >> n;
for(int i = 0;i < n;i++){
cin >> x[i] >> y[i];
}
int tmp = (abs(x[0]) + abs(y[0])) % 2;
for(int i = 1;i < n;i++){
if((abs(x[i]) + abs(y[i])) % 2 != tmp){
cout << -1 << endl;
return 0;... | 0 | 56,611,538 |
#include <stdio.h>
#include <stack>
using namespace std;
int main()
{
stack<int> sta;
int num;
while(scanf("%d", &num) != EOF){
if(num == 0 && sta.empty() == 0){
printf("%d\n",sta.top());
sta.pop();
}else{
sta.push(num);
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
const int maxn = 100000;
ll mod = INF;
int submit[maxn];
int WA=0;
int AC=0;
int main(){
int n,m;
cin >> n>>m;
fill(submit,submit+n,0);
rep(i,m){
int p;
string s... | 0 | 3,000,374 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s; cin >> s;
s.erase(4, 1); s.erase(6, 1);
int n = stoi(s);
if(n <= 20190430) cout << "Heisei" << endl;
else cout << "TBD" << endl;
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less<pll>, rb_tree_tag,tree_... | 0 | 30,741,402 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.