code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std ;
int main(){
int n;
int c;
cin >> n;
double sum=0.0;
for(int i=0;i<n;i++){
cin >> c;
sum+=1.0/c;
}
double R = 1/sum;
cout << setprecision(16) << R << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
double a = 0;
double b = 1;
vector<int>v(n);
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
v[i] = x;
b *= x;
}
for (int i = 0; i < n; ++i) {
a += (b/v[i]);
}
double ans = b/a;
cout << fixed << setprec... | 1 | 17,183,887 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define all(A) (A).begin(), (A).end()
int main(){
int N;
cin >> N;
int A[N + 1];
... | #include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... | 1 | 80,959,146 |
#include<stdio.h>
int flg[1000000];
int main(void)
{
int n,i,j,c;
while(scanf("%d",&n)!=EOF){
c=0;
for(i=2;i<n;i++){
flg[i]=0;
}
for(i=2;i*i<=n;i++){
for(j=2;i*j<=n;j++){
flg[i*j]=1;
}
}
for(i=2;i<=n;i++){
if(flg[i]==0){
c++;
}
}
printf("%d\n",c);
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
int main() {
int n, c;
while (std::cin >> n) {
std::vector<int> nums;
++n;
c = 0;
for (int i = 0; i < n; ++i) {
nums.push_back(i);
}
for (int i = 0; i < n; ++i) {
if (nums.at(i) < 2) continue;
for (int j = nums.at(i) * 2; j < n; j += nums... | 1 | 27,053,453 |
#include <bits/stdc++.h>
#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(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, ... | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
char a[10],b[10],c[10];
cin >> a >> b >> c;
int a_nu... | 1 | 82,296,322 |
#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 <iostream>
#include <vector>
#include <algorithm>
int main(){
int N;
std::vector<int> v;
std::cin >> N;
for(int i = 0 ; i < N ; i++){
int temp;
std::cin >> temp;
v.push_back(temp);
}
std::sort(v.begin(), v.end());
double resa = 0;
double ave = v[0];
for(int i = 0 ; i < (int)v.size... | 1 | 41,741,101 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
int main()
{
string tWord, hWord;
int n, tPoint = 0, hPoint = 0, i;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> tWord >> hWord;
if (tWord > hWord)
tPoint += 3;
else if (hWord > tWord)
... | #include <iostream>
using namespace std;
#include <string>
#include <cctype>
int main() {
int pTarou = 0, pHanako = 0, n;
string sTarou, sHanako;
cin >> n;
for (int i = 0; i < n; i++){
cin >> sTarou >> sHanako;
if (sTarou > sHanako) pTarou += 3;
else if (sTarou < sHanako) pHanako... | 1 | 79,217,175 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
using namespace std;
#define NIL -1
#define N 500001
int A[N], n;
int par(int i){ return i / 2; }
int lef(int i){ return i * 2; }
int rig(int i){ return i * 2 + 1;... | #include <stdio.h>
int main(){
int n,a[1000];
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++){
printf("node %d: key = %d,",i,a[i]);
if(i>1)printf(" parent key = %d,",a[i/2]);
if(i*2<=n)printf(" left key = %d,",a[i*2]);
if(i*2+... | 1 | 155,805 |
#include <iostream>
using namespace std;
int main()
{
string s;
cin>>s;
int sum=0;
for(int i=0; i<4; i++)
{
for(int j=0; j<4; j++)
{
if(s[i]==s[j])
{
sum++;
}
}
}
if(sum==8)
{
cout<<"Yes";
}
else
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
string S;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> S;
sort(S.begin(), S.end());
if (S[0]==S[1] && S[1]!=S[2] && S[2]==S[3]) cout << "Yes" << endl;
... | 1 | 5,004,462 |
#include <bits/stdc++.h>
using namespace std;
int a[60], b[60], c[60], d[60];
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < N; i++) cin >> a[i] >> b[i];
for (int i = 0; i < M; i++) cin >> c[i] >> d[i];
for (int i = 0; i < N; i++) {
int minDist = 1001001001, ans = 0;
for (... | #include <bits/stdc++.h>
using ll = long long int;
struct Point {
Point(ll a, ll b) : x(a), y(b) {}
ll x = 0;
ll y = 0;
};
inline ll dist(const std::shared_ptr<Point>& a,
const std::shared_ptr<Point>& b) {
return std::abs(a->x - b->x) + std::abs(a->y - b->y);
}
inline int pos(const std::s... | 1 | 74,103,071 |
#include <iostream>
#include<algorithm>
using namespace std;
int main()
{
int x, y,arr[1000],sum=0;
cin >> x >> y;
for (int i = 0; i < x; i++) {
cin >> arr[i];
}
sort(arr, arr + x);
for (int i = 0; i < y; i++) {
sum = sum + arr[i];
}
cout << sum;
} | #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>;
typedef vector<int> vi;
int main() {
int n, k;
cin >> n >> k;
int p[n];
rep(i, n) cin >> p[i];
sort(p, p+n);
int sum = 0;
rep(i, k) sum += p[i];
cout << sum <... | 1 | 18,983,760 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<int> ans;
int sum = 0;
for(int i = 1; i <= n; ++i) {
if(sum + i < n) {
ans.push_back(i);
sum += i;
} else {
if(sum + i == n) {
ans.push_back(i);
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
ll i,cnt=0;
for(i=1;;i++){
cnt+=i;
if(cnt>=n) break;
}
for(ll j=i;n>0;j--){
if(n>=j){
... | 1 | 37,555,289 |
#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();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | #include <iostream>
using namespace std;
long n, a[100010];
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
cin >> n;
for(int i = 0; i < n; ++i) cin >> a[i];
long L = 2, R = 2;
for(int i = n-1; i >= 0; --i) {
L = (L + a[i] - 1) / a[i] * a[i];
R = R / a[i] * a[i] + a[i] - 1;
}
if(L >= R)... | 1 | 78,132,173 |
#include <stdio.h>
int main () {
int A;
int P;
scanf("%d%d", &A, &P);
A + P <0?printf("%d", A + P) : printf("%d", ((A*3) + P) /2);
} | #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>;
const int INF = 1000000007;
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << endl;
} | 1 | 47,727,725 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,k,x,y;
cin >> n >> k >> x >> y;
ll ans=0;
if(n<=k) {
ans+=n*x;
}
else {
ans+=k*x;
ans+=(n-k)*y;... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
const int MOD = 1000000007;
int main()
{
int a, b , c, d;
cin >> a >> b >> c >> d;
if(a < b) cout << a*c << endl;
else cout << (b*c)+(a-b)*d << endl;
return 0;
} | 1 | 38,766,530 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int cnt = 0;
for (int i = 1; i < (int)s.size(); i++) {
if (s[i - 1] != s[i]) {
cnt++;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
string s; cin >> s;
ll cnt = 0;
for(int i = 1; i < s.size(); i++){
if(s[i - 1] != s[i]) cnt++;
}
cout << cnt << endl;
} | 1 | 3,337,559 |
#include<iostream>
#include<queue>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, m;
scanf("%d %d", &n, &m);
vector<int> goal(n+1, -1);
vector<queue<int>> neighbor(n+1);
int a, b;
for (int i = 0; i < m; i++) {
scanf("%d %d", &a,... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,i;
cin >> N >> M;
vector<vector<int>> c(N+1);
vector<int> p(N+1,-1);
vector<int> d(N+1,-1);
int a,b;
for(int i=0;i<M;i++){
cin >> a >> b;
c[a].push_back(b);
c[b].push_back(a);
}
p[1] = 1;
queue<int> que;
que.push(1);
... | 1 | 87,213,754 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll k;
cin >> k;
ll mx = max(k + 1, 10LL);
vector<ll> lun(mx);
rep(i, 10) {
lun[i] = i;
}
if (k >= 10) {
int count = 10;
int base = 1;
do ... | #include<bits/stdc++.h>
using namespace std;
int k;
void dfs(string ans,int p,int& now){
if(p==0){
now++;
if(now==k){
cout<<ans<<endl;
exit(0);
}
return ;
}
int x=ans[ans.size()-1]-'0';
for(int i=x-1;i<=x+1;i++){
if(i<0||9<i)continue;
dfs(ans+(char)(i+'0'),p-1,now);
}
}
int main(){
cin>>k;
int ... | 1 | 55,021,152 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll, ll>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
ll a[x], b[y], c[z];
for (int i = 0; i < x; i++) cin >> a[i];
for (int i = 0; i < y; i++) cin >> b[i];
for (int i = 0... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <deque>
#include <numeric>
#include <map>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int,int> pii;
typede... | 1 | 86,077,731 |
#include <iostream>
int main() {
for (;;) {
int n;
int m;
int p;
std::cin >> n;
std::cin >> m;
std::cin >> p;
if (n == 0 && m == 0 && p == 0) {
break;
}
int numberOfTickets = 0;
int numberOfTicketsForWinner = 0;
for ... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | 1 | 62,859,213 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono cout << "no" << endl
#define rep(i, n) f... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define re... | 1 | 47,558,426 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include<bits/stdc++.h>
#define ll long long
#define pr pair<ll,ll>
using namespace std;
int main() {
ll s, bd = 1e9;
cin >> s;
if (s == 1e18)cout << 0 << ' ' << 0 << ' ' << 1000000000 << ' ' << 0 << ' ' << 0 << ' ' << 1000000000;
else if (s <= bd)cout << 0 << ' ' << 0 << ' ' << 0 << ' ' << 1 << ' ' << ... | 1 | 87,795,675 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | #include<iostream>
using namespace std;
int main(){
char s,t;cin >> s >> t;
if(s == 'H' ) cout << t << endl;
else if(t == 'D') cout << 'H' << endl;
else cout << 'D' << endl;
} | 1 | 9,216,942 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long li;
typedef pair<li, li> pii;
pii make_set(li x, li y) {
if (x < y) {
return make_pair(y, x);
} else {
return make_pair(x, y);
}
}
pii max_of(pii x, pii y) {
vector<li> vs = {x.first, x.second, y.first, y.second};
... | #include"bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
const ll M = (1LL << N);
vector<ll> A(M);
for (ll i = 0; i < M; i++) {
cin >> A[i];
}
vector<pair<ll, ll>> dp(M, { 0, 0 });
for (ll i = 1; i < M; i++) {
vector<ll> candidate;
... | 1 | 70,808,806 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
int main() {
ll a; cin >>a;
long double b; cin >> b;
ll c = (b+0.001)*100;
ll d = a*c;
ll e = d/100;
cout << e << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long a ; string b; cin>>a; cin>>b;
long long num1=0,num2=0,flag=0;
for(int i=0;i<b.length();i++){
if(b[i]=='.')flag=1;
else if(flag) num2=num2*10+(b[i]-'0');
else num1=num1*10+(b[i]-'0');
}
cout<<(a*num1)+(a*num2)/100<<endl;
} | 1 | 63,515,111 |
#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<cstring>
#include<sstream>
using namespace std;
#define P(p) cout<<(p)<<endl
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int n,m,a,b;
string s,t="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=0;j<m;j++)
{
cin>>s;
if(s=="snuke")
{
a=i;
b=j;
}
}
}
cout<<t[b]<<a<<endl;
ret... | 1 | 64,996,046 |
#include<iostream>
int main(){int A,B,C;std::cin>>A>>B>>C;puts(A+B<C?"No":"Yes");} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int p,c,a,b;
cin>>a>>b>>p;
c=a+b;
if ((a>500 && b>500) || ( a==0 || b==0)) {
cout << "No";
exit(1);
}
else {
if (p <= c) {
cout << "Yes";
} else {
cout << "No";
... | 1 | 42,510,455 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
int n,k,d,c,ans;
cin>>n>>k;
vector<int> v(n,-1);
ans=n;
rep(i,k){
cin>>d;
rep(j,d){
cin>>c;
c--;
if(v[c]==-1){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k,ans;
ans = 0;
cin >> n >> k;
vector<int> a(n);
for(int i=0;i<k;i++){
int d;
cin >> d;
vector<int> vec(d);
for(int j=0;j<d;j++){
int p;
cin >> p;
a.at(p-1) = 1;
}
}
for(int i=0;i<n;i++){
if(a.at(i)... | 1 | 79,379,967 |
#ifdef _DEBUG
#include ".vscode/debug_print.hpp"
#else
#define debug(...)
#endif
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using namespace std;
constexpr int INF32 = 1050000000;
constexpr long long INF64 = 4000000000000000000;
constexpr int MOD7 = 1000000007;
constexpr int MOD5... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | 1 | 33,304,813 |
#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 <iomanip>
using namespace std;
#define REP(i,... | #include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long ll;
#define MAX_V (105)
#define INF (1LL << 32)
int V, E;
ll G[MAX_V][MAX_V];
int main()
{
scanf("%d %d", &V, &E);
for ( int i = 0; i < V; i++ ) {
for ( int j = 0; j < V; j++ ) {
G[i][j] = (i == j) ? 0 : INF;
}
}
for (... | 1 | 61,961,964 |
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
typedef long long ll;
const ll maxn = 1e6+10;
const ll inf = 1e16;
int N,K;
int main(){
cin>>N>>K;
cout<<N-K+1<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int cnt = 0;
for (int i = 0; i < n; i++)
{
if (i + k - 1 < n)
{
cnt++;
}
}
cout << cnt << endl;
return 0;
} | 1 | 37,328,578 |
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#i... | 1 | 60,546,104 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define endl '\n'
int main()
{
Hello
int x, y, z, k;
cin >> x >> y >> z >> k;
ll a[x + 5], b[y + 5], c[z + 5];
for(int i = 0; i < x; i++) cin >> a[i];
for(int i =... | #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,y,z,k;
cin>>x>>y>>z>>k;
vector<ll>a(x),b(y),c(z);
rep(i,x)cin>>a[i];
rep(i,y)cin>>b[i];
rep(i,z)cin>>c[i];
vector<ll>sum;
rep(i,x)rep(... | 1 | 36,954,199 |
#include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
void dfs(const ll N, const ll A, const ll B, const ll C, const vec... | #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... | 1 | 3,244,325 |
#include <bits/stdc++.h>
using namespace std;
int calc(int y,int m,int d){
return (y-1)*195+(y-1)/3*5 + (m-1)*20-(y%3==0 ? 0 : (m-1)/2) + d;
}
int main(void){
int n,Y,M,D;
int Millennium = calc(1000,1,1);
cin>>n;
while(n--){
cin>>Y>>M>>D;
cout<<Millennium-calc(Y,M,D)<<endl;
}
r... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>> n;
for(int i=0; i<n; i++){
int Y, M, D;
cin>> Y>> M>> D;
int ans=0;
for(int y=1; y<=Y; y++){
if(y==Y){
for(int m=1; m<=M; m++){
if(m==M){
... | 1 | 94,512,532 |
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 1 | 12,377,713 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | #include <bits/stdc++.h>
using namespace std;
int n, ans;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++)
ans += (n - 1) / i;
return cout << ans << endl, 0;
} | 1 | 75,781,035 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int h,n; cin >> h >> n;
vector<pair<int,int>> ab(n);
rep(i,n){
cin >> ab[i].first >> ab[i].second;
}
vector<int> dp(h+1,1001001001);
dp[0]=0;
for(int i=0;i<n;i++){
for(int j=0;j<h;j++){
int nj=min... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 1 | 28,423,440 |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <random>
#include <numeric>
using namespace std;
#define... | #include <bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while(n > 0) {
if(n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
long long ans = 0;
long long mod =... | 1 | 28,254,072 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
ll Gc... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pi;
priority_queue<pi, vector<pi>, greater<pi> > pq;
ll mini(ll a,ll b){ return a<b?a:b;}
ll maxi(ll a,ll b){ return a>b?a:b;}
ll gcd(ll a,ll b){ if(b == 0) return a;return gcd(b,a%b);}
ll binpow(ll n,ll x){ ll ans = 1;while(x... | 1 | 78,846,048 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b > c + d) cout << "Left" << '\n';
else if (a + b < c + d) cout << "Right" << '\n';... | #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, D;
cin >> A >> B >> C >> D;
if (A + B > C + D)
cout << "Left" << endl;
else if (A + B == C + D)
cout << "Balanced" << endl;
else
cout << "Right" << endl;
re... | 1 | 32,165,595 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
map<ll,int>mp;
vector<ll>v;
int main(){
int n,k;cin>>n>>k;
ll pre[n+2];
pre[0]=0;
for(int i=0;i<n;i++){
ll a;cin>>a;v.push_back(a);
pre[i+1]=pre[i]+a-1;
pre[i+1]%=k;
}
mp[0]++;
ll ans=0;
for(int i=1;i<=n;i++){
if(i>=k){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repr(i, n) for(int i = (n-1); i >= 0; --i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
... | 1 | 34,841,448 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;
const int INF = 1<<30;
string... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 1 | 78,911,203 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<chrono>
#include<vector>
#include<string>
#include<cstring>
using namespace std;
using namespace std::chrono;
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long
const int M = 1e9 + 7;
#define fr(i,n) for(int i=0;i<n;i++)
#de... | #include<bits/stdc++.h>
using namespace std;
int main(){
long N;cin>>N;
long S=1000000000000000000;
vector<long> A(N);
bool can=true;
for(int i=0;i<N;i++){
cin>>A.at(i);
if(A.at(i)==0) can=false;
}
long ans=1;
for(int i=0;i<N;i++){
if(S/ans>=A.at(i)) ans*=A.at(i);
else{
ans=-1;
... | 1 | 39,567,480 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n = 3;
vector<int> a(n); rep(i,n) cin >> a[i];
sort(a.begin(),a.end());
a.erase(unique(a.begin(),a.end()),a.en... | 1 | 15,999,218 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int n;
vector<int> bmb;
int a, b, c;
int ans;
void dfs(vector<int> &A){
if(A.size() == n){
int len_a = 0, len_b = 0, len_c = 0;
int cnt = 0;
for(int i = 0; i < n; i++){
if(A[i] == 0){
... | 1 | 75,850,999 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define max0(a,b,c) max(max(a,b),c)
#define min0(a,b,c) min(min(a,b),c)
#define ft first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define all(v) (v).begin(),(v).end()
#define mod 1000000... | 1 | 63,504,411 |
#include<iostream>
#include<algorithm>
#define INF 999999
typedef long long ll;
using namespace std;
int n,a,b,c,maxm;
int sum,miniNo,minim;
int t[100][100];
int main(){
while(cin>>n,n){
for(int i=0;i<100;i++)for(int j=0;j<100;j++){
if(i!=j)t[i][j]=INF;
else t[i][j]=0;
}
maxm=0;
for(int i=0;i<n;i++){
... | #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
#define LATTE 1000000000
int main(){
int N;
while(cin>>N,N){
int dp[10][10]={},A,B,C;
bool latte[10]={};
for(int i=0;i<10;i++)for(int j=0;j<10;j++) if(i!=j) dp[i][j]=LATTE;
for(int i=0;i<N;i++){
ci... | 1 | 90,830,845 |
#include <stdio.h>
int main(){
int N, R;
scanf("%d %d", &N, &R);
if(N<=10){
printf("%d", (100*(10-N)+R));
}else if(N>10){
printf("%d", R);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 1 | 88,934,943 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200000;
const int INF = 1<<30;
int n, a[N], ans = 0;
double mid, _ans = INF;
int main()
{
scanf( "%d", &n );
for( int i = 1; i <= n; i ++ )
scanf( "%d", &a[i] );
sort( a+1, a+1+n );
double mid = double( a[n] ) / 2;
for( int i = 1; i <= n; i ++ )
if( ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
int req1=a.back()/2,req2=(a.back()+1)/2;
int cur = INT_MAX, curi;
for(int i=0;i<n;i++){
int val = min(abs(req1-a... | 1 | 7,829,997 |
#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;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_wi... | 1 | 24,732,332 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c,d=0,e,f,g,h,i,j,k,l,m,n,x,y,z;
cin>>a;
char ch,dh;
cin>>ch;
for(i=1;i<a;i++)
{
cin>>dh;
if(dh!=ch)
{
d++;
ch=dh;
}
}
cout<<d+1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int Y=1;
string S;
cin>>N>>S;
for(int X=1;X<N;X++){
if(S.at(X)!=S.at(X-1)){
Y++;
}
}
cout<<Y<<endl;
} | 1 | 93,177,956 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0];
cin >> a[1];
cin >> a[2];
sort(a, a+3);
printf("%d %d %d\n", a[0], a[1], a[2]);
} | #include <iostream>
using namespace std;
int main (int argc, const char * argv[])
{
int a, b, c , i;
cin >> a >> b >> c;
if (a>b ) {
i = a;
a = b;
b = i;
}
if (b>c) {
i = b;
b = c;
c = i;
}
if (a>b ) {
i = a;
a = b;
b = ... | 1 | 9,093,926 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
bool even = false;
for (int i = n - 2; i > 0; i = i - 2)
{
bool same = true;
for (int j = 0; j < i / 2; j++)
{
if (s[j] != s[j + i / 2])
{
... | 1 | 24,938,476 |
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int h, w, d;
scanf("%d%d%d", &h, &w, &d);
map<int, pair<int, int>> mp;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
int a;
scanf("%d", &a);
mp[a] = {i, j};
}
}
vector<int> dist(h * w);
for (int i = ... | #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 ... | 1 | 80,599,952 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
ll euclidean_gcd(ll a, ll b) {
while(1) {
if(a < b) swap(a, b);
if(!b) break;
a %= b;
}
return a;
}
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int x = c-a, y = d-b;
cou... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int,int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main(){
int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
pint v;
v.first = x2-x1; v.second = y2-y1;
cout << x2-v.second << ' ' << y2+v.first << ' ';
cout << x... | 1 | 83,954,270 |
#include<vector>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<bits/stdc++.h>
#include<cstring>
#include<map>
#include<cmath>
#include<set>
using namespace std;
#define ll long long int... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll x, n, m, res=1, ans;
set<ll>s;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
while(n--) {
cin >> x;
x /= 2;
if(s.find(x) == s.end()) {
s.insert(x);
res = res / __gcd(re... | 1 | 61,033,581 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.e... | 1 | 68,014,043 |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define N 200001
#define ll long long
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pull = pair<ull, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
ll gcd(ll a, ll b) {
if (a < b) ... | 1 | 27,145,439 |
#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();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
ll n, m, xin, yin, zin;
cin >> n >> m;
vector<tuple<ll, ll, ll>> cake... | 1 | 61,372,424 |
#include <stdio.h>
#include <algorithm>
using namespace std;
#define INF 1e8
int a[222][222], r[11], R, ans = INF;
void update(void)
{
int i, sum = 0;
for (i = 1; i < R; i++)
sum += a[r[i]][r[i + 1]];
ans = min(ans, sum);
}
int main(void)
{
int N, M, i, j, k;
scanf("%d %d %d" ,&N, &M, &R);
for (i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
int N,M,R;
cin >> N >> M >> R;
vector<ll> r(R);
rep(i,R) {
i... | 1 | 43,695,624 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
int main() {
ll n,m;cin >> n >> m;
priority_queue<ll> q;
rep(i,n){
ll num;cin >> num;
q.push(num);
}
rep(i,m){
if( q.top() == 0 ) break;
ll num = q.top();
q.pop();
q.push(num/2);... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define n_p next_permutation
#define p_p prev_permutation
#define in insert
#define rev reverse
#define pf push_front
#define pob pop_back
#define uniq(v) v.resize(distance(v.begin(),unique(v.... | 1 | 77,036,985 |
#include<stdio.h>
int N[5001]={};
int main(){
int n,x;
while(1){
scanf("%d",&n);if(n==0)break;
for(int i=0;i<n;i++)
scanf("%d",&N[i]);
int t=N[0],s=0;
for(int i=0;i<n;i++)
{
for(int j=i;j<n;j++)
{
s+=N[j];if(t<s)t=s;
}
s=0;
}
printf("%d\n",t);
}
return 0;
} | #include<algorithm>
#include<iostream>
#define INF -11111111
using namespace std;
int main(){
int n;
int a[5555];
while(1){
int ret = INF,sum;
cin >> n;
if(!n)break;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
sum = 0;
for(int j=i;j<n;j++){
sum += a[j];
... | 1 | 82,630,701 |
#include<iostream>
#include<stdio.h>
#include<ctype.h>
using namespace std;
main() {
char ch, chl;
int i, num, counter[26];
for(i = 0; i < 26;i++){
counter[i] = 0;
}
while(cin >> ch){
chl = tolower(ch);
num = chl - 'a';
if(num >= 0 && num <= 25){
counter[num]++;
}else if(ch == EOF){
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | 1 | 25,053,756 |
#include <bits/stdc++.h>
typedef long long lint;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
int main() {
int a,b; cin >> a >> b;
cout << 6 - a - b << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
bool ch[3];
int main() {
for(ll i=0;i<2;i++){
ll n;
cin>>n;
n--;
ch[n]=true;
}
for(ll i=0;i<3;i++){
if(ch[i]){
continue;
}
cout << i+1;
return 0;
}
return 0;
} | 1 | 51,856,715 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const int maxn= 1e5+5;
ll a[maxn];
ll n,ans;
ll b[maxn];
ll c[maxn];
int main(){
cin>>n;
n++;
for(int i=1;i<=n;i++) cin>>a[i];
ans=0;
b[1]=1;
c[n]=a[n];
for(int i=2;i<=n;i++){
b[i] = (b[i-1]-a[i-1])<<1;
... | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define MOD 1000000007
#define endL << '\n'
#define ii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define ... | 1 | 62,681,443 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 1 | 35,968,730 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
const ll MOD = 1e9 + 7;
inline ll fast(ll n, ll k) {
if (k == 1) {
return n;
} else if (k == 0) {
return 1;
}
if ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef unsigned long long ull;
typedef long double ld;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265
const int MOD=1e9+7;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) ... | 1 | 39,839,538 |
#include <stdio.h>
int main() {
int num1,num2,num3;
scanf("%d %d %d",&num1,&num2,&num3);
if(num1 < num2 && num2 < num3) printf("Yes\n");
else printf("No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if(a < b && b < c)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | 1 | 89,156,417 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define pb emplace_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define quickio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
const ll MO... | #include<iostream>
using namespace std;
int main(){
long long a,b,c,d;
long long max;
std:cin>>a>>b>>c>>d;
long long m1=a*c;
long long m2=a*d;
long long m3=b*c;
long long m4=b*d;
if(m1>m2)
max=m1;
else max=m2;
if(max<m3)
max=m3;
if(max<m4)
max=m4;
cout<<max<<"... | 1 | 61,487,490 |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d;
int main()
{
cin >> a >> b >> c >> d;
int ab = a + b;
int cd = c + d;
if (ab > cd)
{
cout << "Left" << endl;
}
else if (ab < cd)
{
cout << "Right" << endl;
}
else
{
cout << "Balanced" << end... | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
using namespace std;
using ll = long long;
int main() {
int a,b,c,d;
cin >> a >> b >>c >>d;
if ((a +b) > (c+d)) cout << "Left" << endl;
else if ((a+b) == (c+d)) cout << "... | 1 | 41,420,011 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define in insert
#define pi 2*acos(0.0)1
#define srt(s) sort(s.begin(),s.end())
#define all(x) x.begin(),x.end()
const ll mod=1e9+7;
const ll MX=2e5... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 1 | 73,195,930 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long K, A, B;
cin >> K >> A >> B;
if (B <= A + 1){
cout << K + 1 << endl;
} else if (K <= A){
cout << K + 1 << endl;
} else {
cout << A + (K - A + 1) / 2 * (B - A) + (K - A + 1) % 2 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD=1000000007;
int main() {
ll K,A,B; cin>>K>>A>>B;
ll biske=1;
while(K>0){
if(biske<A){
biske++;
K--;
}
else{
if(K>1 && A+1<B){
biske+=(B-A);
... | 1 | 35,224,437 |
#include <iostream>
using namespace std;
int main() {
string S,T;
int N,syutsuryoku;
cin >> S;
cin >> T;
N = S.size();
for (int i=0;i<(N-1);i++) {
if (S.at(i) != T.at(i)) {
syutsuryoku++;
}
}
if (syutsuryoku != 0) cout << syutsuryoku+1 << endl;
else cout << syutsuryok... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s >> t;
int count = 0;
for(int i = 0; i < s.size();i++){
if(s.at(i) != t.at(i)){
count++;}
}
cout << count << endl;
} | 1 | 60,853,881 |
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<map>
#include<algorithm>
#include<set>
#include <stdexcept>
#include<queue>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
c... | #include <iostream>
using namespace std;
const int speY = 200;
const int ordY = 195;
const int bigM = 20;
const int smlM = 19;
const int Y3 = speY + ordY * 2;
int calcDay(int Y, int M, int D)
{
int day = 0;
day += Y3 * ((Y - 1) / 3);
day += ordY * ((Y - 1) % 3);
if (Y % 3)
day += (M - 1) / 2 * (bigM+smlM) + ((M -... | 1 | 16,989,262 |
#include <iostream>
int main(){
int k, s;
std::cin >> k >> s;
int count = 0;
for (int i = 0; i <= k; i++)
{
for (int j = 0; j <= k; j++)
{
if ((s - i - j <= k) && (i + j <= s))
{
count++;
}
}
}
std::cout << count << ... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 1 | 80,453,907 |
#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syos... | #include <bits/stdc++.h>
#define long long long
#define ull unsigned long long
#define up(i,a,b) for (int i=a; i<=b; i++)
#define down(i,a,b) for (int i=a; i>=b; i--)
#define endl '\n'
#define pb push_back
#define X first
#define Y second
#define II pair<int, int>
#define III pair<int, pair<int, int> >
#define V vector... | 1 | 25,117,070 |
#include <iostream>
#include <bits/stdc++.h>
#define rep(i,z) for(int i = 0; i<(int)(z); i++)
#define rep1(i,z) for(int i = 1; i<=(int)(z); i++)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
using pear = pair<int,int>;
int main(){
int n, m, x; cin>>n >>m >>x;
int c[n], a[n][m];
ll ans=0;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespac... | 1 | 8,803,268 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<string> vs;
const ll mod = 1e9+7;
const ll inf = 1e17;
const int INF = 1e9;
const double PI = acos(-1);
#define fo(i, a, b) for (int i = a;... | 1 | 94,998,268 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int a[m];
int d = 0;
int i;
rep(i, m){
cin >> a[i];
d += a[i];
}
int p;
p = n - d;
if(p >= 0)
cout << p << endl;
else
cout << "-1" << endl;
} | #include<iostream>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a;
cin>>a;
n-=a;
if(n<0)
{
cout<<"-1";
return 0;
}
}
cout<<n;
} | 1 | 96,358,498 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll a[100010];
int main() {
ll n;
cin>>n;
for(ll i=0;i<n;i++){
cin>>a[i];
}
ll mi=2,ma=2;
for(ll i=n-1;i>=0;i--){
mi=(mi+a[i]-1)/a[i]*a[i];
ma=(ma/a[i]+1)*a[i]-1;
if(mi>ma){
cout <<-1<<endl;
... | #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
#define LLINF 1000000000000000009LL
... | 1 | 10,777,954 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s, t;
bool ok(const string& a, const string& b)
{
for(int i=0;i<a.length();++i){
if(a[i]!=b[i]&&a[i]!='?') return false;
}
return true;
}
void solve()
{
const int n = s.length();
const int m = t.length();
string inf = string(n+1,'z');
s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
string s, t;
cin >... | 1 | 98,603,415 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define phi 3.1415926535
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
using namespace std;
const ll mo... | #include<bits/stdc++.h>
using namespace std;
#define Ff(i,a,n) for(i=a;i<n;i++)
#define Fr(i,a,n) for(i=a;i>n;i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x,... | 1 | 83,977,943 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
int count = 0;
while (N > 0) {
count++;
N -= X;
}cout << count * Y;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,t,c;
cin>>n>>x>>t;
c=n/x;
if(n%x)
{
c++;
}
cout<<c*t;
} | 1 | 100,170,724 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double a = 0, b = 0, x = 0;
cin >> a >> b;
cout << round((a + b)/2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int x = (a+b)-(a+b)/2;
cout << x << endl;
} | 1 | 74,291,752 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,a=0;cin>>N;
vector<string>s(N);
vector<int>t(N);
for(int i=0;i<N;i++)cin>>s.at(i)>>t.at(i);
string X;cin>>X;
int i=0;while(s.at(i)!=X)i++;
for(i++;i<N;i++)a+=t.at(i);
cout<<a<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
queue<string> title;
queue<int> length;
for(int i=0; i<n; i++){
string t; int l; cin>>t>>l;
title.push(t);
length.push(l);
}
string x; cin >>x;
int ans = 0;
while(true && title.size()>0){
... | 1 | 41,992,603 |
#include <bits/stdc++.h>
#define N_MAX 100002
#define ll long long
using namespace std;
int n;
struct Pile
{
ll cnt;
int cntBigger;
ll sumBigger;
int index;
};
ll sum;
bool cmpCnt (const Pile &a, const Pile &b)
{
return make_pair(a.cnt, a.index) > make_pair(b.cnt, b.index);
}
bool cmpIndex (const Pi... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1000000007;
typedef... | 1 | 33,351,454 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int R, G, B, N;
cin >> R >> G >> B >> N;
ll cnt = 0;
rep(r, N+1){
rep(g... | 1 | 5,179,063 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#include <numeric>
#include <math.h>
using namespace std;
int main(void){
int W,H,N;
cin ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define rep(i, a, n) for (int i = a; i < n; ++i)
int main() {
int w, h, n;
cin >> w >> h >> n;
int x1 = 0, y1 = 0;
rep(i, 0, n) {
int x, y, a;
cin >> x >> y >> a;
if (a == 1) {
x1 = ma... | 1 | 53,193,395 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair< int, int > ii;
typedef vector< ii > vii;
void solve(){
int n; cin>>n;
int ans = 1;
while(n / 2){
n /= 2;
ans *= 2;
}
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
int ans=1;
int X=2;
while(X<101){
if(N>=X) ans*=2;
X*=2;
}
cout<<ans<<endl;
} | 1 | 15,039,744 |
#include"iostream"
#include"vector"
using namespace std;
int main()
{
vector<int> branch;
int n;
cin>>n;
for(int i=0;i<n;i++)
{
int num;
cin>>num;
branch.push_back(num);
}
for(int i=0;i<branch.size();i++)
{
cout<<"node "<<i+1<<": key = "<<branch[i]<<", ";
if(i>0)
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
using namespace std;
long a[251];
int main(){
int H; scanf("%d",&H);
for (int i = 1; i <= H; ++i) scanf("%ld",&a[i]);
for (int i = 1; i <= H; ++i){
cout << "node " << i << ": key = " << a[i] << ", ";
int tmp = i / 2;
if (tmp >=1 ) cout << "p... | 1 | 63,583,509 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<ll,P> event;
const ll MAX = 510000;
const ll MOD = 1000000007;
int main() {
ll n,m;cin>>n>>m;
queue<P>qu;
if(n%2==1){
rep(i,m... | #include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | 1 | 80,980,120 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n; cin >> n;
string s1, s2; cin >> s1 >> s2;
for (int i = 0; i < n; i++)
if (s1[i] == s2[0]) {
bool g = 1;
for (int j = i + 1, k = 1; j < n; j++, k++)
if(s1[j] != s2[k])
g = 0;... | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <limits>
#include <climits>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;... | 1 | 45,305,419 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <iomanip>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vec... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | 1 | 61,951,420 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | #include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
#define ll long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
int main()
{
ll n,x,t;
cin>>n>>x>>t;
if(n%x==0)
cout<< (n/x)*t <<endl;
else
cout<< (n/x+1)*t <<endl;
} | 1 | 67,090,803 |
#include <bits/stdc++.h>
#define rep(i,l,r) for (int i=l,i##end=r;i<=i##end;++i)
#define per(i,r,l) for (int i=r,i##end=l;i>=i##end;--i)
#define rep0(i,r) for (int i=0,i##end=r;i<i##end;++i)
#define ll long long
using namespace std;
const int N=1e6+6;
int n,a[N],b[N];
ll calc(ll k){
ll s=0; rep(i,1,n) if ((a[i]&k)=... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 1 | 91,384,430 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
int r = 0, b = 0, c = 0;
rep(i, s.size()) {
if (s[i] == '0') {
if (b > 0) {
c += 2;
--b;
} else {
+... | #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... | 1 | 58,743,723 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline void chmax(T1 &a, const T2 &b) {
if (a < b) a = b;... | #include<iostream>
int main()
{
int X,Y=0;
std::cin >> X >> Y;
int clane,turtle=0;
for(int i=0; i<(X+1); i++)
{
clane = (X-i)*2;
turtle = i*4;
if((clane+turtle)==Y)
{
std::cout << "Yes";
return 0;
}
}
std::cout << "No";
retu... | 1 | 50,297,697 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
#define MOD 1000000007
ll N, K;
ll solve() {
vector<ll> A (N + 1, 0);
ll ans = 0;
for (size_t i = 1; i < N + 1; i++) A.at(i) = A.at(i - 1) + i;
for (size_t i = K; i < N + 1; i++) {
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DEBUG 0
#if DEBUG
#define DUMP(a) REP(_i, a.size()) cout << a[_i] << (_i + 1 == a.size() ? "\n" : " ")
#define DUMP2D(... | 1 | 75,162,707 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
ll n;
ll x,m;
cin>>n>>x>>m;
ll a[m+1];
a[0]=x;
rep(i,0,m){
a[i+1]=a[i]*a[i]%m;
}
if(n<m){
ll ans=0;
rep... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int MAX =3001;
const int MOD =998244353;
signed main(){
int n... | 1 | 54,812,384 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi... | #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;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
int mn[1 << 26];
signed main() {
string s;
cin >> s;
int n = ... | 1 | 33,079,291 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.