code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<iostream>
#define _USE_MATH_DEFINES
#include<math.h>
#include<vector>
#include<array>
#include<algorithm>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef long dou... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | 0 | 43,149,091 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long n,k,ans=0;
cin >> n >>k;
for(int i=k;i<=n+1;i++){
ans+=i*(n-i+1)%1000000007+1;
if(ans>=1000000007){
ans%=1000000007;
}
}
cout << ans <<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll N,K; cin >> N >> K;
vector<p... | 0 | 64,154,038 |
#include <bits/stdc++.h>
using namespace std;
#define rep(k,dst) for(int i=k; i<dst; i++)
#define rep2(k,dst) for(int j=k; j<dst; j++)
#define INF 1000000000000
#define MOD 10000007
#define ll long long
#define pb pop_back
template<typename T> inline void chMin(T* a, T* b) {if(*a>*b) *a=*b;}
template<typename ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repm(i, a, n) for (ll i = a; i >= n; i--)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define mod (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pl... | 0 | 85,804,290 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
double l;
cin >> l;
cout << fixed << setprecision(10);
cout << (l * 3000 / 3) * (l * 3000 / 3) * (l * 3000/ 3) / 27000000000;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int k,u;
int v;
int table[200][200]={};
for(int i=0;i<n;i++){
cin >> u;
cin >> k;
for(int j=0;j<k;j++){
cin >> v;
... | 0 | 44,793,439 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
bool kaibun(string S){
int t=S.size();
bool K=true;
rep(i,t){
if(S.at(i)!=S.at(t-1-i)) K=false;
}
return K;
}
void YN(bool x){
if(x) cout<<"Yes";
el... | #include <iostream>
using namespace std;
int main() {
while (true) {
int x, y;
cin >> x >> y;
if (x > y) {
swap(x, y);
}
if (x == 0 && y == 0) {
break;
} else {
cout << x << " " << y << endl;
}
}
} | 0 | 99,938,081 |
#include <bits/stdc++.h>
#define DEBUG_ENABLED 0
typedef long long int ll;
int main()
{
using namespace std;
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<pair<int, int>> ab;
for (int i = 0; i < M; i++)
{
int a, b;
cin >> a >> b;
pair<in... | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005
ll mod(l... | 0 | 18,435,897 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | #include <iostream>
#include <string>
using namespace std;
class Dice{
private:
int d[6];
public:
Dice(int n0, int n1, int n2, int n3, int n4, int n5){
d[0]=n0; d[1]=n1; d[2]=n2; d[3]=n3; d[4]=n4; d[5]=n5;
}
int get_top(){
return d[0];
}
int get_front(){
return d[1];
... | 0 | 53,803,047 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | 0 | 32,626,248 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int ll
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#define db(x) cerr << #x << "=... | #include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define beg begin()
#define end end()
void _main(){
int n,m,d; cin >> n >> m >> d;
... | 0 | 17,499,436 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
typedef pair<int, string> P;
void printvector3(vector<P> v) {
REP(i,v.size()-1) {
cout << v[i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
int main()
{
int n;
std::cin >> n;
std::vector<int> min_count(26, 999);
for (int i = 0; i < n; ++i)
{
std::string s;
std::cin >> s;
std::vector<int> count(26);
for (const char c : s)
... | 0 | 25,885,899 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define cool ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define MAX 1000001
#define mod 1000000007
#define pie 3.14159265358979323846
void solve()
{
int n,i,j,ans=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
using namespace std;
#define INF 2000000007
#define L... | 0 | 21,616,442 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
if(n>=1800)
cout<<"1"<<endl;
else if(n>=1600)
cout<<"2"<<endl;
else if(n>=1400)
cout<<"3"<<endl;
else ... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
using namespace std;
typedef struct info{
int nx;
int ny;
int cost;
int target;
info(int a,int b,int c,int d){
nx = a;
ny = b;
cost = c;
target = d;
}
... | 0 | 37,136,879 |
#include <iostream>
using namespace std;
int main(void){
int n,x;
int c = 0;
while(1){
cin >> n >> x;
if(n == 0 && x == 0) break;
for(int i = 1; i <= n; i++){
for(int j = i + 1; j <= n; j++){
for(int k = j + 1; k <= n; k++){
if((i + j... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pl... | 0 | 100,192,798 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
using namespace std;
int main() {
int n, l, y=0;
cin >> n;
string s[n], f;
int a[n];
for(int i=0; i<n; i++) {
cin >> s[i];
cin >> a[i];
}
cin >> f;
for(int i=0; i<n; i++) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
string A,B;
cin >> A;
cin >> B;
if(A.size()>B.size()){
cout << "GREATER" << endl;
}else if(A.size()<B.size()){
cout << "LESS" << endl;
}else{
for(long long i=0;i<A.size();i++){
if(A[i]>B[i]){
cout << "GREATER" << endl;
... | 0 | 41,688,228 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
cout << n * 800 - (n / 15) * 200 << endl;
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | 0 | 45,748,796 |
#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 W, H, N;
int x, y, a;
cin >> W >> H >> N;
int minx = 0, maxx=W;
int miny = 0, maxy=H;
rep(i, N){
cin >> x >> y >> a;
if(a==1){
minx = max(mi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n,k;
cin>>n>>k;
vector<ll> a(n);
rep(i,n) cin>>a[i];
vector<ll> s(n+1,0);
rep(i,n) s... | 0 | 100,829,694 |
#include <bits/stdc++.h>
using namespace std;
int N,K;
const int n=200010;
int cnt[n];
int main()
{
cin>>N>>K;
for (int i = 0; i < n; i++)
{
cnt[i] = 0;
}
for (int i = 0; i < N; i++)
{
int a;
cin>>a;
cnt[a]++;
}
sort(cnt,cnt+n);
int ans=0;
for (int... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
string T="";
for(int i=0;i<S.size();i++){
if(S.at(i)!='x') T+=S.at(i);
}
for(int i=0;i<T.size()/2;i++){
if(T.at(i)!=T.at(T.size()-1-i)){
cout << -1 << endl;
return 0;
}
}
int l=0;
int r=S.size()-1;
... | 0 | 19,349,326 |
#include <iostream>
#include <cmath>
#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>
#inclu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int n = 0;
fscanf(stdin, "%d", &n);
vector<int> heap(n + 5, 0);
for (int i = 1; i <= n; ++i) {
fscanf(stdin, "%d", &heap[i]);
}
for (int i = 1; i <= n; ++i) {
fprintf(stdout, "node %i: key = %d, ", ... | 0 | 76,363,258 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define maxn 1001
#define re register
#define FOR(i, l, r) for(re int i = l; i <= r; ++i)
#define DFR(i, l, r) for(re int i = l; i >= r; --i)
using namespace std;
int n, m, c, r, t, x, y, z;
char b[2][2];
int main() {
b[0][0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using pll = pair<long long, long long>;
const string YES = "Yes";
const string NO = "No";
struct UnionFindPotential{
vll parent;
vll potential;
vll rank;
UnionFindPotential(ll n){
parent = vll(n);
... | 0 | 12,828,151 |
#include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(is... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N ;
vector<int> A(N);
for(int i=0; i<N; i++)
{
cin >> A.at(i);
}
int max=0;
vector<int> B(N);
for(int i=0; i<N; i++)
{
if(max<A.at(i))
{
max=A.at(i);
}
B.a... | 0 | 20,726,253 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begi... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
int main() {
int N,K; cin>>N>>K;
int R,S,P; cin>>R>>S>>P;
string T;cin>>T;
vi sum(3,0);
map<char,int> ctoi;
ctoi['r']=0;ctoi['s']=1;ctoi['p']=2;
for (int i = 0; i < K; i++)sum[ctoi[... | 0 | 50,944,612 |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int x = 0, t = 0;
std::cin >> x >> t;
if (x > t)
std::cout << x - t << std::endl;
else
std::cout << 0 << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2*acos(0)
#define PI 3.14159265358979323846264338
typedef long long ll;
typedef unsigned long long ull;
typedef pair < int , int > pii;
typedef pair < ll , ll > pll;
const int N = 100001... | 0 | 65,518,058 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
unordered_set<int> A;
for(char c:S)
A.insert(c);
for(char c='a';(int)c<='z';c=(char)((int)c+1))
if(!A.count(c)){
cout<<c<<endl;
return 0;
}
cout<<"None"<<endl;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <ioman... | 0 | 63,912,607 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
using namespace std;
#define repi(i,n) for(int i=0;i<n;++i)
#defi... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespac... | 0 | 7,449,149 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | 0 | 48,038,975 |
#include<iostream>
#include<vector>
#include<cmath>
#include<queue>
#include<utility>
#include<algorithm>
using namespace std;
#define INF 1000000
#define N 10
int main() {
int n;
while (1) {
cin >> n;
if (n==0)break;
int dp[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
dp[i][j] = ... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include ... | 0 | 69,388,284 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = N, y = 0;
while(x > 0) {
y += x % 10;
x /= 10;
}
string rep;
int z;
z = N % y;
if (z == 0) {
rep = "Yes";
} else {
rep = "No";
}
cout << rep << endl;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | 0 | 31,110,462 |
#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 pqueue(x) priority_queue<x,v... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) {rep(a,x.size()) cout << x[a] << " "; cout << endl;}
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b... | 0 | 7,281,986 |
#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(_... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii... | 0 | 14,072,585 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
#define S second
#define sz(x) (in... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define lp(a,n) for(ll i=a; i<n; i++)
#define lpi(a,n) for(int i=a; i<n; i++)
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#define vll vector<ll>
#define inf 1e9
#define mod 1e9 + 7
using namespace st... | 0 | 96,933,287 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
long n, T;
cin >> n >> T;
long t[n];
for(int i = 0; i < n; i++) cin >> t[i];
long sum_water = T;
for(int i = 1; i < n; i++) {
sum_water += min((t[i]-t[i-1]), T);
}
cout << sum_water << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (in... | 0 | 85,367,167 |
#include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
cin >> a;
b = n / 500;
c = n - (500 * b);
if(c <= (1 * a)){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define INF (1e12)
ll V,E;
ll G[100][100];
int main() {
cin >> V >> E;
rep(i,V)rep(j,V)G[i][j] = INF;
rep(i,V)G[i][i] = 0;
rep(i,E) {
ll s,t,d;
cin >> s >> t >> d;
... | 0 | 42,131,404 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vec... | # include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
... | 0 | 40,900,914 |
#include<iostream>
#include<map>
using namespace std;
int main(){
map<string,int> word;
string s,ss;
int a = 0,b = 0;
while(cin >>s) word[s]++;
for(map<string,int>::iterator it = word.begin(); it!=word.end(); it++){
if(a < it->second){a = it->second;ss = it->first;}
if(b < (it->first).size()){b = (it... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <al... | 0 | 30,514,412 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x, a, b; cin >> x >> a >> b;
if (b <= a) {
cout << "delicious" << endl;
return 0;
}
string ans;
if( x + 1 <= b - a) ans = "dangerous";
else ans = "safe";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 | 74,928,788 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<Int> as(n);
for(Int i=0;i<n;i++) cin>>as[i];
usin... | 0 | 37,033,317 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
cin >> N >> A;
int i;
i = N % 500;
if(i <= A){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
#define DEBUG
long long seriesXor(long long m, long long n)
{
long long ans = m;
for (long long i = m + 1; i <= n; i++) {
ans ^= i;
}
return ans;
}
long long calculate(long long x)
{
if (x % 4 == 0) {
return x;
} else if (x % 4 == 1) {
... | 0 | 93,577,666 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
string s;
cin >> s;
vector<int> num;
if(s[0]=='0') num.push_back(0);
for(int i=0;i<n;){
int ren=i;
while(ren<n && s[i]==s[ren]) ++ren;
num.push_back(ren-i);
i=ren;
}
if(s.back()=='0') num.push_back(0);
v... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 | 37,909,381 |
#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; }
const int INF=1001001001;
vector<pair<int64_t,int64... | using namespace std;
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#i... | 0 | 41,280,549 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int LP[1005][1005];
int main(){
int j, k;
string x, y;
cin >> x >> y;
for(j = 1; j <= x.size(); j++){
LP[j][0] = j;
}
for(k = 1; k <= y.size(); k++){
LP[0][k] = k;
}
for(j = 1; j <= x.size(); j+... | #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... | 0 | 24,666,908 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
int N;
cin >> N;
vector <int> vec(N);
rep(i,N) cin >> vec.at(i);
int count = 0;
int a = 0;
while (true){
count+... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using std::string;
using std::vector;
using std::set;
using std::map;
using std::uno... | 0 | 18,168,479 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void){
int n,i,a[10005],b[10005];
ll asum=0,bsum=0,k;
cin >> n;
for (i=0;i<n;i++) cin >> a[i];
for (i=0;i<n;i++) cin >> b[i];
for (i=0;i<n;i++) asum+=a[i];
for (i=0;i<n;i++) bsum+=b[i];
k=bsum-asum;
if (k<0){
... | #include<bits/stdc++.h>
using namespace std;
int ara[50];
int main()
{
int n;
cin>>n;
for(int i=0; i<n; i++)
cin>>ara[i];
int res=1;
for(int i=1; i<n; i++)
{
int p=1;
for(int j=0; j<i; j++)
if(ara[j]>ara[i])
p=0;
if(p)
res++... | 0 | 83,462,829 |
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | #include <bits/stdc++.h>
using namespace std;
int n,k;
int main(){
cin >> n >> k;
double res = 0;
for(int i = 1; i <= n; ++i){
if(i >= k){
double cou = 1.0 / n;
res += cou;
}else{
double cou = 1;
int c = i;
while(c < k){
cou /= 2;
c *= 2;
}
res +=... | 0 | 42,263,546 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n;
cin>>n;
deque<int> a;
rep(i,n){
int x;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
vector<array<int, 2>> v;
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end(), [](array<int, 2> a,... | 0 | 68,956,618 |
#include <bits/stdc++.h>
#define int long long
#define quickie ios_base::sync_with_stdio(false); cin.tie(NULL);
#define rep(i, a, b) for(int i=a; i<b; i++)
#define rep1(i, a, b) for(int i=a; i<=b; i++)
#define repp(i, a, b) for(int i=b-1; i>=a; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a,b) for(ll i=(a);i<(b);++i)
#define minv(v) *min_element(... | 0 | 29,742,402 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
long long m, a[5001];
a[0] = 0;
while(cin >> n, n != 0){
for(int i=1; i<=n; i++){
cin >> a[i];
a[i] += a[i-1];
}
m = -100000;
for(int i=0; i<=n; i++){
for(int j=i+1; j<=n; j++){
m = max(m, a[j] - a[i]);
}
}
co... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | 0 | 38,117,496 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
getline(cin, s);
for(int i = 0; i < (int)s.size(); i++){
if('a' <= s[i] && s[i] <= 'z') s[i] = 'A' + s[i] - 'a';
else if('A' <= s[i] && s[i] <= 'Z') s[i] = 'a' + s[i] - 'A';
}
cout << s << endl;
} | #include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#define llint long long
using namespace std;
llint W, H;
vector<pair<llint, int> > vec;
int main(void)
{
cin >> W >> H;
int p, q;
for(int i = 0; i < W; i++){
cin >> p;
vec.push_back( make_pair(p, 0) );
}
for(int i = 0; i < H; i++){
... | 0 | 21,750,884 |
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(int)n;i++)
typedef long long ll;
using namespace std;
long long modpow(long long a, long long n,ll mod){
long long r = 1;
while (n) {
r = r * ( (n%2)?a:1 ) %mod;
a = a * a % mod;
n >>= 1;
}
return r;
}
int main(void){
ll n,mod;cin>>n>>mod;
... | 0 | 76,199,738 |
#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 <iostream>
#include <sstream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <iomanip>
#include <cstdlib>
#include <climits>
#include <set>
using namespace std;
vector<vector<string>> getinputdata();
vector<vector<int>> getinputdata2();
vect... | 0 | 43,523,462 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | #include <stdlib.h>
#include <iostream>
#include <sstream>
#include <cmath>
#define ll long long
using namespace std;
void ask(ll x){
cout << "? " << x << endl;
fflush(stdout);
}
bool rec(){
char x;
cin >> x;
return (x == 'Y');
}
int main(){
bool is10;
ask(1000000000);
is10 = rec();
ll wei = 1;
if(is10){
as... | 0 | 58,326,227 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll dis(ll x1, ll y1, ll x2, ll y2){
return abs(x1 - x2) + abs(y1 - y2);
}
int main()
{
ll h, w;
cin >> h >> w;
vector<string> a(h);
set<ll> ban_h;
set<ll> ban_w;
rep(i, h){
... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
const int mod=1e9+7,maxn=1e6+10;
const int dx[10]={0,0,-1,1,-1,-1,1,1},dy[10]={-1,1,0,0,-1,1,-1,1};
ll tong[10],h,w,n,sum,tot;
pair<int,int> node[maxn];
map<pair<int,int>,in... | 0 | 75,316,822 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int x, y, z;
x = 0;
y = 0;
z = 0;
for (int i = 0; i < n; i++) {
int num;
cin >> num;
if (num <= a) {
x++;
} else if (num >= b + 1) {
z++;
} else {
y++;
}
}
if (x <= y) ... | #include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:16777216")
#define M1 1000000007
#define M2 998244353
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define eb emplace_back
#define mk... | 0 | 72,778,805 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, x, y;
cin >> n >> m >> x >> y;
int aa, bb;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n ; i++){cin >> aa;x = max(x, aa);}
for (int i = 0; i < m ; i++){cin >> bb;y = min(y, bb);}
if (y <= x){cout << "War" << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,m;cin>>n>>m;
vector<int> a[100001];
for (int i=0;i<n;i++) {
int b,c;cin>>b>>c;
a[b].push_back(c);
}
int ans=0;
priority_queue<int> q;
for (int i=1;i<=m;i++) {
for (int x:a[i])
... | 0 | 13,375,016 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s1, s2;
cin >> s1 >> s2;
int ans = 0;
rep(i, 3) {
if (s1[i] == s2[i]) {
ans++;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int dice[6],q;
char c;
for(int i=0;i<6;i++){
scanf("%d",&dice[i]);
}
scanf("%d",&q);
for(int i=0;i<q;i++){
int x,y;
scanf("%d %d",&x,&y);
i... | 0 | 67,215,247 |
#include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
bool cmp(pair<LL,LL> &x, pair<LL,LL> &y)
{
return x.first < y.first;
}
int main(){
LL n;
LL d;
LL a;
cin >> n >> d >> a;
vector<pair<LL,LL>> xh(n);
vector<LL> x(n);
vector<LL> h(n);
... | #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 | 81,834,893 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t K;
cin >> K;
vector<int64_t> result = {1, 2, 3, 4, 5, 6, 7, 8, 9};
while (true) {
if (K <= static_cast<int64_t>(result.size())) {
cou... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define fastio() ios_base::sync_with_stdio(false);
#define rmod(x, y) ((((x)%(y))+(y))%(y))
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
template<typename T, typename R = null_type, typename C = less<T>>
... | 0 | 71,015,246 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k, r, s, p; cin >> n >> k >> r >> s >> p;
string t; cin >> t;
vector<char> result(n, 'e');
int ans = 0;
for (int i = 0; i < t.size(); i++) {
if (i <= k - 1) {
if (t[i] == 'r') {
ans += p;
result[i] = 'p';
... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define mod 1000000007LL
#define IN freopen("nocross.in","r",stdin)
#define OUT freopen("nocross.out","w",stdout)
#define FOR(i,a,b) for(i=a ; i<=b ; i++)
#define DBG printf("Hi\n")
#define INF 2000000000000000000LL
#define i64... | 0 | 16,175,464 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,k;
cin>>n>>k;
ll cnt=(n-1)*(n-2)/2;
if(cnt<k){
cout << -1;
return 0;
}
cnt=cnt-k;
cout << n-1+cnt<<endl;
for(ll i=0;i<n-1;i++){
cout << 1<<" "<<i+2<<endl;
}
for(ll i=2;i<=n;i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 84,321,125 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
string s;
cin >> s;
map<char,int> m;
rep(i,4) m[s[i]]++;
int cnt = 0;
for(auto p : m) if(p.second == 2) cnt++;
if(cnt == 2) cout << "Yes" << ... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
string ans;
inline int query(ll x){
cout<<"? "<<x<<endl;
cin>>ans;return ans=="Y";
}
inline int solve1()
{
ll fac=1;
for(int i=1;i<=10;++i,fac*=10)
if(!query(fac)) return i-1;
ret... | 0 | 27,684,993 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#defin... | #include<iostream>
#include<vector>
#include<map>
#include<string>
#include<cstring>
#include<algorithm>
#include<sstream>
#include<stack>
#include<bitset>
#include<queue>
#include<cmath>
#include<set>
#define ll long long
#define PI 3.14159265358979323846
#define IO ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)... | 0 | 32,789,946 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | #include "bits/stdc++.h"
#include<cassert>
#pragma warning(disable:4996)
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define MRE assert(0)
const int mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<P, int>PP;
vector<int>G[100006];
int dp[1000... | 0 | 46,016,841 |
#include<bits/stdc++.h>
using namespace std;
int n,l,q,a[100005],b[100005][21];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
scanf("%d",&l);
int dem=1,sum=0;
for(int i=2;i<=n;i++){
sum+=a[i]-a[i-1];
while(sum>l){
b[dem][0]=i-1;
dem++;
sum-=(a[dem]-a[dem-1]);
}
}
for(i... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f;
int dp[200][200][2];
char s[200][200];
int main(){
int h,w;cin>>h>>w;
rep(i,h)scanf("%s",s[i]);
memset(dp,0x3f,sizeof(dp));
dp[0][0][s[0][0]=='.'?0:1]=(s[0][0]... | 0 | 50,864,717 |
#include<bits/stdc++.h>
using namespace std;
int n;
vector<vector<int>> adj;
vector<pair<int, int>> DP;
const int inf = (int)1e9 + 7;
void dfs(int i, int p)
{
long long n1 = 1, n2 = 1;
for (auto x : adj[i])
{
if (x == p)
continue;
dfs(x, i);
n1 *= (long long) (DP[x].first + DP[x].second);
n2 *= DP[x].fir... | #include <bits/stdc++.h>
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m... | 0 | 33,203,096 |
#include<bits/stdc++.h>
using namespace std;
int minCoins(int coinList[], int n, int value) {
int coins[value+1];
if(value == 0)
return 0;
coins[0] = 0;
for (int i=1; i<=value; i++)
coins[i] = INT_MAX;
for (int i=1; i<=value; i++) {
for (int j=0; j<n; j++)
if (coinList[j] <= i)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 0 | 87,575,024 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
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
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
map<... | 0 | 9,510,744 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
int B[N];
for(int i = 0; i < N; i++) cin >> B[i];
int ans = B[0] + B[N - 2];
for(int i = 1; i < N - 1; i++) {
ans += min(B[i - 1], B[i]... | #include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<math.h>
#define rep(i,start,n) for(int i=0 ; i<n ; i++)
using namespace std;
int main(){
int a , b , C;
double S=0,h=0,c=0;
cin >> a >> b >> C;
S = 0.5 * a * b * sin(C * M_PI / 180);
h = 2 * S / a; ... | 0 | 56,404,024 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int ans = 2100000000;
if (x < y) ans = y-x;
if (-x <= y) ans = min(ans, 1 + y + x);
if (x <= -y) ans = min(ans, 1 - y - x);
if (x > y) ans = min(ans, 2 - y + x);
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
#define int ll
const int INF=(int)2e18;
const int MOD = 1000000007;
const int PEG = 998244353;
long double pie=acos(-1);
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef pair< int, int > pii;
typedef... | 0 | 84,347,511 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,t;
cin >> a >> b >> c;
while(1){
if(c<=b && b<=a)break;
if(a>b){
t = a;
a = b;
b = t;
}else if(b>c){
t = b;
b = c;
c = t;
}else if(c>a){
t = c;
c = a;
a = t;
}
}
cout << c <<" "<< b << " " << a <<endl;
} | #include <bits/stdc++.h>
#define rep(i ,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int nmax = 8;
vector<vector<bool>> graph(nmax, vector<bool>(nmax, false));
int dfs(int c, int N, vector<bool> visited){
bool all_visited = true;
rep(i, N){
if(!visited[i]){
all_v... | 0 | 934,685 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int K, S;
cin >> K >> S;
long long ans = 0;
for ( int x = 0; x <= K; x++ ) {
for ( int y = 0; y <= K; y++ ) {
int z = S - x - y;
if ( z < 0 ) break;
if ( K < z ) continue;
ans++;
... | #include<iostream>
#include<cstdio>
#include<cctype>
using namespace std;
int main(){
char ch;
int cnt[26]={};
while (cin >> ch){
ch = tolower(ch);
if (isalpha(ch)){
cnt[ch-'a']=cnt[ch-'a']+1;
}
}
for(int i=0; i<26;i++){
printf("%c : %d\n", i+'a', cnt[i]);... | 0 | 61,479,908 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
int main() {
string S; cin >> S;
int n = S.size();
string T = S;
for(int i=n-2; i>0; i-=2){
string T1 = T.substr(0,i/2);
string T2 = T.substr(i/2, i/2);
if(T1 ... | #include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace... | 0 | 76,145,170 |
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
int main(){
ll X,Y,Z,K,i,j,k;scanf("%lld%lld%lld%lld",&X,&Y,&Z,&K);
ll A[X],B[Y],C[Z];
for(i=0;i<X;i++) scanf("%lld",&A[i]);
for(j=0;j<Y;j++) scanf("%lld"... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int H, W, M;
cin >> H >> W >> M;
int h[M], w[M];
int ch[H]{}, cw[W]{};
int hmax = 0;
int wmax = 0;
for (int i = 0; i < M; i++) {
cin >> h[i] >> w[i];
h[i]--;
w[i]--;
ch[h[i]]++;
... | 0 | 27,715,775 |
#include<iostream>
#include <algorithm>
using namespace std;
int main(){
string main, str, sidestr;
int n, i, j;
cin >> main >> n;
for (int p = 0; p < n; p++) {
cin >> str;
if (str == "replace") {
cin >> i >> j >> sidestr;
main.replace(i, j + 1 - i, sidestr);
... | #include<bits/stdc++.h>
using namespace std;
int main ()
{
typedef int l;
int a,b,c,d; cin>>a>>b>>c>>d;
l s1=a+c;
l s2=a+d;
l s3=b+c;
l s4=b+d;
cout<<min(s1,min(s2,min(s3,s4)));
} | 0 | 83,674,225 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
long long longpow(long long n, long long a, long long mod) {
if (a == 0) return 1;
if (a == 1) return n % mod;
if (a % ... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
vector<vector<char> > v;
vector<char> mv;
mv.push_back(' ');mv.push_back('.');mv.push_back(',');mv.push_back('!');mv.push_back('?');
v.push_back(mv);
mv.clear();
mv.push_back('c');mv.push_back('a');mv.push_back('b');
... | 0 | 65,870,140 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 26,262,622 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
template<class T> void vin(vector<T>& v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
bool check(ll x, ll a... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n)
cin >> v[i];
int ans = 0;
rep(l, min(n + 1, k + 1))
rep(r, min(n + 1, k + 1) - l)
rep(d, k + 1 - l - r)
{
... | 0 | 41,808,034 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int qpow(int b,int e){
if(!e)return 1;
if(e&1) return qpow(b,e-1)*b;
return qpow(b*b,e>>1);
}
int a[101][101];
int32_t main(){
int w,h,n;
cin>>w>>h>>n;
int res=0;
while(n--){
int x,y,c;
cin>>x>>y>>c;
i... | #include <bits/stdc++.h>
using namespace std;
int water (vector<int> h) {
int result = 0;
int N = h.size();
vector<int> allzero(N, 0);
while (h != allzero) {
int count = 0;
while (h[count] == 0) count++;
while (count < N) {
int count1 = count;
int minimum ... | 0 | 27,462,600 |
#include<iostream>
using namespace std;
#define df 0
double f(int vl,int vr,int vm,int t){
int M=max(vl,vr),d=2*M-vl-vr,r=t-d;
double sum=M*t-d*d*0.5+r*r*0.25, h=r*0.5+M-vm;
if(h<0)h=0;
sum-=h*h;
if(df)printf("%lf\n",sum);
return sum;
}
int main(){
if(df) printf("*debug mode*\n");
int n; cin >>n;
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool isLowerCase(char x) {
if (0 <= (x - 'a') && (x - 'a') <= 25) {
return true;
}
else {
return false;
}
}
int main() {
string s; cin >> s;
if (s[0] != 'A') {
cout << "WA" << endl;
return 0;
}
int cnt = 0;
for (int i = 2; i < s.size()... | 0 | 4,840,966 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
... | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
vector<int>E[10000];
int in[10000];
bool used[10000];
int main() {
int v, e; scanf("%d%d", &v, &e);
rep(i, e) {
int s, t; scanf("%d%d", &s, &t);
E[s].push_back(t);
in[t]++;
}
list<int>ls;
queue<int>que;
rep(i, v) {
if (!used... | 0 | 41,551,887 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main() {
int n, a, b, c, x;
while(cin >> n >> a >> b >> c >> x, n||a||b||c||x) {
int y[n];
rep(i, n) cin >> y[i]... | #include<bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define INF 10000000000000000LL
#define ll long long
const int inf =INT_MAX;
const int MAX=3e5+9;
const ll MOD=1e9+7;
const int TOT_PRIMES=1e6+9;
const int MAX_A=71;
const int LN=20;
using namespace std;
int main(){
ll N;
cin >> N... | 0 | 88,490,242 |
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct node{
int pri;
int a[18];
} st[18];
int ans=1e9;
int b[18];
int d[18];
int n,m,x;
int len;
void dfs(int p)
{
if(p==len+1)
{
int sum=0;
memset(d,0,sizeof(d));
for(int i=1;i<=len;i++)
{
sum+=st[b[i]].pri;
for(int j=1;j<... | #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 req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 40,050,017 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[10000000];
int main() {
ll i, j, k, l, test, n;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < n; i++) {
a[i] -= (i + 1);
}
ll sum = 0;
sort(a, a + n);
for (i = 0; i < n; i++) {
sum += abs(a[i] - a[n / 2]);
}
cout << ... | #include <iostream>
#include <string>
#include <vector>
using ll=long long;
using namespace std;
int main(){
int N;
cin>>N;
vector<int> X(N);
int ans=0;
for(int i=0;i<N;i++){
cin>>X[i];
ans+=X[i]*X[i];
}
for(int i=1;i<=100;i++){
int tmp=0;
for(auto p:X){
... | 0 | 7,550,923 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000... | 0 | 1,746,452 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAX_N 50001
using namespace std;
int n, m;
int dp[MAX_N];
int knapsack() {
memset(dp, 0, sizeof(dp));
int value[m];
for(int r = 0; r < m; r++){ cin >> value[r]; dp[value[r]]++; }
for(int c = 1; c < n; c++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 0 | 42,398,215 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,N) for(int i=0; i<N; i++){ ;
int main() {
string A,B,C;
cin>>A>>B>>C;
char p=A.at(0);
char r=B.at(0);
char q=C.at(0);
p=toupper(p);
q=toupper(q);
r=toupper(r);
cout<<p<<r<<q<<endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int W, H, N;
cin >> W >> H >> N;
int xl, xr, yb, yt;
xl = 0;
xr = W;
yb = 0;
yt = H;
for (int i=0; i<N; ++i) {
int x, y;
int a;
cin >> x >> y >> a;
if (a == 1) {
if (x > xl... | 0 | 1,743,029 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
int pre=0, cnt=0,... | 0 | 18,607,129 |
#include <stdio.h>
int main(void)
{
int H,W,i,j;
while(1)
{
scanf("%d %d", &H, &W);
if(H == 0 && W == 0 )break;
for( i = 1; i <= H; i++ ){
for( j = 1; j <= W; j++ ){
if(i > 1 && i < H ){
if( j > 1 && j < W){
printf(".");
} else {
printf("#");
}
} else {
print... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define printdbl(a) printf("%lf\n", a)
#define printYes() printf("Yes\n")
#define printNo() printf("No\n")
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%d... | 0 | 26,540,257 |
#include "bits/stdc++.h"
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(x) cerr << #x << " == " << (x) << '\n';
#define all(X) X.begin(), X.end()
#define sz(X) (int)X.size()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
i... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
stri... | 0 | 78,687,369 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin >> k >> n;
int d_max = 0;
vector<int> a(n);
for(int i = 0; i < n; ++i){
cin >> a[i];
}
sort(a.begin(), a.end());
for(int i = 0; i < n - 1; ++i){
d_max = max(d_max, abs(a[i + 1] - a[i]));
}
d_ma... | #include <iostream>
#include <vector>
#include <math.h>
using namespace std;
long long gcd(long long a, long long b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
long long findlcm(vector<long long> arr, int n)
{
long long ans = arr[0];
for (int i = 1; i < n; i++){
ans = (((arr[i] * an... | 0 | 50,973,464 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 77;
char A[N][N] , B[N][N];
void sol(){
int n , m ; cin >> n >> m ;
for(int i = 0 ; i < n ; ++i) for(int j = 0 ; j < n ; ++j) cin >> A[i][j];... | 0 | 61,918,781 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll S; cin >> S;
ll x2 = 1e9;
ll x3 = (x2-S%x2)%x2;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 77,438,689 |
#ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#define DLOG_V(var)\
cout << "#" << __LINE__ << ":" << #var << " : " << var << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#define DLOG_V(var)
#endif
using namespace std;
constexpr auto no_value = numeric_l... | #include<bits/stdc++.h>
using namespace std;
int main() {
int a,b;
scanf("%d%d",&a,&b);
double ans=0;
for(int i=1; i<=a; i++) {
double pos=1.0/a;
int now=i;
while(now<b) {
now*=2;
pos/=2;
}
ans+=pos;
}
printf("%.12f\n",ans);
return 0;
} | 0 | 30,652,228 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | 0 | 53,974,262 |
#include <iostream>
int main()
{
int x;
for(int i=1;;i++){
std::cin>>x;
if(x==0)break;
std::cout<<"Case "<<i<<": "<<x<<std::endl;
}
return 0;
} | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 98,676,522 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout <<... | #include<iostream>
using namespace std;
struct Card{char suit, value;};
void selectionSort(struct Card A[], int N) {
int i, j, mini;
for(i = 0; i < N; i++) {
mini = i;
for(j = i; j < N; j++) {
if(A[j].value < A[mini].value) mini = j;
... | 0 | 42,599,852 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a,b) for(ll i=(a);i<=(b);++i)
#define minv(v) *min_element... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int f(long long a, long long b) {
int d_a = 1;
while (a / 10 != 0){
d_a++;
a /= 10;
}
int d_b = 1;
while (b / 10 != 0){
d_b++;
b /= 10;
}
return max(d_a, d_b);
}... | 0 | 72,276,981 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int w,h;
cin >> w >> h;
vector<pair<long long,bool>> v;
for(int i=0; i<w; i++){
long long t;
cin >> t;
v.push_back(make_pair(t,true));
}
for(int i=0; i<h; i++){
long long t;
cin >> t;
v.push... | #include <bits/stdc++.h>
using namespace std;
#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++)
typedef long long ll;
int main() {
int H, W, D, tmp; cin >> H >> W >> D;
vector<pair<int, int>> pos(H*W+1);
rep(i, H)rep(j, W) {
cin >> tmp;;
... | 0 | 3,320,206 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N; cin>>N;
cout<<N*(N-1)/2<<endl;
} | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b) cout<<"Draw"<<endl;
else{
if(a==1) cout<<"Alice"<<endl;
else if(b==1) cout<<"Bob"<<endl;
else{
if(a>b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
}
} | 0 | 40,664,876 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int l, r;
cin >> l >> r;
int mod_min = 2019;
for (int i = l; i <= min(l + 2019, r); i++) {
for (int j = i + 1; j <= min(l + 2019, r); j++) {
mod_min = min(mod_min, ((i % 2019) *... | #include <iostream>
#include <queue>
#define MAX 1005
#define INF 100000000
using namespace std;
typedef struct{
int x;
int y;
int state;
} Mouse;
int H,W,N;
int start_x,start_y;
char ar[MAX][MAX];
int offset_x[4] = {1,0,-1,0};
int offset_y[4] = {0,1,0,-1};
int ans[MAX][MAX];
void init(){
for(int i = 0;... | 0 | 91,897,289 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<ll> a(N), b(N);
REP(i, N) cin >> a[i];
REP(i, N) c... | #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,k;
cin>>a>>b>>c>>k;
int sum = 0;
if(k>=a){
sum += a;
k-=a;
}else{
cout<<k<<endl;
return 0;
}
if(k>=b){
k-=b;
}else{
... | 0 | 31,451,484 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin>>n;
map<int,int> a;
rep(i,n){
int A; cin>>A;
a[A]++;
}
int ans=-1;
rep(x,100010){
int now_ans=0;
now_ans=a[x-1]+a[x]+a[x+1];
ans=max(ans,now_a... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb puah_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
int ... | 0 | 64,107,814 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.