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;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int m, k;
cin >> m >> k;
if (k >= (1 << m)) {
puts("-1");
return 0;
}
if (m == 0) {
printf("0 0\n");
return 0;
}
if (m == 1) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1000000;
int main() {
ll N, M;
ll ans = 0;
cin >> N >> M;
vector<pair<ll, ll>>p(N);
priority_queue<ll>que;
for (int i = 0; i < N; i++) {
ll A, B;
cin >> A >> B;
p[i] = make_pair(A, B);
... | 0 | 6,429,561 |
#include<bits/stdc++.h>
using namespace std;
long long N;
long long x[1005];
long long y[1005];
int main(){
cin >> N;
bool ok = true;
for(long long i = 0; i < N; i++){
cin >> x[i] >> y[i];
if(i != 0){
if((abs(x[0]) + abs(y[0]))%2 != (abs(x[i]) + abs(y[i]))%2){
ok = false;
}
}
}
if(!ok){
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 | 47,077,352 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int sum = 0;
rep(i, n) sum += w[i];
int ans = 1001001001;
for (int k = 1; k < n; ++k) {
int l = 0;
rep(i... | #include <iostream>
void printN (int N);
int main()
{
int N;
std::cin >> N;
printN (N);
return 0;
}
void printN (int N)
{
for (int i = 0; i < N; ++i) {
int x, y, z;
std::cin >> x >> y >> z;
if (x * x + y * y == z * z) {
std::cout << "YES" << std::endl;
} else... | 0 | 19,180,964 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(),A.end()
void ALLIN1_NUMBER(vector<ll>& V)
{
for(auto& x : V)
{
cin >> x;
}
}
void ALLOUT2_WITHOUT_SPACE(vector<vector<ll>> V)
{
ll Vsize = V.size();
ll Visize = V[0].size();
for(ll i=0;i<Vsize;i+... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 | 39,038,079 |
#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>
typedef long long ll;
typedef unsigned long long ull;
const ull mod = 1e9+7;
#define fo(i, n) for (int i = 0; i < n; i++)
#define sc(n) scanf("%d", &n)
using namespace std;
void solve() {
int n, k; sc(n); sc(k);
int a[n]; fo(i, n) sc(a[i]);
int g = 0;
int el = 0;
for (int ... | 0 | 85,152,352 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N,M; cin >> N >> M;
int ans = 0, sum = 0;... | #include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 1e8
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main(){
int n;
while(cin >> n, n){
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
int ans = INF;
for(int i = 0; i < n; i++){
for(int j ... | 0 | 17,109,625 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, T;
cin >> n >> T;
vector<int> t(n);
for (int i = 0; i < n; i++) cin >> t[i];
int pushed = t[0];
int tot = 0;
for (int i = 1; i < n; i++) {
tot += min(T, t[i] - pushed);
pushed = t[i];
}... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
int a1;
int a2;
if( b > a) a1 = b-a;
else if(a==b) a1 = d;
else a1 = a-b;
if(c > b) a2 = c - b;
else if(b==c) a2 = d;
else a2 = b-c;
int c1;
if(c > a) c1 = c-a;
else if(... | 0 | 33,734,194 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
bool can = true;
int a = min(s.size(), t.size());
for(int i=0; i<a; i++) {
if(s[i]>t[i]) {
can = false;
break;
}
else if(s[i]<t[i]) break;
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 15,857,978 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, type... | 0 | 1,354,260 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int i,j,l,n,k;
cin >> n >> k;
if((n-1)*(n-2)/2<k){
cout << -1 << endl;
return 0;
}
int x[110][110];
for(i=0;i<n;i++){
for(j-0;j<n;j++){
x[i][j]=0;
}
}
for(i=1;i<n;i++){
x[0][... | #include<iostream>
using namespace std;
int main()
{
int ans[5];
cin>>ans[0]>>ans[1]>>ans[2]>>ans[3]>>ans[4];
for(int i=0;i<5;i++)
{
for(int j=4;j>i;j--)
{
if(ans[j]>ans[j-1])
{
int tmp=ans[j];
ans[j]=ans[j-1];
ans[j-1]=tmp;
}
}
}
for(int i=0;i<5;i++)
{
if(i!=0) cout<<" ";
cout<<an... | 0 | 73,357,129 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define mod 1000000007
#define REP(i,j,n) for (int i=j;i<(n);i++)
#define RREP(i,n) for (int i = n; 0<i;i--)
#define print(out) cout<< out << "\n";
int main(){
string S1,S2;cin>>S1>>S2;
int s1_l=S1.length(), s2_l=S2.length(... | #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 | 24,802,594 |
#include <stdio.h>
int main(){
int a, b, c, i,j=0,check=0;
int yakusu[1000];
scanf("%d%d%d", &a, &b, &c);
for (i = 1;; i++){
if (c%i == 0){
yakusu[j] = i;
if (i == c){
break;
}
j++;
}
}
for (i = 0; i <= j; i++){
if (a <= yakusu[i] && yakusu[i] <= b){
check++;
}
}
printf("%d\n", check)... | #include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int ans=0;
for(int c=1;c<n;++c){
int ab=n-c;
int cnt=0;
for(int i=1;i*i<=ab;++i){
if(ab%i==0){
cnt++;
if(i!=ab/i) cnt++;
}
}
ans+=cnt;
}
cout<<ans<<endl;
return 0;
} | 0 | 64,156,877 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int64_t i=ini;i<n;i++)
#define _rep(i,ini,n) for(int64_t i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int64_t X,Y,A,B,C; cin>>X>>Y>>A>>B>>C;
vector<int64_t> P(A),Q(B),R(C);
rep(a,0,A) cin>>P.at(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v)... | 0 | 96,795,742 |
#include <iostream>
using namespace std;
int main()
{
int n,x,t,count=0;
cin>>n>>x>>t;
if(n%x>0)
{count=((n/x)+1)*t;}
else{
count=(n/x)*t;
}
cout<<count<<"\n";
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
int n; scanf("%d",&n);
vector<int> a(n),b(n);
rep(i,n) scanf("%d",&a[i]);
rep(i,n) scanf("%d",&b[i]);
lint asum=0,bsum=0;
rep(i,n){
asum+=a[i];
bsum+=b[i];
}
if(asum>bsum) return puts("No"... | 0 | 54,291,497 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int h, w; cin >> h >> w;
vector<string> g(h);
vector<bool> ish(h), isw(w);
rep(i,h) cin >> g.at(i);
rep(... | 0 | 81,112,848 |
#include<iostream>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a;
cin>>a;
n-=a;
if(n<0)
{
cout<<"-1";
return 0;
}
}
cout<<n;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
int main(){
ll N, MAX = 0; cin >> N;
multiset<ll> ST;
set<ll> ban;
for(int i = 0; i < N; i++){
ll x; cin >> x;
MAX = ... | 0 | 89,000,886 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
string s[45][45];
signed main(){
int a,b;
cin>>a>>b;
for(int i=0;i<a;i++){
for(int j=0;j<b;j++){
cin>>s[i][j];
}
}
for(int i=0;i<a;i++){
for(int j=0;j<b;j++){
if(s[i][j]=="snuke"){
... | #include <vector>
#include <iostream>
using namespace std;
#define ll long long
vector<int> adj[100001];
ll ans[100001][2];
ll MOD = 1000000007;
void dfs(int i,int par){
ll prodW = 1;
ll prodTot = 1;
for(int next : adj[i]){
if(next!=par){
dfs(next,i);
prodW*=ans[next][0];
... | 0 | 88,545,210 |
#include "bits/stdc++.h"
#define F first
#define S second
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n = 0, k = 0;
cin >> n >> k;
ll ar[n];
ll ans = 0;
for (ll i = 0; i < n; ++i) ci... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
using namespace std ;
const int N = 1e5+5 ;
int n ,l ,q ,x[N] ,nxt[N] ,lst[N] ;
int main(){
scanf("%d",&n);
int sq = sqrt(n) ;
for(... | 0 | 14,165,128 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int n,m; cin>>n>>m;
cout<<(ll)abs(n-2)*abs(m-2)<<endl;
} | #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... | 0 | 73,424,417 |
#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) FORR(i,0,n)
int main() {
int N, K;
cin >> N >>... | #include<bits/stdc++.h>
using namespace std;
vector<int> adj[100001];
bool visited[100001];
int ans[100001];
void bfs(){
queue<int> q;
q.push(1);
visited[1] = true;
while(q.size()){
int cur = q.front(); q.pop();
for(auto i : adj[cur]){
if(!visited[i]){
ans[i] ... | 0 | 95,477,026 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "YES" : "NO")
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
const int siz = 1e5 + 10;
const int SIZ = 1e5 + 10;
const ... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 58,055,556 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <utility>
using namespace std;
int main() {
int n, m;
while(true) {
pair<int, int> guard[100000];
int exp = 0;
cin >> n >> m;
if(n == 0 && m == 0) {
break;
}
for(int i = 0; i < n; ... | #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 rrep(i,n) for(int i=int(n);i>0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pi 3.141... | 0 | 48,172,034 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, t;
cin >> n >> t;
int tm[n];
for (int i = 0; i < n; i++) cin >> tm[i];
ll ans = 0;
for (int i = 0; i < n - 1; i++) {
ans += min(t, tm[i + 1] - tm[i]);
}
ans += t;
cout << ans << endl;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
string s,x;
vector <int> a(26,0);
cin>>s;
for(int i=0;i<s.size();i++) a[s[i]-'a']++;
for(int i=0;i<n-1;i++)
{
cin>>x;
vector <int> b(26,0);
for(int j=0;j<x.size();j++)
b[x[j]-'a']... | 0 | 78,563,274 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
while(cin >> n, n) {
int x[n];
for (int i=0; i<n; i++)
cin >> x[i];
int ans = -(1<<30);
for (int i=0; i<n; i++) {
int sum = 0;
for (int j=i; j<n; j++) {
sum += x[j];
ans = max(ans, sum... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <climits>
#include <queue>
using namespace std;
const int WHITE = 0, GRAY = 1, BLACK = 2;
struct BFS {
int n;
vector<vector<int>> g;
vector<int> depth;
vector<int> state;
int time = 0;
BFS(int n) : n(n) {
... | 0 | 89,005,178 |
#include <iostream>
using namespace std;
void print(int *p, int n)
{
cout << p[0];
for (int i = 1; i < n; i++) cout << " " << p[i];
cout << endl;
}
int selectionsort(int *p, int n)
{
int minj, j, v;
int count = 0;
for (int i = 0; i < n; i++)
{
minj = i;
for (j = i; j < n; j++... | #include <iostream>
#include <string>
using namespace std;
typedef struct{
int x,y,t;
} acord_t;
int main(void)
{
int N;
cin >> N;
acord_t point[N];
for(int i=0; i<N; i++){
cin >> point[i].t;
cin >> point[i].x;
cin >> point[i].y;
}
for(int j=0; j<N; j++){
int x_... | 0 | 84,687,759 |
#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 1001001001001001000;
int main() {
int n,q... | #include<iostream>
#include<string>
using namespace std;
int main(){
int t = 0;
int h = 0;
int n;
string str1, str2;
cin >>n;
for(int i = 0; i<n; i++){
cin >>str1 >>str2;
if(str1 == str2){
t += 1;
h += 1;
}else if(str1 > str2){
t += 3... | 0 | 77,823,781 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ll long long
#define pii pair<int,int>
int fac[9];
void init() {
int i=0;
fac[0]=1;
for(int i=1;i<9;i++)
fac[i]=i*fac[i-1];
}
void test_case()
{
... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | 0 | 91,594,248 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int MAX = 1000000;
const ll INF = (1LL << 31) - 1;
const double pi=acos(-1);
long double n,m,d,ans=0;
int main(){
cin >> n >> m >> d;
if(d==0){
ans=(m-1)/n;
}
else{
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int gcd(int a,int b){
if(... | 0 | 5,960,260 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout<< (x) << " "
int main(){
int r,g,b,n;cin>>r>>g>>b>>n;
int rmax=n/r,gmax=n/g;
ll ans = 0;
for(int i=0;i<... | 0 | 77,561,611 |
#include<iostream>
#include<cstdio>
#include<deque>
#include<algorithm>
using namespace std;
typedef pair<int,int>P;
const int maxn=1e3+5;
int inf=500;
int h,w,n,sx,sy;
char s[maxn][maxn];
int book[maxn][maxn],goal[10];
int Next[4][2]={{0,1},{1,0},{-1,0},{0,-1}};
int judge(int row,int col)
{
if(row>=0&&row<h&&col>=... | #include <cmath>
#include <cstdio>
#include <vector>
#include <iterator>
#include <iostream>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <map>
#include <stdio.h>
#include <functional>
#include <chrono>
using namespace std;
#define rep(i,s,n) for(ll i=s... | 0 | 39,628,143 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
int C = 0;
cin >> A >> B;
for (int i = A; i <= B; i++) {
int b = i / 10000;
int c = (i - (b * 10000)) / 1000;
int d = (i - (b * 10000) - (c * 1000)) / 100;
int e = (i - (b * 10000) - (c * 1000) - (d * 100)) / 10;
int f = (... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | 0 | 21,976,675 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<vector<int>> g;
g.resize(N + 1);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> v;
for (int i = 1; i <= N; i++)
v.pus... | #include <iostream>
using namespace std;
int main() {
int n,b,f,r,v,college[4][3][10]={0};
cin>>n;
for(int m=0;m<n;m++){
cin>>b>>f>>r>>v;
college[b-1][f-1][r-1]+=v;
if(college[b-1][f-1][r-1]>9)college[b-1][f-1][r-1]=9;
if(college[b-1][f-1][r-1]<0)college[b-1][f-1][r-1]=0;
}
for(int i=0;i<4;i++){
if(i!... | 0 | 46,740,280 |
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long ... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n;
string s, t;
map<char,set<char>> mp;
set<char> viz;
int main() {
ios_base::sync_with_stdio(fa... | 0 | 17,553,486 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<utility>
#include<cmath>
#include<string>
#include<cstring>
#include<map>
#include<queue>
#include<set>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define prin(arg) std::cout<<arg<<"\n"
#define prin2(arg... | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ll k, l, cnt, a[100], ans = 0LL;
string s;
cin >> s >> k;
l = s.length();
cnt = 0LL;
for (int i = 0; i < l; i++) {
if (s[i] == s[0]) {
cnt++;
}
}
if (cnt == l) {
cout << l * k / 2LL << endl;
... | 0 | 96,345,805 |
#include <bits/stdc++.h>
using namespace std;
int A[100050];
int n,l,q;
int dp[100050][20];
int main(){
cin >> n;
for(int i=1; i<=n; ++i) cin >> A[i];
cin >> l;
for(int i=1; i<=n; ++i) dp[i][0] = upper_bound(A+1,A+n+1,A[i]+l)-A-1;
for(int k=1; k<=18; ++k){
for(int i=1; i<=n; ++i){
dp[i][k] = dp[dp[i][k-1]][k-... | #include <iostream>
#include <algorithm>
using namespace std;
long long lcm(long long a, long long b)
{
return a / __gcd(a, b) * b;
}
int main()
{
long long A, B;
cin >> A >> B;
cout << lcm(A, B) << endl;
return 0;
} | 0 | 86,746,223 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> a(10000000+1, 0);
for (long long int i = 1; i <= 10000000; i++) {
a[i] = a[i-1]+i;
}
vector<long long int>::iterator ite = lower_bound(a.begin(), a.end()... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | 0 | 18,194,960 |
#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
set<int> chair;
for(int i=0;i<n;i++){
int l,r;
cin>>l>>r;
for(int i=l;i<=r;i++){
chair.insert(i);
}
}
cout<<chair.size()<<endl;
return 0;
} | 0 | 41,092,306 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int num;
vector<int> list;
while(cin >> num)
{
list.push_back(num);
}
sort(list.begin(), list.end(), greater<int>());
for(int i = 0 ; i< 3 ; i++)
{
cout<< list[i] <<endl;
}
... | #include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) vector <int> a(n); rr(i, n) cin >> a[i]
#define pvec(a) rr(i, a.size()) cout << a[i] << " "; cout << endl
#define bug(x) cout << #x << " " << x << endl
#define ll long long
#define vii vector <int>
using namespace std;
void s... | 0 | 57,066,318 |
#include <iostream>
#include <algorithm>
using namespace std;
long long n, p[200001], pmin[200001], ans = 0;
int main()
{
cin >> n;
for (int i = 0; i <= 200000; i++) pmin[i] = 200000;
for (int i = 1; i <= n; i++)
{
cin >> p[i];
pmin[i] = min(pmin[i - 1], p[i]);
}
for (int i = 1; ... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int n,k;
cin >> n >> k;
long long int a,b;
long long int ans=0;
for(int i=0;i<k;i++){
if(i==0)ans+=(n/k)*(n/k)*(n/k);
else{
if(n%k>=i)a=n/k+1;
else a=n/k;
if(n%k>=k-i)b=n/k+1;
... | 0 | 42,106,819 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5;
inline bool cek_bit(ll mask, int x){
return mask&(1ll<<x);
}
int n;
ll li[N+5];
int depan[65];
int urut = 0;
int matrix[65][N+5];
bool masuk(int bit){
urut++;
for(int i=1;i<=n;i++){
if(cek_bit(li[i],bit)){
matrix[urut][i] = 1;... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
string s;
cin >> s;
vector<int> x(4);
rep(i, 4) x[i] = s[i] - '0';
if(x[0] + x[... | 0 | 88,245,360 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, X;
cin >> N >> D >> X;
int sum = N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++)
for (int j = 1; j <= D; j++)
if ((j * A.at(i) + 1) <= D)
sum++;
else
br... | #include <bits/stdc++.h>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define fi first
#define se second
#define all(arr) arr.begin(), arr.end()
#define rep... | 0 | 88,967,760 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
string t;
cin>>s>>t;
string s1=s;
string t1=t;
reverse(s.begin(),s.end());
reverse(t.begin(),t.end());
if(s1==t && t1==s){
cout << "YES" << endl;
}else{
cout<<"NO"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 15,396,446 |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#pragma warning(disable:4996)
int main(){
int n = 0;
int arr[105][105] = { 0 };
scanf("%d", &n);
for (int m = 0; m < n; m++){
int a = 0;
int b = 0;
scanf("%d %d", &a, &b);
for (int x = 0; x < b; x++){
int c = 0;
scanf("%d", &c);
getchar();
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<doub... | 0 | 61,163,361 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 0 | 63,432,647 |
#include<iostream>
using namespace std;
int main(){
int car[100];
int input;
int i = 0;
while(cin >> input){
if(input == 0){
i--;
cout << car[i] << endl;
}else{
car[i] = input;
i++;
}
}
} | #include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
... | 0 | 85,259,969 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, kakikae = 0;
cin >> n >> k;
map<int, int> a;
for (int i = 0; i < n; i++) {
int ai; cin >> ai;
if (a.count(ai)) a[ai]++;
else a[ai] = 1;
}
int syurui = a.size();
if (syurui <= k) goto OUT;
for (int i = 1; i < n; i++) {
... | #include<iostream>
#include<cmath>
#include<map>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1c(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
int N, dp[100][2][3];
map<int, int> m;
void solve() {
rep1c(i, N) {
int j = 2;
int k = i;
while (k > 1 || i >= j) {
if (k... | 0 | 25,679,330 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = (B-1); I >= (A); --I)
const ll INF=1e18+7;
const ll MOD=1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,m;
cin >> n >> m;
vector... | #include <iostream>
#include <vector>
#include <set>
#include <utility>
#include <algorithm>
using namespace std;
typedef pair<long long, long long> P;
int main(){
int N, M;
cin >> N >> M;
vector<long long> A(N), B(N);
vector<long long> ind(N);
set<int> s;
for(int i = 1; i <= M; i++) s.insert(i)... | 0 | 58,383,906 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int debt=100000, n;
cin >> n;
for(int i=0;i<n;i++){
debt += debt*(5.0/100.0);
if(debt%1000!=0){
debt=(debt/1000)*1000+1000;
}
}
if(debt%1000!=0){
debt=(debt/1000)*1000+1000;
}
cout << debt << endl;
return 0;} | #include<iostream>
int n, m;
long long x[100000], y[100000];
long long ansx, ansy;
int waru = 1000000000+7;
long long ans;
int main() {
std::cin >> n >> m;
for (int i = 0; i < n; i++) {
std::cin >> x[i];
}
for (int j = 0; j < m; j++) {
std::cin >> y[j];
}
for (int i = 1; i <= n; i++) {
ansx = ((i + i - n -... | 0 | 76,945,821 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
#define fi first
#define se second
#define pb push_back
#define nn "\n"
#define all(p) p.begin(),p.end()
#define zz(v) (ll)v.size(... | 0 | 61,815,511 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char c;
cin >> c;
if(c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o'){
puts("vowel");
}
else puts("consonant");
} | #include<bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define all(v) v.begin(),v.end()
#define meow ios::sync_with_stdio(0);cin.tie(0);
typedef long long int ll;
typedef unsigned long long int ull;
int main()
{
meow;
ll i,n,j,cnt=0,k;
cin>>n;
for(i=0;i<=n;i++){
string s... | 0 | 21,947,600 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
vector<pair<int, int>> a_i(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
a_i.at(i) = make_pair(i + 1, a);
}
sort(a_i.begin(), a_i.end(), [](const auto &x, const auto &y) {
return x.s... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
#include <queue>
#include <map>
#include <set>
using namespace std;
using Int = int64_t;
using P = pair<Int, Int>;
const Int INF... | 0 | 50,397,686 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void chmin(double &a, double b){
if( a > b){ swap(a,b);} return;}
int main(){
int N; cin >> N;
vector<int> t(N); vector<int> v(N); int time = 0;
for(int i = 0; i < N; i++){ cin >> t[i]; time += t[i];}
for(int i = 1; i < N; i++){ t[i] += t[i-1];}... | 0 | 44,944,771 |
#include <stdio.h>
int main(){
int N;
unsigned long long int sum=1;
scanf("%d", &N);
unsigned long long int A[N];
for(int i=0;i<N;i++){
scanf("%llu", &A[i]);
if(A[i]==0){
printf("0");
return 0;
}
for(int i=0;i<N; i++){
}
}
for(int i=0; i<N;i++){
if(A[i]<=1000000000000000000/sum){
sum*=A[i]... | #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 | 4,337,261 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | 0 | 4,775,045 |
#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define vi vector<int>
#define vll vector<ll>
#d... | #include<iostream>
#include<cstdio>
const int MAX_N = int(1e6);
int N, a[MAX_N+10];
int res, m[MAX_N+10];
int main()
{
std::cin>>N;
for (int i = 0; i < N; ++i)
scanf("%d", a+i);
res = 0;
for (int i = 0; i < N; ++i)
{
int l = 0, r = res+1;
while (r-l>1)
{
i... | 0 | 34,395,814 |
#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
#de... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF 1e9
using ll = long long;
using namespace std;
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) ... | 0 | 47,509,366 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
vector<ll> T(N), ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int s;
cin >> s;
map<int, int> mp;
int count = 0;
while (1)
{
++count;
if (mp[s] == 1)
{
cout << count << endl;
return 0;
}
mp[s]++;
if (s % 2 == 0)
{
... | 0 | 12,290,398 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
for (int i = 0;i < h*w;++i) {
string s;
cin >> s;
if (s == "snuke") {
char a = 'A';
a += i%w;
cout << a << i/w+1 << "\n";
break;
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
int num;
int win_point = 3;
int draw_point = 1;
int taro_point = 0;
int hanako_point = 0;
string card_taro, card_hanako;
cin >> num;
for (int i = 0; i < num; ++i)
{
cin >> card_taro >> card_hanako;
... | 0 | 72,918,196 |
#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>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define sayyes cout<<"Yes"<<endl;
#define sayno cout<<"No"<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,ll>P;
const int mod =998244353;
int main()
{
int n;
cin>>n;
vector<ll> d(n);
rep(i,n)
{
cin>>d[i];
... | 0 | 98,800,824 |
#include<bits/stdc++.h>
using namespace std;
#define itn int
#define endl "\n"
int main(void){
int n;
cin >> n;
long long int a[n],num[n];
for(int i = 0;i < n;i++)cin >> a[i];
num[0] = a[0];
for(int i = 1;i < n;i++)num[i] = num[i-1] + a[i];
long long int sum = abs(num[0] - (num[n-1] - num[0]... | #include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
int main()
{
int a, b;
cin >> a >> b;
int i = 1;
while((int)(i * 0.08) <= a... | 0 | 91,821,818 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int calc(int y, int m, int d) {
int dy = y - 1, dm = m - 1;
int sum = 0;
sum += (dy - dy / 3) * (39 * 5) + (dy / 3) * (10 * 20);
sum += (y % 3) ? (dm / 2 * 39 + (dm % 2) * 20) : (dm * 20);
sum += d - 1;
return sum;
}
int... | #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, p[300000], min, ans = 0;
cin >> n;
rep(i, n) cin >> p[i];
min = p[0];
rep(i, n)
{
if (min >= p[i])
{
min = p[i];
ans++;
... | 0 | 2,833,077 |
#include <iostream>
#include <queue>
using namespace std;
int w,h;
int g[21][21];
bool visited[21][21];
int moves[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int count;
bool legal(int x, int y)
{
if(visited[x][y]!=true&&0<=x&&x<h&&0<=y&&y<w&&g[x][y]==0)
return true;
else
return false;
}
void dfs(int x,int y)
{
vis... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define NIL -1
#define MAX 100001
struct Node{
int parent;
int left;
int right;
};
Node tree[MAX];
int n;
int depth[MAX];
void setdepth(int r,int i){
depth[r]=i;
if(tree[r].right != NIL)setdepth(tree[r].right,i);
if(tree[r].left... | 0 | 95,054,716 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define ll long long
#define rep(i, a, b) for(ll i = (ll)a; i < (ll)b; i++)
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if(a+b < c+d) cout << "Right\n";
else if(a+b > c+d) cout << "Left\n";
else cout << ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1<<21;
const ll INF = 1LL << 60;
const ll mod = 1e9+7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4... | 0 | 10,731,581 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 81,651,261 |
#include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define all(v) v.begin(), v.end()
#define UNIQUE(c) (c).resize(unique(all(c)) - (c).begin())
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define START cin.tie(0); cout.tie(0); ios_base::sync_wit... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
template<typename T =ll> using v = vector<T>;
template<typename T =ll> using vv = v<v<ll>>;
template<typename T=ll,typename U=ll> using p = pair<T,U>;
template<typename T>... | 0 | 88,358,674 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
string s;
int a, b, c;
cin >> s;
if(s[0]==s[1] && s[1]==s[2])
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
int N,M,X; cin >>N >>M >>X;
vector<int> C(N);
vector<vector<int>> A(N,vector<int>(M));
rep(i,0,N) {
cin >>C[i];
rep(j,0,M) ... | 0 | 1,944,756 |
#ifdef debug
#include <chrono>
#endif
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstring>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#include <iterator>
... | #include <iostream>
using namespace std;
int main(){
int N, M, P;
while( 1 ){
cin >> N >> M >> P;
if( N == 0 && M == 0 && P == 0 ) break;
int money = 0, mn;
for( int i = 1; i <= N; i++ ){
int j;
cin >> j;
if(M == i) mn = j;
money += j;
}
if( mn == 0 ){
cout << 0 << endl;
}else{
money =... | 0 | 40,880,408 |
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
#define LL long long
#define fgx cerr<<"--------------"<<endl;
#define dgx cerr<<"=============="<<endl;
inline LL read(){
LL x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 51,281,513 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=998244353,MAX=100005,INF=1<<28;
int main(){
std::ifstream in("text.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
while(1){
int N;cin>>N;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 33,218,823 |
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll N) {
cout << (N-1)/2 << endl;
}
int main() {
ll N;
cin >> N;
solve(N);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int mod = 1e9+7;
int main()
{
int x, n;
cin >> x >> n;
if(n == 0)
{
cout << x << endl;
return 0;
}
int p[n];
rep(i, n) cin >> p[i];
sort(p, p+n);
auto it1 = lower_... | 0 | 55,415,384 |
#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>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
string str;
cin >> str;
rep(i,4) cout << str.at(i);
cout << " ";
rep(i,8) cout << str.at(i+4);
cout << en... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define pb push_back
#define pf push_front
#define eb... | 0 | 57,018,862 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N; cin >> N;
long long ans = 9999999999;
int tmp_a = 0;
int tmp_b = 0;
for(long long i = 1; i * i <= N; i++){
if(N % i == 0){
long long a,b;
a = i;
b = N / i;
while(a > 0){
a /= 10;
tmp_a++;
}... | 0 | 64,492,188 |
#include <iostream>
#include <map>
#include <string>
#include <algorithm>
#include <vector>
#define ll long long
int main()
{
ll a, b, c, d;
std::cin >> a >> b >> c >> d;
ll max_num = -1000000000000000000;
max_num = (max_num > (a*c)) ? max_num : (a*c);
max_num = (max_num > (a*d)) ? max_num : (a*d);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | 0 | 14,613,094 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | #include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
#define PMOD 998244353
#define pb(x) push_back(x)
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9+10;
const ll LINF = 1LL*INF*INF;
const i... | 0 | 19,460,621 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,double> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( ... | 0 | 65,562,126 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF=1LL<<60;
int n;
... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
int r[n], c[n], a[n][n];
for(int i=0;i<n;i++) cin>>r[i]>>c[i];
for(int i=0;i<n;i++)
a[i][i] = 0;
for(int i=1;i<n;i++){
for(int j=0;j+i<n;j++){
... | 0 | 70,121,957 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#include <complex>
#include <functional>
#include <b... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<long long int>> v(8, vec... | 0 | 29,665,601 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define s second
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define f first
const ll N=1e3+5;
ll bexpo(ll x,ll n){
if(n==0)return 1;
else if(n%2==0)retu... | 0 | 59,149,929 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans;
int main()
{
int n;
scanf("%d", &n);
ans = 1ll * n * (n + 1) * (n + 2) / 6;
for(int i = 1; i < n; ++i)
{
int u, v;
scanf("%d%d", &u, &v);
if(u > v) swap(u, v);
ans -= 1ll * u * (n - v + 1);
}
cout << ans << endl;
return 0;
} | #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 | 56,862,800 |
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <deque>
#include <map>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P ... | 0 | 90,246,607 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define ssort(a) sort(a.begin(), a.end(), greater<ll>())
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
us... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll min, max;
cin >> min >> max;
vector<ll> A;
A.push_back(min);
ll n = min;
for(;;) {
n *= 2;
if(n > max) {
break;
}
A.push_back(n);
}
cout << A.size() << endl;
} | 0 | 84,988,280 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
int main() {
int i,n, sum1, sum2;
sum1 = 0; sum2 = 0;
string s, t;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s; cin >> t;
if (s < t) {
sum2 += 3;
}
else if (s > t) {
sum1 += 3;
}
el... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 200000000;
cons... | 0 | 96,272,205 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n, a, b, c,f;
cin >> n;
a = n / 15;
b = a * 200;
c = n * 800;
f = c - b;
cout << f;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[100001][2];
ll mod = 1e9+7;
vector<ll>v[100001];
ll add(ll x , ll y)
{
x += y;
if(x >= mod)
x -= mod;
return x;
}
void dfs(ll x , ll p)
{
ll mult2 = 1 , mult1 = 1;
for(ll i = 0 ; i < (ll)v[x].size() ; i++)
{
if... | 0 | 2,619,242 |
#include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define RFOR(i,m,n) for(int i=m;i>=n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0... | #include <cstring>
#include <iostream>
struct card {
char mark;
unsigned int number;
};
static void print_cards(const card cards[], const unsigned int n) {
const char* sep = "";
for (unsigned int i = 0; i < n; ++i) {
const card* const cardp = &cards[i];
std::cout << sep << cardp->mark << cardp->number;
... | 0 | 39,090,647 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef long lo... | 0 | 35,762,229 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a + b == 15) {
cout << "+";
} else if (a * b == 15) {
cout << "*";
} else cout << 'x';
r... | #include <bits/stdc++.h>
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; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | 0 | 23,601,714 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include <bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
int N = S.size();
int counta = 0;
int countb = 0;
if (S.at(0) == 'k'){
counta++;
if (counta == 1 && S.at(1) == 'e'){
counta++;
if (counta == 2 && S.at(2) == 'y'){
counta++;
if (counta == 3 && ... | 0 | 82,237,536 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n;
string s;
cin >> n >> s;
vector < char > d (2 * n);
d[0] = 'L';
int cnt = 1;
for (int i = 1; i < 2 * n; i++) {
if (s[i] == ... | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<n; i++)
#define repr(i, s, e) for(ll i=s; i>=e; i--)
#define reps(i, s, e) for(ll i=s; i<=e; i++)
#define inf 1e18
#define all(v) v.begin(),v.end()
#define ceill(a, b) (a+b-1)/b
#def... | 0 | 12,485,767 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> ans(n+1);
rep(i,n) {
int a;
cin >> a;
ans[a] = i+1;
}
for(int i = 1; i < n; i++)
c... | #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 gcd(int a, int b)
{
if (a % b == 0)
{
return (b);
}
else
{
return (gcd(b, a % b));
}
}
in... | 0 | 41,685,371 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef vector<pair<ll,ll> > vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#defin... | 0 | 68,509,126 |
#include <bits/stdc++.h>
#define mem(i,j) memset(i,j,sizeof(i))
#define pl (p<<1)
#define pr (p<<1)|1
#define int long long
using namespace std;
inline int read(){
char ch=' ';int res=0,f=1;
while(!isdigit(ch)){ch=getchar();if(ch=='-')f=-1;}
while(isdigit(ch)){res=res*10+ch-'0';ch=getchar();}
return res*f;
}
int _m... | #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;
ll const INF = 1LL << 60;
int main() {
string s;
cin >> s;
string target = "ke... | 0 | 83,141,115 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
int main() {
int n;
cin>>n;
vector<int>a(n);
deque<int>k;
for(int i=0;i<n;i++){
cin>>a[i];
if(i%2==n%2){k.push_back(a[i]);}
else{k.push_front(a[i]);}
}
for(int i=0;i<n;i++){
cout<<k[i];
if(i<n-1){cout<<"... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomani... | 0 | 63,777,983 |
#include <iostream>
#include <complex>
using namespace std;
#define EPS (pow(10, -10))
#define EQ(a,b) (abs((a)-(b)) < EPS)
typedef complex<double> P;
double cross(P a, P b) {
return(a.real() * b.imag() - a.imag() * b.real());
}
int is_parallel(P a1, P a2, P b1, P b2) {
return(EQ(cross(a1 - a2, b1 - b2), 0.0));... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 24,813,856 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Hea... | #include <stdio.h>
int main(){
int n,b,f,r,v;
scanf("%d",&n);
int o[3][10] = {};
int p[3][10] = {};
int q[3][10] = {};
int t[3][10] = {};
for(int k = 1; k <= n; k++){
scanf("%d%d%d%d",&b,&f,&r,&v);
if(b==1){
o[f-1][r-1] = o[f-1][r-1] + v;
if(o[f-1][r-1... | 0 | 97,279,442 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void solve() {
long long a, b, c; scanf("%lld %lld.%lld", &a, &b, &c);
printf("%lld", a *... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rrep(i,n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep2(i,s,n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ... | 0 | 56,482,053 |
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
#define PB push_back
const int N=1e4+10;
int main(){
int n,m,l,r,d[N],nxt;
queue<int> q;
vector<int> graph[N];
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)d[i]=0;
while(m--){
scanf("%d%d",&l,&r);
graph[l].PB(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 49,172,210 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <unordered_map>
typedef long long ll;
using namespace std;
const int mod=1e9+7;
ll solve(){
int n,x,t;
cin>>n>>x>>t;
return ((n/x)+(n%x != 0))*t;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
... | #include <iostream>
#include <set>
#include <vector>
#include <map>
#include <string>
#include <math.h>
#include <queue>
using namespace std;
int solve(int Y,int M, int D){
int res;
res=0;
if(Y%3==0 || M%2!=0){
for(int dd=D;dd<=20;dd++) res++;
}
else{
for(int dd=D;dd<=19;dd++) res++;
}
for(int mm=M+1;mm<=10;... | 0 | 6,091,755 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, s... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 35,175,487 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef p... | #include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, cla... | 0 | 75,844,756 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double doublel;
#define f first
#define s second
const int N = 1e6 + 100;
const ll mod = 1e9 + 7;
const ll inf = 1e17;
set<pair<ll, ll>> s;
int par[N], cnt[N];
ll h[N];
vector<pair<int, int>> ans;
vector<int> adj[N];
void dfs(int u)
{
... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n != 0) {
vector<int> imos(100000, 0);
for (int i=0; i<n; i++) {
int h, m, s, start, goal;
char colon;
cin >> h >> colon >> m >> colon >> s;
... | 0 | 16,661,007 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.