code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#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... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using v... | 0 | 75,139,603 |
#include<iostream>
using namespace std;
int main(){
int m,n;
n=1;
while(n>0){
cin >> n >> m;
if(n==0) break;
int d[n],p[n];
int s=0;
for(int i=0;i<n;i++){
cin >> d[i] >> p[i];
s += d[i]*p[i];
}
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
int a,b;
if(p[j]<p[i]){
a... | #include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
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; }... | 0 | 44,143,556 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int a[26];
int main()
{
string s;
cin >> s;
rep(i, s.size()) {
a[s[i] - 'a']++;
}
... | #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... | 0 | 50,229,593 |
#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;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define int long long int
#define endl "\n"
#define pb push_back
int dp[100001][2];
vector<int> v[100001];
void Indset(int n, int p){
dp[n][0]=1;
dp[n][1]=1;
for(auto c : v[n]){
if(c!=p){
Indset(c,n);
dp[n][0]... | 0 | 48,078,102 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cmath>
#inc... | #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int WHITE = 0, GREY = 1, BLACK = 2;
const int INF = 1000000;
struct BFS {
int n;
vector<vector<int>> g;
vector<int> parent;
vector<int> distance;
vector<int> color;
BFS (int n) : n(n) {
g.... | 0 | 59,431,801 |
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#include <vector>
#include <math.h>
#include <bitset>
#include <cmath>
#include <set>
#define rep(i,s,n)for(int i = s;i<n;i++)
#define repe(i,s,n)for(int i = s;i<=n;i++)
#define rep_r(i,s,n)for(int i = n-1;i>=s;i--)
#define rep_r... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int X, Y, Z, K;
scanf("%d", &X);
scanf("%... | 0 | 57,334,512 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> A){
for(auto a : A){
if(a == 0){
cout << 0 << endl;
return;
}
}
long long ans = 1;
for (int i = 0; i < N; i++)
{
if(A[i] <= 1000000000000000000/ans) ans *= A[i... | #include<bits/stdc++.h>
using namespace std;
template<class T>inline void init(T&x){
x=0;char ch=getchar();bool t=0;
for(;ch>'9'||ch<'0';ch=getchar()) if(ch=='-') t=1;
for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1)+(x<<3)+(ch-48);
if(t) x=-x;return;
}
const char symbol[4]={'R','G','B','Y'};
int n,m,k;
int main()
{
i... | 0 | 12,000,648 |
#include <iostream>
using namespace std;
int P[10001];
void init(int n) {
for (int i = 0; i <= n; i++)
P[i] = i;
}
int root(int a) {
if (P[a] == a)
return a;
return (P[a] = root(P[a]));
}
bool is_same_set(int a, int b) {
return root(a) == root(b);
}
void unite(int a, int b) {
P[root(a)] = root(b);
}
int main()... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 79,436,832 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin>> H >>W;
vector<vector<char>> a(H, vector<char>(W));
vector<bool> row(H, false);
vector<bool> col(W, false);
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin>>a[i][j];
if(a[i][j]=='#'){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll ... | 0 | 56,929,504 |
#include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i,n) for(int i=0;i<n;i++ )
#define rep2(i,f,n) for(int i=f;i<n;i++ )
#define SORT(A) sort(A.begin(),A.end())
#define REV(A) reverse(A.begin(),A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<... | #include <bits/stdc++.h>
using namespace std;
#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 _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 53,774,977 |
#include<iostream>
#include<algorithm>
#define N 10
#define M 10000
using namespace std;
int data[N][N];
void Init(){
for(int i=0; i<N; ++i){
for(int j=0; j<N; ++j){
if(i == j) data[i][j] = 0;
else data[i][j] = M;
}
}
}
void WarshallFloyd(int& n){
for(int k=0; k<n; ++k){
for(int i=0; i<n; ... | #include <iostream>
#include <algorithm>
#include <vector>
typedef int TInt;
typedef std::vector<TInt> TList;
TList Input()
{
int Count;
std::cin >> Count;
TList List(Count);
for(int i = 0; i < Count; ++i){
std::cin >> List[i];
}
return List;
}
TInt SelectionSort(TList& List)
{
typed... | 0 | 12,237,849 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pw(x) (1LL << (x))
#define db(x) cerr << #x << " = " << x << endl
#define db2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"
#define db3(x, y, z) cerr << "(" << #x << ", " << #y << ",... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<ll, ll> P;
int main(){
int a,b;
cin >> a >> b;
string s;
cin >> s;
bool ok = true;
rep(i,a){
if(s[i]=='-'){
cout << "No" << endl;
return... | 0 | 8,488,739 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2+5;
int n , k;
bool yes[N];
int main(){
scanf("%d%d" , &n , &k);
for(int i = 1; i <= k; i++){
int d;
scanf("%d" , &d);
for(int j = 1; j <= d; j++){
int x;
scanf("%d" , &x);
yes[x] = 1;
... | #include<stdio.h>
#include<algorithm>
using namespace std;
#define NIL -1
#define MAX 100005
struct Node { int parent, left, right; };
struct Node T[MAX];
int D[MAX];
void setDepth(int u, int d) {
D[u] = d;
if (T[u].left != NIL) setDepth(T[u].left, d+1);
if (T[u].right != NIL) setDepth(T[u].right, d);
}
void prin... | 0 | 8,238,455 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 0 | 34,977,769 |
#include<iostream>
#include<algorithm>
using namespace std;
int a[8];
int main(){
for(int i=0;i<8;i++)cin>>a[i];
cout<<max(a[0]+a[1]+a[2]+a[3],a[4]+a[5]+a[6]+a[7])<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
const int MOD = 1'000'000'007;
template <typename T>
void print(const T &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
... | 0 | 52,955,523 |
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
using namespace std;
struct Node {
Node *prev,*next;
int key;
};
Node *Nil;
void init(){
Nil=(Node *)malloc(sizeof(Node));
Nil->next=Nil;
Nil->prev=Nil;
}
void Insert(int x){
Node *node;
node=(Node *)malloc(sizeo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | 0 | 35,084,258 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int a, b, k; cin >> a >> b >> k;
for (int i = min(a,b); i >= 1; i--) {
if (a % i == 0 && b % i == 0)k--;
if (k == 0) {
cout << i << endl;
return 0;
}
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
typedef long long ll;
using namespace std;
void solver() {
int n;
int money = 100000;
cin >> n;
for (int i = 0; i < n; ++i) {
money *= 1.05;
if (money % 1000 != 0) {
money = money - (money % 1000);
... | 0 | 29,444,637 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | #include<bits/stdc++.h>
using namespace std;
const long long mod=1000000007;
long long f[1000005][2];
int main()
{
char ss[100005];
cin >> ss+1;
f[0][1]=1;
f[0][0]=0;
int n=strlen(ss+1);
for(int i=1;ss[i];i++)
{
f[i][0]=(f[i-1][0]*3)%mod;
if(ss[i]=='1')
{
f[i][1]=(f[i-1][1]*2)%mod;
f[i][0]+=f[i-1][1]... | 0 | 81,419,339 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
map<int, int> mp;
for (int i = 0; i < N; i++) {
cin >> A[i];
mp[A[i]] = i;
}
vector<int> B = A;
sort(B.begin(), B.end());
int cn... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod=1e9+7;
int main(){
int N;
cin >> N;
int A, B;
cin >> A >> B;
queue<int> P;
for(int i=0; i<N; i++){
int tmp;
cin >> tmp;
P.push(tmp);
}
int x=0, y=0, z=0;
while(!P.empty()){
... | 0 | 23,704,590 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
const int dx[] = {1, 0};
const int dy[] = {0, 1};
int a, b;
int n;
int x, y;
bool maze[22][22];
inline bool check(int hx, int hy){ return 0 <= hx && hx < a && 0 <= hy && hy < b; }
int main()
{
while(cin >> a >> b, a){
rep(i, a) ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=40;
int n;
char a[maxn][3];
char b[maxn][3];
char c[maxn][3];
void bubble_sort()
{
for(int i=0;i<n;i++)
{
for(int j=n-1;j>0;j--)
{
if(b[j][1]<b[j-1][1]) swap(b[j],b[j-1])... | 0 | 1,524,419 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=9982443... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++) par.at(i) = i;
}
int root(int x) {
if (par.at(x) == x) return x;
return par.at(x) = root(par.at(x));
}
void unite(int x, int y) {
int rx = root(x);
in... | 0 | 48,724,983 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int N;
int main() {
cin >> N;
vector<int> a(N);
int mx = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
a[i] = tmp;
mx = max(mx, tmp);
}
int r = -1;
for (int ... | 0 | 42,099,053 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
map<int, int> m;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (m.count(x) == 0) {
m.emplace(x, 0);
}
m[x]++;
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef vector<int> vi;
int N,M; Graph G;
void input()
{
cin>>N>>M;
G.resize(N+1);
for(int i=0;i<M;++i){
int a... | 0 | 9,636,157 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
using namespace std;
int main(void) {
string card1, card2;
int score1, score2;
int N;
int i;
cin >> N;
score1 = score2 = 0;
for(i=0; i<N; i++)... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | 0 | 42,652,911 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | #include <iostream>
#include <sstream>
using namespace std;
int main() {
int H,W,i;
string tpbtmF,mdlF;
while(cin>>H>>W && (H!=0 || W!=0)){
tpbtmF = string(W,'#');
stringstream ss;
ss << "#";
if (W>2) ss << string(W-2,'.');
if (W>=2) ss << "#";
mdlF = ss.str()... | 0 | 59,902,903 |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 1e5+5;
typedef long long ll;
const ll INF = 1e4;
ll n, X, x[max_n];
void solve(){
ll ans = 0;
for(int i=0 ; i+1<n ; i++){
if(x[i] == x[i+1]){
x[i+1] = INF;
ans++;
}
}
cout << ans << endl;
}
int main(... | #include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
if(x&1) ans=ans*a%MOD;
a=a*a%... | 0 | 8,789,875 |
#include "bits/stdc++.h"
using namespace std;
int main()
{
int n,max,p,q;
max=0;
cin>>n;
vector<int> a(n);
vector<int> aa(n);
for(int i=0;i<n;i++)
{
cin>>a.at(i);
if(max<a.at(i))
{
max=a.at(i);
p=i;
}
}
for(int i=0;i<n;i++)
{
aa.at(i)=a.at(i);
}
sort(aa.begin(),aa... | #include <bits/stdc++.h>
using namespace std;
map<pair<int, int>, int> mp;
long long an[10];
int h, w, n;
bool ok(int a, int b){
return a > 0 && b > 0 && a + 2 <= h && b + 2 <= w;
}
int main(){
scanf("%d%d%d",&h,&w,&n);
for(int i = 1; i <= n; ++i){
int x, y;
scanf("%d%d",&x,&y);
for(int j = x - 2; j <= x; ++j)... | 0 | 74,415,115 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int sum = 0;
bool flag = false;
int pos = 0;
for(int i = 1; i <= n; i++)
{
sum += i;
if(n == sum)
{
flag = true;
pos = i;
break;
}
}
if(!fla... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,ll>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=9... | 0 | 75,598,148 |
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n; cin>>n;
if(n==0)break;
int score[n]; for(int i=0;i<n;i++)cin>>score[i];
for(int i=0;i<n;i++){
bool flag=false;
for(int j=i;j<n;j++){
int minj=i;
if(sco... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 72,263,410 |
#include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define all(x) (x).begin(), (x).end()
usi... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,k;
cin>>n>>k;
vector<int>a(n);
vector<ll>sum(n);
rep(i,n)cin>>a[i];
sum[0]=a[0];
for(int i=1; i<n; ++i)sum[i]=sum[i-1]+a[i];
vector<ll... | 0 | 94,167,792 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,n) for(ll i=a;i<n;i++)
#define rev(i,n,a) for(ll i=n-1;i>=a;i--)
#define f first
#define s second
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define vpii vector<pair<int,int>>
#define vpll vector<pll>
#define pll pair<ll,ll>
#... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | 0 | 62,149,576 |
#include <bits/stdc++.h>
using namespace std;
typedef long long llint;
const int maxn = 1e5+10;
const llint inf = 1e9+10;
int n;
llint m;
llint a[maxn];
int cnt[maxn];
int main() {
scanf("%d%lld", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%lld", a+i);
a[i] /= 2;
}
for (int i = 0; i <... | #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 n... | 0 | 58,578,469 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
using namespace std;
#define int long long
#define fr(i,n) for (int i = 0; i < n; i++)
#define fro(i,m,n) for (int i = m; i < n; i++)
#define pb push_back
#define iter ::iterator
#define fi first
#define se second
void io(){
#ifndef ONLINE_JUDGE
... | 0 | 66,239,817 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
#include<bitset>
using name... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int in() {int x; cin>>x; return x;}
ll lin() {ll x; cin>>x; return x;}
string sin() {string x;cin>>x;return x;}
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
bool i... | 0 | 30,028,075 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <climits>
using namespace std;
int main(){
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
int h = i;
int count = 0;
while ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
struct card {
int num;
char suit;
};
bool operator==(const card &lhs, const card &rhs) {
return lhs.num == rhs.num && lhs.suit == rhs.suit;
}
vector<card> bubbleSort(vector<card> c) {
int n = c... | 0 | 48,170,958 |
#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(... | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef p... | 0 | 33,443,139 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int coin[10] = {0, 1, 2, 3, 4, 1, 2, 3, 4, 5};
int main(){
int n, ans;
while(true){
cin >> n;
if(n == 0){
break;
}
n = 1000 - n;
ans = 0;
for(int loop = 0; loop < 4; loop++){
ans += coin[n % 10];
n /=... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define LINF 1e18
#define INF 1e9
using namespace std;
#define P pair<ll,ll>
#define fs first
#define sc second
signed main(){
ll h,w;
cin >> h >> w;
ll ans = min(h,w);
... | 0 | 66,778,988 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<ll,int>> v;
for(int i=0;i<n;i++){
ll a;
cin>>a;
v.... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
#define FOR(i,a,b) for (int i=... | 0 | 91,835,258 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n) ;i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int getKey(int x,vector<ll> &arr){
return arr.at(x-1);
}
int getLeft(int x,vector<ll> &arr){
return arr.at(2*x-1);
}
int getRight(int x,vector<ll> &arr){
return arr.at(2*x);
}
int getParent(int x,vector<ll> &arr){
int one_start = x/2;
... | 0 | 25,668,177 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define dump(x) cout << (x) << '\n'
Int mod = 1e9+7;
Int gcd(Int n, Int m) {
Int a = max(n, m);
Int b = min(n, m);
return a % b == 0 ? b : gcd(b, a % b);
}
int main() {
Int n, x;
cin >> n >> x;
if (n % x == 0) {
dump((n -... | #define fi first
#define se second
#define mp make_pair
#define pb push_back
#define LOCAL 1
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define dbg(...) cout<<#__VA_ARGS__ ": ["; for(auto e: __VA_ARGS__){cout<<e<<", ";} cout<<"]\n"
#define dbg1(...) cout<<#__VA_ARGS__ " "<< __VA_ARGS__
#else
#define dbg... | 0 | 64,998,740 |
#include <bits/stdc++.h>
#include <vector>
#include <string>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
}
else {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int ans=0;
if(abs(a)>abs(b)){
ans+=abs(a)-abs(b);
if(a>0)
ans++;
if(b>0)
ans++;
}else if(abs(a)<abs(b)){
ans+=abs(b)-abs(a);
if(a<0)
ans++;
if(b<0)
ans++;
}else{
ans=1;
}
... | 0 | 42,855,242 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
#define MOD 1000000007
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) { rep(i, N) par[... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define precise cout.precision(10); cout << fixed;
#define endl "\n"
#define int int64_t
#define ll long long
#define yes printf("YES\n")
#define no printf("NO\n")
#define push_back pb
int32_t main()
{
long ... | 0 | 16,284,827 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s >> t;
int i = 2000;
for (int j = 0; j < s.size() - t.size() + 1; j++) {
int difcou = 0;
for (int k = 0; k < t.size(); k++) {
if (t.at(k) != s.at(j + k)) {
difcou++;
}
}
if (difcou < i) {
i =... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int A,B,M;
cin>>A>>B>>M;
int a[A];
int mina=INT_MAX;int minb=INT_MAX ;int minc=INT_MAX;
for(int i=0;i<A;i++)
{
cin>>a[i];
if(a[i]<mina)
mina=a[i];
}
int b[B];
for(int i=0;i<B;i++)
{
cin>>b[i];
if(b[i]<min... | 0 | 100,373,871 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,k;
cin>>a>>b>>k;
cout<<max(a-k,(long long)0)<<" "<<max(min(b,b+a-k),(long long)0)<<endl;
return 0;
} | #include<iostream>
#include<vector>
#include<set>
using namespace std;
int main() {
string s; cin >> s;
int gx, gy; cin >> gx >> gy;
int xx, mode = 0, count = 0, tokubetu = 1;
vector<int> idox, idoy;
for (int i = 0; i <= s.size(); i++) {
if (s[i] == 'T' || i == s.size()) {
if (tokubetu) xx = count, tokubetu =... | 0 | 83,757,277 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
void solve(void)
{
int n;
string s, t;
cin >> n >> s >> t;
int ans = 2 * n;
rep(i, n)
{
int cta = 0;
rep(j, n)
{
if... | # 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,882,290 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n,a,b,res;
cin>>n;
res=n+1;
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
b=n/i;
a=i;
res=min(res,a+b);
}
}
cout<<res-2;
return 0;
} | #include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#includ... | 0 | 60,132,105 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> X(N);
for(int i=0; i<N; i++) {
cin >> X[i];
}
vector<int> Y(N);
Y = X;
sort(Y.begin(), Y.end());
int min_n = Y[0];
int max_n = Y[... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | 0 | 74,207,715 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B) cout << C << endl;
else if (A == C) cout << B << endl;
else i... | #include <bits/stdc++.h>
#include<math.h>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int , int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main() {
int n ;
cin >> n ;
vector<int> a (n);
int mx ;
rep(i, n){
... | 0 | 74,626,442 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
int n; cin >> n;
int ans; cin >> ans;
for (int i = ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<ll>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int> ... | 0 | 24,474,355 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int N; ll K;
scanf("%d %lld", &N, &K);
ll a[N];
for(int i = 0; i < N; ++i) scanf("%lld", &a[i]);
sort(a, a + N);
ll sm = 0;
int res = N;
for(int i = N-1; i >= 0; --i) {
if(sm + a[i] < K) sm += a[i];
... | #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 | 49,626,060 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
deque<int> q;
int main(){
ll m,k;
cin>>m>>k;
if(k>((1<<m)-1)){
cout<<-1<<endl;
return 0;
}
if(k==0){
for(int i=0;i<(1<<m);i++){
cout<<i<<" "<<i<<" ";
}cout<<endl;
return 0;
}
if(m==1){
cout<<-1<<endl;
return 0;
}
q.push_front(k... | #include<iostream>
using namespace std;
int main(){
int x,y;
while(true){
cin >> x >> y;
if(x==0 && y==0){
break;
}
else if(x<=y){
cout << x <<" " << y <<endl;
}
else if(x>y){
cout << y << " " << x <<endl;
}
}
re... | 0 | 59,951,849 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long long ll;
typedef long double ... | #include <iostream>
#include <cmath>
#define _USE_MATH_DEFINES
#include <math.h>
#include <string>
#include <iomanip>
#include <valarray>
#include <vector>
int main(int argc, char *argv[])
{
std::cout << std::fixed << std::setprecision(0);
int h,w;
while(1){
std::cin >> h >> w;
if(h+w == 0)b... | 0 | 67,414,437 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | #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>
#includ... | 0 | 7,147,783 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<deque>
#include<map>
#include<queue>
#define maxn 106
using namespace std;
typedef long long ll;
int read()
{
int x=0,f=1;
char ch=getchar();
while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
while... | 0 | 65,913,386 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
using namespace std;
const int inf = 1e9 + 13;
signed main () {
int n;
cin >> n;
vector < int > need(4);
for (int i = 1; i < 4; ++i)
cin >> need[i];
vector < int > l(n);
for (int i = 0; i < n; ++i)
cin >> l[i];
sort(l.rbegin... | 0 | 28,371,152 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
[[maybe_unused]] long long int n,m,i,j,c=0,h[1000010],a[1000010],b[1000010],x[1000010],ans=0;
cin >> n >> m;
for(i=0;i<n;i++)
{
cin >> h[i];
x[i]=0;
}
for(i=0;i<m;i++)
{
cin >> a[i] >> b[i];
if(h[a[... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 57,176,729 |
#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#define debug(x) cer... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> h(n, 0);
rep(i, 0, n){
cin >> ... | 0 | 7,118,198 |
#define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string str;
string cpy;
int m, h;
while(cin >> str) {
if(str[0] == '-' && str.length() == 1) break;
cin >> m;
for(int i = 0; i < m; ++i) {
cin >> h;
cpy = str.substr(0, h);
... | 0 | 76,650,983 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define setbits(x) __builtin_popcount(x)
#define zerobits(x) __builtin_ctz(x)
#define setbitsll(x) __builtin_popcountll(x)
#define zerobitsll(x) __builtin_ctzll(... | #include<cstdio>
int ans,w=1e9;
char o[5],lst;
int main(){
while(w!=1){
printf("? %d\n",w),fflush(stdout),scanf("%s",o);
if(*o=='Y'){
printf("? %d\n",w-1),fflush(stdout),scanf("%s",o);
if(*o=='N'||lst=='N')break;
}
lst=*o;
w/=10;
}
if(w==1e9){printf("! %d\n",w),fflush(stdout);return 0;}
if(w==1){
... | 0 | 71,111,211 |
#include <iostream>
#include <string>
using namespace std;
int main (){
int a, b , c;
string s;
cin >> a >> b >> c;
if ((a < b) && (b < c)) s = "Yes";
else s = "No";
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const ll mod = 1000000007;
int inv(int n){
if(n == 1)return 1;
return (mod - mod/n)*1LL*inv(mod%n)%mod;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setpre... | 0 | 15,704,079 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll A,B,C,D;
cin>>A>>B>>C>>D;
if(B<=C||D<=A) {
cout<<0<<endl;
return 0;
}
vector<ll> vec(4);
vec[0]=A;
vec[1]=B;
vec[2]=C;
vec[3]=D;
sort(all(vec));
cout<<vec[2]-vec[1]<<endl;
} | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 0 | 46,144,699 |
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s1, s2, s3; cin >> s1 >> s2 >> s3;
transform(all(s1), s1.begin(), ::toupper);
transform(all(s2), s2.b... | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long int
#define ull unsigned long long int
#define deb(x) cout << #x << "=" << x << endl
#define deb... | 0 | 1,800,104 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define ll long long
#define vi vector<int>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
string S;
void solve(){
if(S.substr(0,4) == "YAKI")
cout << "Yes" << endl;
else
... | #include<bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
const int mod = (int) 1e9+7;
void __print() {cerr << "]\n";}
template<typename T, typename... V>
void __print(T t, V... v)
{ cerr << t; if(sizeof...(v)) cerr << ", "; __print(v...);}
#define dbg(x...) cerr << "[" << #x <... | 0 | 83,336,984 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<v<<"\n";
#define fi(v) get<0>(v)
#define se(v... | #include <iostream>
using namespace std;
const int MIN = 1;
const int MAX = 10000;
bool isIN(int v)
{
if ((MIN <= v) && (v <= MAX))
{
return true;
}
return false;
}
bool isOrder(int a, int b)
{
if (a <= b)
{
return true;
}
return false;
}
int main()
{
int a,b,c;
w... | 0 | 6,494,536 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int a[m];
for(int i=0;i<m;i++){
cin>>a[i];
}
int dp[60000]={};
for(int i=0;i<=n;i++) dp[i]=1e9;
dp[0]=0;
for(int i=0;i<=n;i++){
for(int j=0;j<m;j++){
if(i-a[j]>=0){
... | 0 | 55,527,981 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const char nl = '\n';
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll a,b,k;
cin>>a>>b>>k;
if (k<=a){
cout<<a-k<<" "<<b<<nl;
}
else{
k-=a;
if (k<=b){
cout<<0<<" "<<b-k<<nl;
}
else cout<<0<<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define INF 1000000000
#define MOD 1000000007
void solve() {
string s;
ll n, ans;
cin >> n >> s;
vi r, g;
for (int i = 0; i < n; ++i) {
if (s[i] == '... | 0 | 88,255,093 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { ce... | 0 | 8,012,009 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <math.h>
#include <assert.h>
#include <set>
#include <map>
#include <bitset>
#include <ctime>
#include <time.h>
#include <algorithm>
#include <cstdio>
#include <fstre... | #include <stdio.h>
#include <string.h>
char result[100000];
void calculation(int multi){
int carry=0,i,j=0;
for(i=0;result[i]!=NULL;i++){
carry+=(result[i]-48) * multi;
result[j++]=(carry % 10) + 48;
carry/=10;
}
while(carry){
result[j++]=(carry % 10) + 48;
carry/... | 0 | 31,789,571 |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int,int>;
int N, M, ans, pena;
int main(){
cin >> ... | #include<iostream>
using namespace std;
int main(){
int money,bell;
while(1){
cin >> money;
if(money==0){
break;
}
money=1000-money;
bell=0;
while(money!=0){
if(money>=500){
bell++;
money-=500;
}
else if(money>=100){
bell++;
money-=100;
}
else if(money... | 0 | 2,586,940 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
#define MAXN 2000000
#define INF (1 << 30)
int H, A[MAXN + 1];
void maxHeapify(int i)
{
int l, r, largest;
l = 2 * i;
r = 2 * i + 1;
if(l <= H && A[l] > A[i])
largest = l;
else
largest ... | 0 | 35,421,250 |
#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define MSET(x,y) memset(x,y,sizeof(x))
#define M 1005
#define MOD 1000000007
using namespace std;
int n,m,dp[M][M];
char in[M][M];
int main()
{
scanf("%d %d", &n, &m);
REP(i,1,n) scanf("%s", in[i] + 1);
dp[1][1] = 1;
REP(i,1,n)REP(j,1,m) ... | #include <iostream>
using namespace std;
int main()
{
int m, f, r;
while(true)
{
cin >> m >> f >> r;
if (m==-1 && f==-1 && r==-1) break;
char rank;
int sum = m+f;
if (m==-1 || f==-1)
{
rank = 'F';
}
else
{
if ... | 0 | 98,106,781 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)
int main(){
string s;
cin>>s;
int y = stoi(s.substr(0, 4));
int m = stoi(s.substr(5, 2));
int d = stoi(s.substr(8... | 0 | 45,720,580 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
using namespace std;
vector <int> n;
int main(){
long long n,a,ans=0,cur;
cin>>n>>cur;
for(int i=1;i<n;i++){
cin>>a;
if(a<=cur){
ans+=cur-a;
}else{
cur=a;
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
using namespace std;
const ll maxn = 1e6 + 7;
const ll mod = 1e9 + 7;
const ll mod1 = 123456789;
const int maxx = 1005;
ll q, t, n, m, T, k, ans, a[maxn], b[maxn], c[maxn], f[maxx][maxx];
priority_queue<ll> pr;
string s, str;
char ss[maxx][maxx];
ma... | 0 | 49,990,877 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b,c;
int cnt=0;
cin>>a>>b>>c;
for(int i=1;i<=c;i++){
if(c%i==0 && a<=i && i<=b) cnt++;
}
cout<<cnt<<endl;
return 0;
} | 0 | 29,437,367 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
v... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector <int> vec(N);
for (int i=0; i<N; i++) {
cin >> vec.at(i);
}
int sum=0;
for (int i=0; i<N; i++) {
for (int j=0; j<N; j++) {
sum+=vec.at(i)*vec.at(j);
}
}
for (int i=... | 0 | 33,702,666 |
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define ret return
#define rep(q, i, n) for(int q=i; q<n; q++)
#define forn(i, n) for(int i=0; i<n; i++)
#define mems(a,x) memset(a,x,sizeof(a))
#define ll long long
#define pb push_back
#define em emplace_back
#define mp ma... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
typedef vector <bool> v_bool;
typedef vector <ll> v_ll;
typedef vector <vector <ll> > vv_ll;
typedef vector < pair <ll,ll> > vp_ll;
typedef pair <ll,ll> p_ll;
bool TEST=false;
ll MOD = 1000000007;
void sh... | 0 | 96,090,196 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fa... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(i) begin(i), end(i)
const int INF = 0x3fffffff;
const ll MINF = 0x7fffffffffff;
const ld DINF = numeric_l... | 0 | 61,510,302 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define reps(i,x,n) for(int i=x;i<n;i++)
#define breps(i,x,n) for(int i=x;i>=n;i--)
#define exrep(x,vec) for(auto&& x : vec);
#defi... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 0 | 65,593,259 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A,B,C;
cin>>A>>B>>C;
int Na=A.size();
int Nb=B.size();
int Nc=C.size();
if(A.at(Na-1)==B.at(0) && B.at(Nb-1)==C.at(0)){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
} | #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 <numeric>
#define ll long long int... | 0 | 20,941,528 |
#include<iostream>
#include<string>
using namespace std;
int main(){
while(1){
int m,n;
char cha[100000],con[100000],a[100000];
cin>>m;
if(m==0)break;
for(int i=0;i<m;i++){
cin>>cha[i]>>con[i];
}
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
for(int j=0;j<m;j++){
if(a[i]==cha[j]){
a[i]=con... | #include<cstdio>
#include<iostream>
using namespace std;
int main(void) {
long long N, A, B;
scanf("%lld %lld %lld", &N, &A, &B);
long long set = N / (A + B);
if (N - (A + B) * set >= A) {
printf("%lld", A * set + A);
} else {
printf("%lld", A * set + (N - ( A + B ) * set));
}
return 0;
} | 0 | 63,237,104 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,Y,A=-1,B=-1,C=-1;
cin>>N>>Y;Y/=1000;
for(int i=0;i<=N;i++)
for(int j=0;j<=N-i;j++)
if(9*i+4*j+N==Y)
A=i,B=j,C=N-i-j;
cout<<A<<" "<<B<<" "<<C<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii > vii;
typedef vector<pll > vll;
#define pb push_back
#define mp make_pair
#define ar array
#define mod 1000000007
#define F first
#de... | 0 | 21,662,469 |
#include <bits/stdc++.h>
using namespace std;
using Vi = vector<unsigned>;
using VVi = vector<Vi>;
#define rep(i, ns, ne) for (unsigned i = ns; i < ne; ++i)
unsigned N, M, X;
VVi v;
Vi p;
void input() {
cin >> N >> M >> X;
v.resize(N, (Vi(M)));
p.resize(N);
rep(i, 0, N) {
cin >> p[i];
rep(j, 0, M) { cin... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
bool ans = false;
for(int i = 1; i <= B; i++){
if(A * i % B == C){
ans = true;
}
}
if(ans){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
... | 0 | 50,853,143 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP2(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(v) (v).begin(),(v).end()
#define INF 2e9
typedef long long ll;
int main()
{
int n;
cin>>n;
vector<int> a(n);
int cnt=1,ans=0;
REP(i,n){
cin>>a[i];
if(i!=0){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,d,a;
cin >> n >> d >> a;
vector<pair<ll,ll>> x(n);
vector<ll> indx(n);
for(i = 0;i < n;++i){
cin >> x.at(i).first >> x.at(... | 0 | 77,328,142 |
#include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allo... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
int main() {
long long n, k, ret = 0;
std::cin >> n >> k;
std::vector<long long> a(n);
std::multiset<long long, std::greater<>> ms;
std::map<long long, bool> m;
for (auto i = 0ll; i < n; i... | 0 | 58,611,441 |
#include <iostream>
using namespace std;
int main(){
long long N,M;
cin >> N >> M;
if(N == 1 && M == 1) cout << 1 << '\n';
else if (N == 1 || M == 1) cout << max(M, N) - 2 << '\n';
else cout << N*M - 2*N - 2*M + 4 << '\n';
return 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 ll long long
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statistics_n... | 0 | 26,270,098 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n; cin >> n;
vector<long long> a(n+1);
vector<long long> b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
long long ans=0;
rep(i,n){
long long x=min(a[i],b[i]);
b[i]-=x;
ans+=x;
x=min(a[i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii > vii;
typedef vector<pll > vll;
#define pb push_back
#define mp make_pair
#define ar array
#define mod 1000000007
#define F first
#de... | 0 | 30,848,725 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
if (n % 500 <= k)
cout << "Yes";
else
cout << "No";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> a(n);
rep(i, n) {
if(s[i] == 'R')
a[i] = 0;
if(s[i] == 'G')
a[i] = 1;
if(s[i] == 'B')
a[i] = 2;
}
v... | 0 | 43,710,788 |
#include<stdio.h>
int main(void)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a<b){
if(b<c) printf("Yes\n");
else printf("No\n");
}
else printf("No\n");
} | #include <bits/stdc++.h>
#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 _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl ... | 0 | 90,027,736 |
#include <iostream>
using namespace std;
int main() {
for(;;){
int n,x,ans=0;
cin>>n>>x;
if(n==0&&x==0)break;
for(int i=1;i<=n-2;i++){
for(int j=i+1; j<=n-1; j++){
for(int k=j+1; k<=n; k++){
if(i+j+k==x)ans+=1;
}
}
}
cout<<ans<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int a,cou;
while(cin>>a){
cou=0;
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
for(int k=0;k<10;k++){
for(int q=0;q<10;q++){
if(i+j+k+q==a)cou++;
}
}
}
}
cout<<cou<<endl;
}
return 0;
} | 0 | 23,079,737 |
#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>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n;cin >> n;
vector<vector<int>> v(n-1, vector<int>(3, 0));
for(int i = 0; i < n-1; i++) {
int c,s,f;cin >> c >> s >> f;
v[i][0]=c;
v[i][1]=s;
v... | 0 | 35,389,669 |
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
long long nCr(long long n, long long r) {
if (n < r) return 0;
long long ret = 1;
for (int i = n-r+1... | 0 | 29,813,026 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
ll mpow(ll a,ll b){
ll res=1;
a%=mod;
while(b){
if(b%2) res=res*a%mod;
a=a*a%mod;
b/=2;
}
return res;
}
ll gcd(ll a,ll b){
if(b==0) retur... | #include <iostream>
#include <cstdlib>
using namespace std;
int main()
{
string a;
int ans = 0;
cin >> a;
if (a.at(0) == 'S') {
ans = 0;
if (a.at(1) == 'R') {
ans = 1;
if (a.at(2) == 'R') ans = 2;
} else {
if (a.at(2) == 'R') ans = 1;
... | 0 | 56,925,382 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string string;
int sum,i,j=0;
int sum_list[1000] = {0};
while(1){
cin >> string;
if(string == "0"){
break;
}
sum = 0;
for(i = 0; i < string.size() ;i++){
sum += string[i] - '0';
}
sum_list[j++] = sum;
... | #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... | 0 | 37,663,358 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 1e6 + 7... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define prior priority_queue
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define PI 3.1415926535897932384626433832795
#define ll long long
#define ld long double
#define ret return
... | 0 | 45,512,607 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
int main(){
int n;
cin>>n;
ll ans=0;
for(ll i=1;i<=n;++i){
ans+=i*(n+1-i);
}
rep(i,n-1)... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 69,653,527 |
#include <vector>
#include <algorithm>
#include <iostream>
template <typename T>
int selection_sort(std::vector<T>& xs)
{
int changed {0};
for (int i{0}; i < xs.size(); ++i)
{
int mini{i};
for (int j{i}; j < xs.size(); ++j)
{
if (xs[mini] > xs[j])
{
mini = j;
}
}
if (... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> A){
map<long long, long long> mp;
for(int i = 0; i < N; ++i) mp[A[i]] += 1;
long long res = 0;
for(auto itr : mp) res += itr.second * (itr.second - 1) / 2;
for(int i = 0; i < N; ++i){
long long n = m... | 0 | 18,990,568 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int n,k;
cin>>n>>k;
if(k==1)cout<<0<<endl;
else cout<<n-k<<endl;
} | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
using namespace std;
struct Node {
char c;
int v;
};
void bubbleSort(Node a[], int N) {
bool flag = true;
f... | 0 | 61,673,829 |
#include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string> ... | 0 | 13,659,832 |
#include <stdio.h>
#include <iostream>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string.h>
#include <limits.h>
#include <map>
#include <string>
#include <bitset>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
double sol = 0;
double c;
double x,y;
int n;
cin>>n;
vector<pair<int,int>>data;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
data.push_back(make_pair(a,b));
}
for(int r = 0; r < 100; r++) {
random_shuffle(data.begin(), dat... | 0 | 5,179,327 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll a,b;
cin>>a>>b;
for(int i=1;i<=1e4; ++i){
int tax1 = i*8/100; int tax2 = i*10/100;
if(tax1==a && tax2==b){
cout<<i;
return 0;
}
}
cout<<-1;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
#define endl '\n'
#define fi first
#define se second
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define pb push_back
#define mk make_pair
const ll siz = 1e5 + 7;
vector < pi> adj[siz];
ll n, k, q;
vector<ll>dis(siz, 1e15);
ve... | 0 | 74,632,239 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.