code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
ll n, m;
ll a[2005], b[2005];
ll dp[2005][2005], sum[2005][2005];
int main() {
cin.tie(0);
cou... | 0 | 62,761,890 |
#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 ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int dp[n],x=0;
dp[0]=0;
for(int i=1;i<n;i++)
{
if(i==1)
{
dp[i]=abs(a[i-1]-a[i]);
}
else
{
... | 0 | 67,641,065 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin>>s;
int g=0;
int f=0;
int h=0;
if(s[0]=='A'){
g=1;
}
for(int i=0;i<s.length();i++){
if(s[i]>=92){
h++;
}
}
for(int i=2;i<s.length()-1;i++){
if(s[i]=='C'){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin>>a>>b;
if (a == 1 && b == 1) {
cout<<"1 2"<<endl;
cout<<"#."<<endl;
return 0;
}
if (a == 1 || b == 1) {
cout<<"50 100"<<endl;
} else {
cout<<"100 100"<<endl;
}
if (a > 1) {
--b;
for (int i=0; i<50; i++) ... | 0 | 27,309,183 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string> ... | #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()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 0 | 53,126,597 |
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main()
{
string s;
getline(cin, s);
for (unsigned int i = 0; i < s.length(); ++i) {
if (isupper(s[i]))
s[i] = tolower(s[i]);
else if (islower(s[i]))
s[i] = toupper(s[i]);
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <s... | 0 | 42,707,657 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | #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>
#include <cctype>
#in... | 0 | 63,373,239 |
#include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
typedef std::bitset<6> bit;
int main(){
int N,M,ans=0;
cin>>N>>M;
vector<int> H(N),Hmax(N);
for(int i=0;i<N;i++){
cin>>H.at(i);
Hmax.at(i)=0;
}
int a,b;
for(int i=0;i<M;i++){
cin>>a>>b;
Hmax.at(a-1)=max(Hmax.at(a-1),H.at(b-1)... | #include <bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define pb push_back
#define si second
#define int long long
#define mod 1000000007
#define debug(x) cout << #x << " " << x <<endl;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define double long double
#define all(o) ... | 0 | 79,407,503 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namesp... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
using namespace std;
long long int num[2000000]={};
int main() {
const long long int mod = 1000000007,INF=50... | 0 | 11,805,698 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
typedef long long ll;
... | 0 | 84,847,621 |
#include<iostream>
#include<string>
#include<cstdint>
#include<alloca.h>
int64_t const MOD = 1e9+7;
std::string L;
int64_t const tbl[] = {1, 3, 5, 9, 11, 15, 19, 27, 29, 33, 37, 45, 49, 57, 65, 81};
int to_num(int k, char const* p) {
int res = 0;
while(--k>=0) { res = res*2 + (*p++ - '0'); }
return res;
}
bool is... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp, vector<Q_temp>, greater<Q_temp>>;
const ll MOD = (ll)(1e9 + 7);
const int INF = (int)1e9;
const ll... | 0 | 36,532,488 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
deque<char> list;
string str, fin="";
cin >> str;
long long num=str.length(), sze;
char chr;
for (long long i=0; i<num; i++) {
chr=str[i];
sze=list.size();
if (chr... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
int n,sum;
cin>>n;
for(int i=0;i<n;i++){
sum=0;
for(int k=0;k<2;k++){
cin>>s;
for(int j=0;j<s.size();j++){
switch(s[j]){
case 'm':
if(s[max(0,j-1)]>='2'&&s[max(0,j-1)]<='9') sum+=(s[j-1]-'0')*1000;
else sum+=1000;
... | 0 | 2,577,462 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
ll n;
cin>>n;
ll ans=0;
for (ll i = 1; i < n; ++i)
{
ans+=n/i;
if (n%i==0) ans--;
}
cout<<ans<<endl;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | 0 | 43,594,722 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
cout << (a == b && b == c ? "Yes" : "No");
return 0;
} | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a... | 0 | 59,835,890 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long l;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n,m,p[100000];
char s[100000],h[100001];
cin>>n>>m;
if(n == 99999 && m == 99999)
{
cout<<99999<<" "<<0;
exit(0... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<fstream>
#define MOD (1000000007)
using namespace std;
typedef long long ... | 0 | 69,005,197 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
const int INF (1<<28);
const int MAX_M = 20;
const int MAX_N = 50000;
int COINS[MAX_M+1];
int CNTS[MAX_M+1][MAX_N+1];
int main() {
int n, m; cin >> n >> m;
for (int i = 1; i <= m; i++)
cin >> COINS[i];
memset(CNTS, 0, sizeof(CNTS... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vecto... | 0 | 69,116,614 |
#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 long long mod = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
string ans = "";
ans += s[0];
rep(i, n - 1) {
if(s[i] == s[i + 1])
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
using LL = long long;
const LL MOD = 1e9+7;
int N;
int A[114514];
int T[114514];
int L[114514];
int R[114514];
int main() {
scanf("%d", &N);
rep(i, N) {
scanf("%d", &T[i+1]);
}
rep(i, N) {
scanf("%d", &A[i+1])... | 0 | 20,070,975 |
#include <bits/stdc++.h>
int main(int, char**) {
char c;
std::cin >> c;
if (c=='a' || c=='i' || c=='u'||c=='e'||c=='o') {
std::cout << "vowel" << std::endl;
} else {
std::cout << "consonant" << std::endl;
}
return 0;
} | #include <algorithm>
#include <string>
#include <iostream>
using namespace std;
int main() {
int q, a, b;
string s, p, i;
cin >> s >> q;
while (q --> 0) {
cin >> i >> a >> b;
if (i == "replace") {
cin >> p;
s = s.replace(a, b - a + 1, p);
} else if (i == "reverse") {
reverse(s.begi... | 0 | 88,175,732 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
string s;
cin >> s;
reverse(s.begin(), s.end());
int cnt = s.size();
int i=0;
while(cnt){
if(s.substr(i,7)=="remaerd"){
i += 7;
if(cnt==i){
puts("YES");
retur... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
scanf("%d", &n);
vector<int> v(n);
rep(i, n) {
scanf("%d", &v[i]);
}
sort(v.rbegin(), v.rend());
double ans;
rep(i, n) {
if (i != n-1) ans += v[i] / pow(2, i+1)... | 0 | 22,446,921 |
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<string>
#include<algorithm>
#include<cmath>
#include<numeric>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
t... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
#define task "tst"
using namespace std;
const ll N = 3e5 + 9;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;
ll x,y,a,b,c,R[N],G[N],C[N],i,j;
vector<ll> res;
bool lf(ll x,ll y){
return x > y;
}
int main(){
io... | 0 | 7,541,621 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include <string>
using namespace std;
int c,g;
int hcount(int n,int sum,int bf){
if(n==0){
if(sum==g){
c++;
}
}
else{
for(int i=bf+1;i<10;i++){
hcount(n-1,sum+i,i);
}
}
return 0;
}
int main(){
int n;
while( scanf("%d %d",&n,&g)!=EOF){
if(n==0&... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <locale>
static bool readLines(std::string &str)
{
std::string tmp;
if (0x00 == &str) {
return false;
}
while (std::getline(std::cin, tmp)) {
if (0 < tmp.size()) {
transform(tmp.begin(), tmp.end(), tmp.begin(), tolower);
... | 0 | 41,641,503 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long int
const int mod = 1000000007;
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
vector<int>adj[200005];
bool vi... | 0 | 87,746,559 |
#include<string>
#include<iostream>
using namespace std;
int main()
{
string s;
cin>>s;
int ans=0;
int i;
int len=s.length()-2;
for(i=0;i<=len;i++)
{
if(s[i]!=s[i+1]) ans++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int f(int x) {
int res = 0;
while (x % 2 == 0) {
++res;
x /= 2;
}
return res;
}
ll gcd(ll a, ll b) {
if (a % b == 0) return b;
return gcd(b, a % b);
}
ll... | 0 | 56,519,021 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | #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 = 1000000007;
c... | 0 | 2,288,532 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
int main() {
int N ,K;
cin >> N >>K;
vector<int>A(N+1, 0);
set<int>XA;
rep(i, 0, N){
int index = 0;
ci... | 0 | 98,407,485 |
#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_c... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
int main()
{
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> V;
if (s[0] == '0') V.push_back(0);
char lastCh = s[0];
int cnt = 1;
if (s.size() == 1) V.push_back(1)... | 0 | 17,239,929 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0; i<(ll)n; i++)
#define REPR(i, n) for(ll i=(ll)n-1; i>=0; i--)
#define FOR(i, m, n) for(ll i=(ll)m; i<(ll)n; i++)
#define FORR(i, m, n) for(ll i=(ll)m-1; i>=(ll)n; i--)
#define ALL(x) (x).begin(), (x).end()
#define ASC(v) s... | #include <bits/stdc++.h>
using namespace std;
std::vector<long long int> v;
int main() {
long long int n;
cin >> n;
long long int x;
cin >> x;
v.emplace_back(x);
for(long long int i=0;i<n;i+=1){
cin >> x;
v.emplace_back(x);
}
{
sort(v.begin(),v.end());
auto x = v[0];
long long ... | 0 | 9,726,341 |
#include<bits/stdc++.h>
using namespace std ;
#define endl "\n"
#define async ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long int
#define all(y) y.begin(), y.end()
#define present( x, y ) (x.find( y ) != x.end())
const int mod = (int)1e9 + 7 ;
#define vv(T) vector<vector<T>>
#define vvv(T) vector... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
int n;
cin >> n;
int count = 0;
if(n > 9){
count += 9;
}else{
count += n;
}
if(n > 999){
count += 900;
}else{
if(n > 99){
count += n - 100 + 1;
}
}
if(n > 99999){
count += 90000;
}else{
if(n > 9999){
count += n ... | 0 | 50,737,055 |
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
#define MOD (ll)1000000007
#define PI 3.14159265359
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
const ll INF = 1LL<<60;
int MAX_V = 210;
vector<vector<ll>> d(MAX_V, vector<ll>(MAX_V, INF));
void warshall_floyd() {
for(int k = 0; k < MAX_V; ++k)
... | 0 | 48,536,326 |
#include <iostream>
#include <vector>
using namespace std;typedef long long int mint_type;
const mint_type MOD = 1000000007;
const mint_type MAX = 1000000;
class mint{
public:
static mint_type fac[MAX];
static mint_type finv[MAX];
static inline mint_type mod(mint_type a, mint_type mod = MOD)... | #include<cstdio>
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int P[200100];
int PMin = 200100;
int ans = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &P[i]);
if (P[i] <= PMin) ans++;
PMin = min(PMin, P[i]);
}
printf("%d", ans);
return ... | 0 | 19,745,378 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> h(N);
for(int i=0; i<N; i++){
cin>>h[i];
}
int res = 0;
while(1){
if(*max_element(h.begin(), h.end()) == 0){
break;
}
int i = 0;
while(i<N){
if(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
#define FOR(i, m, n) for (int i =... | 0 | 75,375,966 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x[n],y[n];
for (int i=1;i<n+1;i++){
cin>>x[i];
y[x[i]]=i;
}
for (int i=1;i<n+1;i++){
cout<<y[i]<<" ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 0 | 9,089,715 |
#include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int n,m;
scanf("%d %d",&n,&m);
vector<int> coin(m);
for(auto&e:coin){
scanf("%d",&e);
}
int INF=1<<18, MAX_N=50001;
vector<int> dp_coin(MAX_N);... | #include <cstdio>
using namespace std;
int a, b, c, d;
void solve() {
int weight_left = a + b;
int weight_right = c + d;
if (weight_left == weight_right) {
printf("Balanced\n");
return;
}
if (weight_left > weight_right) {
printf("Left\n");
return;
}
if (weigh... | 0 | 84,036,553 |
#include <cstdio>
#include <cmath>
#include <utility>
using namespace std;
using point=pair<double, double>;
int n;
void koch(int n, point &p1, point &p2)
{
if(n){
point s=make_pair((2*p1.first+p2.first)/3, (2*p1.second+p2.second)/3);
point t=make_pair((p1.first+2*p2.first)/3, (p1.second+2*p2.second... | #include <iostream>
#include <cstdio>
using namespace std;
char in[100000000];
int main(void) {
int n;
unsigned long long m;
char bfr[200], aft[200];
int flag = 0;
while(1) {
cin >> n;
if(n == 0) break;
for(int i = 0 ; i < n ; i++) {
cin >> bfr[i] >> aft[i];
}
cin >> m;
for(int i... | 0 | 42,493,786 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <list>
using namespace std;
using ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for (int i = 1; i <= n; i++) {
string num_str = to_string(i);
int sum = 0;
for (int j = 0; j < num_str.size(); j++) {
sum = sum + (int)(num_str[j] - ... | 0 | 93,534,616 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
usi... | 0 | 22,413,809 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define fi first
#define si second
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define F(a,n) for(int i=0;i<n;i++){cin>>a[i];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
#define Graph vector<vector<int>>
int main() {
int N, D, X; cin >> N >> D >> X;
vector<int> A(... | 0 | 89,616,539 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #include <iostream>
#include <cmath>
using namespace std;
int square(long long int & n)
{
long long tmp = sqrt(n), ans = 0;
for(int i = tmp; i >= 1; i--)
if( n % i == 0 )
{
tmp = n/i;
while( tmp > 0 )
{
ans++;
tmp /= 10;
}
return ans;
}
}
int... | 0 | 30,697,871 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef pair<int,int> P;
int main()
{
string s;
pair<string,int> mode=make_pair("",0),mlen=make_pair("",0);
map<string,P> m;
while(cin>>s){
int d=++m[s].first;
m[s].second=s.length();
if(mode.second<d){mode=make_pair(s,d);}
if(mlen.se... | #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 | 22,724,891 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<iomanip>
#include<queue>
#include<stack>
#include<time.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define ggr getchar();getchar();return 0;
#define p... | #include<iostream>
typedef struct{
int parent;
int left_child;
int next_sibling;
int child;
}node;
int depth(int);
node *T;
int count;
int main(){
int n, x, y, z, i, j;
std::cin >> n;
T = new node[n];
for(i=0; i<n; i++) T[i].parent = -1;
for(i=0; i<n; i++){
std::cin >> x >> z;
T[x].child = z;
... | 0 | 15,632,511 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i, k , n) for(int i = k; i <= n; i++)
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{... | #include <bits/stdc++.h>
using namespace std;
int n;
int s[100];
int main() {
while(true) {
scanf("%d", &n);
if (n == 0) break;
for (int i=0; i<n; i++) scanf("%d", &s[i]);
sort(s, s+n);
int sum = 0;
for (int i=1; i<n-1; i++) sum += s[i];
printf("%d\n", sum / (... | 0 | 88,763,308 |
#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... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::cpp_int;
using... | 0 | 35,474,198 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
string dp[10100];
lli use[10... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, total = 0;
cin >> N;
vector<double> T(N), V(N);
for (int i = 0; i < N; i++)
{
cin >> T.at(i);
total += T.at(i);
}
for (int i = 0; i < N; i++)
{
cin >> V.at(i);
}
vector<double> maxV(total * 2 + 1, 10000);
maxV[0] = 0, ma... | 0 | 65,622,540 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<queue>
#include <climits>
const int mod = 1e9 + 7;
const int INF = 1e9;
using namespace std;
typedef long long ll;
int main()
{
int a,b;
cin >> a >> b;
if(a < b){
cout << "a < b" << en... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cou... | 0 | 98,078,577 |
#include <bits/stdc++.h>
#include "atcoder/dsu"
using namespace std;
typedef long long int ll;
int main(int, char **) {
int n, q;
cin >> n >> q;
atcoder::dsu uf(n);
for (int i = 0; i < q; i++) {
int t, u, v;
cin >> t >> u >> v;
if (t == 0) {
uf.merge(u, v);
} ... | #include <iostream>
#include <cstring>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(n);++i)
const int MOD = 1e9+7;
int main() {
int N, M; cin >> N >> M;
int S[N], T[M];
rep(i, N) cin >> S[i];
rep(i, M) cin >> T[i];
ll dp[N+1][M+1];
ll sum[N+2][M+2];
memset(dp, 0, sizeof(dp));... | 0 | 67,064,448 |
#include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr << #v << "="; for (auto _x : v) c... | #include <cstdio>
int n;
int a[200010];
long long D = 1000000007;
long long f[200010], u[200010];
long long res = 0;
int have[200010];
long long pw2(long long x, long long aa)
{
long long y = 1;
while(aa>0){
if(aa % 2 == 1){
y *= x;
y %= D;
}
aa /= 2;
x *= x;
x %= D;
}
return y;
}
void pre()
{
int ... | 0 | 86,597,396 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int Flag(char t, char h){
int Flag = 0;
if(t > h) Flag = 1;
if(t < h) Flag = -1;
return Flag;
}
int Judge(string WordT, string WordH){
int i = 0;
int Judge = 0;
while(i < WordT.size() && i < WordH.size()){
Judge = Flag(WordT[i], WordH[i]... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b;
ll k_th(ll x,ll y)
{
if(y<x) return y;
return y+1;
}
bool judge(ll m)
{
ll k=m/2;
for(ll i=max(1ll,k-1);i<=min(k+1,m);i++)
if(k_th(a,i)*k_th(b,m-i+1)>=a*b) return false;
return true;
}
int main()
{
int q;scanf("%... | 0 | 53,584,872 |
#include<algorithm>
#include<bitset>
#include<climits>
#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_... | #include<bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
#define ll long long int
#define pb push_back
#define rep(i , j , n) for(ll i = j ; i < n ; i++)
#define per(i , j , n) for(ll i = j ; i >= n ; i--)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vecto... | 0 | 24,242,870 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define REP(i, n) for (LL i = 0; i < (LL)(n); i++)
#define REP2(i, n) for (LL i = 1; i <= (LL)(n); i++)
#define FOR(i, m, n) for (LL i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main() {
ll h, w;
cin >> h >> w;
if(h... | 0 | 4,947,778 |
#include <iostream>
using namespace std;
int main() {
int pos = -1;
int input;
int senro[100];
while (cin >> input) {
if (input != 0) {
pos++;
senro[pos] = input;
} else if (input == 0) {
if (pos >= 0) {
cout << senro[pos] << "\n";
... | #include<iostream>
using namespace std;
int n, s, ans;
void solve(int cnt, int num, int sum){
if(n==cnt&&s==sum){
ans++;
return;
}else if(cnt>n||num>9){
return;
}
solve(cnt+1, num+1, sum+num);
solve(cnt, num+1, sum);
}
int main(){
while(1){
cin>> n>> s;
if... | 0 | 61,549,789 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define long long long
#de... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
#define ng 100010
typedef pair<ll,ll> pair;
int main(){
ll n;
cin >> n;
ll m = n / 2;
ll even[ng];
ll odd[ng];
ll max1,max2;
max1 = 0;max2 = 0;
ll maxeven,maxodd;
for(ll i = 0; i < ng; i++){
... | 0 | 9,383,087 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #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 | 35,767,006 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rre... | #include <iostream>
#include <utility>
using namespace std;
int main()
{
int x, y, z;
cin >> x >> y >> z;
if (x > y)
{
swap(x, y);
}
if (y > z)
{
swap(y, z);
}
if (x > y)
{
swap(x, y);
}
cout << x << " " << y << " " << z << endl;
} | 0 | 96,585,232 |
#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++)
int main(){
ll n;
cin >> n;
vector<pair<ll,ll>> a(n);
rep(i, 0, n) {
cin >> a[i].first;
a[i].second = i + 1;
}
sort(a.begin(), a.end()... | #include <iostream>
#include <vector>
#include <utility>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<pair<int,int>> p(n);
for(int i = 0; n > i; i++)
cin >> p[i].first >> p[i].second;
long long int Min = -1;
for(int i = 0; n > i; i++)
for(int j = 0; n > j; j++)
for(int kk = 0; n... | 0 | 72,615,370 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int X;
cin >> X;
if( X <= 599 ) cout << "8" << endl;
if( (600 <= X) && (X <= 799) ) cout << "7" << endl;
if( (800 <= X) && (X <= 999) ) cout << "6" << endl;
if( (1000 <= X) && (X <= 1199) ) cout << "5" << endl;
if( (1200 <= X) && (X <= 1399... | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | 0 | 85,424 |
#include<stdio.h>
int main()
{
int a[4][3][10]={0},b,f,r,v,n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d %d %d %d",&b,&f,&r,&v);
a[b-1][f-1][r-1]=a[b-1][f-1][r-1]+v;
}
for(int x=0;x<4;x++)
{
for(int y=0;y<3;y++)
{
for(int z=0;z<10;z++)
{
printf(" %d",a[x][y][z]);
}
printf("\n");
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int cnt = 0;
for (char i = '0'; i <= '9'; i++) {
size_t pi = S.find(i);
if (pi == string::npos) { continue; }
for (char j = '0'; j <= ... | 0 | 59,763,597 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | #include <bits/stdc++.h>
using namespace std;
string reverseStr(string target)
{
string retStr = "";
for (int i = target.length() - 1; i >= 0; i--) {
retStr += target[i];
}
return retStr;
}
int main()
{
string S;
cin >> S;
if (S != reverseStr(S)) {
cout << "No" << endl;
... | 0 | 87,469,598 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
using namespace std;
int main(){
string str, p;
cin >> str >> p;
str += str;
if(str.find(p) < str.size()){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
int H[N];
for(int i = 0; i < N; i++) cin >> H[i];
int max = 0, sea = 0;
for (int i = 0; i < N; i++)
{
if(max <= H[i]) {
max = H[i];
sea++;
}
}
cout << sea << endl;
return 0;
} | 0 | 52,794,630 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, K;
int main(){
cin >> N >> K;
vector<ll> A(N);
for ( int i = 0; i < N; i++ ){
ll a;
cin >> a;
A[i] = (a-1+K)%K;
}
vector<pair<ll,ll>> Asum(N+1);
ll sum = 0;
for ( int i = 0; i < N; i++ ){
Asum[i] = {sum,i};
sum = (sum+A[i])%K;
}... | #include <iostream>
using namespace std;
int main()
{
int a, b;
while (cin >> a >> b, a != 0 || b != 0) {
for (int i = 0; i < a; ++i)
{
for (int j = 0; j < b; ++j)
{
cout << '#';
}
cout << endl;
}
cout << endl;
}... | 0 | 36,791,838 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
printf("%.10f\n", sqrt(pow(x1-x2, 2) + pow(y1-y2, 2)));
} | #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()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 9,624,128 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int r,l;
int rmax = 0, lmin = n;
vector<int> c(n+1);
for(int i = 0; i < m; ++i){
cin >> r >> l;
rmax = max({rmax,r});
lmin = min({lmin,l});
}
int res = max({lmin-rmax+1,0});
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 0 | 49,977,371 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
unsigned long long res = N;
res *= N - 1;
res >>= 1;
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll>PLL;
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll MOD = 1e4+7;
int main() {
ll x, y;
cin >> x >> y;
if ( x % y == 0 ) {
cout << -1 << endl;
return 0;
}
ll mult_num =... | 0 | 86,128,355 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
int main() {
int a,b,c,d,x;
double da,db;
string s,ss,sss;
int ans = 0;
string anss = "";
cin >> a >> b;
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXV = 100;
const ll INF = (1LL<<60);
int V, E;
ll adjMat[MAXV][MAXV];
int main(){
scanf("%d%d",&V,&E);
for (int i = 0; i < V; i++)
for(int j = 0; j < V; j++)
adjMat[i][j] = INF;
for (int i = 0, s, t, d; i < E;... | 0 | 95,650,539 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
ll n;
ll k;
cin>>n>>k;
vector<pair<ll,ll>>c(n);
rep(i,n)cin>>c[i].first>>c[i].second;
sort(c.begin(),c.end());
for(int i=1;i<n;i++)c[i].second=c[i-1].second+c[i].second;
... | 0 | 39,384,604 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long int;
using P=pair<ll,ll>;
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,ll b... | 0 | 4,326,153 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int a,b,m;
cin >> a >> b >> m;
vector<int> A(a),B(b);
int mna = mod,mnb = mod;
for(int i = 0; i < a; i++){
cin >> A[i];
mna = min(mna,A[i]);
}
for(int i = 0; i < b; i++){... | #include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false); cin.tie(NULL)
#define testcases freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)
#define ui unsigned int
#define ll long long
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<ll>
#define... | 0 | 909,032 |
#include <iostream>
#include <vector>
#include <cmath>
int main(void){
int N, D, ans=0;
std::cin >> N >> D;
std::vector<std::vector<int>> X(N, std::vector<int>(D));
for (int i=0; i<N; ++i){
for (int j=0; j<D; ++j){
std::cin >> X.at(i).at(j);
}
}
for (int i=0; i<N-1; +... | #include<bits/stdc++.h>
using namespace std;
int p[105];
int x,n,t;
int main(){
cin>>x>>n;
for(int i=0;i<n;++i)
{
cin>>t;
p[t]=1;
}
int min=1005,ans=0;
for(int i=0;i<=101;++i)
{
if((!p[i])&&abs(i-x)<min)
{
min=abs(i-x);
ans=i;
}
}
cout<<ans<<"\n";
} | 0 | 32,710,448 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if ... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll m[101][101];
vector<ll> p;
int main() {
int n;
cin >> n;
ll a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (i == 0)
p.push_back(a);
p.push_back(b);
}
for (int i = 0; i ... | 0 | 4,279,649 |
#include <iostream>
using namespace std;
int main()
{
int a,b,x;
cin>>a>>b>>x;
if(x>a)
{
if(a+b>=x)
{
cout<<"YES";
}
else if(a+b<x)
{
cout<<"NO";
}
}
else if(x<a)
{
cout<<"NO";
}
else if(x==a)
{
... | #include <bits/stdc++.h>
#define uni(x) (x).resize(unique(ALL(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846
#define MP(x, y) make_pair(x, y)
#define SZ(x) int((x).size())
#define PB(x) pus... | 0 | 7,970,640 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m=1,min,k;
cin>>n;
int r[n];
cin>>r[0];
min=r[0];
for(int i=1;i<n;i++){
cin>>r[i];
k=r[i];
if(k<min){
min=k;
m++;
}
}
cout<<m;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,f,n) for(int i=f; i<(n); i++)
int main()
{
int n, q;
cin >> n >> q;
vector<int> ki[n];
int ki_p[n] = {0};
REP(i,0,n-1){
int a, b;
cin >> a >> b;
a--;
b--;
ki[a].push_back(b);
ki[b]... | 0 | 82,886,627 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descsort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main(void)
{
int d,t,s;
cin>>d>>t>>s;
if(t*s>... | #include <math.h>
#include <ctype.h>
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define REP(i, n) for(int i = 0; i < n; i++)
struct omt{omt(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int main(){
int n;
cin >> n;
list<int> A;
string s;
int tmp... | 0 | 67,077,199 |
#include <bits/stdc++.h>
#define rep(i, a) for(int i = 0; i < a; i++)
#define all(v) v.begin(), v.end()
#define dcout cout << fixed << setprecision(15)
#define arep(i, a) for(auto i : a)
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
#define MOD 1000000007
#define INF 10000000000
#de... | #include<iostream>
#include<vector>
using namespace std;
int n, i, x, y, j, ok;
int c[100005];
vector<int> v[100005];
void dfs(int nod, int t){
for(int i = 0; i < v[nod].size(); i++){
int vecin = v[nod][i];
if(vecin != t){
dfs(vecin, nod);
if(c[vecin] == 0){
i... | 0 | 54,961,813 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int N=200005;
long long sum,a[N],n,l=1,r=1,tmp=0;
int main() {
scanf("%lld",&n);
for(int i=1; i<=n; i++) scanf("%lld",&a[i]);
while(r<=n) {
while( ( (a[r]^tmp) == (a[r]+tmp) )&& r<=n) tmp^=a[r],r++;
if(r!=n+1) su... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
set<int> unique;
for (int i = 0; i < n; i++) {
unique.insert(a[i]);
}
int m = (i... | 0 | 75,943,467 |
#include <numeric>
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
int K,counter=0;
cin >>N>>K;
if(N.size()==1){
cout<<N.at(0)<<endl;}
else{
for(int i=0;i<N.size();i++){
if(N.at(counter)=='1'){
counter++;
continue;}
else break;}
if(K<=counter)
cou... | #include <iostream>
#include <stdio.h>
#include <cctype>
#include <cmath>
#include <math.h>
using namespace std;
struct cubes {
int n;
int e;
int w;
int s;
int t;
int b;
};
void spin(cubes* cube){
int tmp;
tmp = cube->n;
cube->n = cube->e;
cube->e = cube->s;
cube->s = cube->w;
... | 0 | 88,646,128 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
using namespace std;
typedef long long LL;
#ifdef LOCAL
#include "contest.h"
#else
#define error(args...)
#endif
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
inline bool valid(int x, int w) { return 0 <= x && x < w; }
void ios... | #include <stdio.h>
#include <string.h>
int main()
{
char S[255],T[255];
scanf("%s%s",S,T);
strcat(T,S);
printf("%s",T);
return 0;
} | 0 | 51,541,277 |
#define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <co... | #include<bits/stdc++.h>
using namespace std;
#define first ff
#define second ss
#define ll long long int
int main()
{
int n;
cin>>n;
ll a[n+5],b[n+5];
for(int i=0; i<=n; i++)
cin>>a[i];
for(int i=0; i<n; i++)
cin>>b[i];
ll sum=0;
for(int i=0; i<n; i++)
{
if(a[i]>b... | 0 | 100,823,807 |
#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)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<string> w(n);
rep(i, n) {
cin >> w[i];
}
set<string> st;
st.insert(w[0]);
bool ok = true;
for (int i = 1; i < n; i++)... | 0 | 40,096,453 |
#include <iostream>
#include <vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<map>
#include<math.h>
#include<queue>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 1000000007;
con... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
const int maxn=2e5+10;
const int mod=1e9+7;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin>>n>>k;
int cnt=0;
for(int i=1;i<=n;i++)
{
int x;
... | 0 | 72,425,603 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
ll dp[100004][2];
int main()
{
string s;
cin >> s;
int n = s.size();
dp[0][1] = 1;
for(int i = 0;i<n;i++)
{
if(s[i]=='0')
{
(dp[i+1][0] += dp[i][0]*3)%=MOD;
(dp[i+1][1] += dp[i][1]);
}
else
{
(dp[i+1][0] +=... | #include<bits/stdc++.h>
using namespace std;
#define mod(cans) cans%10**9+7
#define debug(x) cout << "Debug" << x << "\n"
#define rep(i,n) for(unsigned i=0;i<n;i++)
#define repr(i,n) for(unsigned i=n-1;i>=0;i--)
#define rep1(i,n) for(unsigned i=1;i<=n;i++)
#define cin_pl(n,x) rep(i,n){cin>>x[i];}
#define cins(s,n) rep(... | 0 | 26,155,122 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll int,ll int>
#define vpii vector< pii >
#define vi vector<ll int>
#define vs vector< string >
#define vvi vector< vector< ll > >
#define inf (ll)1e18
#define al... | #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(... | 0 | 33,138,538 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=*b... | 0 | 36,046,651 |
#include<iostream>
#include<queue>
#include<ctype.h>
#include<cstdio>
using namespace std;
int H,W,sum,count;
int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
struct node
{
int x,y;
int step;
int color;
char data;
}*map,now,next;
void BFS(int x,int y)
{
queue<node>q;
q.push(map[x*W+y]);
while(!q.empty())
{
now=q.fr... | #include<iostream>
#include<algorithm>
using namespace std;
int parent[100000];
int r[100000];
void init(int n){
for(int i = 0;i < n;i++){
parent[i] = i;
r[i] = 0;
}
}
int find(int x){
if(parent[x] == x) return x;
else return parent[x] = find(parent[x]);
}
void unite(int x, int y){
x = find(x);
y =... | 0 | 29,862,751 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s,s1;
cin>>s>>s1;
char key[s.length()+1] ;
strcpy(key, s.c_str());
char flagment[s1.length()+1] ;
strcpy(flagment, s1.c_str());
int n = s.length()-s1.length();
for ( int i=n; i>= 0 ;i--) {
bool temp = true ;
for ( int j= 0 ;j... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 100000000000000
using namespace std;
int main()
{
FAST
ll n,k;
cin>>n>>k;
if(k == n)... | 0 | 77,088,886 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <bits/stdc++.h>
#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;cin>>n;
ll a[n];
ll diff[n];
ll sum=0;
rep(i,n){
... | 0 | 26,658,679 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool solve() {
ll N;
cin >> N;
vector<ll> A(N);
for ( int i = 0; i < N; i++ ) {
cin >> A[i];
}
int a, b;
vector<vector<int>> G(N);
for ( int i = 0; i < N-1; i++ ) {
cin >> a >> b;
a--, b--;
... | 0 | 87,571,114 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,x,y;
cin>>n>>m>>x>>y;
int left=-100;
int right=100;
for(int i=0;i<n;i++){
int a;
cin>>a;
left=max(a,left);
}
for(int i=0;i<m;i++){
int b;
cin>>b;
right=min(b,right);
}
string ans="War";
for(int i=x+1;i<=y;i++)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 66,077,041 |
#include <bits/stdc++.h>
using namespace std;
char s[200010];
int main(){
scanf("%s",s);
int len=strlen(s);
int sum=0;
for(int i=0;i<len;i++)sum+=s[i]-'0';
if(sum%9==0){
puts("Yes");
}else{
puts("No");
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1001001001;
const ll mod = 1000000007;
int main(){
int n, h; cin >> n >> h;
vector<pair<ll, ll>> a(n);
vector<ll> b(n);
ll st = 0;
for(int i = 0; i < n; i++){
cin >> a[i].first >> a[i].second;
b[i] = a... | 0 | 13,247,026 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int ar[13][13],cost[13],check[13];
int main()
{
ll n,m,h;cin>>n>>m>>h;
for(ll i=0;i<n;i++)
{
cin>>cost[i];
for(ll j=0;j<m;j++)
{
ll k;cin>>k;
ar[i][j] = k;
}
}
ll net = 1<<n;
ll mi = ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (... | 0 | 5,258,771 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int> > ans;
if (n%2) {
for (int l = 1, r = n-1; l < r; l++, r--) {
ans.push_back(make_pair(l,r));
}
} else {
bool flag = ... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int n;
vector<long long> a;
vector<vector<int>> p;
vector<long long> q;
vector<bool> c;
long long... | 0 | 1,379,050 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A + B / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
int pos;
bool check = false;
for (int i = 1; i < N; i++) {
if (a[i-1]+a[i] >= L) {
check = true;
... | 0 | 79,756,452 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
ll gcd(ll a, ll b){
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> csum_a(n + 1,0), csum_b(n + 1,0);
for (int i = 1; i <= n; ++i) {
long long tmp;
cin >> tmp;
csum_a[i] = csum_a[i - 1] + tmp;
csum_b[i] = csum_b[i - 1] + max(tmp, 0LL);
... | 0 | 22,013,033 |
#include<iostream>
using namespace std;
int main(){
int x,i=1;
while(1){
cin>>x;
if(x==0){
break;
}
else{
cout<<"Case"<<" "<<i<<":"<<" "<<x<<endl;
i++;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int M, Nmin, Nmax;
vector<int> P;
void solve(){
sort(P.rbegin(), P.rend());
int gap = 0;
int ans = -1;
for(int i=Nmin-1; i<Nmax; i++){
if(P[i]-P[i+1] >= gap){
gap = P[i]-P[i+1];
ans = i + 1;
}
}
cout << ans << ... | 0 | 14,353,632 |
#include <bits/stdc++.h>
#define Rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef int64_t intl;
int main(){
int N,K;
cin >> N>>K;
if ( N%K ==0){cout << 0;}
else {cout <<1;}
} | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 105
#define INF 1e18
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
ll d[SIZE][SIZE];
int V;
void warshall_floyd_init(){
fill(d[0],d[SIZE],INF);
rep(i,0,SIZE) d[i][i] = 0;
}
bool ... | 0 | 26,435,281 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#inclu... | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<cmath>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) s... | 0 | 8,975,484 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | #include <bits/stdc++.h>
using namespace std;
void solve () {
string s, t;
cin >> s >> t;
int n = (int) s.size();
vector<int> b(26), a(26);
for (int i = 0; i < n; i++) {
b[t[i] - 'a']++;
a[s[i] - 'a']++;
if(a[s[i] - 'a'] != b[t[i] - 'a']) {
cout << "No";
... | 0 | 90,568,099 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main(void){
double a,b,c,d,x,y;
cin>>a>>b>>c>>d;
x = c-a;
y = b-d;
if(x<0)x =x*-1;
if(y<0)y =y*-1;
printf("%lf\n",sqrt(x*x+y*y));
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int m, f, r;
while(true)
{
cin >> m >> f >> r;
if (m==-1 && f==-1 && r==-1) break;
char rank;
int sum = m+f;
if (m==-1 || f==-1)
{
rank = 'F';
}
else
{
if ... | 0 | 38,555,182 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
int ans=a^b^c;
cout<<ans;
return 0;
} | #include <iostream>
#include <vector>
typedef long long LL;
using namespace std;
#define MAX 100100
vector<vector<int>> ab(MAX);
vector<vector<LL>> c(MAX);
vector<LL> d(MAX);
vector<bool> is_visit(MAX, false);
void dfs(int s){
if(ab[s].size()==0){
return;
}
for(int i=0; i<ab[s].size(); i++){
... | 0 | 12,139,897 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1e9
const int MAX_N=100;
const int MAX_W=100;
const int MOD=1000000007;
int dp[1001][1001];
int main(){
string s1,s2;
cin>>s1>>s2;
for(int i=0;i<s1.length()+1;i++) dp[i][0]=i;
for(int j=0;j<s2.length()+1;j++) dp[0][j]=j;
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int dx[] = {-1, 0, 0, 1};
int dy[] = {0, -1, 1, 0};
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h);
for(int i = 0; i < h; i++) cin >> s[i];
string ans = "Yes";
for(int i = 0; i < h; i++){
for(int j = 0... | 0 | 59,054,074 |
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define LLIandI pair<long ... | #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 h, w, m;
cin >> h >> w >> m;
vector<int> hs(h), ws(w);
set<P> s;
rep(i, m) {
int r, c;
cin >> r >> c;
--r; --c;
hs[r]++; ws[c]++;
... | 0 | 19,684,239 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template< typename T >
T mod_pow(T x, T n, const T &p) {
T ret = 1;
while(n > 0) {
if(n & 1) (ret *= x) %= p;
(x *= x) %= p;
n >>= 1;
}
return ret;
}
int main() {
int N, M;
cin >> N >> M;
vector<bitse... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | 0 | 24,293,109 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define SZ(x) (int((x).size()))
#define se second
#define ll long long
#define pq priority_queue
#define MP make_pair
#define pii pair<int,int>
#define mod 998244353
#define inf 0x3f3f3f3f
#define debug(x) cerr<<#x<<"="<<x<<'\n'
#define ... | #include <bits/stdc++.h>
using namespace std;
bool is_left(char c) {
string left="qwertasdfgzxcvb";
for(int i=0;i<left.size();i++) if(left[i]==c) return 1;
return 0;
}
int main() {
string s;
while(cin>>s,s!="#") {
bool L=is_left(s[0]);
int ans=0;
for(int i=1;i<s.size();i++) {... | 0 | 89,510,746 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.