code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include ... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int n, a, b, c, d, hasil;
int main(){
while(cin >> n){
hasil = 0;
for(int j = 0; j <= 9; j++){
for(int k = 0; k <= 9; k++){
for(int l = 0; l <= 9; l++){
for(int m = 0; m <= 9; m++){
if(j + k + l + m == n){
hasil++;
}
... | 1 | 51,565,699 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<functional>
#include<iomanip>
#include<queue>
#include<cassert>
#include<tuple>
#include<set>
#include<map>
#include<list>
#include<bitset>
#include<utility>
#include<numeric>
#define pb ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 1 | 84,861,994 |
#include <bits/stdc++.h>
#define ENDL '\n'
#define io ios_base::sync_with_stdio(false);cin.tie(0);
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
typedef long long ll;
using namespace std;
int main(){
io
ll n,ans(0);
cin >> n;
for(int i(1); i<=n; i++){
string s = to_string(i);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | 1 | 19,001,055 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
char X, Y;
cin >> X >> Y;
if(X>Y){
cout << ">" << endl;
}else if(X<Y){
cout << "<" << endl;
}else{
cout << "=" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | 1 | 20,561,111 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, h, w;
cin >> n >> h >> w;
vector<int>a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i) >> b.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) >= h && b.at(i) >= w) ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n; cin >> n;
int h, w; cin >> h >> w;
vector<int> a(n), b(n);
REP(i, n) cin >> a[i] >> b[i];
int cnt = 0;
REP(i, n)
if (a[i] >= h && b[i]... | 1 | 80,375,906 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include<limits.h>
#include<iomanip>
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, m, n) for(int i = m; i < n; i++)
#define ALL(v) v.begin(),v.end()
#define RALL(v) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X,Y;
cin >> X >> Y;
int ans=1;
if(X%Y==0) cout << -1 << endl;
else{
while(true){
ans*=X;
if(ans%Y!=0){
cout << ans << endl;
break;
}
}
}
} | 1 | 52,176,742 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N,K;
ll A[20];
int main(){
cin >> N >> K;
for(int i=0;i<N;i++) cin >> A[i];
ll min_cost = 1e12;
for(int i=0;i<(1<<N);i++){
ll cost = 0;
bitset<15> bt(i);
if(bt.count() != K) continue;
ll h = 0;
... | #include <bits/stdc++.h>
#include <numeric>
#define ll long long
#define int ll
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto it... | 1 | 60,885,390 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int x1, x2, x3, x4, y1, y2, y3, y4;
cin >> x1 >> y1 >> x2 >> y2;
int a = x2-x1;
int b = y2-y1;
x3 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X1,X2,Y1,Y2;
cin >> X1 >> Y1 >> X2 >> Y2;
int A = X2-X1;
int B = Y2-Y1;
int X3 = X2-B;
int Y3 = Y2+A;
int X4 = X3-A;
int Y4 = Y3-B;
cout << X3 << " " << Y3 << " " << X4 << " " << Y4 << endl;
} | 1 | 48,473,712 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, n;
cin >> n;
for (int i=0;i<n;i++) {
bool ok = false;
cin >> a >> b >> c;
if (a < c && b < c) {
ok = (a*a+b*b == c*c);
} else if (a < b && c < b) {
ok = (a*a+c*c == b*b);
} else {
ok = (b*b+c*c == a*a);
}
c... | #include<iostream>
using namespace std;
int main() {
int N,a,b,c;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a >> b >> c;
if (a*a + b*b == c*c || a*a + c*c == b*b || b*b + c*c == a*a) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
} | 1 | 62,681,495 |
#include <bits/stdc++.h>
using namespace std;
map<int,vector<int>> P;
set<string> RT;
vector<bool> ans;
int count1=0;
void prog(int a,vector<bool>T){
T.at(a-1)=true;
if(T==ans){
count1++;
return;
}
for(int i:P.at(a)){
if(T.at(i-1))continue;
prog(i,T);
}
}
int main (){
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m... | 1 | 73,447,344 |
#include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 1e8
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main(){
int n;
while(cin >> n, n){
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
int ans = INF;
for(int i = 0; i < n; i++){
for(int j ... | #include <bits/stdc++.h>
std::vector<int> a(1000);
int main() {
int i, n;
while(std::cin >> n, n != 0) {
for(i=0; i<n; ++i) {
std::cin >> a[i];
}
std::sort(a.begin(), a.begin()+n);
int min = INT_MAX;
for(i=0; i<n-1; ++i) {
min = std::min(min, a[i+1... | 1 | 69,467,173 |
#include <iostream>
#include <string>
#include <typeinfo>
struct Card {
char suit;
int value;
};
void traceALDS12C(Card arr[], int max) {
for (int i = 0; i < max; ++i) {
if (i)
std::cout << " ";
std::cout << arr[i].suit << arr[i].value;
}
std::cout << std::endl;
}
void BubbleSort(Card arr[], int N) {
for (... | #include <iostream>
#include <climits>
#include <stdio.h>
using namespace std;
struct Card
{
char suit;
char value;
};
void bubbleSort(Card C[], int N)
{
for (int i = 0; i <= N - 1; i++)
{
for (int j = N - 1; j >= i + 1; j--)
{
if (C[j].value < C[j - 1].value)
{
std::swap(C[j], C[j -... | 1 | 16,166,595 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
cout << K * ll(pow(K - 1LL, N - 1LL)) << endl;
} | #include "bits/stdc++.h"
using namespace std;
void Main() {
int N, K;
cin >> N >> K;
int ans = K;
for (int i = 1; i < N; ++i) {
ans *= K - 1;
}
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | 1 | 40,366,343 |
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1 << 28;
const int MAX_N = 50010;
const int MAX_M = 21;
int c[MAX_M];
int dp[MAX_N];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
fill(dp, dp + MAX_N, INF);
int n, m;
cin >> n >> m;
dp[n] = 0;
for(int i = 0; i < m; ++i){
cin ... | #include <iostream>
#include <set>
#include <unordered_map>
std::set<int> coins;
std::unordered_map<int, int> memo;
int get_minimum_count(int n) {
if (coins.find(n) != coins.end()) {
return 1;
} else if (memo.find(n) != memo.end()) {
return memo[n];
} else {
int min_count = n;
... | 1 | 6,279,112 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(lo... | #include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
using namespace std;
int main()
{
int arr[5];
for(int i=0;i<5;i++) cin>>arr... | 1 | 10,192,304 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll... | #define rep(i, a, b) for(int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template<class T> inline void chmax(T &a, const T &b) {if(a < b) a = b;}
template<class T> inline void chmin(T &a, const T &b) {if(a > b) a = b;}
const long long INF = 1LL<<60;
const long long MOD ... | 1 | 49,842,828 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | #include <bits/stdc++.h>
#define ll long long int
#define mod_ceil(a, b) (a % b) ? a / b + 1 : a / b
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll h, w, d, tmp, n;
cin >> h >> w >> d;
n = h * w;
vector<pair<ll, ll>> cost(n + 10);
for (in... | 1 | 84,973,822 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for(int (i)=(n); (i)<(m); ++i)
int main(){
int M;
cin >> M;
ll n = 0, s= 0;
REP(i, M){
ll d, c;
cin >> d >> c;
n+=... | #include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vect... | 1 | 4,876,845 |
#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++)
int main() {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector<int> vecA(N);
vector<int> vecB(M);
rep(i, N) {
cin >> vecA.at(i);... | #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() {
cin.tie(0);
ios::sync_with_stdio(false);
int n,m,x,y;
cin>>n>>m>>x>>y;
vector<int>xn(n);
rep(i,n){
cin>>xn[i];
}
vector<int>ym(m);
... | 1 | 54,360,003 |
#include <stdio.h>
#include <math.h>
#include <iostream>
using namespace std;
int main(void)
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%f\n",sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2)));
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
int main()
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double dis;
dis = sqrt( (x2-x1)*(x2-x1) + (y2-y1)*(y2-y1));
printf("%f10\n",dis);
} | 1 | 13,367,159 |
#include <bits/stdc++.h>
using namespace std;
#define M 1046527
#define NIL (-1)
#define L 14
char H[M][L];
int getChar(char ch) {
if (ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch == 'G') return 3;
else if (ch == 'T') return 4;
else return 0;
}
long long getKey(char str[]) {
long long sum ... | #include <iostream>
#include <algorithm>
#include <cstdio>
#define _USE_MATH_DEFINES
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#include <cmath>
#include <map>
#include <utility>
#include <numeric>
#include <set>
#include <... | 1 | 52,449,059 |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A % 3 == 0) {
cout << "Possible" << endl;
return 0;
} else if (B % 3 == 0) {
cout << "Possible" << endl;
return 0... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll max(ll a,ll b){
return a>b? a:b;
}
ll T;
ll a,b,c;
int main(){
cin>>a>>b;
if(a%3==0||b%3==0||(a+b)%3==0){
cout<<"Possible\n";
}
else cout<<"Impossible\n";
return 0;
} | 1 | 73,766,594 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
ll A,B,K;
cin>>A>>B>>K;
if(K>A){
K-=A;
A=0;
}
else{
A-=K;
K=0;
}
if(K>B){
B=0;
}
else{
B-=K;
}
cout<... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for(int i = 0; i < n; i++)
#define endl "\n"
typedef long long ll;
const int BIG_NUM = 1e9;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll a, b, k;
cin >> a >> b >> k;
if(k <= a) {
... | 1 | 72,132,697 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
using namespace std;
#define repr(i, a, b) for (i... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template<typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template<typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using Pll = ... | 1 | 4,590,009 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 1 | 64,487,982 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <set>
typedef long long ll;
using namespace std;
int arr[1007];
int main() {
int n, k; cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
sort(arr, arr + n);
int res = 0;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> f(N);
for(int i=0;i<N;i++) cin >> f.at(i);
sort(f.begin(),f.end());
int res=0;
for(int i=0;i<K;i++) {
res += f.at(i);
}
cout << res << endl;
} | 1 | 31,422,962 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
while(cin>>n,n)
{
int data[n],dp[n+1];
int tmp=0,ans;
for (int i = 0; i < n; ++i)
{
cin>>data[i];
}
dp[0]=data[0];
for (int i = 1; i < n; ++i)
{
dp[i]=max(dp[i-1]+data[i],data[i]);
}
sort(dp,dp+n);
cout<<dp[... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if ( n == 0 ) break;
int a[5000];
for ( int i = 0; i < n; i++ ) {
cin >> a[i];
}
int ans = a[0];
int pn;
for ( int i = 0; i < n; i++ ) {
pn = 0;
for ( int j = 0; i + j < n; j++ ) {
pn += a[i + j];
if (... | 1 | 90,362,546 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
#define ll long long
const ll mod=1e9+7;
int main(){
int n;cin>>n;
vector<ll> a(n);
for(int i=0;i<n;i++) cin>>a[i];
vector<ll> d0(60,0),d1(60,0);
for(int i=0;i<n;i++){
for(int j=0;j<60;j++){
if(a[i]&1) d1[j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
rep(i, 60)
{
ll p = 0, q, tmp;
rep(j, n)
... | 1 | 91,688,375 |
#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<ll, ll> 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; } retu... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
long long MOD = 1000000000 + 7;
bool compare(pii x, pii y){
return x.first < x.second;
}
int main(){
cout << setprecision(10);
ll N,D,A;
cin >> N >> D >> A;
vector<pii> v;
for(int i = 0; i < N; i++){
ll tmp1,tmp2... | 1 | 46,370,271 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a,b,c,h,w,i,j,k,l,m,n,x,y;
ll ans = 0;
cin >> h >> w;
vector<string> s(h);
vector<vector<ll>> lh(h+1 , vector<ll>(w+1)),lw(h+1, vector<ll>(w+1));
for(i=0;i<h;i++) cin >> ... | #include <bits/stdc++.h>
#include<algorithm>
using namespace std;
#define ll long long
int l[100005] = {};
vector<int> pc(1000000,-1);
vector<int> f(1000000,-1);
int lc[2001][2001];
int co[2001][2001][2];
int main() {
int h,w;
string s;
cin >> h >> w;
for(int i= 0;i<h;i++){
cin >> s;
for(int j =0;j<w... | 1 | 39,078,918 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
int n,k;
cin>>n>>k;
vector<int> arr(n),dp(n);
for(int i=0;i<n;i++)
cin>>arr[i];
dp[0]=0;
for(int i=1;i<n;i++){
dp[i]=INT_MAX;
for(int j=max(0,i-k);j<i;j++)
dp[i]=min(dp[i],dp[j]+a... | #include <bits/stdc++.h>
using namespace std;
int getCount(vector<int> &arr, int index, int K, vector<int>& mem){
if(mem[index] != -1) return mem[index];
int ans = INT_MAX;
for(int i = 1; i <= K && index+i < arr.size(); i++){
ans = min(ans, abs(arr[index] - arr[index+i])+getCount(arr, index+i, K, me... | 1 | 37,553,367 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
cout << n * (n - 1) / 2 << '\n';
} | #include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.... | 1 | 89,990,818 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
struct Node
{
int to, next;
}edge[maxN * 2 + 1];
int n;
int head[maxN + 1], tot;
int sg[maxN + 1];
inline int read()
{
int num = 0, f = 1;
char ch = getchar();
while( !isdigit( ch ) ) { if(ch == '-') f = -1; ch = getchar(); }
while( isdigit( ... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
us... | 1 | 89,638,444 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define sz(a) a.size()
#define md(a, b) ((a) % b + b) % b
#define mod(a) md(a, MOD)
#define srt(a) sort(all(a))
#define me... | #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 a, b, c, k;
cin >> a >> b >> c >> k;
while (b <= a && k--) b *= 2;
while (c <= b && k--) c *= 2;
if (k >= 0 && (c > b && b > a)) cout << "Yes... | 1 | 93,400,977 |
#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;
int a[n+2] = {};
rep(i,n) cin >> a[i+1];
int cost_change[n+1];
for (int i = 1; i < n+1; i++) {
int pre = abs(a[i] - ... | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;++i)
#include<string>
#include<vector>
using namespace std;
typedef long long 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 ... | 1 | 5,349,258 |
#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--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rep1(i,n) for(int i=1;i<=(int)(n);++i)
#define rep11(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define repm(i,n) for(int i=(i... | 1 | 87,551,003 |
#include <stdio.h>
#include <vector>
class DisjointSet
{
public:
std::vector<int> rank, p;
DisjointSet()
{}
DisjointSet(int size)
{
rank.resize(size, 0);
p.resize(size, 0);
for (int i = 0; i < size; i++) {
makeSet(i);
}
}
void makeSet(int x)
{
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF 1<<30
#define LINF 1LL<<60
struct UnionFind {
vector<int> par;
int n, cnt;
UnionFind(const int& x = 0) { init(x); }
void init(const int& x) { par.assign(cnt = n = x, -1); }
inline int find(const int& x) { return par[x] < 0 ? x : par[x]... | 1 | 867,988 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
int main() {
ll n, z, w; cin >> n >> z >> w;
vector<ll>a(n); for (auto&& x : a)cin >> x;
ll ans = 0;
if (n == 1) {
ans = abs(a[0] - w);
}
else {
ans = max(abs(a[n - 1] - w), abs(a[n - 2] - a[n - 1]));
}
cout <... | #include <iostream>
#include <vector>
#include <algorithm>
#include <assert.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(int argc, char** argv) {
long long N, Z, W;
cin >> N >> Z >> W;
vector<long long> a(N);
REP(i, N) cin >> a[i];
if (N == 1) {
cout << abs(W - a[0]) << endl;
}... | 1 | 37,558,811 |
#include <iostream>
using namespace std;
const int MAX_N = 1e5 + 5;
char colors [4] = {'R', 'G', 'B', 'Y'};
int main () {
ios::sync_with_stdio(false);
int n, m, d;
cin >> n >> m >> d;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int dd = ((MAX_N + i + j) / d) % 2;
int ud = ((MAX_N... | #include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time... | 1 | 44,033,152 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
ty... | 1 | 70,814,191 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
double a, b, c, degc, radc;
double s, r, l, h;
double pi = 4 * atan( 1.0 );
cin >> a >> b >> degc;
radc = degc * pi / 180.0;
s = b * a * sin( radc ) / 2.0;
c = sqrt( a*a + b*b - 2*a*b*cos( radc ) );
r = c / ( 2.0 * sin( radc ) );
l = 2.0 * ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
long double a, b,c;
cin >> a >> b >> c;
c = c / 180.0 * 3.141592653589793;
double h,S,L;
cout <<fixed<< a*b*sin(c)*0.5 << endl << a + b + abs(sqrt((a - b*cos(c))*(a - b*cos(c)) + (b*sin(c))*b*... | 1 | 28,672,779 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, D, X, ans;
cin >> N >> D >> X;
vector<int> A(N+1);
for(int i = 1; i <= N; ++i) cin >> A[i];
ans = X;
for(int i = 1; i <= N; ++i){
ans += (D-1) / A[i] + 1;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
int main()
{
int people, day, choco;
cin >> people >> day >> choco;
vector<int> a(people);
... | 1 | 39,785,735 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long R, G, B, N;
long long count = 0;
cin >> R >> G >> B >> N;
for(long long i = 0; i <= N; i++){
for(long long j = 0; j <= N-i; j++){
if((N >= ((R*i)+(G*j))) && ((N - ((R*i)+(G*j))) % B == 0)) count++;
}
}
cout <... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i <= (n) ; i ++ )
#define all(x) (x).begin(),(x).end()
using ll = long long;
using namespace std;
int main() {
ll r,g,b,n;
cin>>r>>g>>b>>n;
int ans=0;
rep(i,n/r){
rep(j,n/g){
if((n-i*r-j*g)>=0&&(n-i*r-j*g)%b==0){
... | 1 | 73,572,890 |
#include <bits/stdc++.h>
#define REP(i, n) for (int (i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for(int (i) = a; (i) < (int)b; i++)
#define RREP(i, n) for(int (i)=((int)(n)-1); (i)>=0; i--)
#define RFOR(i, a, b) for(int (i) =((int)(b)-1); (i)>=(int)a; i--)
#define ALL(v) (v).begin(),(v).end()
#define MOD 100000... | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 1e5 + 10;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main(){
ios::sync_with_stdio(0); cin.t... | 1 | 88,571,365 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,s=0;
string str;
cin>>str;
for(int i=0;i<str.size();i++){
int j=str[i]-48;
s+=j;
}
if(s%9==0)
cout<<"Yes";
else cout<<"No";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
in... | 1 | 44,167,880 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define sc1(a) scanf("%d",&a)
#define sc2(a,b) scanf("%d %d",&a,&b)
int main(){
int n,m,ans=0;
sc2(n,m);
int k[15][15];
int p[15]={0};
rep(i,15) rep(j,15) k[i][j]=0;
rep(i,m) {
sc1(k[i][0]);
rep... | #include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, m, k, t;
cin >> n >> m;
vector<int> p(n), on(n, 0);
vector<vector<int>> s(m, vector<int>(n, 0));
for (int i = 0; i < m; i++) {
scanf("%d", &k);
... | 1 | 17,916,327 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int N; cin >> N;
int ans =0;
rep(i,N) ans += i+1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int sum=0;
for(int i=1;i<=n;i++){
sum+=i;
}
printf("%d\n",sum);
} | 1 | 22,957,269 |
#include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
int main(){
double x1,y1,x2,y2,answer;
cin >> x1 >> y1 >> x2 >>y2;
answer = sqrt(pow((x1 - x2),2) + pow((y1 - y2),2));
cout << fixed << setprecision(8) << answer << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
int main(){
long double x1,x2,y1,y2,d;
cin >> x1 >> y1 >> x2 >> y2;
d = powl(pow... | 1 | 87,315,384 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int k; cin >> k;
queue<ll> que;
for(int i=1; i<10; i++) que.push(i);
for(int i=0; i<k-1; i++) {
ll n = que.front();
que.pop();
for(int j=-1; j<2; j++) {
ll m = (n % 10) + j;
i... | #include<bits/stdc++.h>
using namespace std;
queue<long long> yui;
int main()
{
int k;
cin>>k;
for(int i=1;i<10;i++) yui.push(i);
while(--k)
{
long long x=yui.front();
int y=x%10;
yui.pop();
for(int i=max(0,y-1);i<=min(9,y+1);i++)
yui.push(x*10+i);
}
c... | 1 | 61,828,376 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
long long q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
n *= 100;
long long ans = 0;
long long t = n / 200;
n -= t * 200;
ans += min(min(t * d, 2 * t * s), min(4 * t * h, 8 * t * q));
t = n / 100;
n -= t * 100;
ans += min(t * s, min(2 *... | 1 | 33,163,083 |
#include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vec... | #include<bits/stdc++.h>
#define ll long long
#define endl "\n"
#define pb push_back
#define READ(FILE) freopen(FILE,"r",stdin)
#define WRITE(FILE) freopen(FILE,"w",stdout)
#define loop(i,s,e) for(int i=s;i<e;i++)
#define mego fast();
using namespace std;
void fast()
{
ios::sync_with_stdio(0);
cin.tie(0);
co... | 1 | 66,923,534 |
#include<bits/stdc++.h>
#define de(x) cout<<#x<<"="<<x<<endl
#define dd(x) cout<<#x<<"="<<x<<" "
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define repd(i,a,b) for(int i=a;i>=(b);--i)
#define repp(i,a,b,t) for(int i=a;i<(b);i+=t)
#define mt(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp(u,v) ma... | #include <bits/stdc++.h>
#define ll long long
#define read(x) scanf("%d",&x)
using namespace std;
const int maxn = 1e5 + 10;
int n;
ll a[maxn];
int zero[64], tot;
ll p[64];
void insert(ll x){
for(int i=0;i<tot;i++){
if((x>>zero[i])&1){
if(!p[i]){
p[i] = x;
break;
}else{
x^=p[i];
}
}
}
}
int... | 1 | 44,236,633 |
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
string s;
string t;
cin>>s>>t;
if(s>t){cout<<">";}
else if(s<t){cout<<"<";}
else{cout<<"=";}
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 1 | 95,439,498 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 55;
int n, m;
pair<int, int> person[N], check[N];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> person[i].first >> person[i].second;
for(int i = 1; i <= m; i++)
cin >> check[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | 1 | 43,884,613 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S; cin >> S;
reverse(S.begin(),S.end());
while (1) {
int N = S.size();
if (N >= 5) {
string S5 = S.substr(0,5);
if (S5 == "maerd" || S5 == "esare") {
S.erase(0,5);
} else if (N >= 6) {
string S6 = S.substr(0,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
bool judge(int idx, string ... | 1 | 36,894,995 |
#include <bits/stdc++.h>
using namespace std;
inline void FAST_IO(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);}
template<class F, class S> ostream& operator<<(ostream& os, pair<F, S> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template<class T, class S> ostream& operator<<(ostream& os, ... | #include<bits/stdc++.h>
using namespace std;
int f[200010],sz[200010];
int zzs(int u)
{
return f[u]==u?u:f[u]=zzs(f[u]);
}
void sq(int u,int v)
{
int a,b;
a=zzs(u);
b=zzs(v);
if(a!=b)
f[b]=a;
}
int main()
{
int n,m,u,v,sn=0;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
f[i]=i;
}
for(int i=1;i<=m;i++)
{
... | 1 | 99,398,981 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
string ans = "Yes";
int h, w;
cin >> h >> w;
vector<string> S(h);
for (int i = 0; i < h; ++i)
{
cin >> S[i];
}
int dx[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 1 | 48,824,340 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main() {
int N,m;
cin >> N;
vector<int> vec(N);
rep(i, N) {
cin >> m;
vec.at(m - 1) = i + 1;
}
rep(i, N) {
cout << vec.at(i) << " ";
}
} | 1 | 36,848,220 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;cin >> n;
vector<int> a(n);
for(auto &i:a) cin >> i;
for(int i=0;i<n;i++){
int p = (i-1)/2;
int l = 2*i+1;
int r = 2*i+2;
cout << "node " << i+1 << ": key = " << a[i] << ", ";
... | #include<iostream>
using namespace std;
struct Node {
int key;
int parent = -1;
int left = -1;
int right = -1;
};
Node T[251];
void prop(int num) {
int div = num / 2;
int tmp = num % 2;
T[num].parent = div;
if (tmp == 0) {
T[div].left = num;
}
else {
T[div].right = num;
}
}
int main() {
int n;
cin >> n... | 1 | 87,659,687 |
#include <iostream>
#include <algorithm>
using namespace std;
int res[300000];
int main(){
long long n, a, b;
cin >> n >> a >> b;
if(a+b > n+1 || a*b < n){
cout << -1 << endl;
return 0;
}
int r = n;
int past = 0;
int i=0;
while(r > 0){
int len;
len = min(a, r - b + past + 1);
for(int m=r-len+1; m<=r; ... | #include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false); cin.tie(... | 1 | 76,910,134 |
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... | #include <bits/stdc++.h>
using namespace std;
void init () {
srand (time(0));
int XOR[20] = {0};
for (int n = 1; n <= 3; ++n) {
for (int k = 1; k < (1<<n); ++k) {
vector <int> a(1<<(n+1));
for (int i = 0; i < (1<<n); ++i) a[i] = i, a[i+(1<<n)] = i;
sort (a.begin(),a.end());
cout << "n = " << n << ", k ... | 1 | 83,133,060 |
#include <iostream>
#include <algorithm>
using namespace std;
long long N, A[1 << 18], B[1 << 18], sum = 0, minx = (1LL << 60);
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i] >> B[i]; sum += A[i];
if (A[i] > B[i]) minx = min(minx, B[i]);
}
if (minx == (1LL << 60)) cout << "0" << endl;
else c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll ans,minb=2e9;
bool ok;
int main(){
scanf("%d",&n);
while(n--){
ll a,b;
scanf("%lld%lld",&a,&b);
ans+=b;
if(a!=b)ok=1;
if(b<a)minb=min(minb,b);
}
if(ok)printf("%lld",ans-minb);
else puts("0");
return 0;
} | 1 | 33,081,093 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <unordered_map>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, int> S;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
++S[s];
}
... | 1 | 6,176,108 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
int n, k, ans;
int main() {
cin >> n ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
if (k & 1) {
ll t = n / k;
t = pow(t, 3);
ans = t;
} else {
ll t = n / k;
ll t2 = n / (k / 2);
t2 = (t2 + 1) ... | 1 | 16,379,092 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <numeric>
typedef long long ll;
#define PI 3.14159265359
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mp make_pair
#define all(v) v.begin()... | 1 | 21,952,600 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
ll N, M;
cin >> N >> M;
ll ans = min(N,M/2);
N-=ans;
M-=ans*2;
cout << ans + M/4... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, m;cin>>n>>m;
ll ans=min(n, m/2);
m = max(0LL, m - n*2);
ans += m / 4;
cout << ans;
} | 1 | 62,177,893 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int siz = s.size(),c=0;
bool flag = true;
for(int i=0; i<siz; i++)
{
if(i == 0)
{
if(s[i]!='A')
{
flag=false;
}
}
if(i>0&&i<siz&&s[i]!=... | #include<bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(i=0;i<n;i++)
#define rep1(i,n) for(i=1;i<n;i++)
#define test(a) cout << "*" << a << endl;
int main(){
string s;
bool existAC = false;
int i;
int existC=false;
int placeC;
cin >> s;
if(s[0]=='A'){
for(i=2;i<s.size()-1;i++){
if(s[i... | 1 | 35,596,539 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unorder... | #include<cstdio>
#include<cstring>
int f[2][16005];
int x[8005],y[8005];
char s[8005];
void getReach(int n,int a[],int start){
int offset = 8000;
for(int i = -8000; i <= 8000; i++) f[0][i+offset] = 0;
f[0][start+offset] = 1;
for(int i = 1; i <= n; i++){
int v = i%2; int u = !v;
int step ... | 1 | 7,295,288 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int a,b,c;
cin>>... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <math.h>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ull unsigned long long
#define ... | 1 | 94,448,154 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | 1 | 20,317,441 |
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int n;
cin >> n;
vector <int> str;
str.resize(n);
for(int i =0; i < n ; i++){
cin >> str[i] ;
}
int cnter =0;
for( int i=0 ; i <= ( n-1 ) ; i++ ){
int minj = i;
int p = 0;
for(int j = i ; j<= ( n-1 ); j++ ){
if( str[j] < ... | #include<stdio.h>
int main(){
int n, array[100], i, j, tmp, min, count=0;
scanf("%d", &n);
for(i=0;i<=n-1;i++)scanf("%d",&array[i]);
for(i=0;i<=n-1;i++){
min = i;
for(j=i;j<=n-1;j++)if(array[j]<array[min])min=j;
if(min!=i){
tmp = array[i];
array[i] = array[min];
array[min] = tmp;
... | 1 | 22,891,615 |
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,ans=INT_MAX;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++)
cin>>v[i];
for(int i=-100;i<=100;i++)
{
int cost=0;
for(auto j:v)
cost+=pow(i-j,2);
ans=min(ans,cost);
}
cout<<ans;
... | 1 | 54,724,616 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
getline(cin, s);
int n = s.size();
for (int i = 0; i < n; i++){
if ((s[i] >= 'A' && s[i] <= 'Z') || (s[i] >= 'a'&&s[i] <= 'z'))
cout << (char)(s[i] ^ 32);
else
cout << s[i];
}
cout <<endl;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<cctype>
#include<cstdio>
using namespace std;
int main(){
char ch;
while(1){
scanf("%c", &ch);
if ( ch == '\n' ) break;
if(isalpha(ch)){
if(islower(ch)){
printf("%c", toupper(ch));
}
else if... | 1 | 91,541,530 |
#include <iostream>
#include <list>
#include <string>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,x;
string str;
list <int> lst;
list<int>::iterator it;
cin >> n;
while (n--){
cin >> str;
if (str == "insert"){
cin >> x;
lst.push_front(x);
}else if (str == "deleteFi... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
struct Node
{
int value;
Node* prev,* next;
};
Node* head;
void Init()
{
head=(Node*)malloc(sizeof(Node));
head->next=head;
head->prev=head;
}
Node* FindNode(int x)
{
Node*temp=head->next;
while(temp!=head&&temp->value!=x)
temp=temp->next... | 1 | 58,608,190 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
while (scanf("%d %d", &n, &m), n){
typedef pair<int, int> P;
vector<P> v;
int res = 0;
for (int i = 0; i < n; i++){
int a, b;
scanf("%d %d", &a, &b);
v.push_back(P(b, a));
res += a * b;
}
sort(v.begin(), v.end());
reverse(v... | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
typedef pair< int , int > P;
int main(){
int N, M;
while(cin >> N >> M , N){
int d[11] = {};
for(int i = 0 ; i < N ; i++ ){
int a, b;
cin >> a >> b;
d[b] += a;
}
for(int i = 10 ; i && M ; i--... | 1 | 7,329,588 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k; cin >> n >> k;
unordered_set<int> st;
for (int i=1; i<=n; i++) {
st.insert(i);
};
for (int i=0; i<k; i++) {
int d; cin >> d;
for (int j=0; j<d; j++) {
int t;
cin >> t;
if (st.find(t) != st.end()) {
st.erase(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<int> d(k);
vector<int> t(n, 0);
for(int i=0; i<k; ++i){
cin >> d[i]; d[i]--;
for(int j=0; j<=d[i]; ++j){
int a;
cin >> a; a--; t[a]++;
}
}
int res = 0;
... | 1 | 44,942,362 |
#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 (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 1 | 56,652,763 |
#include <bits/stdc++.h>
#define rep(i, a) for(int i = 0; i < a; i++)
#define all(v) v.begin(), v.end()
#define dcout cout << fixed << setprecision(15)
#define arep(i, a) for(auto i : a)
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
#define MOD 1000000007
#define INF 10000000000
#de... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1.0);
int main() {
int a, b;
cin >> a >> b;
if (a == 1 && b == 1) {
cout << "Draw" << endl;
} else if (a == 1) {
cout << "Alice" << endl;
} else if (b == 1) {
cout << "Bob" << endl;
} else {
if (a == b)
... | 1 | 35,527,716 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n, ans = 0;
cin >> n;
string s[n];
ll ra = 0, lb = 0, ba = 0;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 2) if (s[i][j] == 'A' && s[i][j + 1] == '... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define rep(i,x) for(int i = 0;i<x;i++)
#define RE... | 1 | 96,409,188 |
#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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include <iostream>
#include <cmath>
#include <bits/stdc++.h>
#include <algorithm>
#include <complex>
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(7)<<(x)
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
typedef pair<int , int > ... | 1 | 78,973,171 |
#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>;
bool isOn(int bit,int i){
return bit & 1<<(i-1);
}
int main(){
int n, m; cin >> n >> m;
vector<vector<int>> lights;
vector<int> conditions;
rep(i, m){
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | 1 | 44,759,099 |
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long LL;
typedef double db;
int get(){
char ch;
while(ch=getchar(),(c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int ... | 1 | 66,012,243 |
#include "bits/stdc++.h"
using namespace std;
const string number={'2','3','4','5','6','7','8','9'};
const string moji={'i','x','c','m'};
void hantei(string MCXI,int *digit){
for(int i=MCXI.size();i>1;--i){
if(MCXI[i-1]==moji[0]){
digit[0]=1;
for(int j=0;j<number.size();++j){
if(MCXI[i-2]==num... | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using pii = pair... | 1 | 96,062,863 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
int total = 0;
for( int i = 0; i < N; ++i ){
int l = 0, r = 0;
cin >> l >> r;
r -= l;
total += r + 1;
}
cout << total;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=1e9+7;
int main() {
int n;
cin>>n;
int ans=0;
rep(i,n){
int l,r;
cin>>l>>r;
ans+=r-l+1;
}
cout<<ans<<endl;
} | 1 | 20,313,855 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#define INF 100000000000000
using namespace std;
typedef long long llong;
int main(){
double x1, x2;
double y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%08f\... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double a_square = (x2 - x1) * (x2 - x1);
double b_square = (y2 - y1) * (y2 - y1);
double c_square = a_square + b_square;
double ans = sqrt(c_square);
printf("%.5f\n", ans);
... | 1 | 92,836,480 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector <int> C(N), S(N), F(N);
for (int i = 1; i < N; i++) {
cin >> C[i] >> S[i] >> F[i];
}
for (int stpos = 1; stpos < N; stpos++) {
int now = 0;
for (int i = stpos; i < N; i++) {
if (now < S[i]) ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | 1 | 50,208,876 |
#include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main(void){
int n, k, ans=0;
cin >> n >> k;
vector<int> p(n);
rep(i,n) cin >> p[i];
sort(p.begin(),p.end());
rep(i,k) ans += p[i];
cout << ans << endl;
return 0;
} | 1 | 1,027,541 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll a, b; cin >> a >> b;
bool flag = 1;
rep(i, a) {
char c; cin >> c;
ll tmp = c - '0';
if (!(0<=tmp && tmp<=9)) flag = 0;... | #include <stdio.h>
int main(){
int a,b;
char str[15];
scanf("%d %d %s" , &a, &b, &str);
for(int i = 0 ; i < a ; i++){
if(str[i] != '-'){
continue;
}
else{
printf("No");
return 0;
}
}
for(int i = a+1 ; i <= a+b ; i++){
if(str[i] != '-'){
continue;
}
else{
printf("No");
return 0;
... | 1 | 1,062,767 |
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
int N, M; pair<int, int> T[100100];
int main()
{
scanf ("%d %d", &N, &M);
for (int i = 0; i < N; i++) scanf ("%d %d", &T[i].first, &T[i].second);
sort(T, T + N);
priority_queue<int> Q;
long long ans = 0;
for (int i = 1, j = 0; i <= M; i+... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
priority_queue<int> q;
vector<vector<int>> v(k);
rep(i,n){
int x,y;
cin >> x >> y;
int z=k-x;
if(z>=0) v[z].push_back(y);
}
ll ans=0... | 1 | 85,962,671 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const string YES = "Yes";
const string NO = "No";
int main()
{
ll A;
scanf("%lld",&A);
ll B;
scanf("%lld",&B);
ll C;
scanf("%lld",&C);
if (A==B&&B==C) cout << YES << endl;
else cout << NO << endl;
return 0;
} | #include <stdio.h>
#include <algorithm>
using namespace std;
int main () {
int a , b , c;
scanf ( "%d%d%d" , &a , &b , &c );
if ( a == b && b == c ) printf ( "Yes\n" );
else printf ( "No\n" );
return 0;
} | 1 | 6,195,100 |
#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 ll long long int
int main(){
ll n,k;cin>>n>>k;
unordered_map<ll,ll> mp;
for(ll i=0;i<k;i++){
ll d;cin>>d;
for(ll j=0;j<d;j++){
ll x;cin>>x;
mp[x]=i;
}
}
cout<<n-mp.size()<<endl;
return 0;
} | 1 | 96,000,585 |
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int m;
int coin[6] = {500, 100, 50, 10, 5, 1};
while (cin >> m, m){
int cnt = 0;
int change = 1000 - m;
for (int i = 0; i < 6; i++){
cnt += change / coin[i];
change %= coin[i];
}
cout << cnt << endl;
}
return (0);
} | #include<iostream>
using namespace std;
int main(){
int n,count;
while(cin >> n, n){
count = 0;
n = 1000 - n;
if(n >= 500){
count++;
n -= 500;
}
while(n >= 100){
count++;
n -= 100;
}
while(n >= 50){
count++;
n -= 50;
}
while(n >= 10){
cou... | 1 | 68,956,045 |
#include <bits/stdc++.h>
using namespace std;
const double pi = 2 * acos(0.0);
const double eps = 1e-8;
#define REP(i,a,b) for(int i=(a); i<(b);++i)
#define rep(i,n) REP(i,0,n)
#define INF (1<<29)
#define INFLL (1L<<62)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
for( ;; ) {
int n;
cin >> n;
if( n == 0 ) { break; }
vector<int> a( n );
for( auto& v: a ) { cin >> v; }
int result = 1000000;
for( int i = 0; i < n; ++i ) {
for( int j = i+1; j < n; ++j ) {
result = min( result, abs( a.at(i) - a.at(j) ) )... | 1 | 95,466,630 |
#include<iostream>
#include<string>
using namespace std;
int a[5000000];
int first=0,last=0;
int n,m,q;
string w;
void insert(){
a[last]=n;
last++;
}
void deleteFirst(){
last--;
}
void deleteLast(){
first++;
}
void _delete(){
for(int k=last-1;k>=first;k--){
if(a[k]==n){
m=k;
for(int k=m;k<last-1;k++){
... | #include <iostream>
#include <algorithm>
#include <list>
#include <string>
using namespace std;
int main(){
list<int> lst;
int N;
cin >> N;
string command;
int num;
for(int i=0; i<N; i++){
cin >> command;
if( command == "insert" ){
cin >> num;
lst.push_fro... | 1 | 57,011,410 |
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main(){
vector<long long> inv(100002);
vector<long long> fact(100002);
vector<long long> factInv(100002);
for(int i=0;i<2;i++) inv[i] = fact[i] = factInv[i] = 1;
for(int i=2;i<=100001;i++){
inv[i] = inv[MOD % i] * (MOD - M... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 1 | 71,948,523 |
#include <functional>
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <queue>
#include <string>
#include <cstring>
#include <math.h>
using namespace std;
int main() {
long long a,b,c;
cin >> a >> b >> c;
long long ans = 0;
if (a < c){
c = c - a;
a = 0;
if (b... | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
long long int a,b,k,m,n;
cin>>a>>b>>k;
if (a>=k)
{
m=a-k;
n=b;
cout<<m<<" "<<n<<endl;
}
else if(a+b<=k)
{
m=0;
n=0;
cout<<m<<" "<... | 1 | 71,218,681 |
#include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000000;
int main(){
int N;
cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; i++){
cin >> a[i];
}
long long tv = -100;
long long fv = INF;
while (fv - tv > 1){
long long mid = (tv + fv) / 2;
vector<long long> b... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MOD = 1000000007;
int main()
{
int n;
cin >> n;
ll arr[n];
for(int i = 0;i < n;i++)
cin >> arr[i];
sort(arr, arr + n);
if(arr[n - 1] <= n - 1){
cout << 0;
return 0;
}
ll k = 0;
ll res = 0;
for(int i = n - 1;i >=... | 1 | 66,694,619 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin>>s;
ll lo = s.size()-1;
ll ans = 0;
ll w = 0;
for(int i = 0; i<lo+1;i++){
if(s[i]=='W'){
ans+=i-w;
w++;
}
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
ll ans = 0;
ll w = 0;
for (ll i = s.size() - 1;i >= 0;--i) {
if (s[i] == 'W')++w;
else ans += w;
}
cout << ans << endl;
} | 1 | 8,880,820 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
set <int>d{a,b,c};
cout << d.size() ;
return 0;
} | 1 | 88,413,551 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
for (int i=0; i<10; i++){
if (111*i<N&&N<=111*(i+1)){
cout<<111*(i+1)<<endl;
}
}
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 1 | 1,795,425 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.