code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
ll x, y;
cin >> x >> y;
if (x % y == 0) {
cout << ... | #include<bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
#define all(a) a.begin(),a.end()
#define F first
#define S second
#define pb push_back
#define ll long long
#define vi vector<int>
#define pi pair<int,int>
#define mp make_pair
#ifdef LOCAL
#include "debug.h"
#else
#define debu... | 0 | 7,548,059 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
signed main(){
int n,m;cin>>n>>... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; 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 ALL(v) (v).begin(),(v... | 0 | 90,625,904 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(a) a.begin(), a.end()
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; }
using namespace std;
typedef... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int takahasi,nakahasi,hikuhasi,K;
cin>>takahasi>>nakahasi>>hikuhasi>>K;
if(K%2==0){
K=2;
}else if(K%2==1){
K=1;
}
if(takahasi==nakahasi==hikuhasi){
cout<<0<<endl;
return 0;
}
for(int i=1;i... | 0 | 97,150,750 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, a, ali, bor;
string ans;
cin >> n;
cin >> ali;
cin >> bor;
ans = "Alice";
a =((bor-1)-ali)%2;
if(a == 0) ans = "Borys";
cout << ans << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<math.h>
#include<map>
using namespace std;
using ll = long long;
int main() {
int a,b,c,K;
bool flag = false;
cin >> a >> b >> c >> K;
for(int i=0;i<=K;i++){
for(int j=0;j<=K;j++){
for(int k=0;k<=K;k++)... | 0 | 19,214,966 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
s[5] = ' ';
s[13] = ' ';
cout << s << endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
... | 0 | 24,403,876 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define S... | 0 | 83,491,184 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const string YES = "Yes";
const string NO = "No";
void solve(long long H, long long W, std::vector<std::string> s) {
vector<pair<ll, ll>> dir{pair<ll, ll>(-1, 0), pair<ll, ll>(1, 0), pair<ll, ll>(... | #include <iostream>
#include <list>
#include <string>
#include <algorithm>
using namespace std;
void output(list<int> a);
int main(void){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int n;
int entersuji;
cin >> n;
list<int> suji;
std::string command;
for(int i=0 ; i < n; i++){
cin >> command;
if(comm... | 0 | 40,002,559 |
#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;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long long unsigned llu;
typedef pair<long long, long long> pll;
const long long inf = 2000000000000000000LL;
#define pi acos(-1.0)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout... | 0 | 9,493,151 |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
template<typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod = 1e9 + 7, Nmax = 1e5 + 5;
ll fact[Nmax], ifact[Nmax];
int ap[Nmax], n, i, x, rest;
ll comb(int n, int k)
{
if(n < k) return 0;
return fact[n] * ifact[k] % Mod * ifact[n-k] % Mod;
}
ll power(ll a, int b)
{
if(!b) return 1;
... | 0 | 63,877,075 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
char a, b;
cin >> a >> b;
if (a > b)
cout << ">";
else if (a < b)
cout << "<";
else
cout << "=";
} | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
struct point{
double x,y;
public:
point(const point &p):x(p.x),y(p.y){}
point():x(0),y(0){}
point(double x,double y):x(x),y(y){}
double get_x()const{ return x; }
double get_y()const{ return y; }
point& operator=(const point &p)... | 0 | 89,893,214 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... | #include<iostream>
#include<cstring>
const int MAX_STR = 35;
const int MAX_NUM_OF_STR = 1010;
using namespace std;
int main(){
int cnt = -1, len = 0, tango = 0;
char str[MAX_NUM_OF_STR][MAX_STR], max[MAX_STR], maxlen[MAX_STR];
while(cin >>str[tango]){
int tmpcnt = 0;
for(int i = 0; i <= tango; i++){
if(strcmp... | 0 | 5,553,469 |
#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
using namespace std;
typedef un... | #include<stdio.h>
int main()
{
int a,b,c,d,e;
scanf("%d%d%d",&a,&b,&c);
if(a==b && a==c )
printf("1");
else if(a==b && a!=c)
printf("2");
else if(a==c && a!=b)
printf("2");
else if(b==c && b!=a)
printf("2");
else if(a!=b && a!=c)
printf("3");
retur... | 0 | 83,090,766 |
#include <stdio.h>
int main(){
int a[5];
for(int i=0;i<5;i++) scanf("%d",&a[i]);
for(int i=0;i<5;i++){
for(int j=i+1;j<5;j++){
if(a[i]<a[j]){
a[i]^=a[j];
a[j]^=a[i];
a[i]^=a[j];
}
}
}
for(int i=0;i<5;i++){
if(i) printf(" ");
printf("%d",a[i]);
}
printf("\n");
return 0;
} | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
int n,i,x,d,c=1,s=0;
int ans=INT_MAX;
cin>>n;
int a[n],b[n];
for(i=0;i<n;i++)
cin>>a[i];
for(int t = 0; t < n - 1; t++)
{
int s1 = 0, s2 = 0;
for (int i = 0; i < n; i++)
{
if (i <= t)
s1 += a[i];
e... | 0 | 89,156,024 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
using llong = long long;
llong n, k;
llong a[... | #include <bits/stdc++.h>
using namespace std;
struct Atack {
int power;
int magic;
};
int main() {
int H, N;
cin >> H >> N;
vector<Atack> atack(N);
int A, B;
for (int i = 0; i < N; i++) {
cin >> atack[i].power;
cin >> atack[i].magic;
}
long dp[H+1];
for (int i = 1... | 0 | 51,421,143 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string a, b, ans="H";
cin >> a >> b;
if(a!=b) ans = "D";
cout << ans << endl;
} | #include <climits>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
class NumberString {
public:
static UInt Digits(Int number) {
return to_string(number).length();
}
};
int main(void) {
Int n;
cin >> ... | 0 | 52,307,711 |
#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 <cstdio>
#include <cstdlib>
#define MAX 2000001
#define NIL -1
typedef struct {
int size;
int S[MAX];
} Heap;
int Left(int i) {
return 2 * i;
}
int Right(int i) {
return (2 * i + 1);
}
int Parent(int i) {
return i / 2;
}
void increaseKey(Heap *H, int i, int key) {
if (key < H->S[i]) {
... | 0 | 13,402,405 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K, S;
cin >> N >> K >> S;
for(int i=0;i<K;i++){
cout << S << " ";
}
if(S==1e+9) S=0;
for(int i=K;i<N;i++){
cout << (S+1) << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> ... | 0 | 45,215,437 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<ll> ans;
void dfs(int d, ll now){
ans.push_back(now);
if(d==10) return;
for(int j = -1; j<=1; j++){
int add = (now % 10) + j;
if(add>=0 && add <= 9) dfs(d+1, now*10+add);
}
}
i... | #include <iostream>
using namespace std;
int main() {
int n;
int count = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int num = i, digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
if (digit % 2 == 1) count++;
}
cout << count << endl;
return 0;
} | 0 | 53,357,680 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<string>
#include<algorithm>
#include<math.h>
#include<unordered_set>
using namespace std;
const int MAX = 500;
int H, W, d;
char getColor(int x, int y) {
x = (x + W) / d;
y = (y + H) / d;
if (y & 1) {
if (x... | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
class triangle
{
private:
double a, b, C, S, L, h;
public:
triangle(double edge1, double edge2, double angle);
~triangle(){;}
void calc_area();
void calc_around();
void calc_height();
void print_();
};
triangle::triangle(double edge1, do... | 0 | 51,788,265 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int mod = 1000000007;
int n, m;
cin >> n >> m;
vector<int> a(n + 1);
vector<int> dp(n + 2, 0);
for (int i = 0; i < m; i++)
{
int buf;
cin >> buf;
a[buf] = 1;
}
dp[n] = 1;
for (int i = n - 1; i >= 0; i--)
{... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | 0 | 37,149,648 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
vector<int> e[N];
queue<int> Q;
int n,deg[N];
bool del[N],white[N];
void erase(int x){
del[x]=1;
for (int i=0;i<e[x].size();i++){
int v=e[x][i];
if (del[v]) continue;
deg[v]--;
if (deg[v]==0) puts("First"),exit(0);
if (deg[v]==1) Q.push(v);
}... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#d... | 0 | 36,720,584 |
#include<iostream>
using namespace std;
int main(){
int x;
int n = 1;
cin >> x;
while(x!=0) {
cout << "Case " << n << ": " << x << endl;
n = n+1;
cin >> x;
}
return 0;
} | #include<iostream>
#include<string.h>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<bitset>
#include<set>
#include<climits>
#include<math.h>
#include<stdlib.h>
#define lli long long int
#define pb push_back
#define mp make_pair
#define pii pair<int , int >
#define pll pai... | 0 | 29,958,424 |
#include <bits/stdc++.h>
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
string s, t;... | #include <bits/stdc++.h>
int main() {
for(;;) {
int n, m, p;
std::cin >> n >> m >> p;
if (n == 0 && m == 0 && p == 0) {
break;
}
std::vector<int> xs(n);
for(int i = 0; i < n; ++i) {
std::cin >> xs[i];
}
int sum = 0;
for(... | 0 | 56,625,800 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,M;
cin>>N>>M;
vector<string> A(N),B(M);
for(string &S:A)cin>>S;
for(string &S:B)cin>>S;
for(int i=0;i+M<=N;i++)
for(int j=0;j+M<=N;j++){
for(int k=0;k<M;k++)
for(int l=0;l<M;l++)
if(A[i+k][j+l... | #include <iostream>
#include <string>
using namespace std;
int main(){
int H,K,W;
cin >> H >> W >> K;
string c[H];
int count=0;
for(int i=0;i<H;i++){
cin >> c[i];
}
for(int bit_l=0; bit_l < (1<<H); ++bit_l){
for(int bit_c=0; bit_c < (1<<W); ++bit_c){
int black=0;
... | 0 | 82,011,807 |
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
char c;
cin >> c... | 0 | 21,038,058 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define... | #include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | 0 | 9,929,433 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, x;
cin >> a >> b >> x;
double pi = acos(-1);
if(x >= a*a*b/2){
double c = a, d = b, e = x;
printf("%.10f",atan(2.0*(c*c*d - e)/(c*c*c)) * 360.0 / (2.0*pi));
}
else{
double c = a, d = b, e = x;
pri... | 0 | 29,906,875 |
#include <iostream>
using namespace std;
int main(){
int x, n;
n = 1;
while (1) {
cin >> x;
if (x == 0) {
break;
}
cout << "Case " << n << ": " << x << endl;
n++;
}
return 0;
} | #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>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#... | 0 | 55,699,225 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <cmath>
#include <bitset>
#include <fstream>
using namespace std;
#define pi pair<int,int>
#define mp(x,y) make_pair(x,y)
#define fi first
#define se s... | #include <bits/stdc++.h>
using namespace std;
class UnionFindDS{
private:
vector<int> p, h, sz;
int num;
public:
UnionFindDS(int N){
p.assign(N,0); for (int i=0; i<N; i++) p[i] = i;
h.assign(N,0); sz.assign(N,1);
num = N;
}
int numSets(){ return num; }
int findSet(int ... | 0 | 20,016,352 |
#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 reps(i, n) for (int i = 1; i <= (n); i++)
#define repi(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ull << (b))
using namespace std;
u... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
vector<P> prime_factorize(int N){
vector<P> ans;
for(int a = 2; a*a <= N; a++){
if(N % a == 0){
int ex = 0;
while(N%a == 0){
ex++;
N /= a;
}
ans.push_back(P(a, ex));
}
}
if(N != 1) ans.push_back(P(N... | 0 | 14,692,251 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
char a[302][302],b[302][302];
int main() {
ll n;
cin>>n;
for(ll i=0;i<n;i++){
for(ll j=0;j<n;j++){
cin>>a[i][j];
}
}
ll ans=0;
for(ll B=0;B<n;B++){
for(ll i=0;i<n;i++){
for(ll j=0;j<n;j++){
... | #include <iostream>
#include <vector>
int main()
{
while (true) {
int m, nmin, nmax;
std::cin >> m >> nmin >> nmax;
if (m == 0) {
break;
}
std::vector<int>ps;
ps.resize(m);
for (int i = 0; i < m; i++) {
std::cin >> ps.at(i);
}
int maxgap = -1;
int ans = -1;
for (int i = nmin; i <= nmax; i++... | 0 | 85,194,209 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
long n,a,b;
cin >> n >> a >> b;
long sum ... | #include<iostream>
using namespace std;
int main(){
int cnt=0;
int n, x;
cin >> n >> x;
while(!(n==0 && x==0)){
cnt=0;
for(int i=1;i<=x/3 && i<=n;++i){
for(int j=i+1;j<=x/2 && j<=n;++j){
int k=x-i-j;
if(k>j && k<=n){
++cnt;
... | 0 | 876,881 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double R;
double G;
cin >> R >> G;
double performance = 2 * G -R;
cout << performance << endl;
} | #include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int n,x;
int count=0;
while(1){
cin >> n >> x;
if(n==0 && x==0){
break;
}
int i,j,k;
for(i=1;i<(n-1);i++){
for(j=i+1;j<n;j++){
for(k=j+1;k<=n;k++){
... | 0 | 16,759,790 |
#include <bits/stdc++.h>
#include <stack>
using namespace std;
int main() {
int h,w,m; cin >> h >> w >> m;
vector<int> hcnt(h,0);
vector<int> wcnt(w,0);
int hm = 0;
int wm = 0;
set<pair<int,int>> bomb;
int cnt = -1;
for(int i=0; i<m; i++){
int y; int x;
cin >> y >> x;
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
using namespace std;
#define mod (1e9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) x... | 0 | 63,417,928 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<complex>
#include<cfloat>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define REP(i,n) for(int i=0; i<(int)(n... | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b) cout<<"Draw"<<endl;
else{
if(a==1) cout<<"Alice"<<endl;
else if(b==1) cout<<"Bob"<<endl;
else{
if(a>b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
}
} | 0 | 87,712,898 |
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i,n) for((i)=0;(i)<(n);(i)++)
#define repp(i,n) for((i)=1;(i)<=(n);(i)++)
int main(){
ll i,n,k,c[100010]={0},a,b,cnt=0;
cin >> n >> k;
rep(i,n){
cin >> a >> b;
c[a] += b;
cnt += b;
}
repp(i,100000){
k -= c[i];
if(k<... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) FOR(i,0,(n))
class BTwoColorsCardGame {
public:
void solve(std::istream& in, std::ostream& out) {
int n;
in >> n;
vector<string> s(n);
REP(i,n) in >> s[i];
int... | 0 | 85,865,877 |
#include<bits/stdc++.h>
#define l(i,a,n)for(int i=a;i<n;i++)
#define pb push_back
#define in insert
#define mp make_pair
#define lw(v) sort(v.begin(),v.end());
#define hi(v) sort(v.begin(),v.end(),greater<long long>());
#define all(v) v.begin(),v.end()
#define filein freopen ("input.txt", "r", stdin)
#define fileout fr... | #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... | 0 | 37,075,380 |
#include<iostream>
#include<string>
using namespace std;
void shuffle( string& s )
{
char temp = s[0];
for( int i = 0; i < s.size() - 1; i++ )
{
s[i] = s[i+1];
}
s[s.size()-1] = temp;
}
int main()
{
string str;
int m;
int h; ... | #include <stdio.h>
#include <iostream>
using namespace std;
long long a[100010];
long long mask[61];
int main()
{
int n;scanf("%d",&n);
for (int i=0;i<n;++i)
scanf("%lld",&a[i]);
long long ans=0;
long long tmp=0;
for (int i=0;i<n;++i)
tmp^= a[i];
ans=tmp;
tmp= (1LL << 61)-1-t... | 0 | 84,954,370 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl '\n'
int t=1;
void solve(){
int n,l;
cin >> n >> l;
for(int i=0;i<=n;i++){
if((l+2*i)==4*n){cout << "Yes" <<endl;return;}
}
cout << "No" <<endl;
}
int32_t main(){
ios_base::sync_with_std... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main(){
ll n;
ll a;
ll b;
ll x = 0;
ll y = 0;
ll ans = 0;
cin >> n >> a >> b;
x = n % (a+b);
y = n / (a+b);
if (x ... | 0 | 86,142,222 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | #include <bits/stdc++.h>
using namespace std;
const int N=2e5+100;
const int mod=1e9+7;
typedef long long ll;
typedef pair<int,int> pa;
map<ll,int>mp;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
int n,m;cin>>n>>m;
mp[0]=1;
ll sum=0,ans=0;
for(int i=1;i<=n;i++){
ll x;cin>>x;
sum=... | 0 | 32,837,676 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int n;
ll x = 1000;
cin >> n;
vector<int>a(n);
rep(i,0,n) cin >> a[i];
rep(i,0,n-1) if(a[i] < a[i+1]) x = x%a[i]+(x/a[i])*a[i+1];
cout << x << endl... | #include <iostream>
using namespace std;
int N;
int ma;
int main()
{
cin >> N;
for(int i = 1;i <= N;i++)
{
if((i + 1) * i / 2 >= N)
{
ma = i;
break;
}
}
for(int i = ma;i >= 1;i--)
{
if(N - i >= 0)
{
cout << i << endl;
N -= i;
}
}
return 0;
} | 0 | 29,242,818 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
using namespace std;
int main() {
long long A;
long long B;
long long C;
long long D;
cin >> A >> B >> C >>... | #include <iostream>
#include <cstring>
using namespace std;
int main(){
int n; cin>>n;
int data[101][101];
memset(data,0,sizeof(data));
int id,num,rout;
for(int i=0;i<n;i++){
cin>>id>>num;
id--;
for(int j=0;j<num;j++){
cin>>rout;
data[id][rout-1]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){... | 0 | 7,977,247 |
#include<stdio.h>
using namespace std;
int x,y,z = 0;
int main() {
scanf("%d %d", &x, &y);
while (1) {
if (x == 0 && y == 0) {
break;
}
if (x > y) {
z = x;
x = y;
y = z;
}
printf("%d %d\n", x, y);
scanf("%d %d", &x, &y);
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int calc(int nowTime, int s, int f){
if(nowTime <= s) return s - nowTime;
else {
int div = (nowTime + f-1)/f;
return (div*f - nowTime);
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
ve... | 0 | 18,390,602 |
#include<iostream>
int main(){
int h0,h1,h2,h3,h4,h5,h6,h7,h8,h9,k;
std::cin >>h0>>h1>>h2>>h3>>h4>>h5>>h6>>h7>>h8>>h9;
if (h8>h9) k=h8, h8=h9, h9=k;
if (h7>h8) k=h7, h7=h8, h8=k;
if (h8>h9) k=h8, h8=h9, h9=k;
if (h6>h7) k=h6, h6=h7, h7=k;
if (h7>h8) k=h7, h7=h8, h8=k;
if (h8>h9) k=h8, h8=h9, h9=k;
if (h5>h7) k... | #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... | 0 | 67,383,135 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int maxs,mins,sum;
while(cin>>n,n){
sum=0;
maxs=0;
mins=2000;
for(int i=0,tmp;i<n;i++){
cin>>tmp;
sum+=tmp;
maxs=max(maxs,tmp);
mins=min(mins,tmp);
}
sum-=mins;
sum-=maxs;
cout<<sum/(n-2)<<endl;... | #include "omp.h"
#include <iostream>
#include <iomanip>
#include <string>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <vector>
#include <cassert>
#include <fstream>
#include <algorithm>
#include <list>
#include <random>
#include <ctime>
#include <random>
#in... | 0 | 18,532,455 |
#include<bits/stdc++.h>
using namespace std;
int a[2005],n,k;
const int mod=1e9+7;
int calc(int K){
return (1ll*K*(K+1)/2)%mod;
}
signed main(){
cin>>n>>k;
for(int i=1;i<=n;++i)
cin>>a[i];
int ans=0;
for(int i=1;i<=n;++i){
for(int j=1;j<i;++j)
if(a[j]>a[i]) ans=(ans+calc(k))%mod;
else if(a[j]<a[i]) ans=(... | #include <cstdio>
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
int H, M, N;
int go[4][2];
bool K[1002][1002];
int score[1002][1002];
int C[11][2];
int ans = 0;
void saiki(int sx, int sy, int s){
if(K[sx][sy]){
if(score[sx][sy] > s){
score[sx][sy] = s;
for(int i = 0; i <... | 0 | 84,684,855 |
#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_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
ii mer(int a, int b... | #include <iostream>
#include <string>
#include <cstring>
#include <sstream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <chrono>
#include <numeric>
#include <set>
#define _USE_MATH_DEFINES
#include <cmath>
#include <math.h>
#include <iomanip>
#include <list>
usin... | 0 | 12,596,181 |
#include<iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
int main()
{
long N,K;
cin >> N >> K;
vector<long> longlist(N);
long num = 0;
for (long i = 0; i < N; i++)
{
cin >> num;... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
int t[N+1];
int x[N+1];
int y[N+1];
t[0] = x[0] = y[0] = 0;
for(int i = 0; i < N; i++) {
cin >> t[i+1] >> x[i+1] >> y[i+1];
}
bool flag = true;
for(int i = 0; i < N; i++){
i... | 0 | 21,287,584 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100 + 10;
int f[N][N];
char a[N][N];
void upd(int &x,int y){
x = min(x,y);
}
int main(){
int n,m; cin>>n>>m;
for(int i=1;i<=n;i++) cin>>(a[i]+1);
memset(f,0x7f,sizeof(f));
for(int i=1;i<=n;i++) for(int j=1;j<=m;j++){
... | #include <iostream>
#include <cstdio>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <set>
#include <vector>
using namespace std;
#define ll long long
const int maxx = 2005;
const ll mod = 1e9+7;
int a[maxx],b[maxx];
ll dp[maxx][maxx];
int n,m;
int main(){
cin>>n>>m;
for(int i=1;i... | 0 | 50,445,342 |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int x = 0, t = 0;
std::cin >> x >> t;
if (x > t)
std::cout << x - t << std::endl;
else
std::cout << 0 << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T, typename E>
struct SkewHeap{
typedef function<T(T, E)> F;
typedef function<E(E, E)> G;
typedef function<bool(T,T)> C;
F f;
G g;
C c;
E e;
SkewHeap(... | 0 | 38,669,623 |
#include <bits/stdc++.h>
using namespace std;
#define long long int
signed main(){
int a,b,c,k; cin>>a>>b>>c>>k;
while(k--){
if(b<=a)b*=2;
else if(c<=b)c*=2;
}
if(b>a&&c>b)cout<<"Yes";
else cout<<"No";
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int n;
cin>>n;
vector<pair<int,int>> red(n),blue(n);
for(int i=0;i<n;i++) cin>>red[i].second>>red[i].first;
for(int i=0;i<n;i++) cin>>blue[i].first>>blue[i].second;
sort(red.begin(),red.end());
sort... | 0 | 10,301,801 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
#define vi vector<int>
#define INF 1000000000
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int S, W;
cin >> S >> W;
string safety = W >= S ? "unsafe" : "safe";
cout << safety << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
char a;
int kotae[26],b;
int main(void){
while(1){
if(scanf(" %c",&a) == EOF)break;
for(int j=0;j<26;j++){
if(a=='a'+j ||a=='A'+j){
kotae[j]+=1;
}
}
}
for(int i=0;i<26;i++){
cout<<(char)('a'+... | 0 | 99,350,594 |
#include <iostream>
#include <vector>
using namespace std;
int gcd(int x, int y){
if(x < y) swap(x, y);
if(x % y == 0) return y;
return gcd(y, x % y);
}
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++) cin >> A[i];
int g = A[0];
for(int i = 1; i < N; i++){
... | #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize (2)
#pragma G++ optimize (2)
#include <bits/stdc++.h>
#include <algorithm>
... | 0 | 22,365,465 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
ll w, h;
cin >> w >> h;
ll p, q;
priority_queue<P,vector<P>,greater<P>> que;
rep(i,w) {
cin >> p;
que.push(P(p,0));
}
rep(i,... | #pragma GCC optimize ("-O2")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld ... | 0 | 57,000,441 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
int N; cin >> N;
int p[N];
for(int i=0;i<N;i++){
cin >> p[i]; p[i]--;
}
int a[N];
int b[N];
int r[N];
for(int i=0;i<N;i++){
r[p[... | #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()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 0 | 87,577,059 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(),v.end()
#define pb push_back
#define rep(p,a,b) for(ll p=a ; p<b ; p++)
#define F first
#define S second
using namespace std;
ll lcm(ll a,ll b)
{
return a*b/__gcd(a,b);
}
int main()
{
ll t,i,j,k,ans,n,m;
t=1;
wh... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 42,435,312 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, sum, x;
cin >> A >> B;
sum = 0;
x = A;
for(int i = 0; i <= B - A; i++ ){
int a, b, c, d;
a = x / 10000;
b = (x % 10000) / 1000;
c = (x % 100) / 10;
d = x % 10;
if(a == d && b == c ){
sum = sum + 1;
}
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | 0 | 89,543,334 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | #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 REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define debug(x... | 0 | 60,699,242 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t a, b, c, d; cin >> a >> b >> c >> d;
int64_t ans = b - a + 1; int64_t l = lcm(c, d);
ans -= (b / c - a / c + (a % c == 0));
ans -= (b / d - a / d + (a % d == 0));
ans += (b / l - a / l + (a % l == 0));
cout << ans << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define ALL(obj) (obj).begin(),(obj).end()
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;}
... | 0 | 60,037,459 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
string s1,s2,s3;
cin>>s1>>s2>>s3;
cout<<char('A'+(s1[0]-'a'))<<char('A'+(s2[0]-'a'))<<char('A'+(s3[0]-'a'))<<endl;
return 0;
} | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define double long double
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#defi... | 0 | 45,629,212 |
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#include <boost/math/tools/minima.hpp>
#endif
#ifdef... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define INF (INT_MAX / 2)
#define INFL (INT64_MAX /2)
typedef pair<int, int> P;
int main() {
int n,m;
cin >> n >> m;
vector<int> a(m+1),b(m+1);
rep(i,m) {
cin >> a[i] >> b[i];
}
vector<vector<int>>... | 0 | 32,848,676 |
#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, K;
cin >> N >> K;
vec<ll> P(N);
rep(i, N) cin >> P[i], --P[i];
vec<ll> C(N);
... | #include <bits/stdc++.h>
using namespace std;
void solve()
{
int row,col,mod=1e9+7;
cin>>row>>col;
string arr[row];
for(int i=0;i<row;i++)
{
cin>>arr[i];
}
vector<vector<long long int>>dp(row,vector<long long int>(col,0));
dp[0][0]=1;
for(int i=1;i<col;i++)
if(arr[0][i]!='#')
dp[0][i]=dp[0][i-1];
f... | 0 | 39,578,853 |
#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORA(i, n... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YE... | 0 | 42,029,785 |
#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 <<... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI 3.1415926535897932384626433832795028841971693993
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9+7;
int main(){
int n,ans=0;
string s;
cin>>n>>s;
ll a=0,b=0,c=0;
rep(i,n){
if(s[i]==... | 0 | 40,516,171 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
string s;
cin >>s;
int w;
cin >>w;
string t = " ";
for(int i = 0; i < s.size(); i+=w){
t += s[i];
}
cout << t << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n);i>=(j);i--)
using ll=long long;
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; retu... | 0 | 58,835,917 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
set<char> st;
rep(i, S.size()) st.insert(S[i]);
for (int i = 0; i < 26; i++) {
if (!st.erase((char)('a' + i))) {
cout << (char)('a' + i) << endl;
r... | #include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | 0 | 78,415,011 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, ans, L1, L0;
cin >> N;
L1=1;
L0=2;
ans=1;
for(int i=2; i<=N; i++){
ans = L1 + L0;
L0=L1; L1=ans;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ub(b,val) upper_bound(b+1,b+n+1,val)-b
#define ll long long
using namespace std;
const int N = 1e5 + 123, MAXN = 1e9;
ll n, m, v, p;
ll a[N], b[N], ans, c[N];
bool check (int in) {
ll k = 0, id = (n - p + 1);
if (b[in] + m < b[id])return 0;
k += (p - 1) * 1ll * m + (in - 1) ... | 0 | 80,588,677 |
#include <iostream>
using namespace std;
int main(){
int a;
for(int i=1 ;;i++){
cin>>a;
if (a==0){
return 0;
}
cout << "Case "<< i <<":"<<" "<<a<< endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
string s;cin>>s;
for(int i=0;i<s.size();i++) {
if(s[i]=='B') {
if(i>0) {
s.erase(i-1, 2);
i-=2;
} else {
s.erase(i, 1);
i--;
... | 0 | 62,041,246 |
#include <iostream>
#include <string>
#include <vector>
#include <iomanip>
#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()
{
long double T, X;
cin >> T >> X;
cout << std::fixed << std::setprecision(7) << T / X << en... | #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;
cin >> n;
vector<int> a(n),b(n);
rep(i,n) {
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
boo... | 0 | 27,420,371 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long k,a,b;
cin >> k >> a >> b;
if(b-a>2){
if(k<=a)cout << k+1 << endl;
else{
cout << b + (b-a)*((k-a-1)/2) + (k-a+1)%2 << endl;
}
}
else{cout << k+1 << endl;}
return 0;
} | #include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x)... | 0 | 15,113,225 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
const int MAX = 101010;
LL A[MAX], B[MAX], ACUM[MAX];
int main(){
int ... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 0 | 41,256,611 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 100002
#define NIL -1
int n, D[MAX];
struct node{
int p, l, r;
};
node T[MAX];
void printTree(){
for(int i=0;i<n;++i){
printf("node %d: parent = %d, depth = %d, ",i,T[i].p,D[i]);
if(T[i].p == NIL) printf("root, [");
else{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 6,187,912 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
char c;
cin >> c;
cout << (char)((int)c + 1);
return 0;
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin >>n;
vector<int> vec(n);
for(int i=0;i<n;i++) cin >> vec[i];
if(n%2 == 0){
for(int i=n-1;i>0;i -= 2){
cout << vec[i] << " ";
}
for(int i=0;i<n-1;i += 2){
cout << v... | 0 | 9,938,652 |
#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <random>
#include <cmath>
#include <iomanip>
#include <climits>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <unordered_set>
#include <queue>
#include ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define INF 1e18
#define EPS 1e-9
#define MOD 1000000007
#define F first
#define S second
#define all(x) begin(x), end(x)
using ll = long long;
using ull = unsigned lo... | 0 | 66,342,900 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... | #include <bits/stdc++.h>
using namespace std;
#ifdef ARTEM
#define deb(x) x
#else
#define deb(x)
const int LIMIT = 2 * int(1e5) + 123;
#endif
void solve();
int main() {
solve();
}
void solve() {
int n, l;
cin >> n >> l;
vector<string> s(n);
for(int i = 0; i < n; i++)
cin >> s[ i ];
sort(s.begin(), s.end());
... | 0 | 11,616,294 |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
int main() {
int K, N;
std::cin >> K >> N;
std::vector<int> A(N);
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
std::vector<int> diff(N);
for (int i = 0; i < N - 1; i++) {
diff[i] = A[i+1] - A[i... | 0 | 58,919,980 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define INF 1e8
typedef long long int ll;
const double PI = acos(-1);
using Graph = vector<vector<int>>;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = (n / (a + b)) * a;
if ((n % (a ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | 0 | 21,034,828 |
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | #include<iostream>
#include<queue>
#include<limits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<math.h>
#include<iomanip>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#define ll long long
#define tc(t) wh... | 0 | 56,388,163 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
int kyori;
string kekka = "No";
cin >> a >> b >> c >> kyori;
if(abs(c - a) <= kyori) kekka = "Yes";
if(abs(c - b) <= kyori && abs(b - a) <= kyori) kekka = "Yes";
cout << kekka;
} | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 78,860,812 |
#include<bits/stdc++.h>
#define swap(type,a,b) {type t; t=a; a=b; b=t;}
#define forN(i,n) for(int i=0;i<n;i++)
#define forS(i,start,n) for(int i=start;i<n;i++)
#define ll long long
#define pb(t,d,n) {t p;int i;forN(i,n){cin>>p;d.push_back(p);}}
#define DOUBLE fixed << setprecision(15)
using namespace std;
typedef vecto... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 0 | 76,466,623 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
templ... | #include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<deque>
#include<queue>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LLINF = 1001001001001001001;
const int MOD = 1000000007;
#define rep(i,n) ... | 0 | 92,325,487 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#... | #include<cstdio>
#include<string>
#include<list>
using namespace std;
list<int>L;
int main()
{
int N;
int d;
char command[20];
scanf("%d",&N);
for(int i=0;i<N;i++){
scanf("%s",command);
if(command[0]=='i'){
scanf("%d",&d);
L.push_front(d);
}
else if(command[6]=='F'){
L.pop_front();
... | 0 | 28,507,862 |
#include <iostream>
using namespace std;
int main(){
int D, T, S;
cin >> D >> T >> S;
if (S*T >= D) cout << "Yes";
if (S*T < D) cout << "No";
cout << "\n";
} | #include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N = 2e5 + 228;
ll dp[N][3], a[N][3];
int main()
{
#ifdef LOCAL_RUN
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n;
... | 0 | 88,087,136 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N; cin >> N;
ll ans = 0;
ll i = 1;
while (i * i < N - i) {
if ((N - i) % i == 0) ans += (N - i) / i;
i++;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int q;
cin >> q;
for(int i = 0; i < q; i++) {
ll a, b; cin >> a >> b;
if(a > b) swap(a, b);
if(a == b) {
cout << 2 * (a - 1) << endl;
} else if (a + 1 == b) {
cout... | 0 | 77,525,393 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main() {
ios
#ifndef ONLINE_JUDGE
in;
out;
#endif
int n;
cin>>n;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int t, k;
int check[4];
for(int i = 0; i < 4; i++){
check[i] = 0;
}
for(int i = 0; i < 3; i++){
cin >> t >> k;
check[t - 1]++;
check[k - 1]++;
}
int flag_1 = 0;
int flag_2 = 0;
for(int i = 0; i <... | 0 | 73,869,796 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
void solve() {
int n; cin >> n;
vector<string> s(n);
vector<int> c(26, 100), count(26);
for(int i=0; i<n; ++i) {
cin >> s.at(i);
vector<int> count(26);
for(int j=0; j... | #include "bits/stdc++.h"
using namespace std;typedef long long lint;typedef vector<lint> liv;
#define all(v) v.begin(),v.end()
#define linf 1152921504606846976
#define MAXN 100010
#define md 1000000007
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1,_2,_3,_4,name,...) name
#define _g... | 0 | 58,463,305 |
#include <bits/stdc++.h>
#define rep(i , n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main (){
string s;
cin >> s;
int c = 0;
for(int i = 1; i < s.size() / 2;i++){
if(s.substr(0 , i) == s.substr(i , i)){
c = 2 * i;
}
}
cout << c ... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) f... | 0 | 48,870,347 |
#include <bits/stdc++.h>
#include <climits>
#ifdef atclib
#include <atcoder/all>
#endif
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef boost
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ld long double
#define ull unsigned long long
#define vi std... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <string.h>
#include <iomanip>
using namespace std;
#define int long long
#define ul... | 0 | 41,912,452 |
#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 >=... | #include<bits/stdc++.h>
using namespace std;
int main () {
char S[100];
int si = 0;
string com;
cin >> com;
for (int i = 0; i < (int)com.size(); i ++) {
char c = com[i];
if (c == '0') {
S[si] = '0';
si ++;
}
if (c == '1') {
S[si] = '1';
si ++;
}
if (c == 'B') {
... | 0 | 61,856,050 |
#include <iostream>
#include <cstdio>
#include<cctype>
#include<cstring>
using namespace std;
int main()
{
char str[1001];
while (1) {
scanf("%s",str,1001);
int sum = 0;
if (strcmp(str,"0")==0) {
break;
}
else {
for (int i = 0; i < strlen(str); i++) {
sum += (str[i] - '0');
}
}
printf("%d\n... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 | 41,373,412 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, m; scanf("%d %d", &n, &m);
vector<vector<int> > data(100010);
for(int i = 0; i < n; i++){
int a, b; scanf("%d %d", &a, &b);
data[a].push_back(b);
}
priority_queue<int> que;
int ans = 0;
for(int i = 0; i <= m; i+... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
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&... | 0 | 47,998,066 |
#include <bits/stdc++.h>
typedef struct Node {
Node *left, *right;
int data;
} Node;
Node base;
void Node_init() {
base.right = &base;
base.left = &base;
return;
}
void Node_insert(int x) {
Node *node = new Node();
node->data = x;
node->right = base.right;
node->left = &base;
base.right->left = no... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
for (int tmp = 0; tmp < (1 << 3); tmp++) {
bitset<3> bs(tmp);
int sum = s.at(0) - '0';
string formula = to_string(sum);
for (int i = 0; i < (int)s.size() - 1; i++) {
int n = s.at(i + 1) - '0'... | 0 | 93,560,304 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int X[100010] = {};
for(int i = 0; i < N; i++) cin >> X[i];
int L, Q; cin >> L >> Q;
int A[100010][18] = {};
for(int i = 0; i < N; i++){
int a = upper_bound(X, X+N, X[i] + L) - X;
A[i][0] = a - 1;
}
for(int j = 1; j < 18; j++)... | #include <iostream>
#include <cmath>
using namespace std;
int main(void)
{
int n;
double x[4],y[4];
double degree[2];
cin >> n;
for(int i = n ; i > 0 ; i--){
cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3];
degree[0] = (y[1] - y[0]) / (x[1] - x[0]);
degree[1] = (y[3] - y[2]) / ... | 0 | 76,664,718 |
#include<iostream>
using namespace std;
int main()
{
int64_t X,Y ;
cin>>X>>Y ;
int64_t ans=(X>Y?X-Y:Y-X) ;
if(ans<=1) cout<<"Brown"<<endl ;
else cout<<"Alice"<<endl ;
return 0 ;
} | #include <bits/stdc++.h>
#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 FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1... | 0 | 70,153,606 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << (a+b+1)/2;
} | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retur... | 0 | 68,262,146 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string num;
cin >> num;
for(int i=0; i<num.size(); i++)
{
if(num[i] == '7')
{
cout << "Yes";
return 0;
}
}
cout << "No";
} | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n,a,b,c,x;
vector<int>y;
while(cin>>n>>a>>b>>c>>x){
if(n+a+b+c+x==0)break;
int cnt=0,ans=-1;
for(int i=0;i<n;i++){
int tmp;
cin>>tmp;
y.push_back(tmp);
}
for(int i=1;i<=10001;i++){
if(y[cnt]==x)cnt++;
if(cnt==y.size()){... | 0 | 93,487,514 |
#include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> cumsum(n + 1);
cumsum[0] = 0;
rep(i, 0, n)
{
int a;
cin >> a;
cumsum[i + 1] = a + cumsum[i];
}
ll ans = 100... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 22,592,278 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, M;
int count = 0;
int count_max = -100;
string search_word;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
cin >> M;
vector<string> t(M);
for (int i = 0; i < M; i++) {
cin >> t.at(i);
}
for (int i = 0; i < ... | #include<iostream>
#include<string>
typedef struct dictionary{
struct dictionary *A, *C, *G, *T;
bool a, c, g, t;
} dictionary;
void insert(void);
void find(void);
void init(dictionary*);
dictionary *Dic;
int main(){
int n;
std::string func, ins="insert", fin="find";
init(Dic = new dictionary);
std::cin >> ... | 0 | 69,496,432 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
if (n % k == 0) {
cout << 0 << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
priority_queue<long long> que;
for (int i = 0; i < n; i++){
long long ai;
cin >> ai;
que.push(ai);
}
for (int i = 0; i < m; i++){
long long t;
t=que.top();
que.pop()... | 0 | 55,411,398 |
#include <stdio.h>
int main (void)
{
int i, j;
for (i = 1; i < 10; i++) {
for (j = 1; j < 10; j++) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; ... | 0 | 33,828,805 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.