code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
int ans = 100000;
int k = N/9;
for(int i = 0; i <= k; i++){
int x = i;
int y = (N-9*x)/6;
int z = N-9*x-6*y;
int countx = 0;
int county = 0;
whil... | 0 | 24,161,429 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <math.h>
using namespace std;
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) { a = b; return true; } return false; }
const long long INF = 1L... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
long n;
vector<long>a;
long ans;
main()
{
cin>>n;
for(int i=0;i<n;i++)
{
long x;cin>>x;a.push_back(x);
}
while(1)
{
sort(a.begin(),a.end(),greater<long>());
if(a[0]<n)break;
long k=0;
while(k+1<n&&a[k+1]+k+1>=n&&a[k]-a[k+1]<n+1... | 0 | 54,711,435 |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostre... | #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()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | 0 | 21,226,923 |
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (int i ... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main(){
LL N;
cin>> N;
for(LL i=sqrt(N);i>0;i--){
if(N%i==0){
i=N/i;
int count=0;
while(i>0){
i/=10;
count++;
}
cout << count << endl;
return 0;
}
}
} | 0 | 62,981,747 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a,b;
cin >> a >> b;
if(a==b){
cout << a << endl;
return 0;
}
ll res;
if(a%2==0){
ll n=b-a+1;
if(n%4==0) res=0;
else if(n%4==2) res=1;
else if(n%4==1) res=b;
... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,m,c[20],dp[50001],i=0,j=0;
cin >> n >> m;
for(i;i<m;i++){
cin >> c[i];
}
sort(c,c+m);
for(i=0;i<=n;i++){
dp[i] = 100000;
}
dp[0]=0;
for(i=0;i<m;i++){
dp[c[i]]=1;
}
for(i=1;i<... | 0 | 86,075,379 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll H, W, M;
scanf("%lld %lld %lld... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int main(){
int N, M; cin >> N >> M;
vector<ll> X(N), Y(N), Z(N); for(int i = 0; i < N; i++) cin >> X[i] >> Y[i] >> Z[i];
ll Max = 0;
for(int f1 = 0; f1 < 2; f1++){
for(int... | 0 | 91,742,009 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI fir... | 0 | 50,976,067 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N,K,h,i,c;
cin>>N>>K;
c = 0;
for(i=0;i!=N;i++)
{
cin>>h;
if(h >= K)
c++;
}
cout<<c;
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
int a=1;
cin>>n;
while(true)
{
if(n == 4 || n == 2 || n == 1)
{
cout << a+3 << endl;
break;
}
if(n%2)
{
n = 3*n + 1;
}
else {
... | 0 | 884,429 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define LL long long
#define mod 1000000007
#define FOR(i, j, k) for (int i=j ; i<k ; i++)
#define ROF(i, j, k) for (int i=j ; i>=k ; i--)
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time_... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_t... | 0 | 88,994,229 |
#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... | #include <bits/stdc++.h>
#define int long long
#define FLASH \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) ... | 0 | 100,426,440 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int MOD=1000000007;
int main() {
int n;
cin >> n;
int ans;
if(n/10==0) ans=n;
else if(n/100==0) ans=9;
else if(n/1000==0) ans=n-90;
else if(n/10000==0) ans=909;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const long double PI = acos(-1);
#define chmin(i, j) i = min(i, j);
#define chmax(i, j) i = max(i, j);
#define rep(i, n) for(int i=0;i<n;i++)
ll MOD = 1000000007;
ll fact(ll m) {
if(m == 0 || m == 1) return 1LL;
else retur... | 0 | 41,670,802 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<(n);i++)
#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 rev(i,... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
long long sum=0;
vector<long long>A(N);
for(int i=0;i<N;i++){
cin>>A.at(i);
A.at(i)=A.at(i)-(i+1);
}
sort(A.begin(),A.end());
long long b=0;
if(N%2==1){
if(N==1){
b=A.at(0);
}
else{
b=A.at(N/2);
}
... | 0 | 66,679,940 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long t,a,k;
cin>>t>>a>>k;
if(k<=t)
{
t=t-k;
k=0;
}
else
{
k=k-t;
t=0;
}
if(k<=a)
{
a=a-k;
k=0;
}
else
{
k=k-a;
a=0;
}
cout<<t<<" "<<a... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n; cin>> n;
vector<int> a(100000);
map<int, int> mp;
int MAX=0;
int MIN = 1000000000;
for(int i=0; i<n; i++){
cin >> a[i];
MAX = max(MAX, a[i]);
MIN = min(MIN, a[i]);
if(!mp.count(a... | 0 | 97,806,929 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
string T;
cin >> S >> T;
sort(S.begin(), S.end());
sort(T.begin(), T.end());
reverse(T.begin(), T.end());
if(S < T) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define rep0(i,j) for(int i=0;i<j;i++)
#define rep1(i,j) for(int i=1;i<=j;i++)
#define rep0d(i,j) for(int i=j-1;i>=0;i--)
#define MOD 1000000007
#define INF (int)1e7
class Graph{
ty... | 0 | 91,994,697 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
map<int,int> A;
for(int i=0;i<N;i++){
int a;
cin>>a;
A[a]++;
}
int j=0;
for(pair<int,int> p:A)
if(p.second>=p.first)
j+=p.second-p.first;
else
j+=p.second;
cout<<j<<endl;
} | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) f... | 0 | 16,137,588 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i=0; i<N; i++) cin >> d[i];
ll ans = 0;
for (int i=0; i<N-1; i++) {
for (int j=i+1; j<N; j++) {
ans += d[i]*d[j];
}
}
cout <<... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | 0 | 50,913,776 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int t, x;
cin >> t >> x;
double ans = (double)t / x;
printf("%.10f\n", ans);
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
int n;
cin >> n;
if (n == 1)
{
cout << "Yes" << endl << "2" << endl;
cout << "1 1" << endl;
cout << "1 1";
return 0;
}
for (int il = 2; il <= n; ++il)
{
... | 0 | 26,357,866 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
if (N&1) {
cout << 0 << '\n';
return 0;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | 0 | 82,598,179 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s,t,u,v;
cin >> s >> t >> u >> v;
string w = s+t+u+v;
int n=0;
int o=0;
int p=0;
int q=0;
for(int i=0;i<4;i++){
if(w.at(i)=='1'){
n++;
}
else if(w.at(i)=='9'){
o++;
}
else if(w.at(i)=='7'){
p++;
}... | 0 | 92,646,320 |
#include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n, k;
cin >> n >... | #include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
bool prime(int cur)
{
if(cur==1||cur==0)return false;
for(int i=2;i<=sqrt(cur);i++)
{
if(cur%i==0)
{
return false;
}
}
return true;
}
in... | 0 | 83,642,166 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
string s; cin >> s;
string t; cin >> t;
int cnt=0;
bool flg = false;
for(int i=0; i<s.length(); i++){
string s_sub = s.substr(i, s.length()-i);
for(int j=0; j<t.length(); j++){
string t_sub = t.su... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S; int N; int count;
cin >> N >> S;
for (int i=0;i<1000;i++){
int a[3]={i/100, (i/10)%10, i%10};
int kakutei=0;
for (int j=0; j<N;j++){
if(S[j]==('0'+a[kakutei])){
kakutei++;
}
if(kakutei==3){
break;
... | 0 | 93,934,053 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
void Digvijay()
{
int n;
cin>>n;
vector<int> a(n);
for(auto& it:a)cin>>it;
int val=1;
bool ok=false;
for(int i=0;i<n;i++)
{
if(a[i]==val)
{
ok=true;
val++;
}
}
if(ok)
{
c... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
string s;
cin >> n >> s;
int a[26] = {};
for (int i = 0; i < n; i++) {
a[s[i] - 'a']++;
}
const int mod = 1'000'000'007;
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= a[i] + 1;
ans %= mod;
}
cout << ans - 1 << end... | 0 | 52,569,112 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 0 | 72,418,363 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,int>P;
int n;
P d[200000];
vector<int>E[200000];
int sz[200000];
ll dp1[200000];
vector<pair<int,int>>ans;
void dfs1(int v){
for(int u:E[v]){
dfs1(u);
ans.push_back({v+1,u+1});
dp1[v]+=dp1[u... | #include<iostream>
#include<cmath>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<climits>
#include<deque>
#include<tuple>
#include<iomanip>
using namespace std;
#define int int64_t
#define double ... | 0 | 29,779,815 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <limits>
const int N = 102;
long m[N][N], p[N+1];
int matrixChainOrder(int n){
for(int i=1; i<n; i++){ m[i][i] = 0; }
for(int l=2; l<n; l++){
for(int i=1; i < n - l + 1; i++){
int j = i+l-1;
m[i][j] = std::numeric_limits<long>::max(... | #include <bits/stdc++.h>
#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 chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | 0 | 91,584,115 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF... | 0 | 48,736,699 |
#include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
int odd = (m + 1) / 2;
int even = m / 2;
std::vector<int> a(m), b(m);
int p = 1;
for (int i = 0; i < odd; ++i)
a[i] = p++;
for (int i = odd; i-- > 0;)
b[i] = p++;
for (int i = 0; i < even; ++i)
a[odd + i] = p+... | #include "bits/stdc++.h"
using namespace std;
long long P_is_not_2_5(long long N, long long P, const string& S) {
map<long long, long long> residual;
residual.insert(make_pair(0LL, 1LL));
long long pow10 = 1;
long long curr = 0LL;
for (long long i = N - 1; i >= 0; --i) {
curr += pow10 * (lon... | 0 | 98,022,918 |
#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-9;
struct mint {
int n;
m... | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.begin(); i != vec.end(); ++i)
const int mod = 10... | 0 | 93,243,808 |
#include<bits/stdc++.h>
using namespace std;
int gcd(int n, int m){
if(n%m==0) return m;
else return gcd(m, n%m);
}
int main(){
long long a,b; int g; cin>>a>>b; g = gcd(a, b);
long long ans = a*b/g;
cout << ans << endl;
} | #include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#define rep(i, a, b) for ( int i = (a); i < (b); i++ )
#define per(i, a, b) for ( int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#defin... | 0 | 98,531,306 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n, k; cin >> n >> k;
vector<int> l(n);
rep(i,n) cin >> l[i]... | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sz(v) ((int)v.size())
#define lgt(s) ((int)s.length())
#define int long long
using namespace std;
class Solver{
public:
void test(){
{
... | 0 | 16,399,930 |
#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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#de... | 0 | 50,235,970 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | #include<bits/stdc++.h>
#define ll long long
#define P pair<ll, ll>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>>G(n);
vector<int>p(m), y(m);
for(int i=0;i<m;i++){
cin >> p[i] >> y[i];
p[i]--;
G[p[i]].push_back(i);
}
vector<ll>ans(m);
... | 0 | 58,992,469 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
using namespa... | #include <bits/stdc++.h>
using namespace std;
int N, temp, swaps = 0;
int arr[100];
void SelectionSort(int *arr, int n, bool stable = 0)
{
for (int i = 0; i < n - 1; i++)
{
int minIdx = i;
for (int j = i + 1; j < n; j++)
{
if (arr[j] < arr[minIdx])
{
... | 0 | 67,982,187 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
using namespace std;
int main(){
int n;
cin>>n;
float x1,y1,x2,y2,x3,y3,x4... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
signed main(){
Int n,m;
cin>>n>>m;
vector<vector<Int> > G(n);
for(Int i=0;i<m;i++){
Int u,v;
cin>>u>>v;
u--;v--;
G[u].emplace_back(v);
G[v].emplace_back(u);
}
vector<Int> used(n,-1);
Int cnt=0,flg=0;
function<void(In... | 0 | 73,821,797 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
int n, a, sum = 0; cin >> n >> a;
if (n + a == 15) {
cout << '+' << endl;
}
else if (n * a == 15) {
cout << '*' << endl;
}
else {
cout << 'x' << endl;
}
cin >> n;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 0 | 7,955,543 |
#include <iostream>
using namespace std;
int main (){
while (1){
long n,dset[5000],temp=0,max;
cin>>n;
if (n==0)break;
for (int i=0;i<n;i++){
cin>>dset[i];
}
max=dset[0];
for (int i=0;i<n;i++){
for (int j=i;j<n;j++){
temp=temp+dset[j];
if (max<temp){
... | #include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
int n, m, a, b, flag;
string s = "IMPOSSIBLE";
cin >> n >> m;
vector<int> ve(200001);
flag = 0;
for(int i = 0; i < m; i++){
cin >> a >> b;
if(flag == 0){
if(a == 1){
if(ve[b] == 0){
... | 0 | 46,287,401 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/jsc2019_qual_b.txt"); \
cin.rdbuf(in.rdbuf());
#else
#define INPUT_FILE
#endif
#define... | 0 | 92,721,268 |
#include <bits/stdc++.h>
#define ll long long int
#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 put(x) cout << x << endl;... | #include <iostream>
#include <string>
using namespace std;
int H,W;
int main(){
cin >> H >> W;
string board[H*W];
for(int i=0; i<H; i++) cin >> board[i];
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
for(int y=0; y<H; y++){
for(int x=0; x<W; x++){
if(board[y][x]=='.') continue;
... | 0 | 57,770,372 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
using namespace std;
int main(void) {
string x;
int sum;
cin >> x;
while( !(x=="0") ) {
sum = 0;
for( auto i:x ) {
sum += i - ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < n; ++i)
int main() {
ll n, x, m;
cin >> n >> x >> m;
i... | 0 | 46,788,410 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll a,b,k,s,l;
cin>>a>>b>>k;
if(k<=a)
{
cout<<a-k<<" "<<b<<endl;
}
else
{
if((k-a)<=b)
{
cout<<"0"<<" "<<b-(k-a)<<endl;
}
else cout<<"0"<<" "<<"0"<<endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vec = bitset<100001>;
bool solve(vector<vec> A, int N, int M){
int r = 0;
for(int j = 0; j < M; j++)... | 0 | 99,307,111 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long r;
cin >> r;
cout << r*r << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main( void )
{
int a, b;
cin >> a >> b;
if ( a == b )
{
cout << "Draw";
}
else if ( a == 1 )
{
cout << "Alice";
}
else if ( b == 1 )
{
cout << "Bob";
}
else if ( a > b )
{
cout << "Alice";
... | 0 | 54,460,161 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
const long MOD = 1'000'000'007;
int main() {
long n; string s;
cin >> n >> s;
long r, g, b;
r = g = b = 0;
for (long i = 0; i < n; i++) {
switch (s[i]) {
case 'R':
r++;
break;
case 'G':
g++;
break;
case 'B':
b+... | #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;
cin >> n >> k;
vector<int> a(n, -1);
rep(i,k){
int d; cin >> d;
rep(j,d){
int A;
cin >> A;
... | 0 | 86,157,940 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
if(a == "H"){cout << b << endl;}
else{
if(b == "H"){cout << "D" << endl;}
else{cout << "H" << endl;}
}
} | #include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define nl cout<<"\n";
#define chk(x) cout<<#x<<" : "<<x, nl
#define ll long long int
#define u unsig... | 0 | 5,037,235 |
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utilit... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 85,847,731 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void a_sandglass2(void) {
int x, t;
cin >> x >> t;
cout << ((x - t<0)?0:x-t) << endl;
}
int main()
{
a_sandglass2();
return 0;
} | #include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int N;
int a[100];
int b, c, d;
int main()
{
cin >> N;
for(int i=0; i<N; i++)
{
cin >> a[i];
}
d=0;
for(int k=0; k<N-1; k++)
{
b=k;
for(int i=k; i<N; i++)
{
if(a[i]<a[b])
{
b=i;
}
}
if(k!=b)
{
c=a[b];
a[b... | 0 | 87,957,538 |
#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(){
ll n;
cin >> n;
vector<int> ns(n);
rep(i, n){
cin >> ns.at(i);
}
sort(ns.begin(), ns.end());
int sum = 0;
rep(i, n-1) if(ns.at(i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 26,353,140 |
#include <iostream>
#include <functional>
using namespace std;
int main()
{
function<long long(int)> const fact = [&]( int n ) -> long long { return n==0 ? 1 : fact( n-1 ) * n; };
int i; cin >> i;
cout << fact( i ) << endl;
} | #include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long l... | 0 | 31,634,163 |
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int K, S;
cin >> K >> S;
int cont = 0;
for (int X = 0; X <= K; X++)
{
for (int Y = 0; Y <= K; Y++)
{
int Z = S - X - Y;
if (Z >= 0 && Z <= K)
cont++;
}
}
cout << cont;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
string s, t;
cin >> s >> t;
int n = s.length();
vector<int> sa(26, 0), ta(26, 0);
vector<int> sv(n), tv(n);
for(int i=0; i<n; i++){
if(sa[s[i]-'a... | 0 | 87,841,126 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
ret... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <ra... | 0 | 41,649,496 |
#include<stdio.h>
#define INT_MAX 0x7f7f7f7f
int n, m, dis[105][105];
bool floyd()
{
for(int k = 0; k < n; k++)
for(int i = 0; i < n; i++){
dis[i][i] = 0;
for(int j = 0; j < n; j++)
if(dis[i][k] != INT_MAX && dis[k][j] != INT_MAX)
if(dis[i][j] > di... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#d... | 0 | 8,602,000 |
#include<bits/stdc++.h>
using namespace std;
int dist[101][101];
int n, m;
bool isUsed(int a, int b, int c){
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(dist[i][j] == dist[i][a] + c + dist[b][j]) return false;
}
}
return true;
}
int main(){
cin >> n >> m;
for(int i=0; i<n; i++) for(int j=... | #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 | 51,396,002 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int ans = (n - 2) * 180;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(n,v) cout<<#v<<":";for(int i=0;i<n;i++)cout<<v[i]<<" ";cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-... | 0 | 5,778,793 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N, L;
cin >> N >> L;
string S[N];
rep(i,N) cin >> S[i];
sort(S,S+N);
string ans = "";
rep(i,N) ans += S[i];
cout << ans << endl;
return 0;
} | #include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <sstream>
type... | 0 | 58,151,110 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int N, K, ans = 1;
cin >> N >> K;
rep(i, N) {
if (ans < K) ans += ans;
else ans += K;
}
cout << ans << "\n";
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#... | 0 | 25,796,405 |
#include <bits/stdc++.h>
using namespace std;
#define foru(i, l, r) for (register int i = l; i <= r; i++)
#define ford(i, r, l) for (register int i = r; i >= l; i--)
int N;
char S[100002];
char T[100002];
int main() {
scanf("%d%s%s", &N, S + 1, T + 1);
for (int len = N; len >= 1; len--) {
bool flag = true;
... | #include <iostream>
#include <iomanip>
#define SQRT_3 1.73205080757
using namespace std;
constexpr double
ccw60x(const double ax, const double ay, const double bx, const double by)
{
return (bx - ax) / 2 - (by - ay) * SQRT_3 / 2 + ax;
}
constexpr double
ccw60y(const double ax, const double ay, const double bx, cons... | 0 | 49,510,633 |
#include <iostream>
using namespace std;
int main(void){
int A,B;
cin>>A>>B;
if(A==B){
cout<<"Draw"<<endl;
}
else if(A==1||A>B){
if(B==1){
cout<<"Bob"<<endl;
}
else{
cout<<"Alice"<<endl;
}
}
e... | #include <bits/stdc++.h>
using namespace std;
int64_t from_zero(int64_t n)
{
if (n % 4 == 0)
{
return n;
}
else if (n % 4 == 1)
{
return 1;
}
else if (n % 4 == 2)
{
return n ^ 1;
}
else
{
return 0;
}
}
int main()
{
int64_t a, b;
cin... | 0 | 42,865,944 |
#include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
for (int x = 1; x <= 1000000; ++x) {
if (int(x * 0.08) == A && int(x * 0.10) == B) {
cout << x << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a)*(a)
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#... | 0 | 25,939,270 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll K, A, B;
cin >> K >> A >> B;
if(A + 2 < B) {
ll ans = A;
K -= A - 1;
ans += (K/2)*(B - A) + K%2;
cout << ans << endl;
} else {
cout << K + 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n;
string s;
char t[10][100005];
int main(void){
cin>>n>>s;
t[0][0]='S';
t[1][0]='S';
t[2][0]='W';
t[3][0]='W';
if(s[0]=='o'){
t[0][1]='S';
t[0][n-1]='S';
t[1][1]='W';
t[... | 0 | 94,591,705 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef p... | #include <cstring>
#include <string>
#include <memory>
#include <iostream>
constexpr int max_size()
{
return 1000003;
}
constexpr int null_val()
{
return -1;
}
class dictionary {
public:
dictionary()
: _data(std::make_unique<int[]>(max_size()))
{
for (int i = 0; i < max_size(); ++i) {
... | 0 | 77,565,402 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int H, W;
cin >> H >> W;
vector<string> G(H);
rep(i, H) cin >> G.at(i);
vector<vector<string>> a(H, vector<string>(W));
rep(i, H) rep(j, W) a.at(i).at(j) = G.at(i).at(j);
rep(i, H) {
... | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
int a, b,c,d,f,g;
cin>> a;
cin>>b;
cin>> c;
cin >>d ;
f=(a+b);
g=(c+d);
if(f>g){
cout<<"Left";
}else if(f<g) {
cout<<"Right";
}else {
cout<<"Balanced";
}
return 0;
} | 0 | 16,871,051 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef double db;
#define inf 0x3f3f3f3f
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll a[31... | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cassert>
#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 rep2(i, s, n) for (int i = (s); i <= (int)(n); ... | 0 | 3,209,178 |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
int main()
{
static long i,j,k,l;
long n;
long cnt = 0;
long left,right,mid;
long ans = 0;
int a,b;
static int H[10000];
static int W[10000];
for(i = 0;; i++) {
scanf("%d %d",&H[i],&W[i]);
if(H[i] == 0)
... | #include <iostream>
int main(int argc, char const *argv[]) {
int Mid_score=0,Final_score=0,Retest_score=0;
while(1){
int grade=0;
char rank;
std::cin >> Mid_score >> Final_score >> Retest_score;
if(Mid_score==(-1) && Final_score == (-1) && Retest_score == (-1))break;
grade = Mid_score+Final_scor... | 0 | 98,325,781 |
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string S;
cin >> S;
bool iscan = true;
for (int i=0; i<A; i++) {
if (S[i] < '0' || S[i] > '9') {
iscan = false;
}
}
if (S[A] != '-') {
... | 0 | 69,874,541 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;
int main(){
int N,K;
cin>>N>>K;
vector<pair<ll,ll>> x;
for(int i(0);i<N;i++){
int t,d;
cin>>t>>d;
x.push_back({d,t});
}
sort(x.rbegin(),x.rend());
ll sum(0);... | #include<bits/stdc++.h>
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<vector<int>> A(N, vector<int>(M));
vector<int> c(N);
for (int i = 0; i < N; i++) {
cin >> c.at(i);
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int... | 0 | 30,656,217 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int h,n;
cin>>h>>n;
int a[n],sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
sum+=a[i];
}
if(sum>=h)
cout<<"Yes\n";
else
cout<<"No\n";
exit(0);
} | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statis... | 0 | 30,419,853 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
int main() {
int n;
while (cin >> n, n) {
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 1e8;
for (int i=0; i<n-1; ++i) {... | #include<iostream>
#include<vector>
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int x=0,y=0,z=0;
int cnt=0;
for (int x = 0; x <=k ; x++) {
for(int y=0;y<=k; y++){
z=s-x-y;
if (z>=0 && z<=k){
cnt++;
}
... | 0 | 94,127,592 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k;
cin >> k;
vector<uint64_t> costs(k, INT_MAX);
priority_queue<pair<uint64_t, int>, vector<pair<uint64_t, int>>,
greater<pair<uint64_t, int>>>
q;
costs[1] = 0;
q.push(m... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a.at(i);
int ans = MOD;
for (int z = -1000; z <= 1000; z++) {... | 0 | 28,645,806 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
long double cnt=0.0;
for(ll i=0;i<n;i++){
long double now;
cin>>now;
cnt+=1/now;
}
cnt=1/cnt;
printf("%.9Lf",cnt);
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | 0 | 53,886,990 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
const int MOD = 1000000007;
signed main(){
int num = 0;
int N;
int L, Q;
vector<int> x;
vector<vector<int>> table;
cin>>N;
x.resize(N);
for(int n = N; n > 0; n >>= 1, num++);
table.resize(num+2, vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n, k;
scanf("%d%d", &n, &k);
vector<int> p(n, 0), l(n, 0);
vector<ll> c(n, 0), s(n, 0);
for (int i = 0; i < n; ++i) {
scanf("%d", &p[i]);
p[i]--;
}
for (int i = 0; i < n; ++i) {
scanf("%lld", &c[i]);
}
for (int i = 0; i ... | 0 | 80,193,908 |
#include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
struct UnionFind{
vector<int> data;
UnionFind(int size) : data(size,-1){}
bool unite(int x,int y){
x=root(x),y=root(y);
if(x!=y){
if(data[y]<data[x]){
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d... | 0 | 27,016,833 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
#define vll vector<ll>
#define ... | #include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll=long long;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
template<class T>bool chmax(T &a, const T &b) {if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, co... | 0 | 43,458,953 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | #include<cstdio>
#include<algorithm>
void read_int (int &a) {
char c=getchar(); a=0;
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') a=(a<<1)+(a<<3)-48+c,c=getchar();
return;
}
int n,a[200003];
int num[200003],pla[200003],tot,w;
bool inc (int lim) {
if (pla[tot]!=w)
++tot,pla[tot]=w,num[tot]=0;
++num[t... | 0 | 22,306,464 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 0 | 6,374,763 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#include <queue>
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M;
priority_queue<int64_t> A;
for (int64_t i = 0; i < N; i++) {
int64_t tmp... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#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 FOREACH(x,a) for(auto& (x) : (... | 0 | 45,953,151 |
#include <bits/stdc++.h>
using namespace std;
void bingo(int a1, int a2, int a3, vector<bool>& judge);
int main(){
vector<int> A(9);
for (int i = 0; i < 9; i++){
cin >> A.at(i);
}
int N;
cin >> N;
vector<bool> judge(9, false);
for (int i = 0; i < N; i++){
int B;
cin >> B;
for (int j = 0; j... | #include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
using namespace std;
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int i = (m); (i) < (n); (... | 0 | 24,607,342 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w, m; cin >> h >> w >> m;
vector<int> hc(h, 0), wc(w, 0);
vector<vector<int> > p(m, vector<int>(2));
for (int i = 0; i < m; i++) {
cin >> p[i][0] >> p[i][1];
p[i][0]--; p[i][1]--;
hc[p[i][0]]++;
... | # include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
ll n,arr[100005],ps[100005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n;
for(int i=1;i<... | 0 | 51,709,914 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
int N; cin >> N;
int a[N];
for(int i=0;i<N;i++){
cin >> a[i];
}
int b[N];
for(int i=0;i<N;i++){
cin >> b[i];
}
int ans=0;
ll... | # 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 | 39,697,378 |
#include <iostream>
#include <vector>
#include <string>
typedef long long LL;
using namespace std;
int main(){
string n;
int ns;
int k;
cin >> n;
cin >> k;
ns = n.size();
vector<vector<LL>> dp0(ns+1, vector<LL>(k+1, 0));
vector<vector<LL>> dp1(ns+1, vector<LL>(k+1, 0));
dp0[0][0]=1;
... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll h... | 0 | 40,515,977 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
int cal(vector<int> &a, int n) {
vector<int> b(n);
for (int i = 0; i < n; i++) b[i] = i + 1;
int cnt = 1;
while (a != b) {
cnt++;
next_perm... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<n;i++)
int main(){
string s... | 0 | 11,667,362 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(),... | 0 | 81,673,006 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
string S;
cin >> S;
string A = S.substr(2, S.size() - 3);
if (S[0] == 'A') {
if (count(A.begin(), A.end(), 'C') == 1) {
sort(S.begin(), S.end());
int Q = 0;
for (int i = 0; i < S.size(); i++) {
if (islower(S[i])... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i=0;i<(n); i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
int main(... | 0 | 6,411,429 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
int min_diff = INT_MAX;;
string s;
cin>>s;
int n=s.length();
for(int i=0;i<n-2;i++){
string res = s.substr(i,3);
int x = stoi(res);
min_diff = min(min_diff,abs(75... | #include<bits/stdc++.h>
using namespace std;
#define ld long double
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi >
#define str string
#define vs vector<str>
#define vb vector<bool>
#define slli set<lli>
#define mii map<int, int>
#define mlli map<int, lli>
#define msi m... | 0 | 94,362,453 |
#include<iostream>
using namespace std;
int main() {
int n, b, f, r, v;
int count[5][4][11] = { 0 };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b >> f >> r >> v;
count[b][f][r] += v;
}
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 3; j++) {
for (int k = 1; k <= 10; k++) {
cout << ' ' << count... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
bool ok=false;
for(int i=a;i<a*b;i+=a){
if(i%b==c){
ok=true;
break;
}
}
if(ok)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
} | 0 | 31,763,488 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #include<bits/stdc++.h>
using namespace std;
long long w=10;
int n;
int ans=0;
char s[10];
int main(){
cout << "? 10000000000" << endl;
cin>>s;
if (s[0]=='Y') {
long long x=2;
while(true) {
cout<<"? "<<x<<endl;
cin>>s;
if (s[0]=='Y') {
cout<<"... | 0 | 1,938,306 |
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[20000... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> p(n), x(n + 1);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
x.at(p.at(i)) = i;
}
multiset<ll> s;
s.insert(x.at(n));
s.insert(-1);
s.insert... | 0 | 74,533,408 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int ans = 0;
string s, t;
cin >> s >> t;
rep(i, 3) {
if (s[i] == t[i]) {
ans++;
}
}
cout << a... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
constexpr int MaxN = 100000;
int main()
{
int N, M;
cin >> N >> M;
vector<int64_t> A(N);
for (int i = 0; i < N; ++i)
{
cin >> A[i];
}
vector<int64_t> B(N);
B[0] = A[0];
for (int i = 1; i < N; ++i)
{
B[i] = A[i] + B[i-1];
}
map<int... | 0 | 44,895,840 |
#include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int64_t>>;
int main(){
int64_t N;cin>>N;
Graph G(N);
for(int i=0;i<N-1;i++){
int64_t u,v;cin>>u>>v;u--;v--;
G[u].push_back(v);
G[v].push_back(u);
}vector<int64_t>C(N);C.at(0)=1;
for(int i=1;i<N;i++){
int64_t a=C.at(i-1)+i+1;
... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <set>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;... | 0 | 80,427,657 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <iostream>
using namespace std;
string s;
void solve() {
int cnt = 0;
int l = 0, r = s.size() - 1;
while (l < r) {
if (s[l] == s[r]) {
l++;
r--;
} else if (s[l] == 'x') {
cnt++;
l++;
} else if (s[r] == 'x') {
cnt++;
r--;
} else {
cout << -1 << end... | 0 | 60,974,933 |
#include <cstdio>
#include <cstring>
#define MAXN 200010
#define LL long long
struct edge{
int to,next;
edge(int _to=0,int _next=0):to(_to),next(_next){}
}e[MAXN<<1];
LL n,m;
int g[MAXN],nume;
int c[MAXN],nowc,d[MAXN],tag[MAXN];
void addEdge(int u,int v){
e[nume]=edge(v,g[u]);
g[u]=nume++;
}
void dfs(int x){
c[x]=... | #include<iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
int main()
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int X = x2 - x1;
int Y = y2 - y1;
int x3 = x2 - Y;
int y3 = y2 + X;
int x4 = x3 - X;
int y4 = y3 - Y;
cout << x3<<" "<<... | 0 | 54,964,860 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | 0 | 68,590,628 |
#include <stdio.h>
#include <iostream>
using namespace std;
int calcSumOfNumbers(const char x[]);
int main(void)
{
while (1) {
char x[1000] = "\0";
cin >> x;
if (x[0] == '0') break;
cout << calcSumOfNumbers(x) << endl;
}
return 0;
}
int calcSumOfNumbers(const char x[])
{
int sum = 0;
for (int i = 0; x[i] ... | #include <iostream>
#include <string>
#include <queue>
using namespace std;
struct Point{
int x;int y;
};
int main(){
int w,h,i,j,k,c=0;
string str;
Point p,b;
cin >> w >> h;
while(w!=0&&h!=0){
c=1;
int dp[21][21]={{}};
for(i=0;i<h;i++){
cin >> str;
for(j=0;j<w;j++){
if(str[j]=='.')... | 0 | 6,190,145 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int i = a * b;
if(i % 2 == 0){
cout << "Even" << endl;
}
else{
cout << "Odd" << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
intt N, K, R, S, P; std::cin >> N >> K >> R >> S >> P;
std::string T; s... | 0 | 16,308,332 |
#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>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
string str;
cin >> str;
rep(i,4) cout << str.at(i);
cout << " ";
rep(i,8) cout << str.at(i+4);
cout << en... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
int n; cin >> n;
vector<int> a;
int ans(0),t(1);
rep(i,n){
int x; cin >> x;
if(x==t){
t++;
a.push_back(... | 0 | 5,194,144 |
#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#define FOR(i, a, b) for(decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long long l... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int MOD=1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(j,k) {
vector<int> b(n+1);
rep(i,n) {
int l=max(... | 0 | 70,814,887 |
#include<iostream>
#include<cctype>
#include<cstdio>
#include<string>
using namespace std;
int main(){
string str;
int i;
getline(cin,str);
for(i=0;i<str.size();i++){
if(str[i]>='a'&& str[i]<='z'){
str[i]+='A'-'a';
}
else if(str[i]>='A' && str[i]<='Z'){
str[i]+='a'-'A';
}
cout<<str[i];
}
cout<<end... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define popcnt __builtin_popcount
#define getBit(x, k) ((x >> k) & 1)
#define all(x) (x).begin(),(x).end()
const int mod = 1e9 + 7;
#define pow abcdef... | 0 | 53,095,074 |
#include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
int ans = (a + b) / 2;
cout << ans + ((a + b) % 2) << endl;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
string x;
cin >> x;
int N = x.size();
vector <char> f(N);
int res;
for(int bit = 0; bit < (1<<N); ++bit){
res = x[0] - '0';
for(int i = 1; i < ... | 0 | 21,997,227 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
class Matrix {
public:
int r, c;
Matrix () {}
Matrix (i... | 0 | 77,206,186 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int m, nmin, nmax;
while(cin >> m >> nmin >> nmax, m | nmin | nmax){
vector<int> P(m);
for(int i = 0; i < m; i++) cin >> P[i];
sort(P.begin(), P.end(), greater<int>());
int ans = 0;
int gap = 0;
for(int n = nmin; n <= nmax; n++){
... | #include <iostream>
#define SIZE 100
using namespace std;
int main() {
int value[SIZE] = {0}, n, max = 0;
while (cin >> n) {
value[n - 1]++;
if (value[n - 1] > max) max = value[n - 1];
}
for (int i = 1; i <= SIZE; i++) {
if (value[i - 1] == max) {
cout << i << endl;
}
}
return 0;
} | 0 | 59,477,919 |
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <list>
#include <string.h>
using namespace std;
#define M 1046527
#define MIL (-1)
#define L 14
char H[M][L];
int getChar(char ch) {
if( ch == 'A' ) return 1;
el... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m;
... | 0 | 43,537,678 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include <bits/stdc++.h>
using namespace std;
int main(){
using point= pair<int64_t, int64_t>;
int N,K;
cin >> N >> K;
const int Kin= K-2;
vector<point> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i).first >> data.at(i).second;
}
sort(data.begin(), data.end());
int64_t ans= INT64_MAX;
for(in... | 0 | 44,528,223 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.