code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include "bits/stdc++.h"
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 25,034,427 |
#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 int64 l... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb em... | 0 | 10,287,864 |
#include<stdio.h>
typedef long long int lli;
int main() {
char s[6];
scanf("%s", &s);
if(s[2]==s[3] && s[4]==s[5]){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 54,864,370 |
#include <string>
#include <iostream>
using namespace std;
class Dice
{
public:
static const int SURFACE_NUM = 6;
static const int DIR_NUM = 4;
static const int ROUND_NUM = 4;
enum DIR { N, W, S, E };
private:
static const int rotate_table[DIR_NUM][ROUND_NUM];
static const int front_rotate_table[ROUND_NUM]; ... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)(n); i++)
const ll MOD = 1000000007;
const int INFI = 1000000000;
const ll INFL = (1LL << 60);
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) ... | 0 | 16,649,522 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N ;
bool possible = false;
for (int i=0;i<=N/4;i++){
for (int j=0;j<=N/7;j++){
if (4*i+7*j == N) possible = true;
else if(4*i+7*j>N) break;
}
}
cout << (possible ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++) {
ll count... | 0 | 51,086,860 |
#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 n; cin >> n;
vector<int> a(n);
map<int, int> mp;
rep(i, n) {
int a; cin >> a;
mp[a]++;
}
int cnt = 0;
for(auto it=mp.begin();i... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 1e6;
int unip[max_n],unir[max_n];
void init(int n){
for(int i=0 ; i<n ; i++){
unip[i] = i;
unir[i] = 0;
}
}
int find(int x){
if(unip[x] == x){
return x;
}else{
return unip[x] = find(unip[x]);
}
}
void unite(int x, int y){
x = fi... | 0 | 86,925,970 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,m,h[100005],memo[100005],x,y,ans=0;
cin >> n >> m;
rep(i,n){
cin >> h[i];
memo[i]=0;
}
rep(i,m){
cin >> x >>y;
if(h[x-1... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
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 vec... | 0 | 86,602,128 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, a;
cin >> n >> a;
cout << n * n - a;
} | #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 pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJK... | 0 | 37,547,106 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #include <iostream>
#include <string>
#include <vector>
int visit(int a, int b);
using namespace std;
vector<string> cell;
vector< vector<bool> > check;
int c, d;
int main(){
while(cin >> c >> d, c | d){
string temp;
int x = 0, y = 0;
for(int i = 0; i < d; i++){
cin >> temp;
... | 0 | 57,835,576 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#ifdef DEBUG
#define line() cout << "[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
ll output = 0;
for (ll i = K; i <= N + 1; i++) {
ll min = (i - 1) * i / 2;
ll max = (2 * N - i + 1) * i / 2;
min %= 1000000007;
max %= 1000000007;
ll tmp = max... | 0 | 39,552,220 |
#include <iostream>
int main(){
int a,b,c,i=0;
std::cin>>a>>b>>c;
for(;a<=b;a++)if(c%a==0)i++;
std::cout<<i<<std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ikarus_101 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typed... | 0 | 81,389,919 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0 , -1};
signed main(){
int N;
string S;
cin >> N >> S;
int l = 0;int r = 0;
for(int i = 0; i < N; i++) {
if(S[i] == ')... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int h, w, k; cin >> h >> w >> k;
vector<string> s(h);
for (int i = 0; i < h; i++)
cin >> s[i];
int ans = 0;
for (int x = 0; x < (1<<h); x++) {
for (int y = 0; y < (1<<w); y++) {
ve... | 0 | 66,640,488 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <limits>
#include <iomanip>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int... | #include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define ll long long
using namespace std;
const int N=1005;
const ll inf=1e18;
const int dx[4]={1,-1,0,0};
const int dy[4]={0,0,-1,1};
const char ch[4]={'R','L','D','U'};
int n,x[N],y[N],odd,even,a[N];
int main(){
scanf("%d",&n);
rep (i,1,n){
sca... | 0 | 53,083,020 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<algorithm>
#include<complex>
#include<cstdlib>
#include<cctype>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define PB push_back
#define MP make_pair
#define SHOW1d(v,n) {for(int i = 0;i < (n);i++)cout << v[i] << ' ';cout << ... | #include <iostream>
#include <cstring>
using namespace std;
#define MAX_V 10
#define MAX_E 45
#define INF 1<<28
int d[MAX_V][MAX_V];
int n;
int main() {
while (cin >> n) {
if (n == 0) break;
for (int i = 0; i < MAX_V; i++) {
for (int j = 0; j < MAX_V; j++) {
if (i == j) {... | 0 | 38,567,297 |
#include<bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long n,sum=0;
cin>>n;
for(long long i=1;i<=n;i++)
{
sum+=(n-1)/i;
}
cout<<sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,t=0,f=0;cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
t++;
if(a[f]==2)
break;
else
f=a[f]-1;
}
if(t<n)cout<<t;
else cout<<-1;
return ... | 0 | 64,320,012 |
#include<iostream>
using namespace std;
int main()
{
int a,n,i,j,min,max;
long long sum;
cin >> n;
cin >> a;
min = max = sum = a;
for (i = 1; i < n; i++) {
cin >> j;
sum += j;
if (max < j)
max = j;
if(min > j)
min = j;
}
cout << min... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;
int main(){
const int max_n = 200000;
const long long mod = 1000000000 + 7;
int n, k;
cin >> n >> k;
long long s[max_n+1];
s[0] = 0;
for(int i = 1; i <= n; i++){
s[i] = s[i-1] + i;
}
... | 0 | 83,768,091 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define MOD 1000000007
int main(void) {
int n;
cin >> n;
int a = n/15;
cout << 800*n-a*200 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 | 60,379,173 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >>B;
int count = 0;
for (int i = A; i <= B; ++i) {
int d1, d2, d3, d4, d5, work;
work = i;
d5 = work / 10000;
work %= 10000;
d4 = work / 1000;
work %= 1000;
d3 = work / 100;
work %= 100;
d2 = work /... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define v vector<ll>
#define st stack<ll>
#define pq priority_queue <int>
#define q queue<ll>
#define mod 1000000005
using namespace std;
char ch[1000000];
int main(){
cin>>ch;
... | 0 | 64,667,197 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
vector<int> pay;
int coins[] = {500,100,50,10,5,1};
while(true){
int temp;
cin >> temp;
if(temp == 0)break;
pay.push_back(temp);
}
for(int i = 0;i < pay.size();i++){
int chang... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n;
cin >> n;
... | 0 | 5,265,544 |
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
int a, b, c;
int f(int x) {
return (a*x + b) % c;
}
void solve(int n, int x) {
vector<int> Y(n);
rep(i,n) cin >> Y[i];
int p = 0;
for(int frame=0; ; frame++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 44,413,141 |
#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<string,int>;
int main() {
int n;
cin >> n;
vector<int> b(n-1);
vector<int> a(n);
rep(i,n-1) cin >> b.at(i);
a.at(0) = b.at(0);
a.at(n-1) = b.at(n-2);
for (int i = 1; i < n-1; i++) {
... | #include<bits/stdc++.h>
#include<string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <stdlib.h>
#include<string>
#define mp make_pair
#define ss second
#define ff first
#define pb push_back
#define io ios_base::sync_with_stdio;cin.tie(0);cout.tie(0)
#define READ freopen("input... | 0 | 8,869,054 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define fr(i,n) for(i=0;i<n;i++)
#define F first
#define S second
#define fast std::ios_base::sync_with_stdio(false)
#define mod 1000000007
#define pi 3.14159265
int main() {
fast;
l... | #include <bits/stdc++.h>
#define FOR(i, k, n) for(int i = (k); i < (n); i++)
#define FORr(i, k, n) for(int i = (k); i > (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORr(i, n, 0)
#define ALL(x) (x).begin(), (x).end()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;... | 0 | 88,174,097 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)((x).size())
#define endl "\n"
#define jonathan ios_base::sync_with_stdio(0)
#define livingston cin.tie(0)
using nam... | #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 ... | 0 | 60,074,266 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define rep(i, n) for(int i=0;i<n;i++)
int main(){
int n,k;
cin >> n >> k;
if(n%k==0)cout << 0 <<endl;
else cout << 1 << endl;
} | #include <iostream>
#include <stdlib.h>
using namespace std;
#define MAX_N 44
class Fib{
private:
int size;
int *A;
public:
Fib(int size){
this->size = size;
makeFib();
}
int getFib(int n){
return A[n];
}
void makeFib(){
int i;
this->A = (int*)malloc(sizeof(int)*(this->size+1));
th... | 0 | 28,535,464 |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
int i,j,k,n,x,c=0;
do {
cin >> n >> x;
if (n==0 && x==0 ) break;
c=0;
for(i=1;i<=n;++i) {
for(j=i+1;j<=n;++j) {
for(k=j+1;k<=n;++k) {
if(i+j+k==x) {
c++;
}
}
}
}
printf("%d\n",c);
} while(1);
return 0;
... | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typede... | 0 | 8,876,041 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
#define vecsort(v) sort(v.begin(),v.end())
#define lcm(x,y) (x/__gcd(x,y))*y
#define forn(i,n) for(i = 0 ; i < n ; i+... | 0 | 48,624,783 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int s=S.size();
if (s==1||s==2) {
cout << S.at(0) << endl;
}
else {
if (s%2==0) {
for (int i=0; i<s/2-1; i++) {
cout << S.at(2*i);
}
cou... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int n;
cin >> ... | 0 | 98,938,278 |
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
const int maxn = 1e5+10;
int dp[maxn];
int32_t main(){
ios_base:... | #include <bits/stdc++.h>
#define LL long long
#define PII pair
#define MP(x, y) make_pair((x),(y))
#define fi first
#define se second
#define PB(x) push_back((x))
#define MMG(x) memset((x), -1,sizeof(x))
#define MMF(x) memset((x),0,sizeof(x))
#define MMI(x) memset((x), INF, sizeof(x))
using namespace std;
const int INF... | 0 | 8,889,965 |
#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, T;
cin >> N >> T;
vector<int> t(N);
rep(i,N) cin >> t.at(i);
sort(t.begin(), t.end());
ll Tend = 0;
ll ans = 0;
rep(i,N) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R,G,B,N;
cin>>R>>G>>B>>N;
int cnt=0;
for (int i = 0; i <= N/R; i++){
for (int j = 0; j <= N/G; j++){
if((N - R*i-G*j )%B==0 && (N - R*i-G*j>=B || N - R*i-G*j==0)){
cnt++;
}
}
}
... | 0 | 75,376,111 |
#include <iostream>
#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 <unordered_set>
#include <i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n, m, i;
cin>>n>>m;
if(n>m){
for(i=1;i<=n;i++){
cout<<m;
}
}
else if(n<m){
for(i=1;i<=m;i++){
cout<<n;
}
}
else
for(i=1;i<=n;i++){
cout<<n;
}
} | 0 | 14,238,467 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
int a, b, x;
cin >> a >> b >> x;
if (a > x)
cout << "NO" << endl;
else if (b >= x - a)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;r... | 0 | 89,224,456 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<string> cut={"maerd","remaerd","esare","resare"};
reverse(S.begin(),S.end());
bool all_cut=false;
for(int i=0;;){
if(i==S.size()){
all_cut=true;
break;
}
bool exist_cut=false;
for(int j=0;j<4;j+... | #include<bits/stdc++.h>
using namespace std;
int main()
{
stack<int>stk;
int n;
cin>>n;
stk.push(n);
cin>>n;
stk.push(n);
int k=stk.top();
k=k*2;
stk.pop();
int m=stk.top();
cout<<k-m<<endl;
} | 0 | 26,251,738 |
#include <bits/stdc++.h>
using namespace std;
string S;
char rights[11] = {'y','u','i','o','p','h','j','k','l','n','m'};
bool isright(char c) {
for (int i = 0; i < 11; i++) if (rights[i] == c) return true;
return false;
}
void solve() {
int cnt = 0;
int n = (int)S.size();
bool prev = 0;
for (int i = 0; i < n; i+... | #include<iostream>
using namespace std;
int main(){
while(true){
int njudge = 0;
cin >> njudge;
if(njudge == 0)return 0;
int max=0;
int min=10000;
int ave=0;
int sum=0;
for(int i = 0 ; i<njudge ; i++){
int input;
cin >> input;
if(max < input)max = input;
if(min ... | 0 | 84,603,079 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int A, B;
cin >> A >> B;
string s;
cin >> s;
size_t pos = s.find('-');
bool ok(true);
if (pos == A) {
if (s.size() == A + B + 1) {
for (int i = 0; i < s.size(); i++) {
if (i =... | 0 | 47,909,376 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
string S;
cin >> S;
ll cnt0 = 0;
ll cnt1 = 0;
rep(i,0,S.size()){
if(S[i] == '0') cnt0++;
if(S[i] == '1') cnt1++;
}
cout << 2*min(cnt0,cnt1) ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORit(it,a) for(auto it=a.begin();it!=a.end();it++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define vec vector
#define vi vec<int>
#define vll vec<ll>
#define pb push_back
#define pp pop_back
#define a... | 0 | 95,822,076 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "a" || S == "e" || S == "i" || S == "u" || S == "o")
cout << "vowel" << endl;
else
cout << "consonant" << endl;
} | #include<iostream>
#include<string>
#include<algorithm>
#define MAX 1001
using namespace std;
int main() {
int n,mat[MAX][MAX];
string s1,s2;
cin >> n;
for(int k=0;k<n;k++) {
cin >> s1 >> s2;
for(int i = 0; i < s1.size(); i++) {
for(int j = 0; j < s2.size(); j++) {
... | 0 | 98,425,927 |
#include <bits/stdc++.h>
using namespace std;
using db = double;
using ll = long long;
using vi = vector <int>;
#define op operator
#define pb push_back
string input[10] = {
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
int main() {
cout << fixed << setprecision(9);
ios :: sync_wi... | bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | 0 | 79,102,141 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int h, w;
while ((cin >> h >> w), h != 0 || w != 0) {
for (int y = 0; y < h; ++y) {
for (int x = 0; x < w; ++x) {
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pr;
typedef vector<pr> vp;
typedef vector<vp> vpp;
typedef vector<vector<ll> > graph;
#define pb push_back
#define mp make_pair
#define maxi INT_MAX
#define mini INT_MIN
#define endl '\n'
void set_val(vector<ll>& v, ll val){for(ll i=... | 0 | 24,571,352 |
#include<iostream>
#include<fstream>
#include<string>
#include<cmath>
#include<queue>
#include<vector>
using namespace std;
int main(){
string n,r;
char b;
int h,w;
cin >> h;
cin >> w;
r="snuke";
for (int j=0;j<h;j++){
for(int i=0;i<w;i++){
cin >> n;
if (r==n){
b = 'A'+i;
cout << b... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>
using namespace std::chrono;
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_updat... | 0 | 23,812,943 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int n;
int taro = 0, hana = 0;
cin >> n;
for (int i = 0; i < n; i++) {
string t, h;
cin >> t >> h;
if (t > h)taro += 3;
else if (t == h) {
taro++;
hana++;
}
else hana += 3;
}
cout << taro << " " << hana << endl;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
{
return a;
}
return gcd(b, a%b);
}
int main() {
int n, x;
cin >> n >> x;
vector<int> x_s(n);
for (auto i = 0; i < n; i++)
{
cin >> x_s[i];
}
vector<int> sub(n);
for (auto i ... | 0 | 12,740,770 |
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int ans=0,n,k,box[100005]={0},sum=0;;
cin >> n >> k;
if(n==0&&k==0)break;
for(int i=0;i<k;i++){
cin >> box[i];
sum+=box[i];
}
ans=sum;
for(int i=k;i<n;i++){
... | #include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
int main()
{
ll a1 , a2 ;
ll N ;
cin >> N ;
ll a[N] ;
ll b[N] ;
for(ll i = 0 ; i < N ; ... | 0 | 33,640,748 |
#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... | #include<iostream>
#include<string>
#include<cstdint>
#include<alloca.h>
int64_t const MOD = 1e9+7;
std::string L;
int64_t const tbl[] = {1, 3, 5, 9, 11, 15, 19, 27, 29, 33, 37, 45, 49, 57, 65, 81};
int to_num(int k, char const* p) {
int res = 0;
while(--k>=0) { res = res*2 + (*p++ - '0'); }
return res;
}
bool is... | 0 | 73,063,286 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[7],b,c,d;
for(int i=1;i<=6;i++){
cin>>a[i];
}
cin>>b;
for(int i=0;i<b;i++){
cin>>c>>d;
if(c==a[1]){
if(d==a[2])cout<<a[3]<<endl;
if(d==a[3])cout<<a[5]<<endl;
if(d==a[5])cout<<a[4]<<endl;
if(d==a[4])cout<<a[2]<<endl... | #include <bits/stdc++.h>
#define rep(i,a,n) for (int i=a; i<n; i++)
#define ll long long
#define MOD 1000000007
using namespace std;;
ll calc(ll a, ll b) {
if (b ==0) return 1;
if (b % 2 ==0) {
ll d = calc(a,b/2);
return(d*d) % MOD;
}
if (b % 2 ==1) return (a*calc(a,b-1)) % MOD;
}
ll combi(ll a, ll b) {... | 0 | 69,261,140 |
#include<bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int D[110];
int max = -1;
int min = 1000000001;
for (int i = 0; i < N; i++) {
cin >> D[i];
if (D[i] < min) min = D[i];
if (D[i] > max) max = D[i];
}
cout << max - min << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s;
cin >> s;
int n = s.size();
int a=0,b=n-1,ans=0;
bool flag = true;
while(b-a>0){
if(s[a]==s[b]){
a++;
b--;
continue;
}
... | 0 | 22,774,000 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
int a,b,c;
cin >> a >> b >> c;
int k;
cin >> k;
if( a < b && b < c ){
cout << "Yes" << endl;
return 0;
}
while(k--){
if( a >= b ){
b = b*2;
}
els... | 0 | 88,571,657 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
using ll = long long;
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" ... | #include <iostream>
using namespace std;
int minus_five(int f, int* money)
{
if (*money >= f)
{
*money -= f;
return 1;
}
return 0;
}
int minus_one(int o, int* money)
{
int result = *money / o;
*money = *money - result*o;
return result;
}
int main(void)
{
int pay;
int coin;
while (true)
{
... | 0 | 8,320,185 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | #include <iostream>
using namespace std;
int main()
{
char Result[10000];
int m, f, r = 0;
for (int i = 0; i<10000; i++)
{
cin >> m >> f >> r;
if ((m == -1) || (f == -1))Result[i] = 'F';
else if (m + f >= 80)Result[i] = 'A';
else if (m + f >= 65)Result[i] = 'B';
else if ((m + f >= 50) || (r >= 50))Result... | 0 | 25,855,679 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
#define let auto const
int main() {
i64 N, K;
cin >> N >> K;
vector<i64> t(N), d(N);
vector<pair<i64, i64>> vec;
rep(i,0,N) {
cin >> t[i] >> d[i];
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
using ll = long long;
using Graph = vector<vector<pair<int, int>>>;
const ll INF = 1001001001;
int main(){
int n, k; cin >> n >> k;
vector<int> v(n);
for(int i = 0; i < n; i++) cin >> v[i];
int ans = -INF;
for(i... | 0 | 58,632,791 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
ll gcd(ll x, ll y){
if(y == 0) return x;
return gcd(y, x % y);
}
ll lcm(ll x, ll y){
return x / gcd(x, y) * y;
}
int main(){
int n;
cin >> n;
vector<ll> ... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef short int sh;
const int inf=0x3f3f3f3f;
const int MAX=1e5+10;
const int mod=1e9+7;
vector<int>vec[26];
char str[MAX];
void Get_Pos()... | 0 | 7,001,074 |
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsig... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
ll n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
for(int i = 0; i < n + 1; ++i)... | 0 | 3,775,814 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
vector<int> n = {a, b, c};
sort(n.begin(), n.end());
cout << n.at(2)*10 + n.at(1) + n.at(0) << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("... | 0 | 54,323,425 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep( i, n, m ) for(int i = ( n ); i < ( m ); i++)
#define rep_d( i, n, m ) for(int i = ( n ) - 1; i >= ( m ); i--)
#define sort_asc( X ) sort(( X ).begin(), ( X ).end())
#define sort_desc( X ) sort(( X ).begin(), ( X ).end(), greater <>())
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF 1000000007
#define mod 1005
#define ll long long int
const double mx = 2e6 + 5 ;
void solve()
{
int n;
cin>>n;
int tCnt = 0;
for(int i=1; i<=n; i++)
{
int cnt = 0;
int te... | 0 | 60,418,727 |
#include <iostream>
#include <algorithm>
#include <string>
#include <unordered_set>
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main(){
unordered_set<string> dic;
int n; cin >> n;
string s, t;
rep(i,n){
cin >> s >> t;
if(s[0] == 'i... | #include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--... | 0 | 68,815,096 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
cin>>n;
string s;
cin>>s;
int l=s.size();
if(n>l)
{
cout<<s;
}
else
{
for(int i=0;i<n;i++)
{
cout<<s[i];
}
}
if(n<l)
{
cout<<"..."<<endl;
}
return 0;
} | 0 | 85,933,117 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll n;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
ll ans = 0;
for(ll i=1; i*i<=n; ++i){
if(n%i==0){
ll m=n/i-1;
if(m>i) ans += m;
}
}
cout << ans <<"\n";
} | #include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define mk mak... | 0 | 87,436,646 |
#include "bits/stdc++.h"
using namespace std;
int main() {
double a,b;
cin>>a>>b;
int c=a;
int d=b;
cout<<c/d<<endl;
cout<<c%d<<endl;
printf("%.10f",a/b);
} | #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; }
int A, B;
int main() {
cin >> A >> B;
vector< vector<char> > smap(... | 0 | 74,889,155 |
#include <string>
#include <iostream>
using namespace std;
int main() {
while (true) {
string cards;
cin >> cards;
if (cards == "-") {
break;
}
int n;
cin >> n;
for (int i = 0;i != n;++i) {
int h;
cin >> h;
for (int j = 0;j != h;++j) {
char buttom = cards[0];
cards.erase(0,1);
car... | #include <bits/stdc++.h>
using namespace std;
vector <int> adia[100010];
int calc(int nod, int tata)
{
int ans = 0;
vector <int> fii;
for (auto i : adia[nod]) {
if (i == tata)
continue;
int x = calc(i, nod);
ans ^= (x + 1);
}
return ans;
}
int main()
{
int n, ... | 0 | 86,874,633 |
#include<bits/stdc++.h>
using namespace std;
const int S=(1<<20)+5;
char buf[S],*H,*T;
inline char Get()
{
if(H==T) T=(H=buf)+fread(buf,1,S,stdin);
if(H==T) return -1;return *H++;
}
inline int read()
{
int x=0;char c=Get();
while(!isdigit(c)) c=Get();
while(isdigit(c)) x=x*10+c-'0',c=Get();
retu... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using ll = long long;
using namespace std;
void solve() {
int n, k;
cin>>n>>k;
vector<ll> a;
for(int i=0;i<n;i++){
int num;
cin>>num;
a.pb(abs(k-num));
}
ll ans = __gcd(a[0], a[1... | 0 | 90,236,353 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) \
for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_A... | 0 | 16,389,107 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, m; cin >> a >> b >> m;
vector<int> ai(a), bj(b), aisorted(a), bjsorted(b);
for(int i = 0; i < a; i++) {
cin >> ai.at(i);
aisorted.at(i) = ai.at(i);
}
for(int i = 0; i < b; i++) {
cin >> bj.at(i);
bjsorted.at(i) = bj.at(i);
}... | #include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
using namespace std;
typedef pair<int, int> P;
typed... | 0 | 21,444,963 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template ... | 0 | 26,752,212 |
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define int long long
#define swap(x,y) (x^=y^=x^=y)
#define debug1(a) cerr<<#a<<" = "<<(a)<<endl;
#define debug2(a,b) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<endl;
#define debug3(a,b,c) cerr<<#a<<" = ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | 0 | 67,424,961 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string str;
char c;
int cnt = 0;
bool chk = true;
cin >> str;
if(str.substr(0,1) != "A") chk = false;
for(int i = 2; i < str.size()-1; i++){
c = str.at(i);
if(str.substr(i,1) == "C") cnt++;
else if(islower(c) == false) chk = false;
}
... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N,D,A;
P X[200001];
queue<P> range;
ll ans;
ll m;
ll K;
int main(){
cin >> N>>D>>A;
for(int i=0;i<N;i++){
int ... | 0 | 98,158,549 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int i, tmp, min, max;
long long total;
for (i = 0; i < n; i++) {
cin >> tmp;
if (i == 0) {
min = tmp;
max = tmp;
total = tmp;
} else {
if (tmp < min) {
min = tmp;
} else if (tmp > max) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll N=1e6+5,inf=1e18,mod=1e9+7;
#define test ll testcases;cin>>testcases; while(testcases--)
#define lp(var,start,end) for (ll var = start; var <end ; ++var)
#define rlp(var,start,end) for(ll var = start; var>=end ; var--)
#... | 0 | 47,067,553 |
#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(a) a.begin(),a.end()
#define INF 1000000007
const int MOD = 1000000007;
int gcd(int x,int y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
bool isPrime(int n){
if(n < 2) return false;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>;... | 0 | 46,257,362 |
#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 all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
#define MOD2 998244353
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) (ll)x.size()
#def... | 0 | 66,891,510 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define F first
#define S second
#d... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define int long long int
#define double long double
#define inf (int)(1e15)
#define all(x) (x).begin(), (x).end()
#define pair pair<int, int>
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vect... | 0 | 48,933,105 |
#include<iostream>
using namespace std;
int main(){
int i,n[101]={0},m=0;
while(cin>>i)n[i]++;
for(i=0;i<100;i++)if(n[i]>m)m=n[i];
for(i=0;i<100;i++)if(n[i]==m)cout<<i<<endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int A,B,C;
cin>>A>>B>>C;
int ans=A;
for(int i=1;i<=B;i++)
{
if((ans*i)%B==C)
{
cout<<"YES"<<endl;
return 0;
}
}
cout<<"NO"<<endl;
... | 0 | 41,837,341 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
cout<<(M*1900+(N-M)*100)*pow(2,M)<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map... | 0 | 2,814,274 |
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <c... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int ary[10];
for(int i=0;i<10;i++){
cin>>ary[i];
}
for(int i=0;i<10;i++){
for(int j=i+1;j<10;j++){
if(ary[i]<ary[j]){
swap(ary[i], ary[j]);
}
}
}
cout<<ary[0]<<endl;
cout<<ary[1]<<endl;
cout<<ary[2]<<endl;
return 0;
} | 0 | 524,813 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include <bits/stdc++.h>
int64_t mem[45][45];
int64_t V;
int64_t dp(int64_t N, int64_t v) {
if (N == 0) return 0;
if (mem[N][v] != -1) return mem[N][v];
int64_t best = -2;
for (int64_t i = v + 1; i <= N; ++i) {
if (dp(N - i, i) == -2) continue;
best = std::max(dp(N - i, i) + 1, best);
}
mem[N][v] = ... | 0 | 38,296,671 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
const int SIZE = 1e5+100;
ll x,y;
int main(){
cin >> x >> y;
if(x % y == 0){
cout << "-1\n";
return 0;
... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
long long min_diff(long long h, long long w) {
long long diff1 = (h % 3 != 0) * w;
long long w1 = w / 2, w2 = (w + 1) / 2;
long long l = 0, r = h, diff2 = INF;
while (l <= r) {
long long mid = (l + r) / 2;
long lon... | 0 | 100,182,874 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
{
int n ;
cin>>n;
vector <int> arr(n);
for(int i = 0;i<n;i++)
{
cin>>arr[i];
}
set <int> check;
check.insert(ar... | #include <iostream>
#include <string>
using namespace std;
int solve(string s1, string s2){
int L[s1.size()+1][s2.size()+1];
for(int i=0;i<=s1.size();i++){
for(int j=0;j<=s2.size();j++){
if(i<=0 || j<=0){
L[i][j]=0;
}
else if(s1[i-1] == s2[j-1]){
... | 0 | 29,878,170 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int64_t ans = 0;
int MaxNum = 0;
for (int i = 0; i < N; i+... | 0 | 51,656,896 |
#include <iostream>
#include <map>
#include <stack>
#include <string>
using namespace std;
int main(){
string line;
map<char, char> bracket;
bracket[')'] = '(';
bracket[']'] = '[';
while(getline(cin, line)){
if(line == ".") break;
bool ans = true;
stack<char> s;
for(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 | 21,601,972 |
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin>>h>>w;
vector<int> a(h);
vector<int> b(w);
char x[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++)
cin>>x[i][j];
}
for(int i=0;i<w;i++){
for(int j=0;j<h;j++){
if(x[j][i]=='#')
break;
if(j==h-1)
... | 0 | 26,867,973 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int L;
cin >> L;
double memo = (L + 0.0) / 3;
double ans = memo * memo * memo;
cout << fixed << setprecision(16);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string>W(N);
set<string>Set;
for(int i = 0; i < N; i++) {
cin >> W[i];
Set.insert(W[i]);
}
if(Set.size() != N) {
cout << "No" << endl;
return 0;
}
char usiro = W[0][W[0... | 0 | 16,121,766 |
#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
#define LINF 1e18
typedef long long ll;
int main() {
int A,B; cin >> A... | #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 | 42,691,763 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k; cin >> k;
vector<ll> a(k); for (int i = 0; i < k; i++) cin >> a[i];
ll min = 2, max = 2;
for (int i = k-1; i >= 0; i--) {
ll n = (min + a[i] - 1) / a[i] * a[i];
ll nn = max / a[i] * a[i] + a[i] - 1;
... | #include <cstdio>
using namespace std;
int main() {
int a, b, c, d;
scanf("%1d%1d%1d%1d", &a, &b, &c, &d);
int mult[] = {1, -1};
char s[2] = {'+', '-'};
int idx[3] = {};
for (int i = 0; i < 8; i++) {
idx[0] = (i & 0x1) > 0;
idx[1] = (i & 0x2) > 0;
idx[2] = (i & 0x4) > 0;
... | 0 | 87,732,948 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define li long
#define pb push_back
#define mem(arr,x) memset(arr,x,sizeof(arr))
ll n;
vector<ll>adj[100001];
ll dp[100001][2];
ll totalWays(ll node,ll parent,ll color)
{
if(dp[node][color]!=-1) return dp[node][color];
ll total... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
void debug() { cerr << "\n"; }
t... | 0 | 21,190,465 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define RFOR(i,a,b) for(int i = (int)(b-1);i>=(int)(a);--i)
#define REP(i,n)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 0 | 43,324,544 |
#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
char x, y;
cin>>x>>y;
if(x>y) cout << '>';
if(x<y) cout << '<';
if(x==y) cout <<'=';
cout << endl;
} | #include <iostream>
#include <string>
#include <array>
using namespace std;
int main() {
int n, i, x, y;
cin >> n;
array<string, 500> s;
for(i = 0; i < n; i++) cin >> s[i];
int ans = 0, xx, yy;
bool b;
for(i = 0; i < n; i++) {
b = true;
for(x = 0; x < n; x++) {
fo... | 0 | 255,995 |
#include<iostream>
#include<vector>
#include<cmath>
#define _GLIBCXX_DEBUG
using namespace std;
int main(){
int64_t N;
cin>>N;
std::vector<int64_t> L(N+1);
L[0]=2;
L[1]=1;
for(int i=2;i<=N;i++)
L[i]=L[i-1]+L[i-2];
cout<<L[N]<<endl;
return 0;
} | #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<utility>
#include<vector>
#include<valarray>
using n... | 0 | 30,596,580 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#define rep(i,j,k) for(int i=j;i<k;i++)
#define drep(n,m) for(int i=0;i<n;i++)for(int j=0;j<m;j++)
#define Sort(x) sort((x).begin(),(x).... | #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 | 24,511,532 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int a,b,c,d;
cin >> a >> b;
vector<int> ans(a,0);
int sum;
for(int i= 0;i<b;i++){
cin >> c;
for(int j = 0;j<c;j++){
cin >> d;
ans.at(d-1)++;
}
}
for(int i = 0;i<a;i++){
if(ans.at(i)==0)sum++;
}
cou... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <iomanip>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[4] = {-1, 0, 1, 0};
ll dy[4] = {0, 1, 0, -1};
int main(void){
... | 0 | 93,012,000 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,aa=0,bb=0;
cin >>n;
string a,b;
for(int i=0;i<n;i++){
cin >>a>>b;
if(a==b){
aa+=1;
bb+=1;
}
if(a>b){
aa+=3;
}
if(a<b){
bb+=3;
}
}
cout <<aa<<" "<<bb<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1};
const int dx[4]={1,0,-1,0};
const ll INF=1e10;
int main(){
ll a,... | 0 | 6,597,435 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
long long int ans = 0;
map<long long int, int> memo;
long long int sum = 0;
for(int i = 0; i < n; i++){
sum += a[i];
... | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
signed main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for( int i = 0; i < N; i++ ) cin >> V.at(i);
int ans = 0;
for( int l ... | 0 | 34,686,907 |
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
ll n;
int main() {
... | 0 | 81,752,296 |
#include <iostream>
#include <list>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#include <stack>
#include <cstring>
using namespace std;
int main(){
stack<int> garage;
vector<int> out;
int enter;
while(cin >> enter){
if(enter == 0){
out.push_back(garage.top());
garage.pop();
}
... | #include <stdio.h>
int main(void){
int A,B;
scanf("%d%d",&A,&B);
if(A == B){
printf("Draw\n");
}
else if(A == 1){
printf("Alice\n");
}
else if(B == 1){
printf("Bob\n");
}
else if(A > B){
printf("Alice\n");
}
else{
printf("Bob\n");
... | 0 | 31,345,630 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
const int maxn = 2e5+7;
const int mod = 1e9+7;
const int inf = 2e9;
int get_len()
{
string test="1";
string ans;
cout<<"? "<<test<<endl;
while(cin>>ans,ans=="Y")
{
if(te... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vect... | 0 | 34,340,671 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> P;
constexpr int INF = 1e9;
constexpr int MOD = 1e9+7;
int main() {
ll a,b,c,d;
cin >> a >> b >> c >> d;
... | #include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<l... | 0 | 23,366,503 |
#include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define ALLR(X) (X).rbegin(), (X).rend()
#define MP make_pair
#define PB push_back
#define EB e... | #include <iostream>
#include <deque>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
using namespace std;
int main(){
std::ios_base::sync_with_stdio(false);
deque<int> a;
int num, n;
string command;
cin>>n;
for(int i=0;i<n;i++){
cin>>command;
if((command.length() >= 6) && (command[... | 0 | 48,960,277 |
#include <cstdio>
#include <algorithm>
using namespace std;
#define INF 0x7fffffff
int n;
int dp[100001];
int main() {
scanf("%d", &n);
fill(dp, dp+n, INF);
for (int i=0; i<n; i++) {
int a;
scanf("%d", &a);
*lower_bound(dp, dp+n, a) = a;
}
printf("%ld\n", lower_bound(dp, dp+n... | #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | 0 | 97,292,087 |
#include <iostream>
bool judging(int x, int y, int z)
{
if (x * x + y * y == z * z) {
return true;
} else if (z * z + x * x == y * y) {
return true;
} else if (y * y + z * z == x * x) {
return true;
} else {
return false;
}
}
int main()
{
int a, b, c, n;
s... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <math.h>
#include <set>
#define inf -1e18
#define sz 1e5
using ll = long long int;
using namespace std;
int main() {
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll temp;
ll max=inf;
temp=a*c;... | 0 | 97,917,285 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define _LL long long
int* mallocint(int si)
{
return (int*) malloc(si * sizeof(int));
}
int* inputint(int n)
{
int *ans = mallocint(n);
for( int i = 0; i < n; i++ ) cin >> ans[i];
return ans;
}
_LL _f[100004];
int main()
{
int n, m;
... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
#define N 100010
ll n,l,t;
ll x[N],w[N],ans[N];
int main(){
cin>>n>>l>>t;
for(int i=0;i<n;i++)cin>>x[i]>>w[i];
ll hosl=x[0];
for(int i=0;i<n;i++)x[i]-=hosl;
bool hosf=(w[0]==2);
if(hosf)for(int i=0;i<n;i++){
... | 0 | 36,374,003 |
#include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG_OUTPUT
#define DEBUG_LOG(s) cout << s << endl;
#else
#define DEBUG_LOG(s) void();
#endif
int main(){
string s;
cin >> s;
for (auto i = ((int)s.size() - 1) / 2; i > 0; i--) {
if(s.substr(0, i) == s.substr(i, i)) {
cout << 2... | #include <bits/stdc++.h>
using namespace std;
int main(){
while (1){
int N, A, B, C, X;
cin >> N >> A >> B >> C >> X;
if (N == 0 && A == 0 && B == 0 && C == 0 && X == 0){
break;
}
vector<int> Y(N);
for (int i = 0; i < N; i++){
cin >> Y[i];
}
int pos = 0;
int t = -1;
... | 0 | 1,134,089 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | #include <iostream>
using namespace std;
typedef struct {
int id;
int parent;
int depth;
int child_num;
int* children;
} node;
node* tree;
void update_depth(int node_id, int depth) {
node nod = tree[node_id];
tree[node_id].depth = depth;
int child_num = nod.child_num;
for (int i = 0; i < child_num; i+... | 0 | 91,550,257 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string rev_s; cin >> rev_s;
string s = rev_s;
reverse(rev_s.begin(), rev_s.end());
string key = "keyence";
string rev_key = "ecneyek";
int cnt=0, rev_cnt=0;
int n = s.length();
for(int i=0; i<n; i++){
if(s[i] == key[cnt]){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N,M;
ll a[100000];
ll count(ll n){
bitset<64> bt(n);
for(int i=0;i<N;i++){
if(bt[i] == 1) return i;
}
return -1;
}
bool check(ll m){
for(int i=1;i<N;i++){
if(count(a[i]) != m) return true;
}
return false;
... | 0 | 14,620,863 |
#include<bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef unsigned long long ull;
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 < ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); i--)
#define ITER(it, a) for(typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))
#define SZ(a) (int) a.size()
#define A... | 0 | 28,206,661 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll h[200010],n,k;
bool cmp(ll a,ll b)
{
return a>b;
}
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>h[i];
sort(h,h+n+1,cmp);
ll ans=0;
for(int i=k;i<=n;i++)
ans+=h[i];
cout<<ans;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define PI 3.141592653589793
#define FOR(i,a,b) for(int i=int(a);i<int(b);++i)
#define RFOR(i,a,b) for(int i=int(b)-1;i>=int(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
class Dice{
p... | 0 | 36,105,495 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.