code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,k;
cin>>a>>b>>k;
int cnt=0,ans;
for(int i=100;i>0;i--){
if(a%i==0 && b%i==0){
cnt++;
}
if(cnt==k){
ans=i;
... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()... | 0 | 31,651,145 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | 0 | 2,749,565 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
const int M = 1000005;
int main() {
int x;
cin >> x;
int zy = x / 100;
int per = x % 100;
int cnt = z... | #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... | 0 | 75,546,545 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #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... | 0 | 42,145,136 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | #include <bits/stdc++.h>
using namespace std;
string solve(vector<string>&a, vector<string>&b){
int n = a.size();
int m = b.size();
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
int res = 0;
for(int k = 0; k < m; k++){
for(int l = 0; l < m; l++){
... | 0 | 17,343,190 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=20010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
retu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0; (i)<(int)(n); (i)++)
#define frep(i,m,n) for(int (i)=(m); (i)<(int)(n); (i)++)
#define rrep(i,n) for(int (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(int (i)=(n)-1; (i)>(int)(m)-1; (i)--)
#define all(x) (x).begin(), (x).end()
#define sq... | 0 | 62,775,882 |
#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 ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#defi... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 3,447,774 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <cmath>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
#define rep(i, o) for (ll i = 0; i < (o);i++)
#define rep_s(i, o) for (int i = 1; i <= (o);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<(int)(b);i... | 0 | 9,609,202 |
#include <bits/stdc++.h>
#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 = 1000000000;
const ll inff = 1000000000000000000;
int main(){
string s;
cin >> s;
st... | #include<iostream>
#include<vector>
#include<string>
#include<list>
int main(){
int n;
std::cin >> n;
std::list<int> out;
for(int i = 0; i < n; i++){
int a;
std::cin >> a;
if(i % 2 == 0){
out.push_back(a);
}else{
out.push_front(a);
}
}
... | 0 | 9,989,196 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H1,M1,H2,M2,K,ans=0,minute=0; cin >> H1 >> M1 >> H2 >> M2 >> K;
cout << 60*(H2-H1) + (M2-M1) -K << endl;
} | #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 | 89,624,659 |
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (((A <= C) && (C <= B)) ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a >= b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; ... | 0 | 58,881,302 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dd;
const int mod=1e9+7;
const int N = 1e5+5;
string now;
int main(){
cin>>now;
if(now.size() == 2){
if(now[0] == now[1]) cout<<"1 2"<<endl;
else cout<<"-1 -1"<<endl;
return 0;
}
for(int i = 0;i < now.size();i++){
... | #include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 2e5 + 7;
const double eps = 1e-9;
const long double pi = 3.1415926535897932384626433... | 0 | 7,107,877 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
bool flag;
int num;
cin >> N >> A;
num = N % 500;
if(A >= num){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a... | 0 | 74,528,204 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
#de... | 0 | 2,096,540 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int x;
cin >> x;
if (x < 1200) {
puts("ABC");
} else {
puts("ARC");
}
return 0;
} | #include<bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <map>
#include <cmath>
#include <algorithm>
#define INF 0x3f3f3f3f
#define SI(a) scanf("%d",&a)
#define ms(a,x) memset(a,x,sizeof(a))
typedef long long ll;
const int mod = 998244353;
const int max... | 0 | 9,832,926 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define MOD 1000000007
int main(){
int n;
cin >> n;
map<int,int> mp;
rep(i,n){
int a;
cin >> a;
mp[a]++;
}
int cnt=0;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<int> dict(N);
for (int i=0; i < N; i++) {
int x ;
cin >> x;
dict.at(x)++;
}
int length;
for (int i=0; i < N; i++) {
if (dict.at(i)){
length = i;
}
}
int ng_flag = 0;
if(length%2 == 0... | 0 | 80,267,067 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int count = 0;
int nokori = 15 - s.size();
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o') count++;
}
cout << (count + nokori >= 8 ? "YES" : "NO") << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
char a, b;
int main... | 0 | 10,370,885 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = n-1; i >= 0; i--)
#define FOR(i, n, m) for(int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()... | #include<iostream>
#include<cstring>
using namespace std;
#define INF -2000000000
int main() {
int n, b[1000],c[1000][4];
memset(b, -128, sizeof(b));
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
for (int i = 1; i <= n; i++) {
cout << "node " << i << ": key = " << b[i] << ", ";
if (b[i / 2] >= INF... | 0 | 63,411,668 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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(void) {
ll L, R;
cin >> L >> R;
ll ans =2020;
ll r = min(L + 2019, R);
for (ll i =... | #include <bits/stdc++.h>
using namespace std;
void chmin (int& a, int b) {
if (a > b) a = b;
}
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i < S.size()-2; i++) {
if (S[i] > '7') {
chmin(ans, (S[i]-'7') * 100 + (S[i+1]-'5') * 10 + S[i+2]-'3');
} else if (S[i] < '7') {
ch... | 0 | 19,446,938 |
#include<iostream>
#include<vector>
#include<numeric>
using namespace std;
int main() {
int n, m;double p;
while (cin >> n >> m >> p&&n&&m) {
vector<int> x;
int cnt = 0,y;
for (int i = 0; i < n; i++) {
cin >> y;
x.push_back(y);
}
double money = 100*accumulate(x.begin(), x.end(), 0);
money = money*(1... | #include<iostream>
using namespace std;
int main(){
int i,h,a=0,b=0,c=0;
for(i=0;i<10;i++){
cin >> h;
if(a<h){
c=b;
b=a;
a=h;
}else if(b<h){
c=b;
b=h;
}else if(c<h){
c=h;
}
}
cout << a << endl << b << endl << c << endl;
return 0;
} | 0 | 95,173,176 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,int>
#define T tuple<int,int,int>
using namespace std;
ll ni(ll a,ll b){
if(b... | 0 | 57,509,420 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string str;
int n;
while(cin >> str){
if(str=="-") break;
cin >> n;
for(int i=0,h;i<n;i++){
cin >> h;
string cat = str.substr(0,h);
str.erase(0,h);
str+=cat;
}
cout << str << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | 0 | 83,770,562 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(),in.end()
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int ctoi(char c){
switch (c){
case '0': return 0;
case '1': return 1;
case '2': return ... | 0 | 77,165,129 |
#include <iostream>
#include <cassert>
#include <limits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <array>
#include <map>
#include <set>
#include <deque>
#include <list>
#include <sstream>
#include <iomanip>
#include <numeric>
#i... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define ALL(v) v.begin(),v.end()
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cout<<v[i]<<" "
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<int, int> P;
struct ... | 0 | 48,699,566 |
#include<iostream>
#include<climits>
#include<vector>
#include<list>
#include<functional>
#include<algorithm>
#include<string>
#include<cmath>
#include<complex>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace... | #include<stdio.h>
int main()
{
long long a,b,c,k;
while(~scanf("%lld %lld %lld %lld", &a, &b, &c, &k))
{
if(k/2 == (k+1)/2)
printf("%lld\n", a-b);
else
printf("%lld\n", b-a);
}
return 0;
} | 0 | 53,906,587 |
#define debug(x) cout<<#x<<": "<<x<<endl
#define rep(i, a, b) for(int i=a; i < b;i++)
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#include <deque>
using namespace std;
void newline() {cout << endl;}
template <typename T>
void display(T input){cout << input;}
template ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod=1e9+7;
int mod2=998244353;
signed main(){
while(true){
int n,m;
cin>>n>>m;
if(!n&&!m)break;
vector<pair<int,int> > a(n);
for(int i=0;i<n;i++){
cin>>a[i].second>>a[i].first;
}
sort(a.begin(),... | 0 | 70,133,625 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define vi vector<int>
#define pi pair<int, int>
#define pb push_back
#define ppb pop_back
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> index... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF 2000000000
#define MOD 1000000007
using namespace std;
... | 0 | 70,000,354 |
#include <iostream>
#include <vector>
using namespace std;
vector<int> M[10000];
vector<int> m[10000];
int mark[10000]={0};
int main(){
int V;
int E;
int s,t;
cin >> V >> E;
for(int i=0;i<E;i++){
cin >> s >> t;
M[s].push_back(t);
m[t].push_back(s);
}
for(int i=0;i<V;i++){
for(int j=0;j<V;j... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
void solve()
{
int mx=50000000;
int n,x,m;
cin>>n>>x>>m;
mx=min(mx,n);
int prev=x;
int ans=x;
unor... | 0 | 95,610,023 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t H,W;
cin >> H >> W;
if (W==1 || H ==1){
cout << 1 << endl;
}
else if (H%2==1 && W%2==1){
cout << W*(H/2)+W/2+1 << endl;
}
else {
cout << H*W/2 << endl;
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
typedef long long llong;
using namespace std;
int main() {
char iptNum[1100];
int sum = 0;
while (1) {
fgets(iptNum, 1100, stdin);
if (iptNum[0] == 48)break;
sum = 0;
for (int i = 0;48<= iptNum[i]&&iptNum[i]<=57 ; ... | 0 | 41,877,983 |
#include <bits/stdc++.h>
#define dcout cout << fixed << setprecision(15)
#define rep(i, a) for(int i = 0; i < a; i++)
#define arep(i, x) for(auto i : x)
#define all(v) v.begin(), v.end()
#define int long long
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
using namespace std;
signed ... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 42,124,829 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> p(n);
for(int i=0;i<n;i++)cin>>p[i];
int ans=1;
int m=p[0];
for(int i=1;i<n;i++){
if(p[i]<=m){
ans++;
m=p[i];
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int inf = 1000000000+7;
int n,m;
cin >> n >> m;
int x;
int ans1=0;
int ans2=0;
for(int i=1;i<=n;i++){
cin >> x;
ans1 = (ans1+(n - 2*i +1)*x)%inf;
}
for(int i=1;i<=m;i++){
cin... | 0 | 10,107,869 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main(){
char a,b;
cin>>a>>b;
if(a>b)cout<<'>';
else if(a<b)cout<<'<';
else cout<<'=';
return 0;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <stdlib.h>
#include <set>
#include <atcoder/dsu>
typedef long long ll;
using namespace std;
u... | 0 | 22,312,784 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(fa... | #include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i+... | 0 | 16,026,091 |
#include <iostream>
using namespace std;
int n;
int f,r;
int B ,F,R,V;
int array[4][10][10];
void Array(int b,int f,int r)
{
array[b-1][f-1][r-1] += V;
}
void input()
{
for(int i=0; i<n; i++)
{
cin >> B >> F >> R >> V;
Array(B,F,R);
}
}
int main()
{
cin >> n;
for(int z=0; z<4; z++){
for(int i=0; i<3; i++)... | #include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <de... | 0 | 16,020,897 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
string s;
cin ... | #include<bits/stdc++.h>
using namespace std;
#define pi 3.1415926535
#define endl "\n"
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define ll long long
#define llu unsigned long long
#define setbits(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define sz(x) (int)x.size()
#define tc int... | 0 | 39,801,005 |
#include <stdio.h>
void judge(int x, int y, int z);
int pow2(int x);
int main(void)
{
int dataset;
scanf("%d", &dataset);
int side1, side2, side3;
while (dataset--){
scanf("%d %d %d", &side1, &side2, &side3);
judge(side1, side2, side3);
}
return 0;
}
void judge(int x, int y, int ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,... | 0 | 20,574,043 |
#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<(S)<<endl
#define ck(a,b) (0<=(a)&&(a)<(b))
using namespace std;
int main(){
int m,nmin,nmax;
while(cin>>m>>nmin>>nmax,m){
int P[201];
int maxg=0;
int ans;
REP(i,0,m) cin>>P[i];
REP(i,nmin,nmax+1){
int gap=P[i-1]-P[i];
... | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
ty... | 0 | 1,759,023 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 44,408,188 |
#include<bits/stdc++.h>
using namespace std;
long long k=9,n;
struct node
{
long long a,b;
};
queue<node>Q;
int main()
{
cin>>n;
for(int i=1;i<=9;i++)
{
node tmp;
tmp.a=tmp.b=i;
Q.push(tmp);
}
while(!Q.empty())
{
node tmp=Q.front();
Q.pop();
long long a=tmp.a,b=tmp.b,t=tmp.a%10;
if(b==n)
{
c... | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string>
using namespace std;
int main(){
int height,width;
while(true){
cin >> height >> width;
if(height == 0 && width == 0)break;
for(int i = 0; i < height; i++){
... | 0 | 72,184,125 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <vector>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a[5],ans;
for(int i=0;i<3;i++){
cin>>a[i];
}
sort(a,a+3);
ans=a[2]*10;
ans+=a[0]+a[1];
cout<<ans<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
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; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x)... | 0 | 94,732,552 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int N, K, n = 1;
cin >> N;
cin >> K;
rep(i, N)
{
if(n <= K){
n *= 2;
}else{
n += K;
}
}
... | 0 | 38,123,999 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <s... | #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;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | 0 | 69,782,264 |
#define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define ... | #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 | 3,586,897 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,n;
cin>>x>>n;
int sa=0;
int frag2=0;
vector<int> num(n);
for(int i=0;i<n;i++)
{
cin>>num.at(i);
}
for (int i = 0; i < 100; i++)
{
int frag=0;
int frag2=0;
for (int j = 0; j < n; j++)
{
if (num.at(j)==x+i)
{
frag++;... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,sum=0;
cin>>n;
string s= to_string(n);
for(int i=0;i<s.length();i++)
{
sum+=s[i]-'0';
}
if(n%sum==0)
{
cout<<"Yes"<<"\n";
}
else
{
cout<<"No"<<"\n";
}
return 0;
} | 0 | 96,910,225 |
#include<cstdio>
const int N=1e5+9;
int L[17][N],R[17][N],n,t,q,X[N],ans;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d",X+i);
scanf("%d",&t);
for(int i=1,it=1;i<=n;++i){
while(it<n&&X[it+1]-X[i]<=t)++it;
R[0][i]=it;
}
for(int i=n,it=n;i;--i){
while(it>1&&X[i]-X[it-1]<=t)--it;
L[0][i]=it;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e2+5 , M = 1e5+5 , MOD = 1e9+7;;
int n , k;
ll A[N] , sum[N] , bit[N][M] , dp[N][M];
void add(int x , int y , int val){
for(int i = y ; i < M ; i+=i&-i) bit[x][i] = (bit[x][i]+val)%MOD;
}
ll query(int x , int y){
ll r = 0;
for(int ... | 0 | 83,276,144 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
vector<char> v;
string s;
cin >> s;
for (char c: s) {
if (c != 'B') v.emplace_back(c);
else if (!v.empty()) v.pop_back();
}
string res(begin(v), end(v));
cout << res << "\n";
} | #include <iostream>
#include <bits/stdc++.h>
#define lli unsigned long long int
using namespace std;
#define S second
#define F first
#define pb push_back
#define M1 1000000007
#define M2 998244353
#define pint pair<int,int>
#define setit set<int>::iterator seti
#define mapit map<int,int> ::iterator mapi
#define MP mak... | 0 | 40,972,945 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
long long N; cin >> N;
long long a[55];
long long cnt = 1;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
long long ans = 0;
while (cnt > 0) {
cnt = 0;
for (int i = 0; i < N; i++) {
if (a[i] >= N) {
cnt... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e18;
int main(){
ll H,W;
cin >> H >> W;
ll ans = INF;
FOR(i,1,H){
ll s1 = i * W;
ll s2, s3;
s2 = (H-i) * (W/2);
... | 0 | 40,769,604 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
signed main()
{
int n,i,j;
cin>>n;
int sum=(n*(n+1))/2;
for(i=2;i<=n;i++)
{
for(j=i;j<=n;j+=i) sum+=(j);
}
cout<<sum;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
const char C[10][6] = {
{},
{'.',',','!','?',' ', 5 },
{'a','b','c', 0 , 0 , 3 },
{'d','e','f', 0 , 0 , 3 },
{'g','h','i', 0 , 0 , 3 },
{'j','k','l', 0 , 0 , 3 },
{'m','n','o', 0 , 0 , 3 },
{'p','q','r','s', 0 , 4 },
{'t','u','... | 0 | 61,922,759 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 10005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main()
{
FAST;
ll n;
cin >> n;
string s;
cin >> ... | #include <iostream>
using namespace std;
int main() {
int n, max1 = 0, max2 = 0, pos = 0, k;
cin >> n;
for(int i = 1;i <= n;i++){
cin >> k;
if(max1 <= k){
pos = i;
max2 = max1;
max1 = k;
}else if(max2 < k){
max2 = k;
}
}
for(int i = 1;i <= n;i++){
if(pos == i){
... | 0 | 93,552,900 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false) ;
cin.tie(NULL) ;
int n = 0 , k = 0 ;
cin >> n >> k ;
vector<int> height(n+1), cost(n+1, INT_MAX) ;
for(int i = 1 ; i <= n ; i++)
cin >> height[i] ;
cost[1] = 0 ;
for(int i = 2 ; i <= n ;... | #include <bits/stdc++.h>
#define reg register
#define pr std::pair<ll, int>
#define fi first
#define se second
#define FIN(s) freopen(s, "r", stdin)
#define FOUT(s) freopen(s, "w", stdout)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define lep(i, l, r) for (int i =... | 0 | 86,744,919 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double x = pow(double (x1 - x2), 2);
double y = pow(double (y1 - y2), 2);
double dis = sqrt(double (x + y));
printf("%lf\n", dis);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 18,586,874 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | #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){
... | 0 | 99,967,570 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#incl... | #include <iostream>
#include <vector>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
const int kNil = -1;
enum class Color {
kWhite,
kGrey,
kBlack,
};
template <class T>
struct Edge {
using w_type = T;
Edge(int u, int v, w_type w): u(u), v(v), w(w) { }
int u, v;
w_type w;
... | 0 | 67,081,206 |
#include<bits/stdc++.h>
using namespace std;
void c_p_c()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main()
{
int a, b;
cin >> a >> b;
int p = a * b;
if (p & 1)
cout << "Odd";
else
cout <... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 86,958,463 |
#include <stdio.h>
#include <math.h>
#include <iostream>
using namespace std;
int main(void)
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%f\n",sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2)));
} | #include <iostream>
#include <climits>
#include <algorithm>
using namespace std;
int main() {
long long dist[105][105];
for (int i = 0; i < 105; ++i) {
for (int j = 0; j < 105; ++j) {
dist[i][j] = INT_MAX;
if (i == j) dist[i][j] = 0;
}
}
int v, e, s, t, d;
ci... | 0 | 77,030,430 |
#include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define rep(i,n) for(int i = 0; i < (n); i++)
#define Srep(i,a,n) for(int i = (a); i < (n); i++)
using namespace std;
int main(){
int n;
bool ans=false;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
Vsort(a);
rep(i,n-1) if(a[i] == a[i+1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (sca... | 0 | 63,773,377 |
#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<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define ll long long int
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define ... | 0 | 75,902,630 |
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#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 ALL(v) (v).begin(),(v).end()
#define COUT(x) cout<<(x)... | 0 | 60,684,511 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,a,n) ... | 0 | 70,249,724 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
for(int i = 1;i <= n;i++){
long long y = n/i;
ans += i * y * (y + 1) / 2;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0;i < n;i++)cin >> a[i];
ll money = 1000;
for(int i = 0;i < n;i++){
int st = a[i];
int now = a[i];
int j = i;
while(j < n && now <= a[j]){
now = a[j];
j++;
}
int end = a... | 0 | 97,270,274 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#include <stack>
#define rep(i, n) for(... | 0 | 65,066,299 |
#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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 94,857,547 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
#include <time.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
t... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define all(x) begin(x), end(x)
#define rot(s, k) rotate(s.begin(), s.begin()+ s.size()-(k%s.size()), s.end());
map<int, int> yes;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<int> arr(n);
for(int i{}; i<n; i++){
int ... | 0 | 55,174,570 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
int main() {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector<int> x(N), y(M);
for (int i = 0; i < N; i++) cin >> x[i];
for (int i = 0; i < M; i++) cin >> y[i];
strin... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 0 | 83,825,795 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,n,maxA=0,maxAi=0,submaxA=0; cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(maxA<=a&&submaxA<=a){
submaxA=maxA;
maxA=a;
maxAi=i;
}else if(submaxA<=a){
submaxA=a;
}
}
for(int i=0;i<n;i++) cout<<(maxAi==i?submaxA:max... | 0 | 9,345,602 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
#include... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | 0 | 50,127,070 |
#include <iostream>
#include <queue>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
int dy[] = {0, 1, 0, -1};
int dx[] = {1, 0, -1, 0};
using namespace std;
int H, W, N;
char map[1003][1003];
int dist[1003][1003];
int bfs(char s, char t) {
queue<int> que_x, que_y;
rep(y, 1003) rep(x, 1003) dist... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | 0 | 90,090,731 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double a, b, c, C;
double S,L,h;
cin>>a>>b>>C;
h = b*sin(C/180*M_PI);
S = a * h / 2;
c = sqrt((pow(a,2)+pow(b,2) - 2 * a * b * cos(C/180*M_PI)));
L = a+b+c;
printf("%10lf\n", S);
printf("%10lf\n", L);
printf("%10lf\n", h);
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
vector<int> a(10);
for (int i = 0; i < 4; i++)
{
cin >> n;
a[n]++;
}
if (a[1] && a[4] && a[7] && a[9])
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
} | 0 | 31,837,387 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, a, b, ans = 0;
cin >> n >> m;
vector<int> high(n);
vector<int> view(n,0);
vector<vector<int>> road(m,vector<int>(2));
for (int i = 0; i < n; i++) cin >> high.at(i);
for (int j = 0; j < m; j++){
cin >> a >> b;
... | #include <bits/stdc++.h>
#include <iostream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define fix(f,n) std::fixed<<std::setprecision(n)<<f
ll mod = 1e9 + 7;
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
t... | 0 | 48,877,548 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
const int MAXN = 100000 + 20, MAXM = 20, MOD = 1000 * 1000 * 1000 ... | #include<bits/stdc++.h>
#define ll long long
const int N=100005;
using namespace std;
string s,t;
int main(){
cin>>s>>t;
if(s[0]<t[0]) cout<<"<";
else if(s[0]==t[0]) cout<<"=";
else cout<<">";
return 0;
} | 0 | 75,958,707 |
#include <bits/stdc++.h>
const int MAXN = 100010;
int head[MAXN], to[MAXN << 1], nxt[MAXN << 1], tot;
void addedge(int b, int e) {
nxt[++tot] = head[b]; to[head[b] = tot] = e;
nxt[++tot] = head[e]; to[head[e] = tot] = b;
}
int dfs(int u, int b = 0, int fa = 0) {
int sc = 0;
for (int i = head[u]; i; i = nxt[i]) if (... | #include <stdio.h>
int main(){
int N;
char S[N];
scanf("%d", &N);
scanf("%s", S);
int yes = 0, no = 0;
if(N % 2 == 0){
for(int i = 0; i < (N / 2); i++){
if(S[i] == S[i + (N / 2)]){
yes++;
}else{
no++;
}
}
if(yes == N / 2){
printf("Yes");
}else{
printf("No");
}
}else{
printf("No... | 0 | 49,609,753 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long X, long long N, std::set<long long> p)
{
ll m = INT_MAX;
ll ans = X;
for (ll i = 0; i <= 101; i++)
{
if (p.count(i) == 0)
{
if (m > abs(X - i))
{
m = abs(X - i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespac... | 0 | 15,052,750 |
#include <bits/stdc++.h>
#include <sstream>
#include <iomanip>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std... | #include <iostream>
#include <cstdlib>
#include <list>
#include <map>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(void)
{
int N;
cin >> N;
int64_t a[100000];
int64_t p = 1;
for (int i = 0; i < N; ++i)
{
cin >> a[i];
if (a[i] == 0)
... | 0 | 17,396,359 |
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
string abc="abc... | #include<iostream>
#include<deque>
using namespace std;
long long N, A, B;
int main(){
cin >> N >> A >> B;
if(A + B > N + 1 || A * B < N){
cout << -1 << endl;
return 0;
}
deque<long long> res;
int cnt = 0;
long long resid = N - (A + B - 1);
for(int b = 0; b < B - 1; b++){
... | 0 | 11,199,363 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
using P=pair<int, int>;
struct UnionFind
{
vector<int> uni;
UnionFind(int n) : uni(n, -1) {}
int root(int a)
{
if (uni[a] < 0) return a;
return uni[a] = root(uni[a]);
}
bool connect(int a, int b)... | #include<bits/stdc++.h>
#define INFTY (1<<30)
using namespace std;
int h,heap[22000001];
void maxheap(int i){
int l,r,lage;
l=i*2;
r=i*2+1;
lage=i;
if(l<=h&&heap[l]>heap[lage])lage=l;
if(r<=h&&heap[r]>heap[lage])lage=r;
if(lage!=i){
swap(heap[i],heap[lage]);
maxheap(lage);
}
return;
}
void inc... | 0 | 72,084,286 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using vvi=vector<vi>;
using vs=vector<string>;
int main() {
int N,A,B; cin >>N >>A >>B;
cout <<((B-A)%2=... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,0,n)
#define _rrange(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);--i)
#de... | 0 | 66,758,296 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
long long n, fn;
int main() {
cin >> n;
fn = 1;
for (int i = 0; n > 1; n--) {
fn *= n... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#include <functional>
#define mod 998244353
#define int long long
#define ld long double
#... | 0 | 95,879,270 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#define _USE_MATH_DEFINES
#include<math.h>
#include<unordered_map>
#define min(a,b) (a)>(b)?(b):(a)
#define max(a,b) (a)>(b)?(a):(b)
using namespace std;
int main()
{
vector<str... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namesp... | 0 | 93,737,179 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
for ( int i = 0; i < N; ++i){
int c = S[i] - '0';
int c2 = i % 2;
if ( c != c2 ) ++ans;
}
int ans2 = 0;
for ( int i = 0; i < N; ++i){
int c = S[i]... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | 0 | 18,408,737 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it))... | #include<bits/stdc++.h>
#define IO if(fopen("input.txt","r")) freopen("input.txt","r",stdin),freopen("output.txt","w",stdout)
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<... | 0 | 46,752,692 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int>... | 0 | 78,138,877 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define dump(x) ... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N;
... | 0 | 48,193,232 |
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
long a,b;
cin>>a>>b;
double z;
long x = a/b;
long y = a%b;
z = (double)a/(double)b;
cout<<x<<" "<<y<<" "<<fixed << setprecision(8)<<z<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MX = 1'000'000 + 1;
int main() {
int n;
cin >> n;
vector<int> a(n), p(MX);
for (int &i : a) {
cin >> i;
p[i]++;
}
int pw = 1;
for (int i = 2; i < MX; i++) {
int cnt = 0;
for (int j = i; j < MX; j += i) cnt += p[j];
if (cnt > 1) {
... | 0 | 93,917,158 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
} else {
... | 0 | 55,996,517 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
#include <climits>
using namespace std;
int main()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>>board(h, vector<char>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++)cin >> board.at(i).at(j);
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (board... | 0 | 87,255,154 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const int ... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
... | 0 | 84,430,301 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<cassert>
#include<numeric>
#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(i... | 0 | 42,190,148 |
#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... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1L... | 0 | 89,066,102 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | #include <bits/stdc++.h>
using namespace std;
long long arr[100005],bas[65];
bool b[65];
int main()
{
int n;
scanf("%d",&n);
for (int i=0;i<n;i++)
{
scanf("%lld",&arr[i]);
for (int j=60;j>=0;j--)
{
if (arr[i]&(1LL<<j))
b[j]^=1;
}
}
long long ans=0;
for (int i=0;i<=60;i++)
{
if (b[i])
{
ans+... | 0 | 75,174,556 |
#include <iostream>
#include <vector>
#include <array>
#include <set>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <list>
#include <stack>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cassert>
#include <bitset>
#include <cctype> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
struct Edge
{
int to;
ll cost;
... | 0 | 6,871,963 |
#include<iostream>
using namespace std;
#define ll long long
#include<bits/stdc++.h>
#define mod 1000000007
void grid(ll int n,ll int m,string s[])
{
ll int dp[n+1][m+1];
memset(dp, 0, sizeof(dp));
int f=0;
for(int i=0;i<m;i++)
{
if(s[0][i]=='#')
f=1;
if(f==0)
dp[0][i]=1;
}
f=0;
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 < (int)(n); i++)
int main() {
string s,t;
cin>>s>>t;
int n=s.size();
vector<ll> v(26,-1);
vector<ll> r(26,-1);
bool ok=true;
rep(i,n){
int s1=s[i]-'a';
int t1=t[i]-'a';
i... | 0 | 1,062,133 |
#include <iostream>
using namespace std;
int main(){
long K;
long a[50];
cin >> K;
cout << 50 << endl;
for(int i = 0; i < 50; i++){
if(i >= 50 - K%50) a[i] = i+1;
else a[i] = i;
a[i] += K/50;
cout << a[i] << ' ';
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int n; cin>>n;
vector<int> v(n);
rep(i,n) cin>>v[i];
int cnt=0;
for(int i=1; i<n-1; i++){
if(v[i-1]==v[i]&&v[i]==v[i+1]) {cnt++; v[i]=0;}
}
for(int i=0; i<n-1; i++){
if(v[i]==v[i+1]) {cnt... | 0 | 29,878,008 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool to_I[200000];
bool to_N[200000];
int main() {
int N, M;
cin >> N >> M;
int a, b;
for (int i=0; i<M; i++) {
cin >> a >> b;
if (a == 1) to_I[b] = true;
if (b == 1) to_I[a] = true;
if (a == N) to_N[b] = true;
if (b == N) to_N[a] = true;... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
int A[N];
int d[N] = {0};
for(int i=0;i<N;i++){
cin>>A[i];
d[A[i]-1] += 1;
}
int size = 0;
for(int i=0;i<N;i++){
if(d[i]!=0){
size+=1;
}
}
int... | 0 | 55,030,895 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL<<60;
using ll = long long;
using P = pair<int, int>;
#define vi vector<int>
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll sum = 0;
for (auto x : arr) sum += x;
ll mid1 = sum / n, mid2 = mid1 + 1;
ll ans = 0;
for (int i = 0; i <... | 0 | 31,307,022 |
#include<bits/stdc++.h>
using namespace std;
int k[15],s[15][15];
int p[15];
int n,m;
int ans;
int check(int x){
for(int i=0;i<m;i++){
int l=0;
for(int j=0;j<k[i];j++){
l^=((x>>s[i][j])&1);
}
if(l!=p[i])
return 0;
}
return 1;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d",&k[i... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld ;
using namespace std;
class DSU {
public :
vector<int> par ;
vector<int> r ;
int ans = 0 ;
DSU(int n) {
par.assign(n+1,0) ;
r.assign(n+1,0) ;
for(int i = 0 ; i <= n ; ++i) {
... | 0 | 57,831,038 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<stdlib.h>
#include<utility>
#include<functional>
#include<cfenv>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define vint vector<ll>
#define vvint vector<vint>
... | 0 | 3,695,706 |
#include <iostream>
#include <iomanip>
int main(){
using namespace std;
int a = 0;
int b = 0;
cin >> a >> b;
int d = a / b;
int r = a % b;
double f = static_cast<double>(a) / static_cast<double>(b);
cout << d << " " << r << " " << fixed << setprecision(5) << f << endl;
return 0;
... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
using namespace std;
using namespace boost::adaptors;
using namespace std::string_literals;
using ll = int64_t;
using vecint = vector<int>;
using ... | 0 | 89,536,467 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int A,B,K; cin>>A>>B>>K;
for(int i=0;i<K;i++){
if(i%2==0){
if(A%2==1)A--;
A/=2;
B+=A;
}
else{
if(B%2==1)B--;
B/=2;
A+=B;
}
}
cout<<A<<" "<<B<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FAST_IO std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define setpre(n) fixed << setprecision(n)
#define F first
#define S second
#define pii ... | 0 | 51,124,089 |
#include<iostream>
using namespace std;
int main(){
char a,b;
cin>>a>>b;
bool reverse=true;
if(a=='H'){
reverse=false;
}
if(reverse){
cout<<(b=='H'?'D':'H');
}
else{
cout<<b;
}
} | #include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
int main()
{
int type_ref, type_mic, type_dis;
cin >> type_ref >> type_mic >> type_dis;
vec... | 0 | 56,288,784 |
#include<iostream>
using namespace std;
int main(){
int str[10000],i;
str[1]=1;
for(int i=1;i<i+1;i++){
cin>>str[i];
if(str[i]==0){
for(int a=1;a<i;a++){
cout<<"Case "<<a<<": "<<str[a]<<endl;
}
break;
}
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define sint(x) cout <<#x<<" = "<<(x... | 0 | 61,835,720 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.