code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
int H, W, K;
cin >> H >> W >> K;
string board[H], t;
for(int i=0; i<H; i++) {
for(int j=0; j<W; j++) {
cin >> board[i][j];
}
}
int ans = 0;
for(int is=... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define M 200020
using namespace std;
LL read(){
LL nm=0,fh=1; char cw=getchar();
for(;!isdigit(cw);cw=getchar()) if(cw=='-') fh=-fh;
for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
return nm... | 0 | 25,289,955 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | #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 ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)
#define repp(a,b,c) for(i... | 0 | 65,012,788 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<long long> V(N);
for(int i=0; i<N; i++) cin >> V[i];
int ans=0;
for(int i=0; i<=K; i++){
for(int j=0; j<=K-i; j++){
if(i+j>N) continue;
vector<long long> S;
int res=0;
for(int k=0; k<i; k++){... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
stri... | 0 | 62,646,216 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=105;
ll F[N][5],k;
string str;
vector <ll> B;
ll solve(ll pos,ll num,bool check)
{
if(pos < 0) return num==k;
if(check==true && F[pos][num] > -1) return F[pos][num];
ll dem=0;
for(int i=0;i<=max(check*9ll,B[pos]);i++)
{
... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace s... | 0 | 55,610,291 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_N 1
typedef long long ll;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
vector<vector<int>> m;
bool possible(int s,int pre,int count){
bool ans = false;
if(count == 2){
if... | #include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
string str;
int n;
n = 0;
char c;
while(std::cin >> str){
if(n != 0){
std::cout << " ";
}
n = str.length();
for(int i=0; i<n; ++i){
c = str[i];
... | 0 | 30,450,226 |
#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>;
#define N 100
int main() {
int a, b; cin >> a >> b;
a--, b--;
char g[N][N];
rep(i, N/2) {
rep(j, N) g[i][j] = '#';
}
rep(i, N/2) {
rep(j, N) g[N/2+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=... | 0 | 41,247,845 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define uint unsigned long long
#define int long long
#define double long double
#define pb push_back
#... | #include<iostream>
using namespace std;
int main()
{
int m, f, r;
do{
cin >> m >> f >> r;
if((m < 0) && (f < 0) && (r < 0)) break;
if((m < 0) || (f < 0)){
cout << "F" << endl;
}else if(m + f >= 80){
cout << "A" << endl;
}else if(m + f >= 65){
... | 0 | 82,978,088 |
#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 <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int w, h, n;
cin >> w >> h >> n;
int w1 = 0, ... | 0 | 39,966,053 |
#include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
using namespace std;
int main() {
int n,a,b,c,x;
while (1) {
queue <int>s ;
cin >> n;
int a;
if (n == 0)break;
cin >> a >> b >> c >> x;
int y;
for (int i = 1; i <= n; i++) {
cin >> y;
s.push(y);
}
int ... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long int;
using ui64 = unsigned long long int;
int main(){
int i,j,k;
while(cin >> i >> j >> k,i){
vector<int> a(i);
for(int l=0;l<i;l++){
cin >> a[l];
}
sort(a.begin(),a.end(),greater<int>());
int... | 0 | 1,859,988 |
#include <iostream>
#define ll long long
using namespace std;
int main() {
ll a, b, c, d;
cin >> a >> b ;
cout << a*a - b << endl;
return 0;
} | #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 | 100,610,404 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n,m;
cin >> n >> m;
int d=n-m;
vector<vector<char>> a(n,vector<char>(n));
vector<vector<char>> b(m,vector... | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define INF ((long) 2e18)
#define MOD ((long) (1e9 + 7))
#define umap unordered_map
int main()
{
ios::sync_with_stdio(true); cin.tie(0); cout.tie(0);
long t = 1;
while (t--) {
long n;
string s;
cin >> n >> s;
... | 0 | 69,808,377 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define clr(v) v.clear()
vector<ll>v;
pair<ll,ll>p;
map<ll,ll>mp;
set<ll>st;
deque<ll>dq;
priority_queue<ll>pq;
#define f(i,b) for(i=0;i<b;i++)
#define f1(i,b) for(i=1;i<... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 0 | 42,404,272 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
pair<string,int> p[n];
for (int i = 0; i < n; ++i) cin >> p[i].first >> p[i].second;
string s;
cin >> s;
bool ok = false;
int ans = 0;
for (int i = 1; i < n... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for... | 0 | 25,702,375 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 666666
int arr[N];
signed main(){
int n,s=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>arr[i];
}
for(int i=2;i<=n;i++){
if(arr[i-1]%2){
if(arr[i]){
arr[i-1]++;
arr[i]--;
}
}
}
for(int i=1;i<=n;i++){
s+=arr[i]/2;
if(arr... | 0 | 62,232,136 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define _GLIBCXX_DEBUG
signed main() {
int N; cin >> N;
int fb=0, ea=0, n=0;
string s;
int ans = 0;
rep(i, 0, N) {
cin >> s;
if(s[0] == 'B') {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
int a, b;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else{
if(a == 1) cout << "Alice" << endl;
e... | 0 | 42,019,053 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
struct Node {
int key;
Node *prev, *next;
};
Node *nil;
int size = 0, np = 0, nd = 0;
void init() {
nil = (Node *) malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void insert(int key) {
Node *x = (Node *) malloc(sizeof(Node));
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
const int64 INF = 1LL << 59;
void solve()
{
int V, E;
int64 v[100][100];
fill_n(*v, 100 * 100, INF);
for(int i = 0; i < 100; i++) v[i][i] = 0;
cin >> V >> E;
while(E--) {
int a, b, c;
cin >> a >> b >> c;
v[a][b] = c;
}
fo... | 0 | 82,261,480 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> n >> m;
vector<ll> x(n), y(m);
for(i = 0; i < n; i++) {
cin >> x[i];
}
for(i = 0; i < m; i++) {
cin >> y[i];
}
ll retx = ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b,r;
unsigned long long int x;
cin >> a >> b;
if(a<b){
int tmp = a;
a = b;
b = tmp;
}
x = (unsigned long long int)a * b;
r = a % b;
while(r!=0){
a = b;
b = r;
r = a % b;
... | 0 | 41,238,870 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
int main() {
string s, t;
cin >> s >> t;
int k = -1;
int S = s.length();
int T = t.length();
rep(i, S - T + 1) {
bool ok = true;
rep(j, T) {
if (s[i + j] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | 0 | 64,679,965 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> cnt;
vector<string> s(n);
int i = 0;
for (string x; n--; cnt[x]++) {
cin >> x;
s.at(i++) = x;
}
int m;
cin >> m;
for (string x; m--; cnt[x]--) cin >> x;
int r = 0;
... | #include <vector>
#include <iostream>
using namespace std;
template <class T> struct Matrix {
vector<vector<T>> value;
T init;
Matrix(vector<vector<T>> vec,T init_) :init(init_), value(vec) {}
Matrix(int h, int w, T init_) : init(init_) , value(h, vector<T>(w,init_)) {}
Matrix<T> operator*(Matrix<T>& left) {
... | 0 | 86,019,910 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, sum;
string op;
cin >> x >> op >> y;
if (op == "+"){
sum = x + y;
} else if(op == "-"){
sum = x - y;
}
cout << sum << endl;
} | #include <iostream>
using namespace std;
int main(){
int n,b,f,r,v;
int s[5][4][11] = {0};
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> b >> f >> r >> v;
s[b-1][f-1][r-1] += v;
}
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 3; j++)
{
for (int k = 0; k < 10; k++)
{
cout << " " << s[i][j]... | 0 | 86,017,055 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef map<string, int> msi;
int main(){
int k, n; cin >> k >> n;
vector<int> v(n);
rep(i, n) cin >> v.at(i);
v.push_back(v.at(0)+k);
int ans = 0;
rep(i, n) ans = max(ans, v.at(i+1)-... | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
int main(void) {
ll n,x;
cin>>n>>x;
ll res = 0;
res += n;
ll height = x,w... | 0 | 65,181,023 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#define all(v) v.begin(),v... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W, D, Q;
cin >> H >> W >> D;
vector<array<int,2>> A(H*W);
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
int k;
cin >> k;
A[k-1] = array<int, 2>{i, j};
}
}
vector<vector<int>> cost(... | 0 | 10,140,670 |
#include <iostream>
#include <cstdio>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
int n;
while(1) {
if(scanf("%d", &n) == EOF) break;
int total = 0;
rep2(i,1,(600/n)) {
total += n * n * i * n * i;
}
cout << total << endl;
}
... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODAD... | 0 | 21,155,027 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
vector<ll>a(n);
for(ll i=0;i<n;i++){
cin >> a[i];
}
deque<ll>b;
if(n%2==0){
for(ll i=0;i<n;i++){
if(i%2==0){
b.push_back(a[i]);
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0;i<(n);i++)
#define rep2(i,n) for(long long i=1;i<=(n);i++)
#define rep3(i,i0,n) for(long long i=i0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mod 1000000007
#define INF 2000000000
typedef long long ll;
bool co... | 0 | 98,539,313 |
#include <iostream>
using namespace std;
long long gcd(long long n, long long m){
if(n%m==0){
return m;
}else{
return gcd(m, n%m);
}
}
int main() {
long long n, k, x, ans = 0;
cin >> n >> k;
cin >> x;
ans = abs(x-k);
for (int i=0; i<n-1; i++) {
cin >> x;
long long temp = abs(x-k);
ans = gcd(ans, temp)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | 0 | 78,458,640 |
#include <iostream>
#include <string>
class Dice{
public:
int a[7];
void roll(char d);
void rotate(void);
};
void Dice::rotate(void){
int tmp;
tmp=a[2];
a[2]=a[3];
a[3]=a[5];
a[5]=a[4];
a[4]=tmp;
}
void Dice::roll(char d){
int tmp;
if(d=='N'){
tmp=a[1];
a[... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... U> void assign(V<T>& v, int n, const U&... u... | 0 | 63,722,013 |
#include <iomanip>
#include <iostream>
#include <cmath>
#include <vector>
int exp_over_v(int i, int thres)
{
int ret = 0;
while(i < thres) {
i *= 2;
ret++;
}
return ret;
}
int main()
{
double N, K;
std::cin >> N >> K;
double prob = 0.0;
for(int i=1; i<=N; i++) {
int e = exp_over_v(i, K);
... | #include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<map>
#define ran(x) (x).begin(),(x).end()
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<string> s(n), t(m);
for(int i = 0; i < n; ++i)
cin >> s[i];
for(int j = 0; j < m; ++j)
cin >> t[j];
int... | 0 | 70,781,730 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = acos(-1) ;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n;
cin>>n;
vector<long long int> v;
while(n--){
long long int h;
cin>>h;
v.push_back(h);
}
vector<long long int> minn;
minn.push_back(0);
minn.push_back(v[0]);
for(long long i... | 0 | 60,216,147 |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>a(N);
cin >> a.at(0);
for(int i = 1 ; i < N ; i++){
cin >> a.at(i);
}
int min = 1000000;
int cal = 0;
for(int i = -100 ; i <= 100 ; i++){
int y = i;
... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
int n;
cin >> n;
vector<int> a(201,0);
int ans = 0;
for(int i = 105;i <= n;i += 2){
for(int j = 1; j <= n;j+= 2){
if(i % j == 0)a[i]++;
}
}
for(int i = 0;i <= n;i++){
if(a... | 0 | 95,001,821 |
#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... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 0 | 88,568,394 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int px[90001],py[90001];
int d[90001];
int main(){
int h,w,D;
cin>>h>>w>>D;
rep(i,h){
rep(j,w){
... | #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 < (int)(n); i++)
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 ... | 0 | 40,703,598 |
#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 n;
cin >> n;
vector<string> A(n);
for (int i = 0; i < n; i++)
{
cin >> A[i];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
#define rep(i,n) for(int i=0;i<n;... | 0 | 26,452,260 |
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<map>
#include<functional>
#include<set>
#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main(){
int N,H;
cin >> N >> H;
vector< pair<int, int> > ab;
REP(i, N) {
int a,b;
cin >> a >> b;
ab.emplace_back( a, 0 );
ab.emplace_back( b, 1 );
}
sort( ab.begin(), ab.end(),grea... | 0 | 31,342,560 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
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; } ret... | #include<bits/stdc++.h>
#define fst first
#define snd second
#define pb push_back
#define mp std::make_pair
#define FOR(i,a,b) for(auto i=(a);i<(b);++i)
#define RFOR(i,a,b) for(auto i=(a);i>=(b);--i)
#define REP(i,a) for(long i=0;i<(a);++i)
#define RREP(i,a) for(long i=(a);i>=0;--i)
#define EACH(i,a) for(auto (i)=(a).b... | 0 | 82,253,462 |
#include <iostream>
using namespace std;
int main()
{
int n , m ;
cin>>n>>m;
if(n+m==15) {
cout<<"+";
return 0;
}
if(n*m==15) {
cout<<"*";
return 0;
}
cout<<"x";
return 0;
} | #include <iostream>
using namespace std;
int n, y, m, d;
void solve() {
int sum = 0;
while(y < 1000) {
sum++;
d++;
if(y%3 && m%2 == 0 && d == 20) {
d = 1;
m++;
}
else if(d > 20) {
d = 1;
m++;
}
if(m > 10) {
m = 1;
y++;
}
}
cout << sum << endl;
... | 0 | 82,442,333 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int W, H, N;
cin >> W >> H >> N;
int l=0, r=W, d=0, u=H;
rep(i,N) {
int x, y, a;
cin >> x >> y >> a;
switch (a) {
case 1:
if (x > l) l = x;
break;
case 2:
if (x < r) ... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
while (cin >> N) {
if (N == 0) break;
int num[5000];
for (int i = 0; i < N; i++) {
cin >> num[i];
}
int m = num[0];
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = i; j < N; j++) {
... | 0 | 15,416,873 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct edge {
int to, cost;
};
signed main() {
int K;
cin >> K;
vector<bool> vis(K, false);
deque<pair<int, int>> dq;
dq.push_back({1, 1});
while (!dq.empty()) {
pair<int, int> p = dq.front();
dq.pop_front();
int x = p.first, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n, a, b;
cin >> n >> a >> b;
if (a > b){
puts("0");
return 0;
}
if (n == 1 && a != b){
puts("0");
return 0;
}
if (a == b){
... | 0 | 81,447,752 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main(){
int N, M; cin >> N >> M;
long long alone = 0, bi = 0, crowd = 0;
vector<vector<int>> g(N);
for(int i=0;i<M;i++){
int a, b; cin >> a >> b;
--a; --b;
g[a].push_back(b);
... | 0 | 18,033,404 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ans = 0,m = 0;
int arr[n];
for (int i=0;i<n;++i){
cin>>arr[i];
}
int temp = arr[0];
for(int i=1;i<n;++i){
if (arr[i]<=temp){
m++;
temp = arr[i];
}
else{
... | 0 | 78,893,071 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> a(s.size()+1, 0);
for (int i = 0; i < s.size(); i++) {
if (s[i] == '<') a[i+1] = a[i] + 1;
}
for (int i = s.size()-1; i >= 0; i--) {
if (s[i] == '>') a[i] = max (a[i], a[i+1]+1);
}
... | #include <bits/stdc++.h>
using namespace std;
class ArgSort{
public:
template<typename T>
static vector<pair<T, T> > Sort(vector<pair<T, T> > A){
sort(A.begin(), A.end(), [&](const auto &p1,const auto &p2){
return atan2(p1.second, p1.first) < atan2(p2.second, p2.first);
});
return A;
}
tem... | 0 | 38,207,254 |
#include<iostream>
#include<algorithm>
#define int long long int
using namespace std;
signed main()
{
int n,k;
while(cin>>n>>k,n){
int a[100000];
for(int i=0;i<n;i++)cin>>a[i];
int s=0;
for(int i=0;i<k;i++)s+=a[i];
int ma=s;
for(int i=k;i<n;i++)
{
s-=a[i-k];
s+=a[i];
ma=max(ma,s);
}
cout<<ma<<endl;}
r... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a... | 0 | 81,973,059 |
#include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
#define MAX_P 2000010
int fact[MAX... | #include <iostream>
#include<algorithm>
using namespace std;
int main()
{
int sum=0, summ=0;
for (int i = 0; i < 4; i++)
{
int s; cin >> s; sum += s;
}
for (size_t i = 0; i < 4; i++)
{
int s; cin >> s; summ += s;
}
if (sum >= summ) { cout << sum<<endl; }
else { cout << summ<<endl; }
} | 0 | 40,454,042 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
int a,b,c,d,e,f,g,h,i,s;
a = n/100000000;
b = n/10000000-10*a;
c = n/1000000-100*a-10*b;
d = n/100000-1000*a-100*b-10*c;
e = n/10000-10000*a-1000*b-100*c-10*d;
f = n/1000-100000*a-10000*b-1000*c-100*d-10*e;
g = n/100-100000... | #include <bits/stdc++.h>
using namespace std;
const int N = (1 << 18) + 10;
int arr[N];
pair<int, pair<int, int>> memo[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < (1 << n); ++i) {
scanf("%d", arr + i);
memo[i] = {arr[i], {arr[i], 0}};
}
for (int i = 0; i < n; ++i) {
... | 0 | 86,926,592 |
#include <iostream>
#include <algorithm>
#include <functional>
int main()
{
int ns[5];
std::cin >> ns[0] >> ns[1] >> ns[2] >> ns[3] >> ns[4];
std::sort(ns, ns+5, std::greater<int>());
std::cout << ns[0] << " " << ns[1] << " " << ns[2] << " " << ns[3] << " " << ns[4];
std::cout << std::endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, char> C;
int N;
C co[36];
C cb[36];
vector<char> so[10];
void check_and_print() {
cout << cb[0].second << cb[0].first;
for (int i = 1; i < N; i++) {
cout << " " << cb[i].second << cb[i].fi... | 0 | 26,800,547 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){ci... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 70,054,806 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 61,929,239 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<pair<string,ll> > svp;
#define spc ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb p... | 0 | 96,950,055 |
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char* argv[]) {
while (true) {
string in; cin >> in;
if (in == "0") break;
int s = 0;
for (string::iterator itr = in.begin();
itr != in.end(); itr++) {
char c = *itr;
int c_i = c + (0 - '0');
s += c_i;
... | #include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
while (true) {
int n, x; cin >> n >> x;
if (n == 0 && x == 0) break;
int db[n+1][n+1][n+1];
for (int i = 1; i <= n; i++) {
for (int j = i+1; j <= n; j++) {
for (int k = j+1; k <= n; k++) {
db[i][j][k] = i+j+k;
}
... | 0 | 38,732,382 |
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1);
rep(i, n) std::cin >> a[i + 1];
for (int i = 1; i <= n; ++i) {
printf("node %d: key = %d, ", i, a[i]);
int left = 2 * i;
int right = left + 1;
... | #include <bits/stdc++.h>
#define fio ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
using namespace std;
const int N = 1007;
const int inf = 1e9 + 7;
bool a[N][N];
int dp[N][N];
int w, h;
int dio(){
dp[h - 1][w - 1] = 1;
for (int i = h - 1; i >= 0; i--){
for (int j = w - 1; j >= 0; j--){
... | 0 | 93,114,081 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
int Fnum, Snum;
vector<char> before, after, sent;
char wk, tk;
while(cin >> Fnum)
{
if(!Fnum) break;
for(int i = 0; i < Fnum; i++)
{
cin >> wk >> tk;
before.push_back(wk); after.push_back(tk);
}
cin >> Snum;
fo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | 0 | 11,001,749 |
#include <iostream>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <list>
#include <math.h>
#include <map>
using namespace std;
#define REP(i, k, n) for(int i = k;i < n; i++)
#define rep(i, n) REP(i,0,n)
int dx[4] = {0,-1,1,0};
int dy[4] = {-1,0,0,1};
bool dp[5001][5001];
int tar = 0;
i... | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | 0 | 59,476,631 |
#include<iostream>
using namespace std;
void show(int arr[], int N){
for(int i=0; i<N; i++)
if(i<N-1)
cout<<arr[i]<<' '<<flush;
else
cout<<arr[i]<<flush;
cout<<endl;
}
void swap(int& a, int& b){
int t=a;
a=b;
b=t;
}
int SelectionSort(int*, int);
int main()
{
int N;
cin>>N;
int* arr=new int[N];
for(in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define... | 0 | 29,733,865 |
#include <iostream>
#include <string>
int main()
{
int a, b;
std::string operand;
std::cin >> a;
std::cin >> b;
if (a > b)
{
operand = ">";
}
else if (a < b)
{
operand = "<";
}
else
{
operand = "==";
}
std::cout << "a" << " " << operand << " " << "b" << std::endl;
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
#include <stack>
#include <vector>
#define INF 0x3f3f3f3f
#define MOD 1000000009
typedef long long ll;
using namespac... | 0 | 26,482,811 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<int>a(N),b(N);
int suma = 0,sumb = 0;
for(int i = 0; i < N; i++) {
cin ... | #include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long int infLL = 9000000000000000000;
#define mem(a,b) memset(a, b, sizeof(a) )
#defin... | 0 | 8,251,733 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
struct Edge {
int t,next;
Edge() {}
Edge(int a,int b):t(a),next(b) {}
};
Edge e[200005];
int head[100005],d[100005];
ll num[100005];
ll dfs(int x,int fa) {
if (d[x]==1) return num[x];
ll sum=0,maxn=0;
for(in... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define CFOR(i, str) for(int i = 0; (str)[i]!='\0'; (i)++)
#define FOR(i, s, r) for(int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegi... | 0 | 15,308,552 |
#include <iostream>
using namespace std;
int a,b;
int main()
{
cin >> a >> b;
if(a + b == 15 && a * b == 15)
cout << "x" << endl;
else if(a + b == 15)
cout << "+" << endl;
else if(a * b == 15)
cout << "*" << endl;
else
cout << "x" << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <math.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){return b!=0?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a*... | 0 | 18,637,460 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | #include <bits/stdc++.h>
using namespace std;
#define fst first
#define snd second
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define for_tests(t, tt) int t; scanf("%d", &t); for(int tt = 1; tt <= t; tt++)
#ifndef ONLINE_JUDGE
#define debug(args...) fprintf(st... | 0 | 85,223,236 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,M;
cin>>N>>M;
vector<vector<ll>>vec(N,vector<ll>(2));
for(ll i=0;i<N;i++){
cin>>vec.at(i).at(0)>>vec.at(i).at(1);
}
sort(vec.begin(),vec.end());
ll a=0;
for(ll i=0;i<N;i++){
if(M>vec.at(i).at(1)){
a+=vec.at... | 0 | 39,470,085 |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int main()
{
char a;
cin >> a;
if(a >='A' && a<='Z')
{
cout << 'A';
}
else
{
cout << 'a';
}
} | #include <iostream>
#include <cmath>
#include <cctype>
#include<cstdio>
using namespace std;
int main(){
int alpha[26];
for(int i=0;i<26;i++){
alpha[i]=0;
}
char c;
while(cin>>c){
if(isalpha(c)){
if(isupper(c)){
alpha[c-'A']++;
}else alpha[c-'a']++... | 0 | 92,749,888 |
#include<iostream>
#include<string>
using namespace std;
int d[10000],p[10000];
int main(){
int n,m;
while(true){
cin>>n>>m;
if(n==0&&m==0)
break;
int load=0;
for(int i=0;i<n;i++){
cin>>d[i]>>p[i];
load+=d[i];
}
if(load<=m)
cout<<"0"<<endl;
else{
int count=0;
for(int i=0;i<n-1;i++){
for(int j=n-... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
for(int i = 0; i < n; i++){
if(s.at(i) != s.at(k-1)){
s.at(i) = '*';
}
}
cout << s << endl;
} | 0 | 22,233,581 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include<cstdio>
#include<iostream>
#include <string>
#include<algorithm>
using namespace std;
int main()
{
int a,b,c,d;
cin >> a >> b >> c >> d;
int min=1000,min1=1000;
if(a<min)
{
min = a;
}
if(b<min)
{
min = b;
}
if(c<min1)
{
min1 = c;
}
if(... | 0 | 21,035,762 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < k; i++) {
vector<int> b(n + 1);
for (int j =... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <string>
#include <list>
#include <bitset>
using namespace std;
typedef long long LL;
typedef un... | 0 | 91,610,927 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
char s[n][n];
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
cin >> s[i][j];
}
}
int ans = 0;
for(int k = 0; k < n; k++){
bool ok = true;
for(int i = 0; i < n; i++){
for(in... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int main(){
map<string,int> mp;
string s;
getli... | 0 | 35,900,737 |
#include <cstdio>
#include <iostream>
#include <set>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define fi first
#define se second
using namespace std;
inline char nc()
{
static char buf[100000],*l=buf,*r=buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;
}
template<class T> void read(T ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1145141919810893364
typedef long long ll;
#define REP(i,n) for(int i=0;i<(n);++i)
#define RREP(i,n) for(int i=(n)-1;i>=0;--i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define ZREP(i,n) for(int i=1;i<(n);++i)
#define int ll
#define Endl en... | 0 | 54,982,762 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define ... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b... | 0 | 44,341,380 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 0 | 55,612,160 |
#include <iostream>
#include <algorithm>
using namespace std;
long long N,M;
void input()
{
cin >> N >> M;
}
void solve()
{
if (N >= 2 && M >= 2){
cout << (N-2) * (M-2) << endl;
} else if (N == 1 && M == 1) {
cout << 1 << endl;
} else {
cout << max(N,M) - 2 << endl;
}
}
int m... | #include<string>
#include<iostream>
using namespace std;
class Dice{
int dn[6];
int up, front;
string qu;
public:
Dice(int d1, int d2, int d3, int d4, int d5, int d6){
dn[0] = d1;
dn[1] = d2;
dn[2] = d3;
dn[3] = d4;
dn[4] = d5;
dn[5] = d6;
}
void Result(string m){
int w;
qu = m;
for (int i = 0; ... | 0 | 19,023,054 |
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
te... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i=0; i<(n); ++i)
int main(void){
int n;
int y, m, d;
cin >> n;
rep(loop, n) {
cin >> y >> m >> d;
int day = 0;
day += d;
day += 20 * (m-1);
if(y%3 != 0) day -= (m-1)/2;
... | 0 | 26,493,863 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{... | #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 fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x... | 0 | 21,860,922 |
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#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 pi (acos(-1))
#define all(x) (x).begin(), (... | #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;
typedef long long int ll;
typedef tree< ll, null_type, less< ll >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
ll mod;
ll pwr(ll a, ll b){
ll res = 1;... | 0 | 94,697,544 |
#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, K;
cin >> N >> K;
vector<int> p(N);
rep(i,N) cin >> p[i];
sort(p.begin(), p.end());
int ans = 0;
rep(i,K) ans += p[i];
cout << ans << endl;
re... | #include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y, ll z){
if(y==0)
return 1;
else
{
ll p=power(x,y/2,z);
if(y%2==0)
return (p*p)%z;
else
return (x*((p*p)%z))%z... | 0 | 74,274,087 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <numeric>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
int a, b, c, n;
string s;
int main()
{
cin>>a>>b>>c;
if(c<=a+b)
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <ll , ll>;
void in(ll &x);
const ll N = 1e5 + 10;
const ll INF = 1e9;
const ll M = 1e9 + 7;
ll n;
ll d[N], dp[N][2];
vector <ll> adj[N];
void makeRooted() {
fill (d , d + N , INF... | 0 | 40,074,049 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define int ll
#define _GLIBCXX_DEBUG
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define REPD(i,n) for (int i = (n-1); i >= 0; --i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define debug(x) cerr << #x <<... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
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;}
using namespace std;
u... | 0 | 88,328,099 |
#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#define M 1000000000000000000LL
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) ... | #include <cstdlib>
#include <climits>
#include <iostream>
#include <cstdint>
#include <vector>
#include <string>
#include <complex>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <regex>
#in... | 0 | 78,421,005 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll x,y;
cin >> x >> y;
if(x%y==0) cout << -1 << endl;
else {
cout << x << endl;
}
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 51,831,024 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef st... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
ll i,j,k,n;
std::cout.precision(10);
int yes=0;
ll a,b,c;
cin>>a>>b>>c>>k;
ll sum=0;
sum=min(k,a);
k-=a;
if(k>0)
{
k-=b;
... | 0 | 74,988,777 |
#include<bits/stdc++.h>
using namespace std;
int main() {
double T,X,ans=0;
cin >> T >> X;
ans=T/X;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
struct point{
int x,y;
};
point rot(int x, int y){
point ans;
ans.x = -y;
ans.y = x;
return ans;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
point a,b;
cin >> a.x >> a.y >> b.x >> b.y;
point p = rot(b.x - a.x, b.y - a.y);
co... | 0 | 87,858,607 |
#include <bits/stdc++.h>
using namespace std;
#define pi 2*asin(1.0)
long Comb(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
for(long i=M;i>0;i--){
ans=ans/i;
}
return ans;
}
long Perm(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
return ans;
}
long GCM(long A,long B)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a <= b && c <= d) {
cout << a + c << "\n";
} else if (a <= b && c >= d) {
cout << a + d ... | 0 | 96,288,712 |
#include <bits/stdc++.h>
using namespace std;
# define rep(i, n) for(int(i)=0;(i)<(n);(i)++)
# define reps(i, n) for(int(i)=1;(i)<=(n);(i)++)
# define rrep(i, n) for(int i=((int)(n)); i>0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>=0; --i)
# define ALL(v) v.begin(), v.end()
template<class T>inline bool chmax(T ... | #include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
int ans[300'009];
int main() {
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
if (a + b - 1 > n || n > (long long)a * b) {
puts("-1");
return 0;
}
if (a >= b) {
for (int i = 0; i < n; i += a) {
int j = min(i + a - 1... | 0 | 16,815,595 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include<iostream>
#include<string>
using namespace std;
int count;
string A="abcdefgqrstvwxz";
string X;
int sA(char ch){
int g=0;
for(int i=0;i<A.size();i++){
if(ch==A[i]){
g=1;
break;
}
}
return g;
}
int main(){
while(1){
count=0;
cin >> X;
if(X[0]=='#')break;
for(int i=0;... | 0 | 5,209,230 |
#include<iostream>
using namespace std;
int main(){
bool ac[100001]={};
int pc[100001]={};
int n,m;
cin>>n>>m;
int a=0,pe=0;
while(m--){
int p;
char s[9];
cin>>p>>s;
if(s[0]=='A'){
a+=!ac[p];
ac[p]=true;
}else{
pc[p]+=!ac[p];
}
}
int p=0;
for(int i=1;i<=n;i++)... | #include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i... | 0 | 61,466,974 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int a,b;cin>>a>>b;
cout<<(a*b-(a+(b-1)))<<endl;
return 0;} | #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... | 0 | 14,911,293 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#inclu... | #include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using names... | 0 | 82,417,211 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <fstream>
#include <complex>
using namespace std;
typedef complex<double> P;
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)
double cross(P a, P b) {
return (a.real() * b.imag() - a.imag() * b.real());
}
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
typedef pair<int, int> P;
const int MAX_N = 10000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef int64_t ll;... | 0 | 92,802,748 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r=0, g=0, b=0;
for (char c : s) {
if (c == 'R') ++r;
else if (c == 'G') ++g;
else if (c == 'B') ++b;
}
long long ans = (long long)r * g * b;
for (int i = 0; i < n; i++) {
for (int j = i+1; j... | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.begin(); i != vec.end(); ++i)
const int mod = 10... | 0 | 6,527,257 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT ... | 0 | 25,718,896 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int N, K;
cin >> N >> K;
cout << (N % K == 0 ? 0 : 1) << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <string>
#include <map>
using namespace std;
int ChangeTimesFormat(string str){
int h = atoi(str.substr(0,2).c_str());
int m = atoi(str.substr(3,2).c_str());
int s = atoi(str.substr(6,2).... | 0 | 34,737,969 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define ALL(v) (v).begin(), (v).end()
ll INF=1e18+5;
ll gcd(ll a, ll b){
if(a < b) return gcd(b, a);
ll r = a % b;
while(r != 0){
a = b;
... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
const ll mod=1000000007;
ll pow(ll x,ll y){
ll res=1;
for(ll i=0;i<y;i++){
res*=x;
}
return res;
}
ll powmod(ll x,ll y){
ll res=1;
for(ll i=0;i<y;i++){
res=res*x%mod;
... | 0 | 80,567,492 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
ll n,x; cin>>n>>x;
ll ans = 0;
vector<ll[2]>dic(n+1);
dic[0][0] = dic[0][1] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
int n,a,b; cin>>n>>a>>b;
int k;
int ans=0;
for(int i=1;i<=n;i++){
k=0;
int m=i;
while(m>0){
k+=m%10;
m=m/10;
}
if(a<=k&&k<=b){
... | 0 | 45,943,706 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < s.length(); i++)
{
if (s[i] == s[k-1])continue;
s[i] = '*';
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const int INF = 1001001001;
long long match[10] = {2,5,5,4,5,6,3,7,6};
string dp[11000];
const string MINUSINF = "-";
void chmax(string &a, string b) {
if (a == MINUSINF) a = b;
else if (a.size() < ... | 0 | 84,455,930 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>data(100005);
for(int i=0;i<n;i++){
int x;
cin >> x;
data.at(x)++;
}
int ans=0;
for(int i=1;i<100004;i++){
ans=max(ans,data.at(i-1)+data.at(i)+data.at(i+1));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int a,b,m;
cin >> a >> b >> m;
int p[a],q[b],x[m],y[m],c[m];
for(int i = 0; i < a; i++){
cin >> p[i];
}
for(int i = 0; i < b; i++){
cin >> q[i];
}
for(int i = 0; i < m; i++){
cin >> x[... | 0 | 34,847,990 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
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; } r... | 0 | 94,442,741 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int h, w;
cin >> h >> w;
vector<string> v(h);
for(int i=0; i<h; i++) cin >> v[i];
vector<bool> tate(h, false);
vector<bool> yoko(w, false);
for(int i=0; i<h; i++) {
for(int j=0; j<w; j++) {
if... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 0 | 30,001,990 |
#include <iostream>
using namespace std;
int dfs(int n, int sum, int x){
int cnt = 0;
if(n == 0 && sum == 0) return 1;
if(n > 0){
for(int i = x;i <= 9; i++){
if(sum-i >= 0) cnt += dfs(n-1, sum-i, i+1);
}
}
return cnt;
}
int main(void){
int n, sum;
while(1){
... | #include <bits/stdc++.h>
#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)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string a, b;
cin >> a >>... | 0 | 80,491,564 |
#include<iostream>
using namespace std;
int main(void){
while(1){
int a;
int n;
int c=0;
cin>>a;
if(a==0)break;
int count=0;
for(n=1000-a;n!=0;c++){
if(n>=500)n-=500;
else if(n>=100)n-=100;
else if(n>=50)n-=50;
else if(n>=10)n-=10;
else if(n>=5)n-=5;
else... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int n = -1;
for(int i = 0; i < 1000000; i++){
if(N == i * (i - 1) / 2){
n = i;
break;
}
}
if(N == 1){
cout << "Yes" << endl;
cout << 2 << endl;
cout << 1 << " " <... | 0 | 65,839,388 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
rep(i,n) {
int ans = 1;
int y,m,d;
ci... | #include <iostream>
#include <cstdint>
using namespace std;
int main() {
auto log10 = [](uint64_t n) {
int log = 0;
while (10 <= n) {
++log;
n /= 10;
}
return log;
};
auto first = [](uint64_t n) {
int last = 0;
while (n) {
l... | 0 | 94,789,412 |
#include <cstdint>
#include <iostream>
using namespace std;
int main() {
int64_t X, Y;
cin >> X >> Y;
int64_t result = 0;
for (int64_t i = X; i <= Y; i*= 2) {
++result;
}
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans=0;
map<int,int>mp;
for(int i=0;i<n;i++){
int a;
cin >> a;
mp[a]++;
if(a>100000){
ans++;
}
}
for(int i=1;i<100001;i++){
if(mp.count(i)){
i... | 0 | 17,767,719 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | 0 | 63,243,650 |
#include <iostream>
using namespace std;
int main(void) {
int x, y;
while (1) {
cin >> x >> y;
if (x == 0 && y == 0) break;
cout << min(x, y) << ' ' << max(x, y) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
vector<P> per(n), cp(m);
for (int i = 0; i < n; i++)
cin >> per[i].first >> per[i].second;
for (int i = 0; i < m; i++)
cin >> cp[i].first >> cp[i].second;
for (int i = 0;... | 0 | 74,839,830 |
#include <iostream>
using namespace std;
int main()
{
int d, width;
int s = 0;
while(cin >> d){
width = d;
while(d<600){
s += width * (d*d);
d += width;
}
cout << s << endl;
s = 0;
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define ull unsigned long long int
#define endl "\n"
#define sz(c) (c).size()
#define sall(c) sort((c).begin(),(c).end())
#define rsall(c) sort((c).rbegin(),(c).rend())
#define rev(c) ... | 0 | 44,877,993 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.