code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int connectedCount(int node, vector<set<int>>& graph, vector<int>& visited)
{
if(visited[node])
return 0;
int ret = 1;
visited[node] = 1;
for(auto& child: graph[node])
{
if(visited[child] == 0)
ret += connectedCount(child, graph, visited);
}
return ret;
}
int... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using ll = long long;
int main(){
int x,n;
cin >> x >> n;
set<int> s;
rep(i,n){
int a; cin >> a;
s.insert(a);
}
int dx=0;
while(1){
if(!(s.count(x-dx))){
cout << x-dx... | 0 | 87,209,931 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 8000;
bool dp[MAXN + 1][MAXN + 1];
bool isPoss(vector<int> v, int offset)
{
if (v.empty())
return offset == 0;
int sum = 0;
for (int x : v)
sum += x;
if (sum % 2 != offset % 2)
return false;
for (int i = 0; i <= (... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | 0 | 73,154,788 |
#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 < (n); ++i)
struct UnionFind {
vector<int> d;
UnionFind(int n=0): d(n, -1) {}
int find(int x) {
if (d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool u... | #include<iostream>
using namespace std;
const int N=200100;
long long abs_(long long x)
{
if(x<0) x=-x;
return x;
}
long long ans,n,a[N],sum[N],sumd[N];
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;++i) cin>>a[i];
for(int i=1;i<=n;++i)
sum[i]=sum[i-1]+a[i];
for(... | 0 | 45,244,955 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (1 << 30)
using namespace std;
int editdistance(string a, string b)
{
int dp[a.size() + 1][b.size() + 1];
rep(i, a.size() + 1) rep(j, b.size() + 1)
{
dp[i][j] = INF;
}
rep(i, a.size() + 1) dp[i][0] = i;
re... | 0 | 27,873,096 |
#include <cstdio>
#include <cstring>
const int MAX_n = 999999;
bool isPrime[MAX_n+1];
int sum[MAX_n+1];
int main()
{
memset(isPrime,true,sizeof(isPrime));
for(int i = 2; 2*i <= MAX_n ; ++i)
if(isPrime[i])
for(int j = 2*i; j <= MAX_n; j+=i)
isPrime[j] = false;
isPrime[0] =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
#define repr(i,x,n) for (int i = x; i < n; ++i)
#define INF 999999999;
int n;
int util[110000][3];
long long dp[110000][3];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) cin >> util[i][0] >> util[i][1] >> util[i][2]... | 0 | 79,685,329 |
#include <bits/stdc++.h>
using namespace std;
#define fast_io cin.tie(0);ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"';}
string to_string(char s) { return string(1, s);}
string to_string(const char* s) { return to_string((string) s);}
string to_string(bool b) { return (b ? "true" : "fa... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> h(n), dp(n, INT_MAX);
for(int i = 0; i < n; i++){
cin >> h[i];
}
dp[0] = 0;
for(int i = 1; i < n; i++){
for(int j = i - 1;... | 0 | 9,158,107 |
#include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
#include<functional>
#include<unordered_set>
#include<unorde... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};... | 0 | 69,440,621 |
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#i... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 0 | 37,599,876 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int n,m,a[10010];
while(~scanf("%d%d",&n,&m))
{
for(int i=0;i<m;i++)
a[i]=1;
int sum=n-m;
a[m-1]+=sum;
printf("%d\n",a[m-1]-a[0]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n; cin >> n;
ll res = 0;
if (n % 2) res = 0;
else {
ll tmp = 10;
while (tmp <= n) {
res += n / tmp;
tmp *= 5;
}
}
cout << res << '\n';
return 0;
} | 0 | 39,915,419 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <functional>
#include <algorithm>
using namespace std;
bool solve(){
vector<int> a(5);
for(int i=0;i<5;i++){
cin>>a[i];
}
sort(a.begin(),a.e... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>
#include <fstream>
#include <array>
#include <utility>
#include <functional>
#include <stack>
#include <math.h>
using namespace std;
typedef long long Int;
#define REP(i , x) for(Int i... | 0 | 27,459,155 |
#include <iostream>
#include<map>
using namespace std;
#define fin(ans) cout << (ans) << '\n'
int main()
{
int ans = 0;
string S,SS;
cin >> S >> SS;
ans = (S[0] == SS[0]) +
(S[1] == SS[1]) +
(S[2] == SS[2]);
fin(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long int MOD = 1000000007;
int main()
{
int N;
string S;
cin >> N;
cin >> S;
if (S[0] == 'W' || S[2 * N - 1] == 'W')
{
cout << 0 << endl;
return 0;
}
vector<int> C(2 * N);
C[0] = 1;
long long int cnt = 1;
for ... | 0 | 68,353,072 |
#include <bits/stdc++.h>
#define MAX_N 100000
#define pb push_back
#define xx first
#define yy second
using namespace std;
int n;
vector <pair<int, int>> g[MAX_N + 1];
vector <pair<int, int>> tata[MAX_N + 1];
int poz[MAX_N + 1];
bool viz[MAX_N + 1];
bool luat[MAX_N + 1];
void out()
{
cout << "No\n";
exit(0);
}
... | #include <cstdio>
#include <iostream>
#include <list>
#include <string>
void delete_value(std::list<int>& data, int number)
{
for(std::list<int>::iterator iter = data.begin(); iter != data.end(); iter++) {
if(*iter == number) {
data.erase(iter);
return;
}
}
}
void show_da... | 0 | 80,442,748 |
#include<iostream>
#include<cstdio>
using namespace std;
main()
{
char s[2];
int now,k=1;
for(now=1;now<=10;now++,k*=10)
{
printf("? %d\n",k);
fflush(stdout);
scanf("%s",s);
if(s[0]=='N')break;
}
now--;
if(now==10)
{
k=2;
for(now=1;now<=10;now++,k*=10)
{
printf("? %d\n",k);
fflush(stdout);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i... | 0 | 12,328,752 |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#ifdef _MSC_VER
#include <Windows.h>
#else
#include <unistd.h>
#endif
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}... | #include <bits/stdc++.h>
using namespace std;
int calc(int node,int node_from,vector<vector<int>> &tree,vector<int> &xsum,vector<int64_t> &psum);
int main()
{
int n,q;
cin >> n >> q;
vector<int> a(n),b(n);
vector<int> p(q+1),x(q+1);
for (int i=1;i<n;++i)
{
cin >> a[i] >> b[i];
}
for (int i=1;i<=q;++i)
{
ci... | 0 | 2,717,258 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
cout << 0 << endl;
string zero; cin >> zero;
if (zero == "Vacant") return 0;
string s;
int left = 0, right = N;
for (int i = 0; i < 19; i++) {
int mid = (left + right) / 2;
cout << mid << endl;
cin >> s;
if (s == "... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
string s, t;
cin >> s >> t;
int n = s.size(), m = t.size();
for (int i = n - m; i >= 0; i--) {
bool ok = true;
string res = s;
for (int j = i; j < i + m; j++) {
if (res[j] != '?' && res[j] != t[j - i]) {
ok = false;
... | 0 | 40,455,011 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define repd(i,a,b) for (int i=a;i<int(b);i++)
#define rep(i,n) repd(i,0,n)
#define VARNAME(v) #v
using P = pair<int,int>;
constexpr int MOD = 1000000007;
constexpr ll INF = 1e16;
#pragma region... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N, M, K;
cin >> N >> M >> K;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= M; j++) {
if (i*j+(N-i)*(M-j) == K) {
puts("Yes");
return 0;
}
}
}
puts("No");
} | 0 | 57,907,842 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define rep0(i,j) for(int i=0;i<j;i++)
#define rep1(i,j) for(int i=1;i<=j;i++)
#define rep0d(i,j) for(int i=j-1;i>=0;i--)
#define MOD 1000000007
#define MAX (lli)1e12
typedef pair<lli... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | 0 | 60,693,737 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
using namespace std;
int main(){
int s, w;
cin >> s >> w;
if(s > w) puts("safe");
else puts("unsafe");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int64_t Comb(int n,int m){
if(m==0) return 1;
int64_t v=1;
m=min(m,n-m);
rep(i,n-m+1,n+1) v*=i;
rep(i,1,... | 0 | 88,105,792 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define fi first
#define se second
#define INF 1000000009
#... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int main() {
int M, N; scanf("%d%d", &M, &N);
int X[100000][2]; rep(i, N) rep(j, 2) scanf("%d", &X[i][j]);
int P[100000]; rep(i, N) P[i] = i;
auto cmpX = [&X](int ... | 0 | 59,855,701 |
#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 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 REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).... | 0 | 37,258,031 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b >> c;
if(c < b)
{
int t;
t = b;
b = c;
c = t;
}
if(b < a)
{
int t;
t = a;
a = b;
b = t;
}
if(c < b)
{
int t;
t = b;
... | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int,int>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
using namespace std;
int modpow(int x, int y, int m = mod... | 0 | 52,528,296 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long i,j,k,a,b,c=0,d=0,n,m,t;
cin>>n;
vector<string>A(n);
vector<int>B(n);
string s;
for(i=0;i<n;i++)
cin>>A[i]>>B[i];
cin>>s;
for(i=n-1;i>=0;i--)
{
if(A[i]==s) break;
else d+=B[i];
}
cout<<d<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using VVI = vector<vector<int>>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
bool dp[30009][4][1009];
string s;
int... | 0 | 94,598,853 |
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define REP(i,a,n) for(int i = a ; i < n ; i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
void solve(){
}
int main(){
st... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
string s;
cin >> s;
int len = s.si... | 0 | 96,598,457 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> W(N);
int rec = 0;
for (int i = 0; i < N; i++) {
cin >> W[i];
}
for (int i = 1; i < N; i++) {
if (W[i - 1][W[i - 1].length() - 1] != W[i][0]) {
rec++;
}
}
sort(W.begin(), W.end());... | #include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(a) max((a),-(a))
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repe(i,n) rep(i,(n)+1)
#define per(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define pere(i,n) rep(i,(n)+1)
#define all(x) (x).b... | 0 | 97,490,507 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C;
cin>>A>>B>>C;
int ans=max(0,C-(A-B));
cout<<ans<<endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<bool> a(N + 1, true);
for(int i = 0; i < M; i++){
int t;
cin >> t;
a[t] = false;
}
const int MOD = 1e9 + 7;
vector<long long> dp(N + 1);
dp[0] = 1;
for(int i... | 0 | 84,811,431 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#defin... | #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<ll,ll>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_elemen... | 0 | 100,016,157 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,k=0,ans=0;
cin >> n;
string a[n];
int b[n];
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
}
string x;
cin >> x;
for(int i=0;i<n;i++){
if(a[i]==x) k = i;
}
for(int i=k+1;i<n;i++) ans += b[i];
... | 0 | 46,312,218 |
#include <iostream>
#include <cstdio>
using namespace std;
#define MAX_SIZE (1000000)
int prime[MAX_SIZE];
int main()
{
int n;
prime[0] = prime[1] = 0;
for (int i = 2; i < MAX_SIZE; i++){
prime[i] = 1;
}
for (int i = 2; i * i < MAX_SIZE; i++){
if (prime[i]){
for (int j = i * i; j < MAX_SIZE; j += i){
pr... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_... | 0 | 77,025,215 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define vv(T) std::vector<std::vector<T>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
deque<int> B;
for (int i = 0; i < n; ++i)
{
int a;
cin >> a;
i... | #include<iostream>
using namespace std;
int main()
{
int m, f, r;
for(int i=0; ; i++){
cin >> m >> f >> r;
if(m==-1 && f==-1 && r==-1) break;
int a = m+f;
if(a>=80) cout << 'A' << endl;
else if(a>=65 && a<80) cout << 'B' << endl;
else if(a>=50 && a<65) cout << 'C... | 0 | 14,647,048 |
#include"bits/stdc++.h"
#define ll long long
#define inf 100005
#define mod 1000000007
#define pb push_back
using namespace std;
vector<vector<ll>>g(inf);
vector<ll>indgree(inf);
vector<ll>dist(inf);
bool visted[inf];
int main(){
ll h,w,m,a,b,temp1,temp2;
cin>>h>>w>>m;
vector<ll>rw(h+1);
vector<ll>cols(w+1);
map<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = unsigned long long;
using p = pair<int, int>;
int main()
{
int N;
cin >> N;
int count = 0;
while (N != 0)
{
if (to_string(N).length() % 2 != 0)
{
++count;
}
... | 0 | 49,552,355 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int h,w,a,b;
cin >> h >> w >> a >> b;
string s,t;
rep(i,a){
s.push_back('0');
t.push_b... | #include<iostream>
using namespace std;
int main() {
int h, w;
char a[110][110];
int comp_h[110] = {};
int comp_w[110] = {};
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) cin >> a[i][j];
}
int ii = 0;
for (int i = 0; i < h; i++) {
bool comp_... | 0 | 81,692,407 |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
cout << N * 800 - (N / 15) * 200 << endl;;
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, i#... | 0 | 19,742,450 |
#include <iostream>
using namespace std;
int main(int argc, char *argv[]){
int d,S;
while(cin>>d){
S=0;
for(int i=0;i<600;i+=d){
S+=i*i*d;
}
cout<<S<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n;
cin>>n;
map<char,int> S;
string s1;
cin>>s1;
rep(i,s1.length()){
S[s1[i]]++;
}
for(int i=1;i<n;i++){
str... | 0 | 15,350,927 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll mod=1e9+7;
#define PI 3.1415926535897932385
#define inf 9e18
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
typedef pair<long long, long long> ii;
... | #include <bits/stdc++.h>
#define max 100010
using namespace std;
int q_sort(int d[],int left,int right){
if(left >= right) return 0;
int pipot = d[(left+right)/2], l = left, r = right, tmp;
while(l<r){
while(d[l] < pipot) l++;
while(d[r] > pipot) r--;
if( l <= r){
tmp = d[l];
d[l] = d[r];
d[r] = tmp;... | 0 | 21,950,717 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int,int>;
template<class T>bool chmax(T &a, const T &b) { if (a<... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | 0 | 47,725,087 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
template <typename T, typename U> std::istream&operator>>(st... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/rope>
#pragma 03
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops, no-stack-protector")
#pragma GCC target("sse,sse2,ss... | 0 | 69,916,110 |
#include <cstdio>
#include <iostream>
#include <string>
#include <map>
using namespace std;
map<string, int> mp;
string name;
int s[110];
int main()
{
int n; cin >> n;
for (int i = 1; i <= n; ++i)
{
cin >> name >> s[i];
mp[name] = i;
}
cin >> name;
int sum = 0;
for (int i = mp[name] + 1; i <= n; ++i) sum += ... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
using Graph ... | 0 | 35,463,878 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 18,844,194 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
bool c[... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
int a, b, c;
cin >> a >> b >> c;
for(int i = 1; i< b; i++){
if(((a*i)-c)%b==0){
... | 0 | 47,322,681 |
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if(b==0) return a;
return gcd(b, a%b);
}
int main() {
int X;
cin>>X;
int res = 360/(gcd(360, X));
cout<<res<<endl;
return 0;
} | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | 0 | 78,711,694 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef l... | #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<string>
#include<cctype>
using namespace std;
bool check(int W,int H,int x,int y,int r){
if(x<=0||y<=0)return 0;
if(x-r<0||y-r<0)return 0;
if(x+r>W||y+r>H)return 0;
return 1;
}
int main(){
int w,h,x,y,r;
cin>>w>>h>>x>>y>>r;
if(check(w... | 0 | 50,876,513 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | #include <iostream>
#include <vector>
#include <cstring>
using namespace std;
int main(){
int a, b;
while(cin >> a >> b, a+b){
int n;
cin >> n;
int field[20][20];
memset(field, 0, sizeof(field));
for(int i=0; i < n; i++){int x, y; cin >> x >> y; field[y][x] = -1;}
... | 0 | 4,515,698 |
#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 INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int N = s.size(... | #include <bits/stdc++.h>
const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 20;
const int MMAX = 20;
const int KMAX = 50;
const int MOD = 1e9 + 7;
using namespace std;
#if __cplusplus >= 201103L
#define ALL(v) begin(v),end(v)
#define SORT(v) sort(begin(v), end(v))
#define FIND(v,x) find(begin(v), end... | 0 | 64,239,760 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int>>adj(n, vector<int>(n));
for (int i = 0;i < n;i++) {
int u, k;
cin >> u >> k;
for (int j = 0;j < k;j++) {
int v;
cin >> v;
adj[u - 1][v - 1] = 1;
}
}
for (int i = 0;i <n;i++) {
for (int j = 0... | #include<bits/stdc++.h>
using namespace std;
int main(){
int matriz[4][4];
memset(matriz, 0, sizeof(matriz));
for(int i = 0; i < 3; i++){
int peso;
cin>>peso;
if(i == 0){
matriz[1][2] = peso;
matriz[2][1] = peso;
}else if(i == 1){
mat... | 0 | 13,003,467 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <iostream>
#include <vector>
#define MAX 100100
#define rep(i,p) for(int i=0;i<p;i++)
#define pb push_back
using namespace std;
int n,temp,length,j;
int LAST[MAX]={0};
std::vector<int> A;
int binary_search (int x, int end) {
int m,s=1,l=end;
if (l-s <= 1) {
if (LAST[1] > x) return 1;
else return 2;... | 0 | 19,220,468 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #include<iostream>
#include<iomanip>
#include<cstdlib>
#include<stdio.h>
#include<time.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for... | 0 | 3,131,079 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define DEBUG2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, m, n) for (ll(i) = (ll)(m); i < (ll)(n); ++i)
#define REP2(i, m, n) for (ll(i) = (ll)(n)-1; i >= (... | 0 | 77,361,294 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tr... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h, w;
cin >> h >> w;
if (h == 1 || w == 1) {cout << 1 << '\n'; return 0;}
int h1,h2,w1,w2;
if (h%2==0)
{
h1 = h/2;
h2 = h/2;
}
else
{
h1 = h/2+1;
h2 = h1-1;
}
if (w%2==0)
{
... | 0 | 70,274,160 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #include <bits/stdc++.h>
using namespace std;
int a;
int main() {
string s, g;
cin >> s >> g;
int jum = 0;
for(int k = 0; k<s.length(); k++){
if(s[k]!=g[k]){
jum++;
}
}
cout << jum << '\n';
} | 0 | 28,978,426 |
#include <bits/stdc++.h>
using namespace std;
bool is_matched(vector<string> &va, vector<string> &vb, int y, int x) {
bool ans = true;
for (int i = 0; i < va.size() && ans; ++i) {
for (int j = 0; j < va.size(); ++j) {
if (vb[i + y][j + x] != va[i][j]) {
ans = false;
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i, n){
cin >> a.at(i);
}
map<int, int> mp;
rep(i, n){
... | 0 | 73,628,215 |
#include <bits/stdc++.h>
using namespace std;
using int64 = int_fast64_t;
using PAIR = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;
#define int int64
#define INIT ios::sync_with_stdio(false);cin.tie(0);
#define VAR(type, ...) ... | #include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename ... | 0 | 41,438,643 |
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chron... | #include <iostream>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
using int64 = long long;
int64 calc(int64 h, int64 w) {
int64 res = INT_MAX;
for (int i=1; i<h; i++) {
int64 a = i * w;
int64 rest_h = h - i;
... | 0 | 27,151,304 |
#include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
#define MOD 1000000007
using namespace std;
signed main() {
int a,b;
while(cin>>a>>b,a||b) {
if (a>b) swap(a,b);
cout << a << " " << b << endl;
}
} | #include <iostream>
using namespace std;
int main()
{
string x;
while (true) {
cin >> x;
if (x[0] == '0') {
return 0;
}
int sum = 0;
for (int i = 0; i < (int)x.size(); i++) {
sum += (int)x[i] - '0';
}
cout << sum << endl;
}
} | 0 | 69,801,406 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin>>N;
vector<ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
int root(int x) {
if (par[x] < 0) {
return x;
} else {
return p... | 0 | 85,867,611 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,dp[111][111],p[111];
int rec(int i,int j){
int Min=2*1e9;
for(int k=0;k<i-1;k++){
Min=min(Min,dp[j+1][j+k+1]+dp[j+k+2][j+i]+p[j]*p[j+k+1]*p[j+i]);
}
return Min;
}
signed main(){
cin>>n;
cin>>p[0]>>p[1];
for(int i=2;i<=n;i++){
... | #include<iostream>
using namespace std;
int dp[100][100],x[100][100],H,W,n,a,b;
int main(){
while(true){
cin>>H>>W;if(H==0)break;
cin>>n;
for(int i=0;i<10000;i++){dp[i/100][i%100]=0;x[i/100][i%100]=0;}
for(int i=0;i<n;i++){cin>>a>>b;x[a][b]=1;}
dp[0][1]=1;
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
... | 0 | 44,649,209 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
int main() {
int n, m;
cin >> n >> m;
long long a[n][3];
for ( int i = 0; i < n; i++ ) {
for ( int k = 0; k < 3; k++ ) { cin >> a[i][k]; }
}
long long ans = -INF;
for ( int bit = 0; bit < 8; bit++ ) {
vector<long long> tmp;
... | #include <bits/stdc++.h>
using namespace std;
const double pi = 2 * acos(0.0);
const double eps = 1e-8;
#define REP(i,a,b) for(int i=(a); i<(b);++i)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int Cost;
struct Edge {
... | 0 | 28,187,743 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n, n) {
int a[1001];
int dif = 1<<25;
for(int i = 0; i < n; i++) {
cin >> a[i];
for(int j = 0; j < i; j++) dif = min(dif, abs(a[i] - a[j]));
}
cout << dif << 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 | 77,254,139 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef lon... | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | 0 | 93,051,848 |
#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(){
string str;
bool flag=false;
cin >> str;
sort(str.begin(),str.end());
if(str.at(0)==str.at(1)){
if(str.at(2)==str.at(3)){
if(str.at(1)!=str.at(2)){
... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n,i,t=0,h=0;
string tstr,hstr;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> tstr >> hstr;
if(tstr==hstr){
t++;h++;
}
else if(tstr>hstr)t+=3;
else h+=3;
}
cout <<t<<' '<<h<<endl;
return 0;
} | 0 | 63,514,515 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cstdio>
#include <set>
#include <map>
const int MAXN = 2e5 + 10;
typedef long long ll;
using namespace std;
int main()
{
ll a, b, c, d, x, y;
cin >> a >> b >> c >> d;
ll maxn = a*c;
maxn = max(maxn, a*d);
maxn ... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,n) REP(i,0,n)
typedef lo... | 0 | 25,362,950 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int p=0;
int count=0;
int max=0;
for(int i=0;i<s.size();i++){
if(s[i]=='R'){
count++;
if(count>max){
max=count;
... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 29,973,598 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int K, N, O, i;
cin >> N >> K;
i = 0;
O = 1;
while (i < N)
{
i++;
if (2 * O > O + K)
{
O += K;
}
else
{
O *= 2;
}
}
cout << O << endl;
} | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
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) {return b ? gcd(b,a%b):a;}
ll lc... | 0 | 15,368,411 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
int n, d;
cin >> n >> d;
int vec[n][d];
rep(i, n)
{
rep(j, d)
{
cin >> vec[i][j];
}
}
int flag = 0;
for (int i = 0; i < n; i++)
{
for (int j = i +... | #include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
#include... | 0 | 38,490,412 |
#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... | #include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)... | 0 | 59,201,769 |
#include <iostream>
using namespace std;
int main(){
int n;
long int a[5000],sum,ans;
while(1){
cin >> n;
if(n==0) break;
sum=0;
ans=-1000000;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
sum=0;
for(int j=0;i+j<n;j++){
sum+=a[i+j];
if(ans<sum){
ans=... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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... | 0 | 49,494,587 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
bool bo=false;
int a,b,c;
cin >>a>>b>>c;
rep(i,b)
if((i... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e16;
const double EPS = 1e-10;
cons... | 0 | 67,809,430 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,x,t,i,np=15,res=0;
int p[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
int c[5];
cin >> n;
fill(c,c+5,0);
for(i=0;i<np;i++){
x=n;
t=0;
while(x>0){
t+=x/p[i];
x/=p[i];
}
if(t>=74)
c[0]++;
... | 0 | 34,638,322 |
#include <stdio.h>
int main() {
int K, A, B;
scanf("%d %d %d", &K, &A, &B);
int N = (B/K) * K;
(N > B || N < A) ? puts("NG") : puts("OK");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B, K;
cin >> A >> B >> K;
int counter = 0;
int ans = 0;
for(int i = min(A, B); i >= 1; i--){
if(A % i == 0 && B % i == 0){
counter++;
}
if(counter == K){
ans = i;
break;
... | 0 | 8,579,279 |
#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 x;
cin >> x;
int ans = 0;
rep(a, 100) {
int sa = x;
sa -= a * 101;
if (sa < 0) continue;
rep(b, 50) {
i... | #include <iostream>
using namespace std;
int main(){
string s;
long long k;
cin>>s>>k;
long long n=s.size();
if(s[0]!=s[n-1]){
long long sum=0;
for(int i=0;i<n;i++){
long long cnt=1;
while(i+1<n&&s[i]==s[i+1]){
i++;
cnt++;
}
sum+=cnt/2;
}
cout<<sum*k<<en... | 0 | 88,843,095 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
string s;
cin>>s;
reverse(all(s));
int n=s.size();
string a="maerd";
string b="remaerd"... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
using namespace std;
using ll=int64_t;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int gcd(int a,int b){
if(a%b==0)
return b;
return gcd(b,a%b);
}
int main(){
int N,Y;
cin>>N>>Y;
for(int ... | 0 | 47,136,015 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, j, k, in) for (int i=j ; i<k ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i>=... | 0 | 90,895,289 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,d,x;
cin >> n >> d >> x;
rep(i,n){
int a;
cin >>... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> l, r;
if (n % 2) {
REP(i, n) {
int tmp;
cin >> tmp;
if (i % 2) r.push_back(t... | 0 | 19,660,707 |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(0);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 52,795,769 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
ll n;
cin >> n;
int input1[n];
... | 0 | 5,640,751 |
#include<bits/stdc++.h>
using namespace std ;
int main()
{
int n ;
while( cin >> n ,n )
{
int m ;
cin >> m ;
int num[ n ] ;
for( int i = 0 ; i < n ; i++ )
cin >> num[ i ] ;
int ans = 0 ;
for( int i = 0 ; i < n ; i++ )
{
int cnt = 0 ;
for( int j = i ; j < m + i && m + i < n ; j++ )
cnt +=... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define Mod 1000000007
int main() {
string s;
cin>>s;
ll k;
cin>>k;
if(s[0]!=s[s.length()-1]){
ll count=0;
for (int i = 0; i < s.length()-1; ++i) {
if(s[i]==s[i+1]){
count++;
... | 0 | 84,577,404 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
ll n;
cin >> n;
ll sum = 0;
ll ... | #include <iostream>
#include <string>
#include <vector>
#include <cctype>
using namespace std;
void count(vector<int>& table, string str){
for(int i = 0; i < str.size(); ++i){
int lower = tolower((int)str[i]);
if(islower(lower)){
table[lower] += 1;
}
}
}
int main()
{
vect... | 0 | 62,929,230 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <iostream>
using namespace std;
typedef long long ll;
const int MAX_N = 1e5 + 5;
ll arr [MAX_N];
int main () {
ios::sync_with_stdio(false);
int n, K;
cin >> n >> K;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll cur = 0;
for (int i = 0; i < K; i++) {
cur += arr[i];
}
for (int i = K... | 0 | 22,738,809 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
ret... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1};
const int dx[4]={1,0,-1,0};
const ll INF=1e10;
vector<ll>a,p;
ll... | 0 | 33,664,375 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <tuple>
#define ll long long
using namespace std;
ll factorial(ll n){
if(n==0){
return 1;
}
els... | 0 | 69,436,021 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define _LL long long
#define rep(i, n) for(_LL i = 0; i < (_LL)(n); i++)
template <class T> class MultiArray2
{
public:
T* _a;
int _w;
int _h;
MultiArray2(int w, int h, bool clr = false)
{
_w = w; ... | #include<bits/stdc++.h>
using namespace std;
#define FASTIO1 ios_base::sync_with_stdio(false)
#define FASTIO2 cin.tie(NULL),cout.tie(NULL)
#define count_1(p) __builtin_popcountll(p)
#define count_0(p) __builtin_ctzll(p)
#define all(x) (x).begin(),(x).end()
#define ll long long
#define pb push_back
#define mp make_pair
... | 0 | 41,770,494 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
template <class T>
bool chmax(T &a, const T &b) {
if (... | 0 | 78,544,092 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
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 ALL(x) x.begin(),x.end()
#define ll long long
const int in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | 0 | 39,389,966 |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int a[N];
bool visited[N];
for (int i=0; i<N; i++) {
cin >> a[i];
}
for (int i=0; i<N; i++) {
visited[i] = false;
}
visited[0] = true;
int next = a[0];... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
int a,b;
cin>>a>>b;
string s;
cin>>s;
if(s[a]!='-'){
cout<<"No\n";
return 0;
}
for(int i=0;i<a;i++){
if(s[i]>=48 && s[i]<=57) continue;
else{
... | 0 | 88,662,356 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEB... | #include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | 0 | 5,190,830 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
char ch;
cin >> ch;
puts((ch >= 'a' && ch <= 'z') ? "a" : "A");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int l = s.size();
while(l > 0){
if(l >= 5 && s.substr(l - 5, 5) == "dream"){
l = l - 5;
}
else if(l >= 7 && s.substr(l - 7, 7) == "dreamer"){
l = l - 7;
}
else if(... | 0 | 88,653,005 |
#ifdef __GNUC__
#pragma GCC target("avx2")
#pragma GCC optimize ("O20")
#pragma GCC optimize ("tree-vectorize")
#pragma GCC optimize("unroll-loops")
#define iss std::cin
#endif
#include "bits/stdc++.h"
#define rep(i, times) for(ll i = 0; i < (times); ++i)
using ll = int_fast64_t; using namespace std;
#ifndef __GNUC__
s... | #include<iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include<map>
#include<cstring>
#include<iomanip>
#include <string>
#include <vector>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long unsigned llu;
typedef long double ld;
#define ll long long
#define PI 3.1... | 0 | 25,579,046 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string sh; cin>>sh;
if (sh[2] == sh[3] && sh[4] == sh[5])
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
} | #include <fstream>
#include <cmath>
#include <vector>
#include <iostream>
using namespace std;
#define MOD 998244353
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = (b-1); i >= (a); i--)
#define RF0(i,b) RFO(i,0,b)
#define lli long long int
#define pii pair... | 0 | 40,416,643 |
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define all(x) begin(x), end(x)
#define loop(i,n) for(int i=0; i<n; i++)
#define rep(i,a,b,c) for(int i=a; i<b; i+=c)
#define brep(i,a,b,c) for(int i=a; i>b; i-=c)
#defi... | #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... | 0 | 76,828,315 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin>>N>>M;
map<int,int> m;
int64_t Z=0,A=0;
m[0]=1;
for(int i=0;i<N;i++){
int a;
cin>>a;
A=(A+a)%M;
m[A]++;
Z+=m[A];
}
Z-=N;
cout<<Z<<endl;
} | #include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std;
char a[1001][1001];
int v[1001][1001],n,h,w,sx,sy,ans;
int dir[4][2]={-1,0,1,0,0,1,0,-1};
char b[1001];
int s[1001][1001];
struct st
{
int x,y;
}st1,st2,fl,pp;
int check(st kk)
{
if(kk.x>=0&&kk.x<h&&kk.y>=0&&kk.y<w)
... | 0 | 87,478,757 |
#include <iostream>
#include <algorithm>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main(){
int n;
vector<int> v(1000,0);
int dis,diss;
while(1){
cin >> n;
if( n == 0 ){
break;
}
for(int i = 0; i < n;i++){
cin >> v[i];
}
dis... | #include <iostream>
using namespace std;
bool less_than(const string a, const string b) {
return a[1] < b[1];
}
void bubble_sort(string* a, int length) {
for (int i = 0; i < length; ++i) {
for (int j = length - 1; j > i; --j) {
if (less_than(a[j], a[j - 1])) {
swap(a[j], a[j ... | 0 | 72,839,976 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define rep1(i,a,b) for(int i=a;i<=(b);++i)
#define per(i,a,b) for(int i=a;i>(b);--i)
#define per1(i,a,b) for(int i=a;i>=(b);--i)
#define LL long long
#define inf 0x7f7f7f7f
#define N 35
using namespace std;
struct Node
{
int key;
Node *prev,*next;
};
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int INT = 1e9;
const ll LINF = 1e18;
string s;
vector<string> button(10);
void init(){
button[1] = ".,!? ";
button[2] = "abc";
button[3] = "def";
button[4] = "ghi";
button[5]... | 0 | 96,153,421 |
#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 yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,int> Pi;
typedef pa... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const int mod = 1e9+7;
char s[N];
int d[N], r[N];
int main(){
int n, ans;
scanf("%d", &n);
scanf("\n%s", s+1);
for(int i=1; i<=n*2; ++i){
d[i] = d[i-1];
if(s[i] == s[i-1]) d[i] ^= 1;
}
for(int i=n*2; i>=1; --i){
if(d[i] == 1) r[i] =... | 0 | 57,258,728 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 1; i <= n; ++i)
using namespace std;
#define int long long
const int maxn = 1020;
int n, x[maxn], y[maxn], odd, even;
namespace sol{
int a[59], k, ham;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
const char dr[] = "DULR";
void dfs(int x, in... | #include<bits/stdc++.h>
using namespace std;
int n;
struct node
{
int pos;
int num;
}a[100005];
bool cmp(node x, node y)
{
return x.num < y.num;
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i].num;
a[i].pos = i;
}
sort (a + 1, a + n + 1, cmp);
for (int i = 1; i <= n; i++)cout << a[i].po... | 0 | 65,740,591 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a,b;
cin >> a >>b;
if(a=='H' && b=='H'){
cout << "H" << endl;
}
else if(a=='D'&&b=='D'){
cout << "H" << endl;
}
else {
cout << "D" << endl;
}
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll mypow(ll p, ll n){
ll res = 1;
while (n>0){
if (n%2==0){
p *= p;
n /= 2;
} else {
res *= p;
n--;
}
}
return res;
}
int main() {... | 0 | 40,576,382 |
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
using s64 = int64_t;
constexpr s64 INF = 1'010'000'000'000'000'000LL;
template<typename T, typename U>
bool chmin(T& xmin, const U& x)
{
if(x < xmin) {
xmin = x;
return true;
}
else {
return false;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
using Edge = pair<ll,ll>;
using Graph = vector<v... | 0 | 4,023,771 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
{
int n ;
cin>>n;
vector <int> arr(n);
for(int i = 0;i<n;i++)
{
cin>>arr[i];
}
set <int> check;
check.insert(ar... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 71,747,890 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T>
void print_vec(vector<T> v) {
for (T i : v) cout << i << " ";
cout << end... | #include <iostream>
using namespace std;
int main(){
int n,m,d[10],a,b,t;
while (1){
for (int i=0;i<10;i++)d[i]=0;
t=0;
cin >> n >> m;
if (n==0&&m==0)break;
for (int i=0;i<n;i++) {
cin >> a >> b;
d[b-1]+=a;
}
for (int i=9;i>=0;i--){
if (m==0) break;
if (d[i]<=m){
... | 0 | 90,875,140 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#define rep(i,n) for(int i=0... | #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... | 0 | 6,058,737 |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf(... | #include <iostream>
#include <map>
#include <string>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
int f(string const & s){
int p = 0, res = 0;
while(p < (int)s.size()){
int n = 0;
while(isdigit(s[p])){
n *= 10;
n +=... | 0 | 17,622,214 |
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | 0 | 83,421,440 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.