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 main(){
#ifdef LOCAL
freopen("input", "r", stdin);
#endif
string s, t;
cin >> s >> t;
cout << t << s << endl;
return 0;
} | #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 | 76,810,796 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int N, M, K;
cin >> N >> M >> K;
for (int i = 0; i <= N; ++i) {
int p = i * M;
for (int j = 0; j <= M; ++j) {
int q = j * N;
int ans = p + q - i * j * 2;
if (ans == K) {
cout << ... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define int long long
#define pb push_back... | 0 | 63,118,282 |
#include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int fib[45]={1,1};
int n;
cin>>n;
for(int i=2; i<=n; i++) fib[i]=fib[i-1]+fib[i-2];
cout<<fib[n]<<'\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=51,INF=1<<30;
int main(){
int N;cin>>N;
vector<int> A(N);
for(int i=0;i<N;i++) cin>>A[i];
int left=0,right=INF;
while(right-left>1){
int mid=(left+right)/2;
... | 0 | 15,536,902 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
int main(){
int n;
while(cin>>n&&n){
int ans = INF;
vector<int> a(n);
... | #include <iostream>
#include <vector>
#include <queue>
static constexpr long long int INF = 10000000000;
int main() {
int V, E;
std::cin >> V >> E;
std::vector<std::vector<long long int>> costs(V, std::vector<long long int>(V, INF));
for (int i = 0; i < V; i++) {
costs[i][i] = 0;
}
for ... | 0 | 68,611,987 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF 2147483647
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<pair<string,int>> data(n,pair<string,int>());
rep(i,n)cin >> data.at(i).firs... | #include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> mp;
for(int n=0; n<N; n++) {
int A;
cin >> A;
mp[A]++;
}
int ans=mp.size();
int cnte=0;
for(auto itr=mp.begin(); itr!=mp.end(); itr++) {
if(itr->second%2==0... | 0 | 73,863,463 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin>>n,n){
string str,a="rldu";
bool leg[2]={};
int ans=0,now=1,num[2]={0,1};
for(;n>0;n--){
cin>>str;
for(int i=0;i<2;i++)if(str[0]==a[i])for(int j=0;j<2;j++)if(str[1]==a[2+j])leg[i]=num[j];
if(now==leg[0]&&now==leg[1]){
ans... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#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 | 49,552,877 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b; cin >> a >> b;
if (a <= 8 && b <= 8) puts("Yay!");
else puts(":(");
} | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
ll n, k;
cin >> n >> k;
vector<ll> p(n);
for(int i = 0; i < n; i++){
... | 0 | 32,637,228 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int x;
cin >> x;
(x < 1200)?cout << "ABC" : cout << "ARC";
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | 0 | 31,507,450 |
#include <bits/stdc++.h>
using namespace std;
void display(vector<long> B){
for(int i=0;i<B.size();i++){
cout<<B.at(i)<<endl;
}
cout<<endl;
}
int main() {
long N;
cin>>N;
vector<long> A(N);
for(int i=0;i<N;i++){
cin>>A.at(i);
}
long sum=0,times=0;
for(int i=0;i<N;... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main(){
int N;
cin >> N;
vector<ll>... | 0 | 62,272,413 |
#include <bits/stdc++.h>
using namespace std;
#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 all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
int A, B, C;
int main() {
cin >> A >> B >> C;
ll tmp = 0;
for (int i = 0; i < 6000; i++) {
tmp = A * i;
... | 0 | 39,313,244 |
#include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) x.begin(),x.end()
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int d;
cin >> d;
if (d == 25) cout << "Christmas" << endl;
else if (d == 24) cout <<... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << x << "\n";
#define debug2(x,y) cout << x << " " << y << "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
const ll mod = 1e9+7;
const int MAX = 2e5+5;
int main() {
string str;
cin >> str;
map<char,int> mp... | 0 | 38,996,144 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<double,double> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 1000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define se... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
#include <stack>
#include <ioman... | 0 | 1,067,310 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int n = S.size();
int cmax,max;
cmax = 0;
max = 0;
for(int i = 0;i < n;i++){
if(S.at(i) == 'R')cmax++;
if(S.at(i) == 'S')cmax = 0;
if(cmax > max)max = cmax;
}
cout << max;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | 0 | 4,561,432 |
#include <bits/stdc++.h>
#define fi first
#define se second
const int N = 2020;
const int mod = 1e9 + 7;
using namespace std;
int ans(int res)
{
cout << res << "\n";
exit(0);
}
int main()
{
ios_base::sync_with_stdio(0);
int x, y;
cin >> x >> y;
if(x <= y){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll t;
t = 1;
while(t--){
string s, t;
cin >> s >> t;
int len = s.length();
int len1 = t.length();
bool check = true;
if(len1 != len + 1)
check=false;
for(int i =0 ;i < len; i ++)
{
if... | 0 | 71,639,923 |
#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 a,b,c,k;
cin >> a >> b >> c >> k;
int xa = min(k,a);
k -= xa;
int xb = min(k,b);
k -= xb;
int xc = k;
cout << xa -xc << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 66,479,108 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
int r, g, b, n;
cin >> r >> g >> b >> n;
ll cnt = 0;
REP(i, 3001) REP(j, 3001) {
if (i * r + j * g <= n)
if ((n - (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define REPS(i,n) for (ll i = 1; i<=(ll)(n); i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_bac... | 0 | 97,831,004 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (long long)(n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
ll ans = 1;
string s;
cin >> n >> s;
vector<ll> c(3);
rep(i, n) {
if (s[i] == 'R') c[0]++;
else if (s[i] == 'G') c[1]++;
else c[2]++;
}
rep(i, 3) ans *= c[... | #include <bits/stdc++.h>
using namespace std;
#define NAME "D"
#define show(x) cout << (#x) << " is " << (x) << endl
#define ll long long
#define ms(arr,val) memset(arr,val,sizeof(arr))
#define len length()
const int maxn = 2e5;
vector< vector<int> >adj;
int main(){
int n,m;
cin>>n>>m;
adj = vector< vector... | 0 | 60,642,529 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
int i=0,j=0,cont=0;
cin >> s >> t;
int stam=s.size();
for(i=0;i<stam;i++){
if(s[i]!=t[i]){
cont++;
}
}
cout << cont << endl;
return 0;
} | 0 | 30,592,208 |
#include<iostream>
#include<cmath>
using namespace std;
int main () {
int N, K;
cin >> N >> K;
int count = K * pow(K - 1, N - 1);
cout << count << '\n';
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
ll n,m,x;
ll f(ll a) {
return a*a % m;
}
int main() {
cin >> n >> x >> m;
... | 0 | 69,991,810 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
long long N;
bool breakFlag = false;
bool zeroFlag = false;
long double res = 1;
long long ans;
cin >> N;
vector<long long> A(N, 0);
for (long long i = 0; i < N; i++)
{
cin >> A.at(i)... | 0 | 36,638,968 |
#include<bits/stdc++.h>
using namespace std;
using ll =long long int ;
int main()
{
ll n,k,sum=0;
cin>>n>>k;
ll arr[n];
for(int i=0;i<n;i++)
{
ll x;
cin>>x;
sum+=x;
arr[i]=x;
}
sort(arr,arr+n);
if(k==0)
cout<<sum<<endl;
else
{
if(n-k>0)
{
ll sum1=0;
for(int j=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
int main(){
ll X, Y, Z, K; cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
for(int i = 0; i < X; i++) cin >> A[i];
for(int i = 0; i < Y; i++) cin >> B[i];
for(int i = 0; i < Z; i++) cin >> C[i];
... | 0 | 4,990,570 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846
#define mod 1000000007
#define ll long long
#define vi vector<int>
#define ii pair<int, int>
#define pb push_back
#define all(c) (c).begin(), (c).end()
const int N = 1e6;
int n, a[N], spf[N + 1], g;
bool vis[N + 1];
int gcd(int a, int b) {
... | #include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RRE... | 0 | 100,121,321 |
#include<bits/stdc++.h>
using namespace std;
const long long int modu=1e9+7;
#define endl '\n'
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define inp(x) for(auto &t:x) cin>>t;
#define itr vector<int>::iterator
#define debug(a) cout << #a << "=" << a << ' '<<endl;
#define out(x) for(aut... | #include <iostream>
using namespace std;
string solve(char c, string vowel)
{
for(int i = 0; i < vowel.size(); i++)
if( c == vowel[i] )
return "vowel";
return "consonant";
}
int main()
{
char c;
cin >> c;
string vowel = "aeiuo";
cout << solve(c,vowel);
} | 0 | 16,143,959 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=998244353;
const ll MAX=91... | #include "bits/stdc++.h"
using namespace std;
using ll=long long;
#define print(n) cout<<n<<endl
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ALL(s) s.begin(),s.end()
#define P pair<ll,ll>
#define vl vector<ll>
#define vi vector<int>
#define vvl vector<vector<ll>>
#define vvi vector<vector<int>>
const int M=200111;
... | 0 | 62,094,125 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, co... | #include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#in... | 0 | 97,493,067 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int A[100010];
int main()
{
... | #include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>... | 0 | 17,374,625 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 110;
int n, a[N];
int main() {
cin >> n;
int num = log(n) / log(2);
cout << pow(2, num) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
void solve()
{
int x,n;
cin>>x>>n;
if(n==0)
{
cout<<x;
return;
}
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
int end=arr[n-1];
int ans=abs(x-arr[0]+1);
int ref=arr[0]-1;
for(int i=0;i<n-1;i++)
{
for(int j=ar... | 0 | 88,995,059 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
for(int i=0; i<s.size(); i+=2)
{
cout << s[i];
}
cout << endl;
return 0;
} | #include <iostream>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <cstring>
#include<cmath>
using namespace std;
int main() {
int x, y, z = 1;
cin >> x>>y;
for (int i = 0; i < x; i++) {
if (z * 2 >=z + y)
z = z + y;
else
z ... | 0 | 70,867,646 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >>N>>M;
vector<pair<long long,long long>> P(N);
vector<pair<long long,long long>> P1(M);
for(int i=0;i<N;i++){
int a,b;
cin >>a>>b;
P.at(i)=make_pair(a,b);
}
for(int i=0;i<M;i++){
int a,b;... | 0 | 65,742,030 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
typedef long long int ll;
typedef long double ld;
const ll N = 1e5+9;
const ll mod =998244353;
#define x first
#define y second
#define pb push_back
#define mp make_pa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll zero = 0;
ll INF = 10000000000;
vector<int> res(string S){
vector<int> re;
int tmp = 1;
for(int i = 1; i < S.size(); i++){
if( S.at(i) == S.at(i-1) ){
tmp++;
}
else{
re.push_back(tmp);
... | 0 | 63,877,609 |
#include<iostream>
int main(void){
long long a;
double b;
std::cin >> a >> b;
long long bint = b * 100 + 0.5;
long long ans;
ans = a * bint / 100;
std::cout << ans << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
int n,m;
cin >> n >> m;
char s[n][n],t[m][m];
rep(i,n){
rep(j,n){
cin >> s[i][j];
}
}
rep(i,m){
rep(j,m){
cin >> t[i][j];
}
}
int i,j,k,l;
str... | 0 | 82,283,861 |
#include <iostream>
using namespace std;
const int MAXN = 1e5+5;
int arr[MAXN];
int main(){
int n,z,w;
cin>>n>>z>>w;
for(int i=1;i<=n;i++){
cin>>arr[i];
}
if(n == 1){
cout<<abs(arr[1]-w)<<endl;
return 0;
}
cout<<max(abs(arr[n]-w),abs(arr[n-1]-arr[n]));
} | #include <iostream>
#include <algorithm>
#include <set>
#include <queue>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
set<int> in, out;
pair<int, int> sushi[N];
for(int i=0; i<N; i++){
cin >> sushi[i].second >> sushi[i].first;
}
sort(sushi, sushi + N, greater<pair<int, i... | 0 | 1,032,140 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | 0 | 37,517,788 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 50 + 10;
int n = 50;
ll k;
int main()
{
scanf("%lld", &k);
ll base = k / n + 49;
int l = k % n;
printf("%d\n", n);
for(int i = 1; i <= n - l; ++i) printf("%lld ", base - l);
for(int i = n - l + 1; i <= n; ++i) printf("%lld ", bas... | #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 | 34,757,124 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N ;
cin >> N;
map<int,int>A;
map<int,int>B;
for (int n = 0;n<N;++n) {
int num;
cin >> num;
if (0 == n%2) {
A[num]++;
}
else {
B[num]++;
}
}
int A0 = 0;
int a0 = 0;
int A1 = 0;
int a1 = 0;
for (auto itr = A.begin(); itr != A.end... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 5,703,396 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long A,B,C,K;
cin >> A >> B >> C >> K;
if(K%2 == 0){
if(abs(A-B) > pow(10,18)){
cout << "Unfair" << endl;
}else{
cout << A-B << endl;
}
}else{
if(abs(B-A) > pow(10,18)){
cout << "Unfair" << endl;
}else{
c... | #include <bits/stdc++.h>
using namespace std;
int main()
{
double a, b, C;
cin >> a >> b >> C;
double b_cos = b * cos(C*2*M_PI/360.);
double b_sin = b * sin(C*2*M_PI/360.);
double S = a * b_sin / 2;
double c;
if(a == b_cos){
c = b_sin;
}else{
c = sqrt((a-b_cos) * (a-b_cos... | 0 | 54,760,923 |
#include<cstdio>
#include<algorithm>
using namespace std;
int w,h,n,a,b,s[17][17];
int d(int x,int y){
if(x==w&&y==h) return 1;
if(x>w||y>h||s[x][y]!=0) return 0;
return d(x+1,y)+d(x,y+1);
}
int main(){
scanf("%d %d",&w,&h);
while(w!=0&&h!=0){
fill_n(*s,17*17,0);
scanf("%d",&n);
for(int i=0;i<n;i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#defin... | 0 | 77,600,539 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 55,282,766 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
vector<int>a(s.length());
vector<int>c(26,0);
for (int i = 0; i < s.length(); i++) {
a.at(i) = s.at(i) - 'a';
c.at(a.at(i))++;
}
if (s.length() <= 25) {
ll ans;
for (int i = 0; i < 26; i++) {
if (c.at(... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<vector<int>> sheet(3,vector<int>(3));
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin>>sheet.at(i).at(j);
}
}
int N;
cin>>N;
vector<int> B(N);
for(int i=0;i<N;i++){
cin>>B.at(i);
}
for(int i=0;i<3;i++){
for(int j=0;... | 0 | 11,348,011 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int s;
cin>>s;
vector<int> v(1000000,0);
int count=1;
v.at(s-1)=1;
while(true){
count++;
if(s%2==0) s=s/2;
else s=3*s+1;
v.at(s-1)++;
if(v.at(s-1)==2) break;
}
cout<<count<<endl;
} | #include <iostream>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int coin[21];
coin[0] = 0;
for (int i = 1; i < M+1; ++i){
int c;
cin >> c;
coin[i] = c;
}
int c[21][50001];
for(int i = 0; i < N+1; i++){
c[0][i] = 500000;
}
for(int j =... | 0 | 49,691,415 |
#include<bits/stdc++.h>
#define rep(i, n) for(int (i)=0 ;i <(n); ++(i))
#define REP(i,m,n) for(int (i) = (m); (i) <= (n); ++(i))
#define yorn(f) puts((f)?"Yes":"No")
#define YORN(f) puts((f)? "YES":"NO")
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
yorn(a<=c && c<=b);
... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#define rep(i,a) for... | 0 | 14,145,455 |
#include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
struct edge {
int to, cost;
};
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
... | #include <iostream>
using namespace std;
const int KINDMAX = 21;
const int PAYMAX = 50001;
const int COINMAX = 10000;
int dp[PAYMAX][KINDMAX];
int coinMem[PAYMAX];
int main() {
int pay, kind, coin[KINDMAX];
cin >> pay >> kind;
for (int i=0; i<kind; ++i) {
cin >> coin[i];
}
for (int j=0; j<=pay/coin[0]; ++... | 0 | 7,064,780 |
#include <iostream>
#include <vector>
using namespace std;
int binarySearch(vector<int> A, int key){
int left = 0, right = A.size();
while(left < right){
int mid = (left + right) / 2;
if(A[mid] < key)
left = mid + 1;
else
right = mid;
}
return left;
}
void LISout(vector<int> v){
for(int i=0;i<v.size();... | #include <iostream>
#include <string>
#include <stack>
using namespace std;
namespace Solver {
string s;
inline bool Read() {
getline(cin, s);
return s != ".";
}
inline void Work() {
stack<char> stk;
bool ok = true;
for (int i = 0; i < s.length(); i++) {
... | 0 | 55,587,261 |
#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;
int main() {
int X,t; cin >>X >>t;
int ans=X-t;
if (ans<0) ans=0;
cout <<ans <<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();... | 0 | 70,325,309 |
#include <iostream>
int main(int argc, char *argv[]) {
int a, b;
char o;
std::cin >> a >> b;
if (a > b) std::cout << "a > b" << std::endl;
else if (a < b) std::cout << "a < b" << std::endl;
else std::cout << "a == b" << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define... | 0 | 50,774,779 |
#include <iostream>
using namespace std;
string s[30][30];
int n,m,i,j,x,y ;
int main()
{
ios_base :: sync_with_stdio(false) ;
cin >> n >> m ;
for(i=0; i<n; i++)
{
for(j=0; j<m; ++j)
cin >> s[i][j] ;
}
for(i=0; i<n; i++)
{
for(j=0; j<m; j++)
if(s[i][j]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ll n;
cin >> n;
ll ans = mod;
for(ll i = 1; i*i <= n; i++){
if(n%i == 0){
ll a = to_string(n/i).size();
ll b = to_string(i).size();
... | 0 | 33,808,979 |
#include <iostream>
#include <string>
#include <map>
#include <vector>
using namespace std;
int main(){
map<string, int> word;
vector<string> w;
string str;
int max=0,length=0;
while(cin >> str){
w.push_back(str);
if(word.find(str) != word.end() ){
word[str]++;
}else{
word.insert( pair<string, int>(str... | #include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
#define ll long long
#define ar array
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int N,K;
cin >> N >> K;
int ans = 0;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (h>=K) ans++;
}
cout << ans << endl;
return 0;
} | 0 | 77,373,194 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n,a;
cin>>n;
vector<int>v;
double sum=0;
for(int i=0;i<n;i++)
{
cin>>a;
v.push_back(a);
sum+=a;
}
int x=ceil(sum/n);
int y=flo... | #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 ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
l... | 0 | 23,305,371 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); ++... | 0 | 94,178,809 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF = 2e9
#define LINF = 1e18
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
#define dump(x) cout << #x << "=" << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO")
#define Yes(n) cout << ((n) ? "Ye... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)
#define COUNTER int i= 0,j = 0,k = 0,l = 0,m... | 0 | 18,444,830 |
#include <bits/stdc++.h>
#define rep2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define sz size()
#define pb push_back
#define bg begin()
#define ed end()
#define fi first()
#define se second()
using namespace std;
using ll = long long;
usin... | #include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define all(v) v.begin(),v.end()
#define pb push_back
#define endl '\n'
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vl... | 0 | 63,615,631 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<ll, ll>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (ll i = begin; i < n; i++)
#define repe(i, begin, n) for (ll i = begin; i <= n; i++)
#define repr(i, begin, n) for (ll i = begin; i > begin - n; i--)
#define repre(i, begi... | 0 | 62,421,448 |
#include"iostream"
using namespace std;
int main()
{
int a,b,c;
int n;
cin>>n;
c=1;
a=1;b=1;
for(int i=1;i<n;i++)
{
c=a+b;
a=b;
b=c;
}
cout<<c<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 64,827,541 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,ans=0;
cin >> n;
for(int i =1;i<=n;i++){
int a=0;
for(int j =1;j<=i;j++){
if(i%j==0&&i%2!=0)
{
a+=1;
}
}
if(a==8)ans++;
}
cout <<ans;
} | #include <bits/stdc++.h>
using namespace std;
vector<long long> a(50);
bool is_ok(long long k, int n) {
for (long long x = k - 51; x <= k + 51; x++) {
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += ((a.at(i) + x - n + 1) + n) / (n + 1);
}
if (sum <= x) return tru... | 0 | 45,987,510 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(c) (c).begin(), (c).end()
#define CALL(c) (c).cbegin(), (c).cend()
#define RALL(c) (c).rbegin(), (c).rend()
#define CRALL(c) (c).crbegin(), (c).crend()
#define REP(i, n) for (int i = 0; i < static_cast<int>(n); i++)
#define FOR(i, s, n) for (int i = s; i < stati... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
ll t[n+1],x[n+1],y[n+1];t[0]=0,x[0]=0,y[0]=0;ll d=0;
for(int i=1;i<=n;i++){
cin>>t[i]>>x[i]>>y[i];
ll a=t[i]-t[i-1],b=abs(x[i]-x[i-1]),c=a... | 0 | 67,127,947 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int rev[n];
for(int i=0;i<n;i++)
{
rev[a[i]-1]=i+1;
}
for(int i=0;i<n;i++)
{
cout<<rev[i]<<" ";
}
} | #include <bits/stdc++.h>
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();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typed... | 0 | 29,028,333 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=1e5+10;
int a[maxn];
signed main(){
int n,m;
scanf("%lld%lld",&n,&m);
int lcm=1;
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
if(lcm>m){
continue;
}
lcm=lcm*a[i]/2/__gcd(lcm,a[i]... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second
... | 0 | 85,695,454 |
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <cmath>
#include <ios>
#include <ctype.h>
#include <stack>
#include <istream>
#include <stdio.h>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>
#include <functional>
#include <bitset>
#includ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 100005
int n , h;
int a[MAXX];
int main()
{
_FastIO;
cin >> h >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
h -=... | 0 | 33,791,407 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int x, y;
cin >> x >> y;
int i = 0;
while (i <= s.size()) {
if (i == s.size() || s[i] == 'T') {
x -= i;
break;
}
i++;
}
vector<int> dist[2];
int idx = 0;
int cur_dist = 0;
while (i < s.size()) {
... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uni... | 0 | 97,522,160 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
__float128 x=1;
int64_t a=1,b;
bool ok=true;
for(int i=0;i<n;i++){
cin >> b;
if(b==0){
cout << 0 << endl;
return 0;
}
a*=b;
x*=b;
if(x>1000000000000000000||a>1000000000000000000)
ok=false;
}... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define INF INFINITY
int N;
float dat[10][10];
int a,b,c,M;
int main(){
while(scanf("%d",&N),N){
memset(dat,0,sizeof(dat));
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
if(i!=j)da... | 0 | 36,288,272 |
#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... | #pragma GCC optimize("Ofast")
#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 <cstdl... | 0 | 97,437,147 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
int main(){
int... | 0 | 55,069,552 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n; int64_t ans = 0;
vector<int64_t> a(n), b(n);
priority_queue<pair<int64_t, int>> que;
for (auto i = 0; i < n; i++) {
cin >> a[i] >> b[i]; que.push({{a[i] + b[i]}, i});
}
for (auto i = 0; i < n; i++) {
auto ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end... | 0 | 9,386,604 |
#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 INF = 1001001001;
int main() {
int n;
cin >> n;
int m = INF;
int ans = 0;
rep(i,n) {
int p;
cin >> p;
if (p <= m) ans++;
m =... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#define ll long long
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
map<ll,ll> abmap;
for(ll i=0;i<n;i++){
int a,b;
cin>>a>>b;
abmap[a]+=b;
}
ll sum=0;
for... | 0 | 42,238,846 |
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int K, S;
cin >> K >> S;
int cont = 0;
for (int X = 0; X <= K; X++)
{
for (int Y = 0; Y <= K; Y++)
{
int Z = S - X - Y;
if (Z >= 0 && Z <= K)
cont++;
}
}
cout << cont;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#define MOD 1000000007
using namespace std;
typedef unsigned long long ull;
void p() {
cout << "\n";
}
template<class Head, class... Body>
void p(Head head, Body... body) {
cout << head << ",";
p(body...);
}
int main(int argc, char const *argv[]) {
... | 0 | 14,346,751 |
#include <bits/stdc++.h>
using namespace std;
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x... | #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 all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(... | 0 | 42,801,270 |
#include <sys/time.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <utility>
#include <cctype>
using namespace std;
using ll = long long;
using... | #include <cstdio>
#include <cmath>
#include <vector>
using namespace std;
void rotate(double r[2], const double pos0[2], const double pos1[2], double a){
double x = cos(a)*(pos1[0]-pos0[0])-sin(a)*(pos1[1]-pos0[1]) + pos0[0];
double y = sin(a)*(pos1[0]-pos0[0])+cos(a)*(pos1[1]-pos0[1]) + pos0[1];
r[0] = x;
... | 0 | 84,872,558 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long ketasuu = 0, sum = 0;
for (int i = 0; i < N; ++i) {
long long d, c;
cin >> d >> c;
ketasuu += c;
sum += d * c;
}
cout << (sum - 1) / 9 + (ketasuu - 1) << endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef double ld;
typedef pair<ll,ll> pii;
typedef tree<ll, null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#defin... | 0 | 70,789,203 |
#include<cstdio>
int main(){for(int i=0;i<81;i++)printf("%dx%d=%d\n",i/9+1,i%9+1,(i/9+1)*(i%9+1));} | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 4 , MOD = 1e9 + 7;
int n;
vector<int> adj[N];
int memo[N][2];
int add(int a, int b){
a += b;
while(a >= MOD)
a -= MOD;
while(a < 0)
a += MOD;
return a;
}
int mul(int a , int b){
return (1ll * a * b) % MOD;
}
int solve(int u , in... | 0 | 68,280,561 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int n, d, x;
cin >> n >> d >> x;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(int i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;ll MM = 1000000000;ll mod = MM + 7;
int main() {
while(1) {
int n; cin >> n;
if(n == 0) return 0;
vector<string> v... | 0 | 75,916,265 |
#include "bits/stdc++.h"
using namespace std;
int gcd(int a, int b) {
if (a == 0) return b;
if (b == 0) return a;
else return gcd(b, a%b);
}
int main() {
int N, X;
cin >> N >> X;
vector<int>Num(N);
for (int n = 0;n<N;++n) {
cin >> Num[n];
}
int ans = 0;
for (int n = 0; n < N; ++n) {
ans = gcd(ans,abs(X-Nu... | #include<bits/stdc++.h>
using namespace std;
#define INFTY 200000000000
int main(){
int v,e;cin>>v>>e;
long long dis[v][v];
for (int i = 0; i < v; i++)
{
for (int j = 0; j < v; j++)
{
if(i==j)dis[i][j] = 0;
else dis[i][j] = INFTY;
}
}
f... | 0 | 97,328,873 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int counter = 0;
cin >> N;
for(int i = 0;i < N/3 + 1;i++){
if((N - 3*(i + 1) >= 0)){
counter ++;}
else cout << counter << endl;}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
const long long int m=pow(10,9)+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
string t="keyence";
ll n=s.length();
for(ll l=0;l<n;l++){
... | 0 | 77,673,628 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define bn(n) (n).begin(), (n).end()
#define FOR(n) for(int i = 0; i < (int)n; i++)
void solve() {
int n;
cin >> n;
cout << (n+1)*n/2 << "\n";
}
int main () {
ios::sync_with_stdio(0);
cin.t... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
typedef long long LL;
using namespace std;
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define CLEAR( a , x ) memset ( a , x , sizeof a )
co... | 0 | 37,994,739 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 70,199,167 |
#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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int n, c, k;
cin >> n >> c >> k;
vector<long long int> t(n);
for(int i=0; i<n; i++){
cin >> t[i];
}
sort(t.begin(),t.end());
long long int ans = 0, time = t[0], num = 1;
for(int i=1; i<n; i++){
if(num == ... | 0 | 70,444,496 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int A, B; cin >> A >> B;
string s; cin >> s;
bool ans = true;
for (int i = 0; i < s.length(); ++i){
if (i == A && s[i] != '-'){
ans = false;
}else if (i != A){
if (!(s[i] - '0' >= 0 && s[i] - ... | #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... | 0 | 62,124,742 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string c ;
bool check = false ;
cin >> c ;
for ( int i = 0 ; i < c.size() ; i++ ){
if (c.at(i)!='a' && c.at(i)!='i' && c.at(i)!='u' && c.at(i)!='e' && c.at(i)!='o' ){
check = true ;
break;
}
}
if (check)
cout << "consonant" <... | #include<bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define ll long long
#define MOD (ll)1e9+7
#define REP(i,b,e) for(int (i)=b... | 0 | 13,221,731 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,end) for(ll i = 0; i < end ; i++ )
#define print(ans) cout << fixed << setprecision(15) << ans << endl;
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> l_l;
typedef pair<int,... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define rep(i,a,b) for(int (i)=a;(i)<(int)(b);(i)++)
using ll = long long int;
using itpl = tuple<int,int,int>;
int wi[4] = {0,-1,0,1};
int hi[4] = {-1,0,1,0};
int main(){
int H,W,cnt=0;
cin >> H >> W;
vector<vector<char>> c(H,vector<char> ... | 0 | 37,897,701 |
/*https:
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long a, b, c, d, e, f, k;
cin >> a >> b >> c >> k;
if (a == b && a == c)
{
cout << "0";
r... | #include <iostream>
using namespace std;
int main(){
int H, N;
cin >> H >> N;
int A[N], B[N], cost[N];
for (int i = 0; i < N; i++){
cin >> A[i] >> B[i];
}
long long dp[N+1][H+1];
for (int i = 0; i <= N; i++){
for (int j = 0; j <= H; j++){
dp[i][j] = 1000000000000000000;
}
}
dp[0][0] ... | 0 | 16,056,484 |
#include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7... | #include <iostream>
#define reep(i,n,m) for(int i=(n);i<(m);i++)
#define rep(i,n) reep(i,0,n)
#define pow(x) (x)*(x)
using namespace std;
void solve(){
int a[3];
rep(i,3){
cin >> a[i];
}
rep(i,3){
if(pow(a[i])==pow(a[(i+1)%3])+pow(a[(i+2)%3])){
cout << "YES" << endl;
... | 0 | 9,917,987 |
#include <cstdio>
#include <cmath>
using namespace std;
int main() {
double a, b, C;
scanf("%lf %lf %lf", &a, &b, &C);
printf("%.7f\n", a * b * sin((M_PI * C / 180)) / 2);
printf("%.7f\n", a + b + sqrt(pow(a, 2) + pow(b, 2) - 2 * a * b * cos((M_PI * C / 180))));
printf("%.7f\n", b * sin((M_PI * C / 180)));
return... | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using l... | 0 | 282,870 |
#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 Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n,d;
cin>>n>>d;
int x[n][d];
rep(i,n){
... | #include<iostream>
using namespace std;
int main(){
int sum1=0,sum2=0;int a;
for(int i=0;i<4;i++){
cin>>a;
sum1+=a;
}
for(int i=0;i<4;i++){
cin>>a;
sum2+=a;
}
if(sum1>sum2)cout<<sum1<<endl;
else if(sum1<sum2)cout<<sum2<<endl;
else cout<<sum1<<endl;
return 0;
} | 0 | 25,325,179 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
double x1,x2,y1,y2;
cin>>x1>>y1>>x2>>y2;
double ans=0.0;
ans=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
printf("%.8f\n",ans);
return 0;
} | #include<iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
using namespace std;
int main()
{
int n;
cin >>n;
vector<long long> a(n, 0);
long long m = 1000;
long long kabu;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (long long i = 0; i < n ... | 0 | 33,834,227 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int x, y;
while (true) {
fscanf(stdin, "%d %d", &x, &y);
if (x == 0 && y == 0) { break; }
if (x > y) { swap(x, y); }
fprintf(stdout, "%d %d\n", x, y);
}
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second
#defin... | 0 | 31,716,309 |
#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#includ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, min, max, a;
cin >> N;
for (int i=0; i<N; i++){
if (i==0){
cin >> a;
min=a;
max=a;
}
else{
cin >> a;
if (a<min) min=a;
if (max<a) max=a;
... | 0 | 26,194,521 |
#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) + 1;
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 y... | #include <iostream>
#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
int main(void) {
int n = 0;
while (cin >> n) {
if (n == 0) {
break;
}
int A[1000];
for (int i = 0; i < 1000; i++) {
A[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n... | 0 | 83,145,701 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
using namespace std;
int main() {
int n; cin >> n;
while (n--) {
vector<pair<double, double>> p(4);
for (int i = 0; i < 4; i++) {
double x, y; cin >> x >> y;
p[i] = {x, y};
}
double l1_r... | #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 | 42,244,275 |
#include <bits/stdc++.h>
using namespace std;
#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 all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | #include<iostream>
using namespace std;
int main(){
int a,n,min=1000000,max=-1000000;
long long int s=0;
cin >> n;
for(int i=0; i<n; i++){
cin >> a;
s += a;
if(a>max) max=a;
if(a<min) min=a;
}
cout << min << " " << max << " " << s << "\n";
return 0;
} | 0 | 26,389,242 |
#include <bits/stdc++.h>
using namespace std;
#include <cstdio>
int main() {
long long a, b, c, k; cin >> a >> b >> c >> k;
if(k%2==0) cout << a-b << endl;
if(k%2==1) cout << b-a << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int f(int n)
{
return ((n % 2 == 0) ? n / 2 : 3 * n + 1);
}
int main()
{
string s;
cin >> s;
int... | 0 | 84,306,868 |
#include <iostream>
using namespace std;
int main()
{
int n, k, x, y;
cin >> n >> k >> x >> y;
int sum = 0;
if( n <= k )
cout << x * n;
else{
cout << x * k + ( n - k ) * y;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | 0 | 86,048,511 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int n, k, cnt;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
cnt = 0;
for (int i = 1; i < n; i++)
{
if (a[0] == a[i]) cnt++;
}
n -= cnt + 1;
if (n < k)
cnt ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 | 6,162,199 |
#include<iostream>
using namespace std;
int main(void){
int A, B, K;
bool result{false};
cin >> K >> A >> B;
if(A%K == 0){
result = true;
}
else if((A/K+1)*K<=B){
result = true;
}
if(result){
cout << "OK" << endl;
}
else{
cout << "NG" << endl;
... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | 0 | 66,651,017 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
vector<bool> visited;
bool can = false;
bool dfs(const vector<vector<ll>> &g, ll v, ll goal){
visited[v] = true;
for(auto next_v: g[v]){
if(next_v == goal) can = tr... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
A[i] -= (i + 1);
}
sort(A, A + N);
long long b = A[N/2];
long long ans = 0;
for (int i = 0; i < N; i++) {
long long... | 0 | 80,681,587 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n; cin >> n;
vector<ll> a(n);
rep(i,... | #include <bits/stdc++.h>
#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()
struct UnionFind{
vec... | 0 | 17,024,436 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) ans++;
}
cout << ans << endl;
} | #include<iostream>
using namespace std;
#define df 0
double f(int vl,int vr,int vm,int t){
int M=max(vl,vr),d=2*M-vl-vr,r=t-d;
double sum=M*t-d*d*0.5+r*r*0.25, h=r*0.5+M-vm;
if(h<0)h=0;
sum-=h*h;
if(df)printf("%lf\n",sum);
return sum;
}
int main(){
if(df) printf("*debug mode*\n");
int n; cin >>n;
int ... | 0 | 62,164,240 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii;... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define Rep(i,n) for(intl i=0;i<(intl)(n);i++)
#define Rep1(i,n) for(intl i=1;i<(intl)(n)+1;i++)
#define vec vector
#define fi first
#define se second
#define pub push_back
#define pob pop_back
#define SortA(v) sort(v.begin(), v.end())
#define SortD(v... | 0 | 25,540,375 |
#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;
vector<int> box(3);
cin >> box.at(0) >> box.at(1) >> box.at(2) >> n;
int ans = 0;
for(int i = 0; box.at(0) * i <= n; i++) {
int x = n - box.at(0) * i;
... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,int> LP;
c... | 0 | 43,739,645 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1<<29);
vector<int> G[MAX];
list<int> out;
bool V[MAX];
int N;
int indeg[MAX];
void dfs(int u) {
V[u] = true;
for (int i = 0; i < G[u].size(); i++)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | 0 | 6,552,710 |
#include<iostream>
#include<map>
using namespace std;
int main() {
long long n, m, current, f, s;
map<long long, long long> memo;
memo[0] = 1;
long long sum = 0, ans = 0;
scanf("%lld %lld", &n, &m);
for (long long i=0; i<n; i++) {
scanf("%lld", ¤t);
sum = (sum + current) % m;
memo[sum]++;
... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
void bfs(int v,vector<vector<int>>& vertex, int d[]);
int main(){
int n;
cin >> n;
int num;
int tmp2;
int d[n];
for(int i=0;i<n;i++){
d[i] = -1;
}
vector<vector<int>> vertex;
vector<int> tmp;
for(... | 0 | 29,916,846 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int N;cin>>N;
int mini=N+1;
int ans=0;
for (int i = 0; i < N; i++){
int P;cin>>P;
if(P<=mini)ans++;
mini=min(mini,P);
}
cout<<ans<<endl;
} | #include <stdio.h>
#include <vector>
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) for(int (i) = (n) - 1; (i) >= 0; --(i))
using lli = long long int;
std::vector<int> A;
int main(void){
int n; scanf("%d", &n);
A.resize(n); REP(i, n) scanf("%d", &A[i]... | 0 | 46,184,984 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.