code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#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>;
vector<int> rt[11];
int main() {
int n, m;
cin >> n >> m;
rep(i,m) {
int k;
cin >> k;
rep(j,k) {
int s;
cin >> s;
rt[i].push_b... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define popcnt __builtin_popcount
#define getBit(x, k) ((x >> k) & 1)
#define all(x) (x).begin(),(x).end()
const int N = 1000000;
const int mod = 1e9 ... | 0 | 4,261,531 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
long long ans = 1LL << 60;
for (int i = 0; i < (1 << N); ++i) {
bitset<15> bset(i);
int color = 0;
for (int j = 0; j < N; ++j) if (b... | 0 | 44,020,246 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int N, M;
cin >> N >> M;
vector <P> p(N);
rep(i,N) cin >> p[i].first >> p[i].second;
sort(all(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 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);
vector<int>cnt(N+1);
for(int i = 0; i < N; i++) {
cin >> A[i];
cnt[i+1... | 0 | 2,929,564 |
#include <stdio.h>
#include <string.h>
int main(){
int Kids, i=1, Candies=0;
scanf ("%d", &Kids);
while (i<=Kids){
Candies+=i;
i++;
}
printf("%d", Candies);
return 0;
} | #include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define mod 1000000007
#define sp fixed<<setprecision(12)
using namespace std;
int dp[101][100005];
int a[101];
void solve(){
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<=a[0];i++){
dp[0]... | 0 | 47,537,253 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,m;
cin >> n >> m;
priority_queue<ll> que;
rep(i,n){
ll a;
cin >> a;
que.push(a);
}
ll ans=0;
rep(i,m){
ll cp=que.top();
que.pop();
cp/=2;
que... | #include <stdio.h>
int main() {
int a, b, c, d;
scanf("%d %d", &a, &b);
if(a < 10) {
c = 100 * (10 - a);
d = b + c;
printf("%d", d);
} else {
printf("%d", b);
}
return 0;
} | 0 | 65,865,198 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep_rev(i, n) for (int i = n-1; i >= 0; --i)
#define all(x) (x).begin(),... | #include<iostream>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.length();
int count = 0;
int c_idx = 0;
bool con = false;
if (s[0] == 'A') {
for (int i = 1; i < len; i++) {
if (isupper(s[i])) {
count++;
if (s[i] == 'C' ... | 0 | 42,955,350 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,s,e) for(int i=s;i<e;i++)
#define endl '\n'
int main(){
string s,t;
cin>>s>>t;
bool flag=false;
for(int i=0;i<s.size();i++){
if(s==t)flag=true;
s=s.back()+s.substr(0,s.size()-1);
}
if(flag){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define ppp pop_back
#define fi first
#define se second
#define pii pair<int,int>
const int N = 1e5 + 5;
int a[N];
int b[500][N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r",... | 0 | 51,234,845 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | #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, d;
cin >> n >> d;
vector<vector<double>> x(n, vector<double>(d));
rep(i,n)rep(j,d) cin >> x[i][j];
int ans = 0;
for (int i = 0; i < n; i... | 0 | 62,910,035 |
#include<bits/stdc++.h>
using namespace std;
#define FastRead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl "\n"
#define sq(x) ((x)*(x))
#define pi acos(-1.0)
#define NUM 1000005
typedef long long ll;
int main()
{
FastRead
ll n, k,mx = -1, gcd;... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
vector<string> store;
int n, m;
int check(int x, int y, int k){
... | 0 | 80,796,498 |
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<=n;i+... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 | 77,775,226 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a... | #include <iostream>
#include <queue>
using namespace std;
int w, h, n;
char map[1024][1024];
int d[1024][1024];
const int direction[4][2] = {
{ -1, 0 },
{ 1, 0 },
{ 0, -1 },
{ 0, 1 },
};
int factory[16][2];
typedef pair<int, int> P;
int bfs(const int& sx, const int& sy, const int& gx, const int& gy)
{
for (int i =... | 0 | 74,010,017 |
#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 DFS(int n, int t) {
int tmp = 100000;
if (t<=5) {
rep(i, 9) {
int nxt = n-i*(pow(9, 6-t));
if (nxt<0) continue;
tmp = min(tmp, D... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, doubl... | 0 | 50,011,490 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = 0;
while (true) {
bool any = false;
for (int i = 0; i < n; i++) {
long long steps ... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 19,770,524 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | #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 | 51,347,453 |
#include "iostream"
#include "random"
#include "ctime"
#include "chrono"
#include "string"
#include "bitset"
#include "algorithm"
#include "map"
using namespace std;
int main() {
int N;
cin >> N;
while (N) {
vector<pair<string, string>>v(N);
for (int i = 0; i < N; i++) {
cin >> v[i].first >> v[i].second;
}
... | #include <bits/stdc++.h>
using namespace std;
int n , m , a , b , grid[2000][2000];
int main(){
cin >> n >> m >> a >> b;
for(int i = 1 ; i <= b ; i++){
for(int j = a + 1 ; j <= m ; j++){
grid[i][j] = 1;
}
}
for(int i = b + 1 ; i <= n ; i++){
for(int j = 1 ; j <= a ; j++){
grid[i][j] = 1;
}
}
for(int... | 0 | 54,103,656 |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
double x1,x2,y1,y2;
double d;
cin >> x1 >> y1 >> x2 >> y2;
d = (double)sqrt(((x2-x1)*(x2-x1))+((y2-y1)*(y2-y1)));
printf("%.6lf\n",d);
return 0;
} | #include <bits/stdc++.h>
const int MOD=1000000007;
const int INF=1000000000;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> P;
vector<int> d;
bool dpx[8005][20005];
bool dpy[8005][20005];
string s;
int x,y,j=0;
int tmp=0;
int main(void)
{
memset(dpx,fals... | 0 | 14,898,167 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i < n; i++)
#define REP(i, n, m) for(int i=n; i < m; i++)
#define reps(i, n) for(int i=1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
using namespace std;
using ll=lo... | #include<cstdio>
#include<cstring>
using namespace std;
#define M 1000000
#define L 12
char H[M][L];
int getChar(char ch){
if(ch=='A') return 1;
else if(ch=='C') return 2;
else if(ch=='G') return 3;
else if(ch=='T') return 4;
else return 0;
}
int getKey(char str[]){
int sum = 0, p=1, i;
for(i=0;i<strlen(str);... | 0 | 35,523,907 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 1; i <= (n); ++i)
using ll = long long;
using P = pair<int, int>;
ll ans;
int main() {
double n;
cin >> n;
rep (i, sqrt(n)){
if ((ll)n % i == 0) ans = (ll)n/i + i - 2;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
ll dx[4]={0,1,-1,0};
ll dy[4]={1,0,0,-1};
signed main(){
ios::sync... | 0 | 88,804,245 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | #include <bits/stdc++.h>
using namespace std;
#define DAMAGE 10000
#define N 1000
#define INF ((1<<31)-1)
int dp[N+1][DAMAGE+1];
int main(void){
int h, n;
cin >> h >> n;
int damage[N+1], cost[N+1];
for (int i = 1; i <= n; i++){
cin >> damage[i] >> cost[i];
}
for (int i = 0; i <= n; i++){... | 0 | 85,428,876 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<list>
#include<stack>
#include<algorithm>
#include<cmath>
#include<memory>
#include<string>
#include<map>
using namespace std;
int main()
{
string s;
string mxs;
int mxl = 0;
map<string, int> h;
int mxh = 0;
string mxhs;
while ... | #include<bits/stdc++.h>
using namespace std;
long long INF;
int main(){
long long h,w;
cin>>h>>w;
INF = w*h;
long long r[4];
for(int i=0; i<4; i++) r[i] = INF;
if(h%3) r[0] = w;
else r[0] = 0;
if(w%3) r[1] = h;
else r[1] = 0;
for(int i=1; i<h; i++){
long long div1 = i*w;
long long div2 = (h-i)*w;
long l... | 0 | 23,986,914 |
#include <stdio.h>
int main(void){
int N;
scanf("%d",&N);
printf("%d\n",N*800-200*(N/15));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll N; cin >> N;
vector<ll> a(N, 0);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<ll> o;
vector<ll> e;
for (int i = 0; i < N; ++i) {
... | 0 | 27,525,874 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k,x,y,s;
cin>>n>>k>>x>>y;
if(n>k){x=k*x;}
else{x=n*x; }
if(n>k){y=(n-k)*y;}
else{y=0; }
s=x+y;
cout<<s<<endl;
return 0;
} | #include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <set>
#include <utility>
#include <cstdlib>
#include <queue>
#include <iomanip>
#include <cstdio>
using namespace std;
int vis[50][100010];
int n;
void dfs(int rem, int dist){
if(dist > 45) retu... | 0 | 75,918,790 |
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pi 2*acos(0.0)
#define eps 1e-9
const int N = 1e7+1;
bool isprime[N];
void sieve()
{
memset(isprime,true,sizeof(isprime));
isprime[0]=isprime[1]=false;
for(ll i=2; i*i<=N; i++)
{
if(isprime[i])
{
for(l... | 0 | 82,509,225 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
const int maxn = 205;
int deg[5];
signed main(void){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int M = 3;
while (M--){
int u, v;
cin >> u >> v;
deg[u]++;... | #include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
#define repu(i,k,n) for(int i=k;i<=n;i++)
#define repd(i,k,n) for(in... | 0 | 4,539,938 |
#include<bits/stdc++.h>
using namespace std;
using Long = long long;
using pii = pair<int,int>;
#define ff first
#define ss second
int h , w , m;
map<int,int> H , W;
multiset<pii> S;
int main(){
scanf("%d %d %d",&h,&w,&m);
int x , y;
int mx = 0 , my = 0;
for( int i = 0 ; i < m ; ++i ){
scanf("%d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define all(v) v.begin(),v.end()
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
const int N = 1... | 0 | 44,922,178 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | #include <iostream>
#include <iterator>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <numeric>
#include <iomanip>
#include <limits>
#include <set>
#include <map>
#include <type_traits>
#include <cstdint>
#include <queue>
#define _USE_MATH_DEFINES
#include <math.h... | 0 | 81,471,016 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str; cin >> str;
for (int i = 0; i < str.length() - 1; i++) {
if (str[i] == str[i + 1]) {
cout << i + 1 << " " << i + 2 << "\n";
return 0;
}
if (i + 2 >= str.length()) continue;
if (str[i] == str[i + 2]) {
cout << i + 1 << " " << i + 3... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <random>
#include <iomanip>... | 0 | 27,384,729 |
#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... | #include <iostream>
#include <queue>
#include <vector>
const int Max = 100;
int map[Max + 1][Max + 1];
typedef struct{
bool startflag;
int distance;
}State;
int main()
{
int n, k, l, temp;
std::queue<int> q;
std::vector<State> state;
for (int i = 1; i < Max + 1; i++){
for (int j = 1; j < Max + 1; j++){
map[i... | 0 | 58,672,382 |
#include <bits/stdc++.h>
#include <vector>
#include <string.h>
typedef long long ll;
typedef long double lg;
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a > 8 || b>8)
cout<<":("<<endl;
else
cout<<"Yay!"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | 0 | 48,451,544 |
#include<iostream>
int n,k;main(){std::cin>>n>>k;std::cout<<(n-2)/(k-1)+1;} | #include <iostream>
#include <algorithm>
using namespace std;
const int MAX = 101;
const int INF = 1<<28;
int main()
{
int n,cost[MAX][MAX],a,b,c;
while (cin >> n, n) {
fill(cost[0], cost[MAX], INF);
int M = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
cost[a][b] = cost[b][a] = c;
M = ... | 0 | 61,970,262 |
#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>;
const int INF = 1000000001;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i... | #include <iostream>
#include <cstdio>
#include <set>
using namespace std;
int main(){
long long n, m;
cin >> n >> m;
multiset<long long> s;
for(long long i = 0; i < n; i++){
long long a;
cin >> a;
s.insert(a);
}
multiset<long long>::iterator it;
for(long long i = 0; i... | 0 | 42,628,618 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
const int p = 26;
vector<vector<int>> num(n, vector<int>(p, 0));
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size(); j++) {
num[i][s[i][j] - 'a']++;
}
}
vector<i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll f(ll A) {
A++;
ll res = 0;
for (ll i = 0; i < 41; i++) {
ll loop_cnt = 1LL << (i + 1);
ll one... | 0 | 87,244,059 |
#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<tuple>
#include<list>
#include<unordered_map>
#include<ra... | #include<bits/stdc++.h>
using namespace std;
#define ms(x,y) memset(x, y, sizeof(x))
#define lowbit(x) ((x)&(-x))
#define sqr(x) ((x)*(x))
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
void run_case() {
LL n; cin >> n;
LL x = n+1, y = n+1;
for(LL i = 1; i*i <= n; ++i) {
i... | 0 | 30,607,501 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mod 1000000007
const int N=101;
const int K=100001;
ll dp[N][K];
int main()
{
ll n,k;
cin>>n>>k;
vector<ll> a(n);
for(int i=0;i<n;i++)
cin>>a[i];
dp[0][0]=1;
for(int i=1;i<=n;i++)
{
for(int j=0;j<=k;... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define... | 0 | 38,297,487 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll A[100005];
ll L[100005];
ll R[100005];
int main() {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
#define rep(i, n) for(int i=0; i<n; ++i)
#define REP(i, n) for(int i=1; i<=n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using P = pair<int, int>;
const int inf = 1e9;
const ll INF = 1e18;
const ll MOD = 1e9+7;
int main(){
... | 0 | 49,400,647 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> u;
for(int i = 0; i < n; i++) {
int ui;
cin >> ui;
u.push_back(ui);
}
sort(u.begin(), u.end())... | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<map>
using namespace std;
int main() {
long long MOD = 1000000007;
int N; cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
long long ans = 0;
long long pow = 1;
for (int bit = 0; bit <... | 0 | 78,856,520 |
#include<iostream>
using namespace std;
int main(){
int n;
int d[1001][11][21];
int i,j,k,l;
l = 0;
for(i = 1;i < 1001;i++){
for(j = 1;j < 11;j++){
for(k = 1;k < 21;k++){
if((!(j%2))&&(i%3)){
if(k == 20) continue;
}
... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <set>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;... | 0 | 49,636,825 |
#include <bits/stdc++.h>
const int N=100005;
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
ll n;
vector<ll>ans(N,0);
vector<pii>ar;
int main()
{ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
int x;cin>>x;ar.push_back({x,-i});
}
sort(ar.b... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
const int mod = 1e9+7;
typedef long long LL;
typedef vector<int> vi; ... | 0 | 57,647,926 |
#include<iostream>
#include<string>
using namespace std;
int a[5000000];
int first=0,last=0;
int n,m,q;
string w;
void insert(){
a[last]=n;
last++;
}
void deleteFirst(){
last--;
}
void deleteLast(){
first++;
}
void _delete(){
for(int k=last-1;k>=first;k--){
if(a[k]==n){
m=k;
for(int k=m;k<last-1;k++){
... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
string find(int n)
{
string ans="";
while(n>0)
{
ans+=n%10+'0';
n/=10;
}
int... | 0 | 99,301,036 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define all(x) (x).begin(),(x).end()
int main() {
int n;
cin>>n;
vector <int> a(n);
int t[n];
rep(i,n){
cin>>a[i];
}
vector<int> rev(n);
for(int i=0;i<n;i++)rev[a[i]-1]=i+1;
for(int... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int A,B,M;cin >>A>>B>>M;
vector<int>a(A);
int mina=INF;
int minb=INF;
... | 0 | 81,934,353 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
vector<int> a(3);
cin>>a[0]>>a[1]>>a[2];
sort(a.begin... | #include<iostream>
#include<queue>
#include<vector>
using namespace std;
const int N = 100005, M = 500005;
const int Inf = 0x3f3f3f3f;
int End[M], Last[M], Next[M], Path[N], dis[N];
bool Vis[N];
struct P{
int x, step;
};
queue<P> Q;
void add_edge(int &cnt, int x, int y) {
++cnt;
End[cnt] = y, Next[cnt] = La... | 0 | 16,342,294 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX = 1ll << 62;
int main(){
int N, K;
cin >> N >> K;
vector<ll> x(N);
vector<ll> y(N);
for(int i = 0; i < N; i++){
cin >> x[i] >> y[i];
}
ll x1, x2, y1, y2;
ll s = MAX;
for(int i = 0; i < N - 1; i++){
x1 = x[i];
f... | #include<iostream>
#include<algorithm>
int ride2(int n){return n*n;}
using namespace std;
int main(){
int a[3],n;
cin>>n;
while(n--){
for(int i=0;i<3;i++)cin>>a[i];
sort(a,a+3);
if(ride2(a[0])+ride2(a[1])==ride2(a[2]))
cout<<"YES"<<endl;
else cout<<"NO"<<endl;
... | 0 | 69,637,958 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
int main(){
vector<ll> time;
ll tmp;
ll mamr=9;
ll amr=0;
ll min=0;
rep(i,5){
cin>>tmp;
time.push_back(tmp);
amr = tmp%10;
if(am... | 0 | 40,912,006 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | #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 | 31,257,461 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
int main(){
int num,n_min,n_max,div,div_max,ans,pre,tmp;
while(true){
scanf("%d %d %d",&num,&n_min,&n_max);
if(num == 0 && n_min == 0 && n_max == 0)break;
div_max = -1;
for(int i = 1; i <= num; i++){
scanf("%... | #include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define re... | 0 | 91,055,965 |
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
int cou... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | 0 | 74,822,284 |
#include <bits/stdc++.h>
using namespace std;
string s[301];
signed main () {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i];
int ans = 0;
for (int iter = 0; iter < n; ++iter) {
for (int i = 0; i < n; ++i)
rotate(s[i].begin(), s[i].begin() + 1, s[i].end());
... | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <set>
#include <stdio.h>
#include <math.h>
#include <queue>
using namespace std;
typedef long long int lli;
const long long int MaxN=500005;
const lli mod=1e9+7;
#define fst first
#define snd second
#define mp make_pair
const float pi=3.... | 0 | 71,097,655 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(20) << fpv << endl;... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 | 2,302,539 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
char a, b;
cin >> a >> b;
char ans;
if (a == b)
{
ans = 'H';
}
else
... | #include <bits/stdc++.h>
using namespace std;
long N, ans;
string S;
int main(void) {
cin >> N >> S;
for (long pin = 0; pin <= 999; pin++) {
long x, y, z;
z = pin % 10;
y = ((pin - z) % 100) / 10;
x = (pin - 10*y - z) / 100;
bool f, g, h;
f = g = h = false;
... | 0 | 16,225,096 |
#include <stdio.h>
#include <string.h>
int main(){
char a[15];
char b[15];
char c [15];
scanf("%s%s%s", a,b,c);
int d= strlen(a)-1;
int e = strlen(b)-1;
if (a[d]==b[0] && b[e]==c[0]){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
for(int i = S.size() - 1; i > 0; --i) {
if (i % 2 != 0) {
continue;
} else {
string s_l, s_r;
s_l = S.substr(0, i / 2);
... | 0 | 90,611,108 |
#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;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = ... | 0 | 80,048,125 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#defin... | 0 | 54,551,239 |
#include <iostream>
int main() {
uint32_t N = 0, A = 0, B = 0;
std::cin >> N >> A >> B;
std::cout << ((B - A - 1) % 2 == 1 ? "Alice" : "Borys") << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define double double double
#define ulong unsigned long long
#define ii pair<int, int>
#define ll pair<long long, long long>
#define ar array
#define f first
#define s second
long lcm(long a, long b) {
return (a*b)/__gcd(a, b);
}
void solve() {
... | 0 | 92,406,540 |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int A[N+1];
for(int i = 1; i <= N; i++) cin >> A[i];
int res = 0;
for(int i = 1; i < N; i++)
{
if(A[i] == A[i+1])
{
A[i+1] = -1;
res++;
}
}
cout << res << '\n';
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
void solve(){
ll n,k;
cin >> n >> k;
vector<ll> x,y;
rep(i,n){
ll p,q;
cin >> p >> q;
x.emplace... | 0 | 23,183,960 |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define Endl endl
#define int long long
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
bool cmps(pair<int,int>p1,pair<int,int>p2) {
return p1.ss<p2.ss;
}
int lcm(int a, ... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstr... | 0 | 13,528,436 |
#include <iostream>
#include <cstdlib>
struct Node {
int value;
struct Node *next;
struct Node *prev;
};
void insert(struct Node *dummy, int x) {
struct Node *newNode = (struct Node *) malloc(sizeof(struct Node));
newNode->value = x;
newNode->prev = dummy;
newNode->next = dummy->next;
dummy->next->prev ... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return ... | 0 | 52,450,785 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define DEBUG2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<... | #include <string>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;
int main(){
int a, b, k; cin >> a >> b >> k;
int cnt = k;
while(true){
a /= 2;
b += a;
cnt -= 1;
if(cnt == 0){break;}
b /= 2;
a += b;
... | 0 | 65,790,008 |
#include <cstdio>
#define PRINCIPAL 100000
#define RATE 1.05
#define ROUND_UNIT 1000
int main(void)
{
int n;
unsigned long debt = PRINCIPAL;
std::scanf("%d\n", &n);
for (int i = 0; i < n; i++) {
debt = debt * RATE;
debt = (debt + (ROUND_UNIT - 1)) / ROUND_UNIT * ROUND_UNIT;
}
std::printf("%lu\n", de... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;... | 0 | 72,678,131 |
#include<stdio.h>
int main(){
int a, b;
scanf("%d %d", &a, &b);
char s[a+b+3];
int n=a+b+1;
scanf("%s", s);
int ctrnum=0, ctrh=0;
for(int i=0; i<n; i++){
if(s[i]>='0'&&s[i]<='9'){
ctrnum++;
}
if(s[i]=='-'){
ctrh++;
}
}
if(ctrnum>=2 && s[a]=='-' && ctrh==1){
printf("Yes\n");
}
else{
printf("... | #include<stdio.h>
int main()
{
int i,n;
long int h;
scanf("%ld",&h);
scanf("%d",&n);
int a[n],s=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
if(h>s)
printf("No");
else
printf("Yes");
return 0;
} | 0 | 88,711,087 |
#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wunused-variable"
#define REP(i,n) for ( int i=0; i<int(n); i++ )
using namespace std;
const int N=1e5+5;
int main() {
int n,p;
cin >> n >> p;
vector<long long> dp(2);
dp[0]=1;
REP(i,n) {
int a;
cin >> a;
vector<long l... | #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... | 0 | 24,471,791 |
#include<iostream>
#include<cstdlib>
using namespace std;
int main()
{
long long N;
long long Sum_t[200000]={0};
cin>>N;
cin>>Sum_t[0];
for(int i=1;i<N;i++)
{
cin>>Sum_t[i];
Sum_t[i]=Sum_t[i-1]+Sum_t[i];
}
long long min=abs(Sum_t[N-1]-2*... | #include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#define syosu(x) fixed<<setprecision(x)
using name... | 0 | 28,914,214 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define vll vector... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 95,769,807 |
#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>;
void solve() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
rep(i, 1000) {
int c[3] = {i / 100, (i / 10) % 10, i % 10};
int f = 0;
rep(j... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();... | 0 | 19,979,639 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | #include<bits/stdc++.h>
using namespace std;
int k, a, b;
int main()
{
cin >> k;
cin >> a >> b;
if(a%k==0)
cout << "OK" << endl;
else{
if((a/k+1)*k<=b)
cout << "OK" <<endl;
else
cout << "NG" << endl;
}
return 0;
} | 0 | 88,834,609 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n;
cin>>n;
vector<int> h(n+10,0);
vector<int> a(n... | 0 | 95,888,648 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
c=a%500;
if(c>b)
cout<<"No";
else
{
cout<<"Yes";
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
int main(){
int k, s;
cin... | 0 | 31,755,090 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string ABCD;
cin >> ABCD;
vector<char> op(3);
for (int i = 0; i < (1 << 3); i++) {
int tmp = ABCD.at(0) - '0';
for (int j=0; j<3; j++){
if (i & 1<<j) {
tmp += ABCD.at(j+1) - '0';
op.at(j) = '+';
}
else {
... | #include <iostream>
using namespace std;
int main() {
string in;
int alp[26]={},i;
while (cin>>in) {
for (i=0;i<in.size();i++) {
if ('a' <= in[i] && in[i] <= 'z') alp[in[i]-'a']++;
if ('A' <= in[i] && in[i] <= 'Z') alp[in[i]-'A']++;
}
}
for (i=0;i<26;i++) {
... | 0 | 54,647,058 |
#include <iostream>
#include <utility>
#include <set>
using namespace std ;
int main(){
int n ; cin >> n ;
set<pair<int,int>> s ;
int ans = 0 ;
for(int i=1;i<=n;i++){
int a ; cin >> a ;
int b ;
if(a>i){
b = a ;
a = i ;
}else{
b = i ;
}
pair<int,int> sub = make_pair(a,b) ;
if(s.count(sub)) ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K,A,B;
cin >> K;
cin >> A >> B;
for(int i=A;i<B+1;i++) {
if(i%K==0) {
cout << "OK" << endl;
exit(0);
}
}
cout << "NG" << endl;
} | 0 | 9,213,467 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> x(n);
for(int i = 0; i < n; i++) cin >> x.at(i).first >> x.at(i).second;
sort(x.begin(), x.end());
ll ans = 4e18 + 1;
for(int i = 0; i... | 0 | 66,236,188 |
#include <bits/stdc++.h>
using namespace std;
signed main(){
int n , k , kind=0 , a , ans = 0;
int num[200005];
cin >> n >> k;
for(int i=0 ;i<=n ;i++ ){
num[i] = n+1;
}
for(int i=0 ;i<n ;i++ ){
cin >> a;
if(num[a] == n+1){
kind++;
num[a] = 1;
... | #include <bits/stdc++.h>
using namespace std;
int n;
typedef vector<int> vi;
typedef vector<vi> vii;
#define rep(i, k, n) for (int i = k; i < (int)(n); i++)
int main()
{
cin >> n;
vii hs(n, vi(3));
rep(i, 0, n)
{
cin >> hs[i][0] >> hs[i][1] >> hs[i][2];
}
vii dp(n, vi(3));
dp[0][0] =... | 0 | 47,428,660 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll ans = (N / (A + B)) * A + min(A, N % (A + B));
cout << ans << endl;
} | #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 | 78,154,811 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;cin>>n;
vector<ll> a(n),b(n);
for(int i=0;i<n;i++) cin>>a[i]>>b[i];
ll ans=0;
for(int i=n-1;i>=0;i--) {
a[i] += ans;
a[i] %= b[i];
if(a[i])
ans += b[i]-a[i];
}
cout<<ans... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 | 17,781,704 |
#include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
if (s.size() <=3) {
std::cout << "No" << std::endl;
} else {
if (s[0] == 'Y' && s[1] == 'A' && s[2] == 'K' && s[3] == 'I') {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 94,107,876 |
#include <iostream>
#include <cmath>
#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>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | 0 | 2,028,035 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int n, u, v, maxi, cnt[N];
bool mark[N];
queue<int> q;
set<int> nei[N];
void add(int v) {
for (int u: nei[v])
maxi = max(maxi, ++cnt[u]);
}
bool ok(int v) {
return nei[v].size() == 1;
}
void check(int v) {
int u = *nei[v].begin();
for (int w: ... | #include<iostream>
using namespace std;
int main(){
int n[101] = {0}, temp, max = -1;
while(cin >>temp){
n[temp]++;
if(n[temp] > max) max = n[temp];
}
for(int i = 1; i <= 100; i++){
if(n[i] >= max) cout <<i <<endl;
}
return 0;
} | 0 | 29,918,721 |
#include <iostream>
using namespace std;
using ll = long long;
int main(){
ll x,y;
cin >> x >> y;
ll ans;
if((x>0 && y<0)||(x<0 && y>0)){
ans = abs(abs(y)-abs(x))+1;
}else if(y == 0){
if(x<0) ans = abs(x);
else ans = x+1;
}else if(x == 0){
if(y<0) ans = abs(y)+1;
else ans = y;
}else if... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 2,573,722 |
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A <= C && C <= B ? "Yes" : "No") << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <set>
#include <cmath>
using namespace std;
int main(){
int W, H;
cin >> W >> H;
vector<pair<int, int>> pq;
for(int i=0; i<W; i++){
int p;
cin >> p;
pq.push_back(... | 0 | 63,840,653 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,K;
cin>>N>>K;
if(N*500>=K){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | 0 | 86,046,630 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int ans = 1e9;
for (int i = -100; i <= 100; ++i) {
int subans = 0;
for (int j = 0; j < N; ++j) {
subans += (A[j] - i)*(A[j] - i);
}
ans = min(ans, subans);
}
co... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using Graph=vector<vector<int>>;
vector<int> cnt;
void dfs(Graph& G, int v, int p){
for(auto nv:G[v]){
if(nv==p) continue;
cnt[nv]+=cnt[v];
dfs(G,nv,v);
}
}
int main(){
int n,q;
cin>>n>>q;
Graph G(n)... | 0 | 59,197,435 |
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 | 79,188,111 |
#pragma gcc optimize("Ofast")
#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 ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(ALL(V))
#define RSORT(V) SORT(V);REV(V)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x,y,z,k;cin>>x>>y>>z>>k;
ll a[x],b[y],c[z];
for (int i=0;i<x;i++)
cin>>a[i];
for (int i=0;i<y;i++)
cin>>b[i];
for (int i=0;i<z;i++)
cin>>c[i];
vector<ll> d,e;
for (int i=0;i<x;i++)
... | 0 | 43,286,900 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector <int>
#define vl vector <ll>
#define all(v) (v).begin(),(v).end()
#define pb push_back
ll power(ll a, ll b){
ll res=1;
while(b>0){
if(b&1){res=(res*a);b--;}
a=(a*a);
b>... | #include<bits/stdc++.h>
#define int long long
#define double long double
#define pb emplace_back
#define pf emplace_front
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#de... | 0 | 34,788,688 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,t; cin>>s>>t;
int n1=s.length(),n2=t.length();
if(n2!=(n1+1)) { cout<<"No"<<endl; return 0;}
for(int i=0;i<n1;i++) if(s[i]!=t[i]) { cout<<"No"<<endl; return 0;}
cout<<"Yes"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).beg... | 0 | 46,579,823 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
int i,j,k;
main()
{
int n,k;cin>>n>>k;int a[n];
int b[n],c[n]={0};
for(i=1;i<=n;i++)
{
cin>>a[i];
b[i]=a[i];
c[i]=i;
}
sort(b+1,b+n+1);
vector<int> ans;
for(i=1;i<n;i++)
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 39,846,668 |
#include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES"... | #include <bits/stdc++.h>
using namespace std;
bool Grid[55][55];
int main()
{
int h, w;
cin >> h >> w;
for (int i = 1; i <= h; i++)
{
for (int j = 1; j <= w; j++)
{
char c;
cin >> c;
Grid[i][j] = c == '#';
}
}
for (int i = 1; i <= h; i++)
{
for (int j = 1; j <= w; j++)
... | 0 | 8,087,699 |
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main(void) {
string str;
char letter;
getline(cin, str);
for(int i = 0; i < str.length(); ++i) {
letter = str[i];
if(islower(letter)) str[i] = toupper(letter);
else if(isupper(letter)) str[i] = t... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n+5];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int gcd=arr[0];
for(int i=1;i<n;i++)
{
gcd=__gcd(gcd,arr[i]);
}
cout<<gcd<<endl;
return 0;
} | 0 | 79,570,837 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b ;
if (a % 2 == 1 && b % 2 == 1) cout << "Odd" << endl;
else cout << "Even" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int64_t> A(N),B(N);
int64_t sumA=0;
int64_t sumB=0;
for(int i=0;i<N;i++){
cin >> A.at(i);
sumA+=A.at(i);
}
for(int i=0;i<N;i++){
cin >> B.at(i);
sumB+=B.at(i);
}
if(sumA<sumB){
cout << -1 << endl;
... | 0 | 42,342,267 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int i, n, a, b, c, x, y, ans;
vector<int> data;
while(1){
cin >> n >> a >> b >> c >> x;
if(n == 0 && a == 0 && b == 0 && c == 0 && x == 0) break;
for(i=0; i<n; ++i){
cin >> y;
data.push_back(y);
}
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 0 | 32,154,183 |
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | #include<bits/stdc++.h>
using namespace std;
#define il inline
#define ll long long
#define no {cout<<"UNRESTORABLE";return 0;}
il int in(){
int s=0;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')return -in();c=getchar();}
while(c>='0'&&c<='9'){s=(s<<1)+(s<<3)+(c^48);c=getchar();}
return s;
}
int main(){
string s... | 0 | 13,019,388 |
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
long double T, X;
cin >> T >> X;
printf("%.10Lf\n", T / X);
return 0;
} | #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() {
string s;
cin >> s;
if (s.size() < 26) {
map<char, int> mp;
rep(i, s.size()) mp[s[i]]++;
for (char c = 'a'; c <= 'z'; c++) {
if (mp[c] == 0) {
... | 0 | 2,233,716 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
if(s.size()<=20){
for(int i=s.size();i--;){
cout << s[i];
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
const int INF = 1e9;
const ll INFLL = 1e18;
const int MOD = 1e9 + 7;
const int NIL = -1;
const ld PI = acosl(-1);
#define rep(i,n) for(int i=0; i<(n); ++i... | 0 | 4,509,135 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define P pair<ll,ll>
#define fs first
#define sc second
template<clas... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | 0 | 98,076,670 |
#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;
scanf("%d", &n);
int l = 0, r = n;
printf("%d\n", l);
fflush(stdout);
string sl;
cin >> sl;
while (sl != "Vacant") {
int m = (l + r) / 2;
... | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define e "\n"
#define MaRiaMa { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
#define fix(n) cout << fixed << setprecision(n);
using namespace std;
int main()
{
MaRiaMa;
int a, b, x;
cin >> a >> b >> x;
if (((a -x) <= 0)&&(x-a)-b<=0)
cout... | 0 | 35,139,825 |
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MAX 2000005
#define MOD 1000000007
#define MOD2 998244353
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<ll>
#define vp vector<pii>
#define all(v) v.begin(),v.end()
#define sz(x) (ll)x.... | #include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
bool cmp_f(const pair<LL, LL> &x, const pair<LL, LL> &y)
{
return x.first < y.first;
}
bool cmp_s(const pair<LL, LL> &x, const pair<LL, LL> &y)
{
return x.second > y.second;
}
int main() {
LL n;
LL a;
... | 0 | 68,086,424 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#inc... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
templat... | 0 | 80,204,962 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int x[5];
vector<int> y;
int s = 0;
cin >> x[0] >> x[1] >> x[2] >> x[3] >> x[4];
for (int i = 0; i < 5; ++i) {
s += (x[i] / 10) * 10;
if (x[i] % 10 != 0) {
y.push_back(x[i] % 10);
}
}
if (y.size(... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 59,725,796 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int main(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int ... | 0 | 61,933,915 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#d... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#d... | 0 | 42,731,866 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
vector<string> s(H);
for (int i = 0; i < H; i++) {
cin >> s[i];
}
int ans = 0;
for (int is = 0; is < 1 << H; is++) {
for (int js = 0; js < 1 << W; js++) {
int cnt = 0;
for (int i = 0;... | #include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
using... | 0 | 35,253,319 |
#include<iostream>
using namespace std;
int main()
{
int n;
int input = 0;
int ansmin = 0;
int ansmax = 0;
long long anssum = 0;
cin >> n;
for (int cnt = 0; cnt < n; cnt++)
{
cin >> input;
if (cnt == 0)
{
ansmin = input;
ansmax = input;
}
if (input < ansmin)
{
ansmin = input;
}
else if ... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
#include<map>
#include<iostream>
#include <cstring>
#include <iomanip>
#include <algorithm>
#define forr(i,a,b) for(int i=a;i<=b;i++)
#define F first
#define S second
#define input ios_base::sync_with_stdio(0);cin.tie(0);
const double PI = acos(-1.0);
using namespace ... | 0 | 4,152,563 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.