code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
#include <algorithm>
using namespace std;
using ll = long long;
int main() {
ll n, u, v;
cin >> n;
ll ans = (n * (n+1) * (2*n+1) / 6 + n * (n+1) / 2) / 2;
for(int i=0;i<n-1;++i) {
cin >> u >> v;
ans -= min(u, v) * (n - max(u, v) + 1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define Int long long
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
Int n;
cin>>n;
Int cv=0;
for(Int i = 1;i<=n;i++)
{
cv+=(i)*(n-i+1);
}
for(Int i = 1;i<n;i++)
{
Int x,y;
c... | 1 | 18,854,058 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int x, n;
cin >> x >> n;
if (n == 0) {
cout << x << endl;
}
else {
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
sort(p.begin(), p.end());
int a;
for (int ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,a,n; cin>>x>>n; unordered_map<int,int> vis; for(int i=0;i<n;i++) {cin>>a; vis[a]=1;}
if(!vis[x]) {cout<<x<<endl; return 0;}
int low=x-1,high=x+1;
while(1){
if(!vis[low]) { cout<<low<<endl; return 0;}
... | 1 | 86,349,094 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
const ll INF = 1001001001;
const ll MOD = 1e9 + 7;
ll a[51], p[51];
ll func(ll n,ll x){
if(n == 0)... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | 1 | 29,816,043 |
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to) - 1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typena... | #include <iostream>
using namespace std;
int main() {
string s;
int d[26] = {0};
cin >> s;
int offset = 'a';
for (int i = 0; i < s.size(); i++) {
int j = s[i] - offset;
d[j]++;
}
bool ok = false;
for (int i = 0; i < 26; i++) {
if (d[i] == 0) {
char c = (char)(i + offset);
cout <<... | 1 | 47,716,943 |
#include <iostream>
#include <vector>
using namespace std;
using pll = pair<long, long>;
constexpr long MOD = 1000000007;
int main() {
string s, t; cin >> s >> t;
long ans = LONG_MAX;
for (long i = 0; i < s.size() - t.size() + 1; i++) {
long tmp = 0;
for (long j = 0; j < t.size(); j++) {
if (s[i + j] != t[j])... | #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;
template < typename T > using oset = tree < T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update >;
typedef long long ll;
typedef long double ld;
#de... | 1 | 55,375,331 |
#include<bits/stdc++.h>
using namespace std;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
long long ans = LLONG_MAX;
long long suf = accumulate(a.begin(), a.end(), 0LL);
long long pref = 0;
for (auto... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 1 | 77,867,030 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >>M;
int R1=99999999;
int L1=0;
for(int i=0;i<M;i++){
int L;
cin >>L;
int R;
cin >>R;
if(R<L){
int a;
a=L;
L=R;
L=a;
}
L1=max(L1,L);
R1=min(R1,R);
}
int count=0;
for... | #include<bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define all(x) (x).begin() (x).end()
#define rall(x) (x).rbegin() (x).rend()
typedef long long ll;
int main(){
int n,m; cin>>n>>m;
int i=-1, j=1e9;
while(m--){
int x, y;
cin>>x>>y;
i=max(i, x);
j=min(j, y);
}
i... | 1 | 15,063,686 |
#include <iostream>
using namespace std;
int N,S;
int set = 0;
int main(){
while(set <= 20){
cin >> N;
if (N == 0) break;
int largest = 0;
int smallest = 1000;
int sum = 0;
for (int i = 0; i <N;++i) {
cin >> S;
if(largest < S) largest = S;
if(smallest >S) smallest = S;
... | #include <iostream>
using namespace std;
int main()
{
int n, s, count, max, min, sum, adv;
while(cin >> n){
if(n == 0){
break;
}
min = 1001;
max = -1;
sum = 0;
count = 0;
while(count < n){
count++;
cin >> s;
sum += s;
if(s < min){
min = s;
}
... | 1 | 40,878,025 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 1 | 88,832,291 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f)... | 1 | 78,691,666 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MAX = 1000000000;
int main()
{
int64_t S, x1 = 0, y1 = 0, x2 = MAX, y2 = 1, x3, y3;
cin >> S;
if (S == MAX * MAX)
{
y2 = 0;
x3 = y3 = MAX;
}
else
{
int64_t p = S / MAX, r = S % MAX;
x3 = MAX - r, y3 = p + 1;
}
cout << x1 << ' ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod=998244353;
#define pb push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t,s;
ll lim=1000000000;
cin>>s;
ll r=(lim-s%lim)%lim;
ll k=(r+s)/lim;
cout<<0<<" "<<0<... | 1 | 98,862,340 |
#include <iostream>
using namespace std;
int main(){
int t;
while((cin >> t), t){
int num=0;
t = 1000-t;
while(t>=500){
num++;
t-=500;
}
while(t>=100){
num++;
t-=100;
}
while(t>=50){
num++;
t-=50;
}
while(t>=10){
num++;
t-=10;
}... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define trep(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef pair<int, int> P;
int v[6] = {500, 100, 50, 10, 5, 1};
int greed(int n)
{
int count = 0;
rep(i, 6)
... | 1 | 97,752,220 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, x;
ll Get(ll x, ll y)
{
if (x < y) return Get(y, x);
if (y == 0) return 0;
ll d = x / y;
return 3ll * d * y + Get(y, x % y);
}
int main()
{
cin >> n >> x;
printf("%lld\n", Get(x, n - x));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long ans;
void calc(long long a, long long b) {
if (a % b == 0) {
ans += (a * 2) - b;
return;
}
ans += (a / b) * b * 2;
calc(b, a % b);
}
int main() {
long long n, x;
cin >> n >> x;
ans = n;
if (x < n - x)
x = n - x;
calc(x, n - x);
... | 1 | 24,032,421 |
#include<iostream>
using namespace std;
int main(){
while(1){
int n,k,a[100002],sum=0,ans=0;
scanf("%d%d",&n,&k);
if(n==0&&k==0)break;
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<k;i++){
sum+=a[i];
}
ans=sum;
for(int i=0;k<n;i++){
sum-=a[i];
sum+=a[k];
if(ans<sum)ans=sum;
k++;
}
prin... | #include <iostream>
#include <vector>
using namespace std;
void solve()
{
int m, n;
while(cin >> m >> n)
{
if(!m && !n)
{
break;
}
vector<int> Vec(m);
for(int i = 0; i < m; ++i)
{
cin >> Vec[i];
}
int sum = 0;
for(int i = 0; i < n; ++i)
{
sum += Vec[i];
}
int max = sum;
for(int i =... | 1 | 37,788,906 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <climits>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RREP(i,n) for(int i=(int)n-1; i>=0; i--)
#defi... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 999999999
#define mod 1000000007
#define rep(i,n) for(int i=0;i<int(n);i++)
#... | 1 | 1,838,949 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(llint i=(a);i... | #include<iostream>
#include<vector>
#include<map>
#include<cmath>
using namespace std;
int main() {
int H, W, D;
cin>>H>>W>>D;
map<int, pair<int, int> > A;
int tmp;
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cin>>tmp;
tmp--;
A[tmp] = make_pair(i, j);
... | 1 | 84,977,272 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int V, E;
ll cost[105][105];
ll INF = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll cost2[105][105];
cin >> V >> E;
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (i == j) cost[i][j] = 0;
else ... | 1 | 72,807,357 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
inline int in(){int x;scanf("%lld",&x);return x... | 1 | 69,791,497 |
#include <iostream>
#include <ios>
using namespace std;
bool mat[101][101] = {{false}};
int main()
{
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int m = 0; m != n; ++m){
int i = 0, k = 0;
cin >> i;
cin >> k;
while (k--){
int j = 0;
cin >> j;... | #include <stdio.h>
int map_max;
int map[110][110];
int rows;
int cols[110];
int mat[110][110] = {};
void get_map();
void print_map();
void conv_map();
void print_mat();
int main()
{
get_map();
conv_map();
print_mat();
return 0;
}
void get_map()
{
int k;
scanf("%d", &map_max);
for(int i=0;i<map_max;i++)
... | 1 | 41,092,993 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s; cin >> s;
int k; cin >> k;
char tmp;
int cnt = 1;
int n = s.length();
ll change = 0;
ll a=0, b=0;
for(int i=0; i<n; i++){
if(i==0) tmp = s.at(i);
else{
if(s[i] == tmp){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s; cin >> s; ll k; cin >> k;
bool al = true;
for (int i = 0; i < s.length() - 1; i++)if (s.at(i) != s.at(i + 1))al = false;
ll ans = 0;
if (s.at(0) != s.at(s.length() - 1)) {
for (int i = 0; i < s.length() - 1; i++) {
if (... | 1 | 39,096,520 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
std::vector<int> a;
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
a.push_back(k - i);
}
partial_sort(a.be... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
a[i]-=(i+1);
}
sort(a.begin(),a.end());
... | 1 | 57,310,821 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int n, m;
n = A + B;
m = C + D;
string s;
if (n == m) {
s = "Balanced";
}
else if (n > m) {
s = "Left";
}
else {
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
signed main(){
int a,b,c,d; cin >> a >> b >> c >> d;
if((a+b)>(c+d)) {cout << "Left";}
else if((a+b)==(c+d)) {cout << "Balanced";}
else if((a+b)<(c+d)) {cout << "Right";}
} | 1 | 73,320,295 |
#include<iostream>
using namespace std;
int main(){
int money;
int change;
while(cin >> money,money){
money=1000-money;
change=0;
while(money){
if(money>=500){
change++;
money-=500;
}
else if(money>=100){
change++;
money-=100;
}
else if(money>=50){
change++;... | #include<iostream>
using namespace std;
int main(){
int gold,change,count;
while(cin>>gold){
if(gold==0) break;
change = 1000 - gold;
count = 0;
while(change!=0){
if(change>=500){
count++;
change -= 500;
}
else if(change<500&&change>=100){
count++;
change -= 100;
}
... | 1 | 68,360,885 |
#include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int n;
cin >> n;
int arr[n], ans[n];
for(int i = 0; i < n; i++)
cin >> arr[i];
for(int i = 0; i < n/2; i++)
{
ans[i] = arr[n-1-2*i];
ans[n-1-i] = arr[n-2-2*i];
}
if( n % 2 == 1 )
ans[n/2] = arr[0];
for(int i = 0; i < n; i+... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 1 | 561,666 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ab_max = max(a, b);
vector<int> v;
for (int i = 1; i <= ab_max; i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
reverse(v.begin(), v.end());
cout << v.at(k-1) <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = unsigned long long;
using p = pair<int, int>;
int main()
{
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int maxRep = max(A, B);
vector<int> v = vector<int>();
rep(i, maxRep + 1)
{
... | 1 | 24,754,922 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
vector<pair<int64_t,int64_t>>prime_factorize(int64_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | 1 | 76,286,357 |
#include<bits/stdc++.h>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef long l;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#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()
const int INF=1000000... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | 1 | 94,407,258 |
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using names... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<vector<char>> vec;
int main(){
ll H,W,ans=0;
cin>>H>>W;
ll dp[111][111];
vec.resize(H,vector<char>(W));
vector<vector<ll>> answer(H,vector<ll>(W));
for(ll i=0;i<H;i++){
for(ll j=0;j<W;j++){
cin>>vec.at(i).at(j);
}
}
... | 1 | 12,133,947 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
c... | 1 | 38,933,196 |
#include <bits/stdc++.h>
using namespace std;
constexpr int MAX = 300;
int gSize;
int gHeap[MAX];
int main(){
cin >> gSize;
for( int i = 0; i < gSize; i++ ) cin >> gHeap[i];
for( int i = 0; i < gSize; i++ ){
cout << "node " << i + 1 << ": "
<< "key = " << gHeap[i] << ", ";
if( i != 0 ){
cout << "p... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n; cin >> n;
int a[n+1];
for(int i=1;i<=n;i++){
cin >> a[i];
}
printf("node 1: key = %d, left key = %d, right key = %d, \n",a[1],a[2],a[3]);
for(int id=2;id<=n;id++){
printf("node %d: key = %d, ",id,a[id]);
if(2*id+1<=n){... | 1 | 7,451,923 |
#include <stdio.h>
#include <string.h>
int main(void) {
char str[1001], p[1001], state[10];
int a, b, q;
scanf("%s\n%d", str, &q);
for (int i = 1; i <= q; i++) {
scanf("%s", state);
if (strcmp(state, "replace") == 0) {
scanf("%d %d %s", &a, &b, p);
for (int j = 0; j < b - a + 1; j++) {
str[a + j] = p[... | #include<iostream>
#include<string>
using namespace std;
int main() {
string str, cmd;
int a, b, q;
cin >> str >> q;
for (int i = 0; i < q; i++) {
cin >> cmd >> a >> b;
if (cmd == "print") {
for (int j = a; j <= b; j++)
cout << str[j]; cout << endl;
}
else if (cmd == "reverse") {
int fend = (b -... | 1 | 56,909,601 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>> a>>b>>c;
int n;
cin >> n;
int x = 0;
for(int i = 0;i< n;i++)
{
if(a<b)
{
break;
}
b*=2;
x++;
}
bool ans = false;
for(int i = 0;i< n-x;i++)
{
c*=2;
if(a<b&&b<c)
{
ans = true;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(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) {
... | 1 | 31,731,057 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solve() {
int p;
int n;
cin >> n >> p;
vector <int> v(n);
int even = 0;
int odd = 0;
for(int i = 0; i < n; i++) {
cin >> v[i];
v[i] %= 2;
even += v[i] == 0;
odd += v[i] == 1;
}
if(odd == 0) {
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | 1 | 29,313,698 |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
long long t = n / (a + b);
long long last = n % (a + b);
long long exb = last;
if (exb > a) exb = a;
cout << t * a + exb << endl;
} | 1 | 42,800,290 |
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
ll a;
cin >> a;
cout << (a*a) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 1 | 71,346,981 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s;cin >>s;
ll k;cin >>k;
ll n=s.size();
ll now=0;
for (int i = ... | #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++)
#define VL vector<ll>
#define VS vector<string>
ll INF=1e18+5;
int main(){
string S; ll K;
cin >> S >> K;
ll ans = 0;
ll cnt = 0;
rep(i,0,S.size()){
ll p = S[i]... | 1 | 6,045,440 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
if(b - a <= 2 || k <= a) {
cout << k + 1 << "\n";
return 0;
}
long long ans = a, t = k - a + 1;
if(t % 2 == 1) {
ans++;
}
cout << ans + t / 2 * (b - a) << "\n";
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
int k,a,b;
cin>>k>>a>>b;
ll ans=0;
if(k<=a||b-a<=2)ans=k+1;
else{
if(k%2==a%2)ans=a+ll(b-a)*((k-a+1)/2)+1;
else ans=a+ll(b-a)*((k-a+1)/2);
}
cout<<ans<<end... | 1 | 54,834,474 |
#include<iostream>
#include <vector>
using namespace std;
int main() {
long long int n, a, b;
cin >> n >> a >> b;
long long int ans = 0;
ans += (n / (a + b)) * a;
if(n % (a + b) > a) {
ans += a;
}
else {
ans += n % (a + b);
}
cout << ans << "\n";
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | 1 | 20,156,875 |
#include<iostream>
using namespace std;
int main()
{
int x,y,z=500,a;
cin>>x>>y;
a=x*500;
if(a>=y){
cout<<"Yes"<<endl;
}
else cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep2(i, a, b) for(int i = (a); i < (b); i++)
typedef long long ll;
int main() {
int k, x;
cin >> k >> x;
string ans = (500 * k >= x) ? "Yes" : "No";
cout << ans << endl;
} | 1 | 86,341,905 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
ll dp[101010][2];
int main() {
string l;
cin >> l;
int n = l.size();
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
int t = l[i] - '0';
for (int j = 0; j < 2; j++) {... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
int main() {
constexpr int mod... | 1 | 83,222,043 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | 1 | 86,068,699 |
#include <iostream>
#include <cstdio>
using namespace std;
int calcDay(int y, int m, int d) {
int total_day = 0;
for (int i = 1; i <= 1000; ++i) {
for (int j = 1; j <= 10; ++j) {
if (i % 3 == 0 || j % 2 != 0) {
for (int k = 1; k <= 20; ++k) {
total_day++;
if (i == y && j == m && k == d) {
ret... | #include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cctype>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
using namespace std;
bool debug=false;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
... | 1 | 18,924,906 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define int long long
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double a,sum = 0, ans;
for ( int i = 0; i < n; i++){
cin >> a;
sum += 1 / a;
}
ans = 1 / sum;
cout << fixed << setprecision(10) << ans << endl;
} | 1 | 65,344,110 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int A,B,C;
cin >> A >> B >> C;
set<int> check;
bool ans;
int x = A;
while(true){
x = x%B;
if(x == C){
ans = true;
break;
}e... | #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... | 1 | 34,409,960 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b){
if (a%b == 0) return b;
else return gcd(b, a%b);
}
int main(int argc, char const *argv[]) {
long long a, b;
long long c, d;
cin >> a >> b >> c >> d;
long long ans = b - a + 1;
long long num_c = b/c - (a-1)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b){
if(a%b==0){return b;}
else{return gcd(b, a%b);}
}
ll lcm(ll a, ll b){
return a*b / gcd(a, b);
}
int main(){
ll a, b, c, d; cin >> a >> b >> c >> d;
ll nc, nd, ncd;
nc = b/c - a/c;
if(a%c==0){nc += 1;}
... | 1 | 53,357,947 |
#include<iostream>
#include<queue>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
typedef long long ll;
#define pi 3.141592653589793238462... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
using vi = vector<int>;
using vll = vector<ll>;
const ll INF = 1LL<<60;
int main... | 1 | 100,121,122 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 100000000... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,s,e) for(int i=s;i<e;i++)
#define endl '\n'
int main(){
string s,t;
cin>>s>>t;
bool flag=false;
for(int i=0;i<s.size();i++){
if(s==t)flag=true;
s=s.back()+s.substr(0,s.size()-1);
}
if(flag){
... | 1 | 27,909,229 |
#include <bits/stdc++.h>
using namespace std;
int quelim = 20;
bool query(int k) {
if (quelim-- <= 0) exit(0);
string s;
cout << k << endl;
cin >> s;
if (s == "Vacant") exit(0);
if (s == "Male") return false;
if (s == "Female") return true;
}
int main() {
int n;
cin >> n;
vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> seat(N);
int Left = 0;
int Right = N;
for (int i = 0; i < 20; i++) {
if (i == 0) {
cout << 0 << endl;
cin >> seat[0];
if (seat[0] == "Vacant") break;
} else {
int ... | 1 | 54,261,135 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
ty... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
string s[60] = {};
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
string ans;
for (char c = 'a'; c <= 'z'; c++)
{
int small = 100;
for (int i = 0; i < n; i++)
{
int cnt = 0;
... | 1 | 2,511,673 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(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) )
ty... | #include<iostream>
#include<cstring>
#include<bitset>
using namespace std;
const int MAX = 8000;
const char FORWARD = 'F';
const char TURN = 'T';
int main() {
string s;
int x, y;
cin >> s >> x >> y;
int read = 0;
for (;s[read] == FORWARD;++ read) -- x;
x = x < 0 ? -x : x;
y = y < 0 ? -y : y;
bitset<MAX> dpX(1)... | 1 | 38,856,502 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define die return c... | #include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <limits>
#include <iomanip>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int... | 1 | 78,019,774 |
#include <bits/stdc++.h>
const int MAXN = 100010;
int xs[MAXN], D, n, Q;
int R[MAXN][20], L[MAXN][20];
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n;
for (int i = 1; i <= n; ++i) std::cin >> xs[i];
std::cin >> D >> Q;
for (int i = 1; i <= n; ++i) {
R[i][0] = std::upper_bound(... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | 1 | 68,271,602 |
#include <bits/stdc++.h>
using namespace std;
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; return 1; } return 0; }
using ll = long long;
using lb = long double;
using P = pair<ll,ll>;
using graph = vector<vector<l... | #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 = 1e9+7;
int N;
int A[114514];
int T[114514];
int L[114514];
int R[114514];
int main() {
scanf("%d", &N);
rep(i, N) {
scanf("%d", &T[i+1]);
}
rep(i, N) {
scanf("%d", &A[i+1])... | 1 | 81,533,185 |
#include<iostream>
#include <iomanip>
using namespace std;
int main(void){
long long int a, b;
cin >> a >> b;
long long int d, r;
double f;
d = a / b;
r = a%b;
f = (double)a / (double)b;
cout << d << " " << r << " " << fixed<<setprecision(15)<< f << endl;
return 0;
} | #include <cstdio>
#include <iostream>
#include <string>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int d = a / b;
int r = a % b;
cout << d << " " << r << " ";
cout << fixed;
cout... | 1 | 87,240,950 |
#include <bits/stdc++.h>
using namespace std;
int h,w,m,hm[300050],wm[300050],p1,p2;
set<pair<int,int> > st;
vector<int> l,r;
int main()
{
int x,y;
cin>>h>>w>>m;
for(int i=1;i<=m;i++)
{
cin>>x>>y;
st.insert(make_pair(x,y));
hm[x]++;
wm[y]++;
if(hm[x]>p1)
{
l.clear();
p1=hm[x];
}
if(hm[x]==p1) ... | #include<bits/stdc++.h>
#define ll unsigned long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
using namespace std;
const int N=3e5+10;
set<pii>s;
int r[N],c[N],id1[N],id2[N];
int main()
{
int h,w,m;
scanf("%d%d%d",&h,&w,&m);
for(int i=1;i<=m;i++)
{
in... | 1 | 62,151,852 |
#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define all(a) a.begin(), a.end()
#define sz(a) a.size()
using namespace std;
int n, m, k, b=0, ans=0;
char a[6][6];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("A.txt", "r", stdin);
#endif
cin >>... | #include <bits/stdc++.h>
using namespace std;
void __start__() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MY
freopen("/home/ainur/CLionProjects/wow/input.txt", "r", stdin);
freopen("/home/ainur/CLionProjects/wow/output.txt", "w", stdout);
#else
#define endl '\n'
#endif
}
#define sz(x... | 1 | 10,829,356 |
#include <bits/stdc++.h>
using namespace std;
#define llong long long
int a, b;
int n;
int ba, bb;
int area[17][17];
bool notgo[17][17];
void solve(){
area[1][1] = 1;
for(int i = 1; i <= a; i++){
for(int j = 1; j <= b; j++){
if(i == 1 && j == 1) continue;
if(notgo[i][j] == true)continue;
int left;
int ... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int i,j,h,w,n,x,y;
while(cin>>w>>h,h!=0,w!=0){
int r[21][21]={0};
r[1][1]=1;
cin>>n;
for(i=0;i<n;i++){
cin>>x>>y;
r[y][x]=-1;
}
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
if(r[i][j]!=-1){
if(i!=1&&r[i-1][j]... | 1 | 15,353,582 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
using namespace std;
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true); }
template<typename A, typename B> bool chmax(A &a, const B &b){ retur... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int A,B,K;
cin >> A >> B >> K;
vector<int> n;
for(int i = 1 ; i <= 100 ; i++){
if(A % i == 0 && B % i == 0){
n.push_back(i);
}
}
sort(n.begin(),n.end(),greater<int>());
cout << n[K-1] << endl;
retur... | 1 | 60,004,245 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (int i = 1; i < (int)(n+1); i++)
#define rep4(i, s, n) for (int i = (s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 1 | 78,001,312 |
#include <iostream>
using namespace std;
int main(void){
string s, left;
int pos, tmp, cnt, i;
left = "qwertasdfgzxcvb";
while(1){
cin >> s;
if(s == "#"){
break;
}
if(left.find(s[0]) != std::string::npos){
pos = 0;
}else{
pos = 1;
}
cnt = 0;
for(i=1;i<s.length()... | #include<iostream>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strtok((... | 1 | 79,325,661 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 9;
vector <int> prime;
bool used[N];
void calc() {
for (int i = 4; i < N; i += 2) used[i] = 1;
for (int i = 3; i * i < N; i += 2) {
if (used[i]) continue;
for (int j = i * i; j < N; j += i) used[j] = 1;
}
prime.push_back(2... | #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]; ... | 1 | 85,430,706 |
#include<iostream>
using namespace std;
int main(){
long long A, B, K;
std::cin >> A >> B >> K;
if(K >= (A + B)){
A = 0;
B = 0;
}else if(K >= A){
B = B - (K - A);
A = 0;
}else{
A = A - K;
}
std::cout << A << " " << B;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main() {
long a, b, k;
cin>>a >>b >>k;
if(a>=k) cout<<a-k<<" "<<b<<endl;
else if(a+b>=k) cout<<0<<" "<<a+b-k<<endl;
else cout<<"0 0"<<endl;
} | 1 | 18,978,835 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int a, b; cin >> a >> b;
string s; cin >> s;
bool ans = true;
for(int i = 0; i < a; i++){
if(s[i]-'0'>=0 && s[i]-'0'<= 9) continue;
else ans = false;
}
if(s[a]!='-') ans = false;
for(int i = a+1; i < a+b+1; i++){
i... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A,B;
string s;
bool check = true;
cin >> A >> B >> s;
for(int i=0;i<A;i++) {
if(!isdigit(s[i])) check = false;
}
if(s[A] != '-') check = false;
for(int i=A+1;i<(A+B);i++) {
if(!isdigit(s[i])) check = false... | 1 | 7,229,684 |
#include <stdio.h>
int main(void) {
int n;
long a;
long min,max,sum;
int i;
scanf("%d\n",&n);
min = 1000000;
max = -1000000;
sum = 0;
for(i=0; i<n; i++){
scanf("%ld",&a);
if(a<min){
min = a;
}
if(max<a){
max = a;
}
sum = sum + a;
}
if(n == 0){
min = 0;
max = 0;
}
printf("%ld %ld %ld\n... | #include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int size;
cin >> size;
long long a[size];
int i;
for(i=0; i<size; i++){
cin >> a[i];
}
long long max=0;
for(i=0; i<size; i++){
if(max < a[i] || i==0){
max = a[i];
}
else{
... | 1 | 99,491,162 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#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 REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cstdio>
#include <cstdint>
#define READINT(X) if(ci-cn+16>cm){while((ct=readchar())>='0')(X)=(X)*10+ct-'0';}else{while((ct=*ci++)>='0')(X)=(X)*10+ct-'0';}
using namespace std;
uint16_t d, k;
uint32_t M ... | 1 | 84,795,780 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){
long long n;
cin >> n;
int ans = 10;
for(int i = 1; i <= sqrt(n); i++) {
if(n % i == 0) {
int keta = 0;
long long syou = n / i;
while(syou > 0) {
... | #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;
ll f(ll a) {
ll aa = a, cou = 0;
while(aa > 0) {
cou+... | 1 | 43,676,738 |
#include <bits/stdc++.h>
using namespace std;
int n;
int num[55], ans;
map<string, int> id;
string s;
int main()
{
cin >> n;
for(int i = 1; i <= n; i++) cin >> s >> num[i], id[s] = i;
cin >> s;
for(int i = id[s] + 1; i <= n; i++) ans += num[i];
printf("%d", ans);
return 0;
} | #include <iostream>
using namespace std;
int main() {
short N;
cin >> N;
short* music_time = new short[N];
int sleep_time = 0;
string* title = new string[N],X;
for(int i = 0; i < N; i++) cin >> title[i] >> music_time[i];
cin >> X;
for (int i = N - 1; title[i] != X; i--)sleep_time += music_time[i];
cout << sle... | 1 | 83,092,742 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> drink(n);
rep(i,n) {
ll a, b;
cin >> a >> b;
drink[i] = make_pair(a, b);
}
sort(drink.begin(), drink.e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll b,c,h,i,j,k,l,m,n,x,y;
ll ans = 0;
string s;
cin >> n >> m;
vector<pair<ll,ll>> a(n);
for(i=0;i<n;i++) cin >> a[i].first >> a[i].second;
sort(a.begin(),a.end());
i = 0;
... | 1 | 7,146,747 |
#include <bits/stdc++.h>
using namespace std;
map<string, bool> record;
int main(int argc, char const *argv[])
{
int n;
string oper, s;
while (~scanf("%d", &n))
{
record.clear();
for (int i = 0; i < n; ++i)
{
cin >> oper >> s;
if("insert" == oper) record[s... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
using namespace std;
int solve(){
string c, s;
map<string, bool> mp;
int n;
cin >> n;
for (int i = 0; i < n; i++){
cin >> c >> s;
if (c == "insert") mp[s] = true;
else {
if (mp[s]) cout << "yes" << endl;
else co... | 1 | 98,315,998 |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int i,j,k,l,m,a,b;
vector< vector<int> > s;
s.resize(9);
for (i = 0; i < 9; i++) {
s[i].resize(101);
}
for (i = 0; i < 9; i++) {
for (j = 0; j < 101; j++) {
s[i][j] =... | #include<map>
#include<list>
#include<cmath>
#include<stack>
#include<string>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
int A[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int cunt = 0;
void depth(int n, int s, int i){
if (n == 0 && s == 0){
cunt++;
return;
}
else if (n == 0) return;... | 1 | 24,046,480 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; ++i)
#define all(a) (a).begin(), (a).end()
int N, K;
vector<int> H;
int main() {
cin >> N >> K;
H.resize(N + 1, 0);
rep(i, N) cin >> H[i + 1];
const ll INF = 1e18;
vector<vector<ll>> dp(N + 1, vec... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(int)(b); i++)
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define st first
#define nd second
#define KW(a) ((a)*(a))
using namespace std;
const int maxN = 1 << 9;
const long long INF = 1000000000000000ll;
int T[m... | 1 | 14,409,932 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i< (n); i++)
using namespace std;
using ll = long long;
typedef pair<int,int> P;
int main(void) {
int N,K; cin >> N >> K;
vector<ll> H;
ll ans = 0;
for(int i=0; i<N; i++) {
ll x; cin >> x;
H.push_back(x);
}
sort(H.begin(),H... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 2e5;
ll a[maxn];
int main () {
int n, k;
cin >> n >> k;
for (int i=1; i<=n; i++) {
cin >> a[i];
}
sort(a+1, a+1+n);
ll ans = 0;
for (int i=1; i<=n-... | 1 | 94,516,489 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
# define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
# d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int k = 1;
while(k * (k - 1) / 2 < n) {
k += 1;
}
if(k * (k - 1) / 2 != n) {
cout << "No" << endl;
return 0;
}
const int m = n * 2 / k;
vector<vector<int>> ans(k);
vector<int> cnt(n);
... | 1 | 45,646,213 |
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
using namespace std;
using LL = lo... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <cstring>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int wf[10][10];
int ma... | 1 | 39,531,203 |
#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>;
const int maxn = 55;
int a[maxn];
int temp[maxn],n,m;
int main(){
int i,ans=0;
cin >> n >> m;
for(i=1;i<=n;i++)
cin>>a[i];
for(int l=0;l<=n;l++)
{
for(int r=n... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define MAX_N 50
int v[MAX_N];
int n;
int k;
int favour_left[MAX_N][MAX_N + 1];
int favour_right[MAX_N][MAX_N + 1];
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
int i;
for(i = 0; i < n; ++i){
... | 1 | 55,343,366 |
#include<cstdio>
#include<iostream>
using namespace std;
#define ll long long
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define MD 1000000007
char sep[2] = {' ', '\n'};
int main() {
int i, j, k, n, m, f, r;
char g;
while(true) {
cin>>m>>f>>r;
if (m==-1&&f==-1&&r==-1) break;
if (m... | #include<iostream>
using namespace std;
char getGrade(int a,int b,int c);
int main() {
int a,b,c;
while (1) {
cin >> a >> b >> c;
if ( a == -1 && b == -1 && c == -1 ) break;
cout << getGrade(a,b,c) << endl;
}
return 0;
}
char getGrade(int a,int b,int c) {
if ( a == -1 || b == -1 ) return 'F';
else ... | 1 | 33,082,230 |
#include <iostream>
using namespace std;
int main() {
int n,y;
cin >> n >> y;
int a= -1, b = -1, c = -1;
for (int i = 0; i < n + 1; i++) {
if (y < i * 10000) break;
for (int j = 0; j < n - i + 1; j++) {
int n_d = n - i - j;
int total = 10000 * i + 5000 * j + 1000 ... | #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... | 1 | 9,211,715 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
int main(){
int n;
cin >> n;
string s;
cin >> s;
vector<vector<vector<bool>>> dp(n+1,vector<vector<bool>>(4,vector<b... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | 1 | 36,474,273 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int n,h,w;
cin>>n>>h>>w;
int a[n],b[n];
for(i=0;i<n;i++)cin>>a[i]>>b[i];
for(i=0;i<n;i++){
if(a[i]>=h && b[i]>=w)cnt++;
}
cout<<cnt;
} | #include <iostream>
using namespace std;
int main()
{
int N, H, W;
cin >> N >> H >> W;
int count = 0;
for(int n = 0; n < N; n++) {
int A, B;
cin >> A >> B;
if(A >= H && B >= W) {
count += 1;
}
}
cout << count << endl;
return 0;
} | 1 | 93,491,950 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL<<60;
int LIS(const vector<long long> &a){
int N = (int)a.size();
vector<long long> dp(N, INF);
for(int i = 0; i < N; i++){
auto it = lower_bound(dp.begin(), dp.end(), a[i]);
*it = a[i];
}
return lower_bound(dp.be... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int... | 1 | 71,169,300 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
int remainder;
bool vqrno=false;
while(n!=0){
remainder=n%10;
if(remainder==7){
vqrno=true;
break;
}
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
if(s[0] !='7' &&s[1] !='7'&& s[2] !='7')cout << "No"<<endl;
else cout <<"Yes" <<endl;
} | 1 | 51,288,895 |
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
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(a > b){ a = b; return... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db long double
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define mi map<int,int>
#define ml map<ll,ll>
#define mii map<pii,int>
#define fi first
#define se second
#define ... | 1 | 25,853,327 |
#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 rSORT(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 << " = " << (... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1000000000100000000;... | 1 | 62,006,368 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define REP(i, d, n) for(int i=(d); i<(n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
string t = s.substr(0, 4);
string u = s.substr(4);
... | 1 | 62,957,315 |
#include<iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int P_sum;
P_sum = A * 3 + P;
cout << P_sum / 2;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... | 1 | 31,623,629 |
#pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = (n-1); i >= 0; --i)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(AL... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using P = pair<int,int>;
using ll = long long;
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n) {
rep(i, n... | 1 | 49,224,619 |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589,da,db;
int a,b;
scanf("%d %d",&a,&b);
da=static_cast<double>(a);
db=static_cast<double>(b);
printf("%d %d %.8lf\n",a/b,a%b,da/db);
return 0;
} | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
double f = a*1.0 / b*1.0;
printf("%d %d %.8lf\n", a/b, a%b, f);
... | 1 | 8,770,307 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
int N,M,P,X[1000];
int i;
int sum,ans,winner;
while(1){
sum = 0;
cin >> N >> M >> P;
if(N == 0 && M == 0 && P == 0){
break;
}
for(i = 1 ; i <= N ; i++){
cin >> X[i];
sum += X[i];
if(M == i){
winner = X[i];
}
}
if(... | #define _crt_secure_no_warnings
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cst... | 1 | 69,473,471 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<unordered_map>
#include<utility>
#include<vector>
constexpr int IINF = (1 << 30) - 1;
constexpr long long... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const static int MOD = 1000000007;
int main(){
string S;
cin >> S;
int initial = 0;
while(initial < S.size()){
if(initial + 4 >= S.size() || (S[init... | 1 | 56,688,488 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
int main() {
string S;
cin >> S;
reverse(S.begin(), S.end());
vector<str... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll mod = 1000000007;
const ll INF = 9223372036854775807;
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define Pi acos(-1)
int mai... | 1 | 71,426,185 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 1 | 90,739,603 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
string ans;
if(d == 25) ans = "Christmas";
else if(d == 24) ans = "Christmas Eve";
else if(d == 23) ans = "Christmas Eve Eve";
else ans = "Christmas Eve Eve Eve";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
int D;
cin >> D;
if (D == 25) cout << "Christmas" << endl;
else if (D == 24) cout << "Christmas Eve" << endl;
else if (D == 23) cout << "Christmas Eve Eve" << endl;
else if (D == 22) cout << "Christmas Eve Eve Eve" << endl;
return 0;... | 1 | 68,034,829 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod=1e9;
int main(){
ll n;
cin>>n;
int sum(0);
int tmp(0);
for (int i(1);i<=n;i++){
sum+=i;
if (sum>=n){
tmp=i;
break;
}
}
for (int i(1);i<=n;i++){
if (i==sum-n) continue;
else if(tmp<i) break;
els... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
#include <iomanip>
#include <stack>
#include <bitset>
#include <functional>
using namespace std;
const constexpr int INF = 1e9;
typedef ... | 1 | 52,051,943 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 1 | 75,636,408 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ll n, res = 1;
string s;
cin >> n >> s;
ll num[30]={};
for (auto c : s) num[c - 'a']++;
for (int i = 0; i < 26; ++i) {
res *= num[i] + 1;
res %= M... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes \
cout << "Yes" << endl; \
return 0;
#define No \
cout << "No" << endl; \
return 0;
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
t... | 1 | 32,423,266 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int main(){
string s;
getline(cin,s);
... | #include <stdio.h>
#include <string.h>
#include <string>
#include <map>
#include <algorithm>
using namespace std;
int
main(void)
{
char line[1002];
if (fgets(line, sizeof line, stdin) == NULL) {
return 0;
}
char* token = strtok(line, " \n");
map<string, int> s;
int m = 0;
string ms;
while (token) {
string t... | 1 | 11,863,241 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0, b = 0, c = 0;
for (int i = 0; i < 3; i++) {
if (S[i] == 'a') a++;
else if (S[i] == 'b') b++;
else if (S[i] == 'c') c+... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
sort(s.begin(), s.end());
if(s == "abc") cout << "Yes\n";
else cout << "No\n";
return 0;
} | 1 | 39,165,578 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
stack<int> st;
int a;
cin >> a;
st.push(a);
while (cin >> a) {
if (a) st.push(a);
else { cout << st.top() << endl; st.pop(); }
}
} | #include <iostream>
#include <stack>
int main(){
std::stack<int> st;
int N = 0;
int a;
while(N <= 100 && std::cin >> a){
if(a != 0){
st.push(a);
}
else{
std::cout << st.top() << std::endl;
st.pop();
}
++N;
}
} | 1 | 75,227,990 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int cnt = 0;
bool st = false;
bool ron=false,lon=false;
while(n--){
string s;
cin>>s;
if(s=="lu") lon=true;
if(s=="ru") ron=true;
if(s=="ld") lon=false;
if(s=="rd") r... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(1){
cin >> n;
if(n == 0) break;
int count = 0;
string back;
for(int i=0; i<n; i++){
string s;
cin >> s;
if(s == "lu" && back == "ru") count++;
if(s == "ru" && back == "lu") count++;
if(s == "ld" &... | 1 | 59,730,782 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
--u; --v;
if (u > v) swap(u, v);
g[u].push_back(v);
... | 1 | 27,293,134 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.