content stringlengths 19 11k |
|---|
#include <stdio.h>
int main(void)
{
int A,B,C;
//char input[LENGTH];
//fgets(input, LENGTH - 1, stdin);
scanf("%d" , &A);
scanf("%d" , &B);
scanf("%d" , &C);
//fgets(input, LENGTH - 1, stdin);
//B = sscanf(input, "%d", &B);
//fgets(input, LENGTH - 1, stdin);
//C = sscanf(input,... |
#include <stdio.h>
#define DATANUM 3
int judge(int*);
int main(void)
{
int data[DATANUM] = {0};
int i = 0;
int ret = 0;
for (i = 0; i < DATANUM; i++) {
scanf("%d", &data[i]);
}
ret = judge(data);
if (ret) {
printf("Yes\n");
} else {
printf("No\n");
}
... |
/*
* abc061a_c.c
*
* Created on: 2019/05/08
* Author: ktaka
*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
int main(void){
char tango[100],*ch;
int val[10];
int i=0,j=0;
fgets(tango,sizeof(tango),stdin);
//printf("%s\n",tango);
ch = strtok(tango," ");
val[i] = atoi(ch... |
r[55];s;a;p;main(i){for(;~scanf("%d",&p+!s+!a)?++r[p]:s/i&&printf("%d ",r[i++]););} |
c[51];main(b,a){for(scanf("%d%*d",c);~scanf("%d",&a);)c[a]++;for(;*c/b;)printf("%d\n",c[b++]);} |
G[51],n,i;main(a,b){for(;~scanf("%d%d",&a,&b);)n?G[a]++,G[b]++:(n=a);for(;i++<n;)printf("%d\n",G[i]);} |
r[99];main(n,m,a,b){scanf("%d%d",&n,&m);while(m--){scanf("%d%d",&a,&b);r[a]++;r[b]++;}for(++m;m<n;)printf("%d\n",r[++m]);} |
#include<stdio.h>
int main(){
int c[51];
int i,n,m,j;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)c[i]=0;
for(i=0;i<m*2;i++){scanf("%d",&j);c[j]++;}
for(i=1;i<=n;i++)printf("%d\n",c[i]);
}
|
#include <stdio.h>
int main (){
int k,n,a,b,s[1000]={0};
scanf ("%d%d",&k,&n);
for (int i;i<n;i++){
scanf ("%d",&a);
scanf ("%d",&b);
s[a]++;
s[b]++;
}
for (int j=1;j<k+1;j++){
printf ("%d\n",s[j]);
}
return 0;
} |
#include<stdio.h>
int main(){
int i,j,c,r,tmp1,tmp2;
i=j=r=c=tmp1=tmp2;
int city[52]={0};
scanf("%d %d",&c,&r);
for(i=0;i<r;i++){
scanf("%d %d",&tmp1,&tmp2);
city[tmp1]++;
city[tmp2]++;
}
for(j=1;j<=c;j++){
printf("%d\n",city[j]);
}
return 0;
} |
#include<stdio.h>
int main(){
int m,n,x;
int city[51]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
scanf("%d%d",&n,&m);
for(int i=0;i<2*m;i++){
scanf("%d",&x);
city[x]++;
}
for(int i=1;i<=n;i++){
printf("%d\n",city[i]);
}
return 0;
} |
int main(){
int N,M;
scanf("%d%d",&N,&M);
int *num=malloc(sizeof(int)*N);
int j,k;
for(int i=0;i<N;i++)num[i]=0;
for(int i=0;i<M;i++){
scanf("%d%d",&j,&k);
num[j-1]++;
num[k-1]++;
}
for(int i=0;i<N;i++)
printf("%d\n",num[i]);
return 0;
}
|
#include <stdio.h>
int main()
{
int i, N, M, a[51], b[51];
scanf("%d %d", &N, &M);
for (i = 1; i <= M; i++) scanf("%d %d", &(a[i]), &(b[i]));
int deg[51] = {};
for (i = 1; i <= M; i++) {
deg[a[i]]++;
deg[b[i]]++;
}
for (i = 1; i <= N; i++) printf("%d\n", deg[i]);
fflush(stdout);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int a[60], b[60], i, j, M, N, R[60]={0};
scanf("%d%d", &N, &M);
for (i=0;i<M;i++) scanf("%d%d", &a[i], &b[i]);
for (i=0;i<M;i++) {
R[a[i]]++; R[b[i]]++;
}
for (j=1;j<=N;j++) {
printf("%d\n", R[j]);
... |
#include <stdio.h>
int main(void)
{
int N, M;
int a[50], b[50];
scanf("%d %d", &N, &M);
for(int i=0; i<M; i++)
scanf("%d %d", &a[i], &b[i]);
int road[50];
for(int i=0; i<N; i++)
road[i]=0;
for(int i=0; i<M; i++){
road[a[i]-1] += 1;
road[b[i]-1] += 1;
}
for(int i=0; i<N; i++){
printf("%d\n",road[... |
#include <stdio.h>
int main(){
int N,M;
int a[55];
int b[55];
int ans[55]={0};
scanf("%d%d\n",&N,&M );
for (int i = 0; i < M; i++) {
scanf("%d%d\n",&a[i],&b[i] );
a[i]--;
b[i]--;
}
for (int i = 0; i < N; i++) {
for(int j=0;j<M;j++){
if(a[j]==i||b[j]==i){
ans[i]++;
}else{}
}
printf("%d\n",ans[... |
#include <stdio.h>
int main(void)
{
int n,m;
scanf("%d %d",&n,&m);
int a[m*2];
for(int p=0;p<m;p++)
scanf("%d %d",&a[p],&a[p+m]);
int ans;
for(int q=1;q<n+1;q++)
{
ans=0;
for(int r=0;r<m*2;r++)
{
if(a[r]==q)
ans++;
}
p... |
#include <stdio.h>
int main(void)
{
int City,Rord,i,j;
int Count;
int a[101] ={ 0 };
scanf("%d %d", &City, &Rord);
for(i=1;i<=Rord*2;i++){
scanf("%d\b",&a[i]);
i++;
scanf("%d",&a[i]);
}
for(i=1;i<=City;i++){
Count = 0;
for(j=1;j<=Rord*2;j++){
if(i == a[j]){
Count += 1;
}
}
prin... |
#include "stdio.h"
int main()
{
int N[50];
int MaxN,MaxM;
int a,b;
int i;
scanf("%d %d", &MaxN, &MaxM);
//初期化
for (i = 0; i < 50; i++) {
N[i] = 0;
}
//N回Inputする
for (i = 0; i < MaxM; i++) {
scanf("%d %d", &a, &b);
N[a - 1] = N[a - 1] + 1;
N[b - 1] = N[b - 1] + 1;
}
for (i = 0; i < MaxN; i++) {
p... |
#include <stdio.h>
int main(void){
int city,road,i,tag,tag2;
scanf("%d %d",&city,&road);
int count[city+1];
for(i=0;i<=city;i++){
count[i]=0;
}
for(i=0;i<road;i++){
scanf("%d %d",&tag,&tag2);
count[tag]++;
count[tag2]++;
}
for(i=1;i<=city;i++){
pri... |
#include<stdio.h>
#include<stdlib.h>
int main()
{
int N,M;
int *a,*b;
int *con;
scanf("%d %d",&N,&M);
a=(int*)malloc(sizeof(int)*M);
b=(int*)malloc(sizeof(int)*M);
con=(int*)malloc(sizeof(int)*(N+1));
for(int i=0;i<M;i++){
scanf("%d %d",&a[i],&b[i]);
con[a[i]]++;
con[b[i]]++;
}
fo... |
#include <stdio.h>
#define NMAX 50
int main(void) {
int N, M;
int A[NMAX], B[NMAX];
int road[NMAX];
int i;
scanf("%d %d", &N ,&M);
for (i = 0; i < M; i++) {
scanf("%d %d", &A[i], &B[i]);
}
for (i = 0; i < N; i++) {
road[i] = 0;
}
for (i = 0; i < M; i++) {
road[A[i] - 1]++;
road[B[i] - 1]++;
... |
#include<stdio.h>
int main()
{
int N, M;
scanf("%d %d", &N, &M);
int a[M];
int b[M];
int co;
int un;
int C[N];
for(un = 0; un < N; un++)
{
C[un] = 0;
}
for(co = 0; co < M; co++)
{
scanf("%d %d", &a[co], &b[co]);
}
for(un = 0; un < N; un++)
{
for(co=0; co<M; co++)
{
if (a[co] == un+1) C... |
#include <stdio.h>
int main() {
int i, number_of_towns, number_of_roads, town_a, town_b;
scanf("%d %d", &number_of_towns, &number_of_roads);
int road_counter[50] = {};
for(i = 0; i < number_of_roads; i++) {
scanf("%d %d", &town_a, &town_b);
road_counter[town_a-1]++;
road_counter[town_b-1]++;
}
... |
#include<stdio.h>
#include<math.h>
int main(void){
int n,m;
scanf("%d%d",&n,&m);
int a[m],b[m];
int c[n+1];
int d[n+1];
for(int i=0;i<m;i++){
scanf("%d%d",&a[i],&b[i]);
}
for(int i=0;i<=n;i++){
c[i]=0;
d[i]=0;
}
for(int i=0;i<m;i++){
c[a[i]]++;
... |
#include <stdio.h>
int main(){
int N, M;
scanf("%d %d\n", &N, &M);
int a[M], b[M];
int count[N];
char yomikomi[32];
for(int i=0;i<M;i++){
fgets(yomikomi, 32, stdin);
int n = sscanf(yomikomi, "%d %d", &a[i], &b[i]);
if(n != 2) printf("error\n");
}
for(int i=0;i<N;i++) count[i] = 0;
for(int i=0;i<N;i++... |
#include <stdio.h>
#include<string.h>
#include<stdlib.h>
int main(void)
{
int g[50];
int x[50];
int n,m;
int a[50],b[50];
int i;
int c;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++){
scanf("%d%d",&a[i],&b[i]);
}
for(i=0;i<50;i++){
g[i]=0;
x[i]=0;
}
for(i=0;i<n;i++){
for(c=0;c<m;c++){
if(i+... |
#include <stdio.h>
int main (void)
{
int N,M,a[50],b[50],road[50],i,j,cnt=0;
scanf("%d\t%d",&N,&M);
for(i=0;i<M;i++)
{
scanf("%d\t%d",&a[i],&b[i]);
}
for(i=1;i<=N;i++)
{
for(j=0;j<M;j++)
{
if(a[j]==i)
{
cnt++;
}else... |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define BUF_SIZE 10
int main(void) {
FILE *fp = stdin;
char line[BUF_SIZE];
if(!fgets(line, BUF_SIZE, fp)) return 0;
int cities, roads;
int i;
sscanf(line, "%d %d", &cities, &roads);
int *city_hist = malloc(sizeof(int)*(cities+1));
for(i = 0; ... |
#include <stdio.h>
#define N_MAX 50
#define M_MAX 50
int main()
{
int n, m;
int roads[M_MAX][2];
int numberOfRoadsCityHave[N_MAX + 1] = {};
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++)
{
scanf("%d", &roads[i][0]);
scanf("%d", &roads[i][1]);
}
for (int i = 0; i < m; i++)
... |
#include <stdio.h>
int main(){
int N,M;
scanf("%d %d", &N, &M);
int a[100]={0},b[100]={0};
int i,k;
for(i=1;i<=M;i++){
scanf("%d %d", &a[i], &b[i]);
}
int counta[100]={0},countb[100]={0};
for(i=1;i<=M;i++){
for(k=1;k<=N;k++... |
#include<stdio.h>
#include<stdlib.h>
void printans(int N, int M, int *a, int *b){
int *ans, i;
ans = (int *)malloc(sizeof(int)*N);
if(ans == NULL) exit(1);
for(i = 0; i < N; i++){
ans[i] = 0;
}
for(i = 0; i < M; i++){
ans[a[i]-1]++;
ans[b[i]-1]++;
}
for(i = 0; i< N; i++){
printf("%d\n", ans[i]);
... |
long k,A[1<<17];b;i;main(){for(;~scanf("%d%ld",&A,k?&b:&k);)A[*A]+=b;for(;k>0;)k-=A[++i];printf("%d",i);} |
long long n,k,a,s[2<<16];main(b){for(scanf("%*d%lld",&k);~scanf("%d%d",&a,&b);)s[a]+=b;for(;k>0;)k-=s[++n];printf("%d\n",n);} |
long k,A[1<<17];b;i;j;
main(a){
for(;~scanf("%d%ld",&a,i++?&b:&k);)A[a]+=b;
for(;k>0;)k-=A[++j];printf("%d",j);
}/////////////////////////// |
#include<stdio.h>
long A[100001];
int main(){
long a,b,N,K,x=0;
int i;
scanf("%ld%ld",&N,&K);
for(i=0;i<N;i++){
scanf("%ld%ld",&a,&b);
A[a]+=b;
}
for(i=1;i<=100000;i++){
x+=A[i];
if(x>=K){
printf("%ld\n",i);
break;
}
}
return 0;
} |
#include<stdio.h>
int main(){
long int x[100001];
long int n,k,i,a,b;
scanf("%ld%ld",&n,&k);
for(i=0;i<100001;i++)x[i]=0;
for(i=0;i<n;i++){scanf("%ld%ld",&a,&b);x[a]+=b;}
for(i=0;i<100001;i++){k-=x[i];if(k<=0){printf("%ld",i);return 0;}}
}
|
#include<stdio.h>
int main(void)
{
long int n,a,b,d[100001]={0}, i;
long int k, s;
scanf("%ld %ld",&n,&k);
for(i=0; i<n; i++){
scanf("%ld %ld",&a,&b);
d[a] += b;
}
s=0;
for( i=1; i <= 100000; i++){
s += d[i];
if(s >= k){
break;
}
}
printf("%d\n", i);
return 0;
} |
#include<stdio.h>
int main(void)
{
long long n,k,a,b,x[100001]={0},i;
scanf("%lld %lld", &n, &k);
for(i=0; i<n; i++)
{
scanf("%lld %lld", &a, &b);
x[a]+=b;
}
a=0;
for(i=1; i<100001; i++)
{
a+=x[i];
if(a>=k)
{
printf("%lld\n", i);
break;
}
}
return 0;
} |
#include<stdio.h>
long count[100001];
int main(int argc, char const *argv[]){
long a,b,i,n,k,c=0;
scanf("%ld %ld",&n,&k);
for(i=0;i<n;i++){
scanf("%ld %ld",&a,&b);
count[a]+=b;
}
for(i=1;i<=100000;i++){
c+=count[i];
if(c>=k){
printf("%ld\n",i);
break;
}
}
return 0;
} |
#include <stdio.h>
#define Rep(i,a,n)for(int i=(int)(a);i<(int)(n);i++)
#define rep(i,n)Rep(i,0,n)
int main() {
long long n, k, a, b, an[100002] = { 0 }, cnt=0, i=0;
scanf("%lld %lld", &n, &k);
rep(i, n) { scanf("%lld %lld", &a, &b); an[a] += b; }
while (1){
cnt += an[i];
if (cnt >= k) { printf("%lld", i); r... |
#include <stdio.h>
int main(void)
{
int l;
long int k;
unsigned long int a[100001], b, c, i, n;
for(i = 0; i < 100001; i++)
a[i] = 0;
l = scanf("%lu %ld", &n, &k);
for(i = 0; i < n; i++){
l = scanf("%lu %lu", &b, &c);
a[b] = a[b] + c;
}
for(i = 1; i < 100001; i++){
k = k - a[i];
if(k <= 0){
printf... |
#include<stdio.h>
#include<string.h>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define lln long long int
int main(){
lln nn,kk,aa,bb;
lln ans = 0;
scanf("%lld %lld",&nn,&kk);
lln array[100001];
memset(array,0,sizeof(array));
while(nn--){
scanf("%lld %lld",&aa,&bb);
array[aa] += bb;
}
FOR(i,0,100001){
... |
#include <stdio.h>
typedef long long ll;
ll num[100005];
int main(){
int N;
ll K;
scanf("%d %lld",&N,&K);
int i;
int a, b;
for (i = 0; i < N; i++) {
scanf("%d %d",&a,&b);
num[a] += b;
}
ll ans = 0ll;
for (i = 1; i <= 100000; i++) {
if (num[i] > 0ll) {
if (ans + 1ll<=K && K<=ans + num[i]) {
... |
#include<stdio.h>
int main()
{
long int n,k,i,cc,ans,ll;
ll=0;
ans=1;
cc=0;
scanf("%ld %ld",&n,&k);
long int sw[100001],a[n],b[n];
for(i=0;i<n;++i)
{
scanf("%ld %ld",&a[i],&b[i]);
}
for(i=0;i<100001;++i)
{
sw[i]=0;
}
for(i=0;i<n;++i)
{
sw[a[i]]=sw[a[i]]+b[i];
}
while(cc==0)
{
... |
#include <stdio.h>
#include <stdlib.h>
typedef struct{
long a,b;
}data;
int cmp(const void *c,const void *d){
return ((data*)c)->a-((data*)d)->a;
}
int main(void){
long n,i,k;
data p[100001];
scanf("%ld %ld",&n,&k);
for(i=0;i<n;i++){
scanf("%ld %ld",&p[i].a,&p[i].b);
}
qsort(p,n,... |
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[])
{
int i, N;
long long K, k = 0;
static long long list[100001];
scanf("%d %lld", &N, &K);
for ( i = 0; i < N; i++ ){
int a, b;
scanf("%d %d", &a, &b);
list[a] += b;
}
for ( i = 1; i <= 100000; ... |
#include<stdio.h>
#include<stdlib.h>
typedef struct {
int number;
int kazu;
} set;
int cmp( const void *p, const void *q ) {
return ((set*)p)->number - ((set*)q)->number;
}
int main(){
int i,j,k,N;
long K;
scanf("%d %ld",&N,&K);
set A[N];
for(i=0;i<N;i++){
scanf("%d %d",&A[i].number,&A[i].ka... |
#include<stdio.h>
#include<stdlib.h>
typedef long long ll;
int max(int a, int b){
if(a > b) return a;
else return b;
}
int min(int a, int b){
if(a < b) return a;
else return b;
}
int main(){
ll n,k;
scanf("%lld %lld",&n,&k);
ll array[500001] = {0};
for(ll i = 0; i < n; ++i){
ll a,b;
scanf(... |
#include<stdio.h>
#include<stdlib.h>
typedef struct tag_ab{
int a,b;
}aandb;
int comp(const void *x,const void *y){
return ((aandb*)x)->a - ((aandb*)y)->a;
}
int main(void){
int n;
long long k;
scanf("%d %lld",&n,&k);
aandb a_b[n];
for(int i = 0;i < n;i++)scanf("%d %d",&a_b[i].a,&a_b[i].b... |
#include <stdio.h>
int main(void){
// Here your code !
long long int n,k;
int i,j,l;
int a,b;
long long int sum=0;
scanf("%lld %lld",&n,&k);
long long int test[100000];
for(j=0;j<100000;j++)
{
test[j]=0;
}
for(i=1;i<=n;i++)
{
scanf("%d %d",&a,&b);
... |
#include<stdio.h>
int main(){
long long N,K,sum=0,ans=-1;
scanf("%lld%lld",&N,&K);
long long a[N],b[N];
for(long long i=0;i<N;i++)scanf("%lld%lld",&a[i],&b[i]);
long long h=N;
long long swapped=0;
while(h>1 || swapped==1){
if(h>1)h=h*10/13;
swapped=0;
for(long long i=0;i<N-h;i++){
if(a[i]>a[i+h]){
... |
#include<stdio.h>
#include<stdlib.h>
long max(long a, long b){
if(a > b) return a;
else return b;
}
long min(long a, long b){
if(a < b) return a;
else return b;
}
int sort(const void *a, const void *b){
return *(int*)a -*(int*)b;
}
int main(){
int n;
long long int k;
scanf("%d%lld",&n,&k);
long ... |
#include <stdio.h>
#include <stdlib.h>
typedef struct{
int num;
int count;
}NC;
int comp(NC *a, NC *b){
return a->num - b->num;
}
int main(void){
long long int n, k, pos = 0;
int i;
NC nc[100000];
scanf("%lld%lld", &n, &k);
for(i = 0; i < n; i++){
scanf("%d%d", &nc[i]... |
#include <stdio.h>
#include <stdlib.h>
typedef struct
{
long long a,b;
} ab_data;
int compare_a(const void *a, const void *b) {
ab_data *A = (ab_data *)a;
ab_data *B = (ab_data *)b;
return A->a - B->a;
}
int main()
{
ab_data ab[100000];
long long n,k;
scanf("%lld %lld",&n,&k);
int i;... |
#include <stdlib.h>
#include <stdio.h>
#define N 100000
typedef struct{
long data,kaisu;
}data;
int cmp(const void *a,const void *b){
return ((data*)a)->data-((data*)b)->data;
}
int main(void){
data a[N];
long n,k,i,j,c,d;
long dat,kai;
scanf("%ld %ld",&n,&k);
for(i=0;i<n;i++){
scanf... |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define df 0
int dc=100000;
#define MAX 100010
typedef long int li;
typedef struct{
int a;
int b;
}data;
data array[MAX];
int comp(const void*a,const void*b){
data x=*((data*)a),y=*((data*)b);
return x.a-y.a;
}
int main(){
if(df)printf("*** debug mode *... |
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#define MAX_N (100000)
#define rep(i, n) for(int64_t i = 0; i < (n); i++)
typedef struct {
int A;
int B;
} st_nums;
int nums_sort(const void *a, const void *b) {
return (((st_nums*)a)->A - ((st_nums*)b)->A);
}
int main(void) {
int64_t N, K;
scanf(... |
#include <stdio.h>
#include <limits.h>
#include <stdlib.h>
typedef struct{
long int a;
long int b;
}NUMBER;
int compare(const void *a, const void *b)
{
NUMBER aNum = *(NUMBER*)a;
NUMBER bNum = *(NUMBER*)b;
int tmp1=aNum.a;
int tmp2=bNum.a;
return tmp1-tmp2;
}
int main(void)
{
... |
#include <stdio.h>
#include <stdlib.h>
typedef struct{
long long num;
long long mul;
}set;
int compare(const void *a,const void *b){
set x=*(set *)a,y=*(set *)b;
long long tmp1=x.num,tmp2=y.num;
if(tmp1>tmp2)return 1;
return -1;
}
int main()
{ long long n,k;
scanf("%lld%lld",&n,&k);
... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct {
int a, b;
} pair;
int paircmp(const void *a, const void *b) {
pair c = *(pair *)a, d = *(pair *)b;
if (c.a < d.a) return -1;
else if (c.a == d.a && c.b < d.b) return -1;
else if (c.a == d.a && c.b == d.b) return 0;
els... |
#include <stdio.h>
#include <stdlib.h>
typedef struct {
long number;
long stock;
} S_ARRAY;
int cmpAscNum(const void * n1, const void * n2)
{
if (((S_ARRAY *)n1)->number > ((S_ARRAY *)n2)->number)
{
return 1;
}
else if (((S_ARRAY *)n1)->number < ((S_ARRAY *)n2)->number)
{
return -1;
}
else
{
return 0;... |
#include <stdio.h>
#include<stdlib.h>
int int_sort( const void * a , const void * b ) {
if( *( long long int * )a < *( long long int * )b ) {
return -1;
}
else
if( *( long long int * )a == *(long long int * )b ) {
return 0;
}
return 1;
}
int main(void){
long long int N,K;
scanf("%lld %lld"... |
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
struct asumikana {
uint32_t a;
uint64_t b;
};
int amamiyasora(const void* x, const void* y) {
struct asumikana a = *(const struct asumikana*)x, b = *(const struct asumikana*)y;
return a.a < b.a ? -1 : a.a > b.a;
}
uint32_t N;
uint64_t K;
struct asumika... |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main(void) {
int test = 0;
int N;
long long int K;
int a;
long long int b[100001];
int i;
long long int num_terms;
char buf[128], *ch;
FILE *file;
if(test == 1) {
file = fopen("input.txt", "r");
}
if(test == 1) {
fgets(buf, sizeof(buf), file)... |
#include<stdio.h>
#include<stdlib.h>
int compr(const void *ax, const void *ay){
unsigned long *x = *(unsigned long **)ax;
unsigned long *y = *(unsigned long **)ay;
if(x[0] > y[0]) return 1;
if(x[0] < y[0]) return -1;
if(x[0] = y[0]) return 0;
}
unsigned long answer(unsigned int N, unsigned long long K, unsigned... |
#include<stdio.h>
#define inf 1145141819810364364
int main(void){
long long d[1024],n,m,a[2048],b[2048],c[2048],i,j,f;
for(i = 0;i < 1024;i++){
d[i] = -inf;
}
d[1] = 0;
scanf("%lld%lld",&n,&m);
for(i = 1;i <= m;i++){scanf("%lld%lld%lld",&a[i],&b[i],&c[i]);}
for(i = 1;i <= 6*n;i++){
f = 0;
for(j = 1;j <= m... |
#include<stdio.h>
int main(){
long long n,m,i,j,l[2010],a[2010],b[2010],c[2010],co[2010]={};
for(i=2;i<2000;i++)co[i]=-1e18;
scanf("%lld %lld",&n,&m);
for(i=0;i<m;i++)scanf("%lld %lld %lld",&a[i],&b[i],&c[i]);
for(i=0;i<n;i++){
for(j=l[i]=0;j<m;j++){
if(co[a[j]]+c[j]>co[b[j]])co[b[j]]=co[a[j]]+c[j];
}
}
f... |
#include<stdio.h>
long long N,M;
long long a[2000],b[2000],c[2000];
long long d[1001];
long long neg[1001];
long long main(){
scanf("%lld%lld",&N,&M);
for(long long i=0;i<M;i++){
scanf("%lld%lld%lld",&a[i],&b[i],&c[i]);
c[i]*=-1;
}
for(long long i=2;i<=1000;i++)d[i]=99999999999999999;
for(int j=0;j<N*2;... |
#include<stdio.h>
#include<stdlib.h>
#define ll long long
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define min(p,q)((p)<(q)?(p):(q))
#define INF ((1LL<<62)-(1LL<<31))
typedef struct edge{ll s,g,c;}E;
E e[2010];
ll d[1010];
int n,m;
void berumanfoodo(ll n,ll s){
rep(i,0,n)d[i]=i==s?0:INF;
rep(nnnn,0,n-1)rep(i,0,m)i... |
#include<stdio.h>
#include<stdlib.h>
#define EMAX 2000
#define VMAX 1000
typedef struct edges{
long int f;
long int t;
long int c;
}edge;
edge v[EMAX];
int n,m;
void initial_BF(int e){for(int i=0;i<e;i++)scanf("%ld%ld%ld",&v[i].f,&v[i].t,&v[i].c);}
long int BellmanFord(int f,int t){
long int l[1001],i,j,tl,a;
... |
#include<stdio.h>
int main(){
int n,m,a,b,i,j,k,flag=0;
long c,g[1001][1001][2]={};
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
g[i][i][1]=1;
for(i=0;i<m;i++){
scanf("%d %d %ld",&a,&b,&c);
g[a][b][0]=c;
g[a][b][1]=1;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if... |
#include<stdio.h>
#define INF -1000000000000000000
#define ll long long
int main() {
int n, m, f;
int i, j;
ll score[1010] = {};
scanf("%d %d", &n, &m);
ll a[2010] = {};
ll b[2010] = {};
ll c[2010] = {};
for (i = 1; i < m+1; i++) {
scanf("%lld %lld %lld", &a[i], &b[i], &c[i]);
}
for (i = 2; i <... |
#include <stdio.h>
#include <inttypes.h>
#define INF INT64_C(1145141919810931)
int N, M;
int a[2048], b[2048];
int64_t c[2048];
int64_t max[2048];
int main(void) {
int i, j;
int64_t asumikana, horieyui;
if (scanf("%d%d", &N, &M) != 2) return 1;
for (i = 0; i < M; i++) {
if (scanf("%d%d%" SCNd64, &a[i], &b[i],... |
#include <stdio.h>
#include <limits.h>
typedef long long ll;
int a[2005];
int b[2005];
ll c[2005];
ll dist[1005];
int negative[1005];
int main(){
int N,M;
scanf("%d %d",&N,&M);
int i,j;
for(i=0;i<M;i++){
scanf("%d %d %lld",&a[i],&b[i],&c[i]);
a[i]--;
b[i]--;
c[i]=-c[i];
}
for(i=0;i<N;i++){
dist[... |
#include<stdio.h>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define lln long long int
#define INF 1LL << 50
int main(){
lln a[2000],b[2000],c[2000],n,m;
lln dist[1000],nega[1000],ans;
scanf("%lld %lld",&n,&m);
FOR(i,0,m){
scanf("%lld %lld %lld",&a[i],&b[i],&c[i]);
c[i] = - c[i];
}
FOR(i,0,n){
dist[i] = ... |
#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
#define ll long long int
#define MIN(x,y) (x)>(y)?(y):(x)
#define MAX(x,y) (x)>(y)?(x):(y)
#define ABS(x) (x)>0?(x):(-x)
//ばなな
int main(void){
const ll INF = (ll)1<<50;
int n,m;
scanf("%d%d",&n,&m);
int a[m],b[m];
ll c[m];
for(int i=0;i<m;i++){
scanf("%... |
#include <stdio.h>
#define ll long long
#define FALSE 0
#define TRUE 1
const ll INF = 1LL << 50;
int main(void){
int N, M;
int a[2000], b[2000], ne[2000] = {FALSE};
ll c[2000], dist[2000], ans;
int i, loop;
scanf("%d%d", &N, &M);
for(i = 0; i < M; i++){
scanf("%d%d%lld", &a[i]... |
// https://atcoder.jp/contests/abc061/tasks/abc061_d
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
long long v[1000][1000], d[1000];
void solv(long long n, long long m) {
long long i, j, max = LLONG_MIN, a, b, c, updated, count;
for (i = 0; i < n; i++) {
d[i] = LLONG_MIN;
for (j = 0; j < n; ... |
#include <stdio.h>
#include <stdlib.h>
#define INF 1e17
typedef long long ll;
typedef struct{
int cnt;
int to[1001];
ll cost[1001];
} edge;
ll d[1001];
ll ans;
edge eg[1001];
int sol(int n,int s){
int i;
for(i=1;i<=n;i++){
d[i]=INF;
}
d[s]=0;
int f,t;
for(i=0;i<n-1;i++){
... |
#include <stdio.h>
#include <stdlib.h>
#define inf (long long int)(1e18)
typedef struct {
long long int nextver;
long long int c;
}edge;
typedef struct {
long long int score;
long long int nextnum;
edge *nexts;
}vertex;
long long int max(long long int a, long long int b){
if(a > b){
return a;
}
else{
ret... |
#include<stdio.h>
#include<stdlib.h>
#define min(a,b) ((a)<(b)?(a):(b))
long long inf=0;
struct edge{
long long from;
long long to;
long long cost;
};
int n,m;
long long d[1000];
struct edge e[2000];
long long from0[1000];
int check[1000]={0};
int find_negative(){
int i,j;
for(i=0;i<n;i++){
for(j=0;j... |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
typedef long long int int64;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
void run(void){
int n,m;
scanf("%d%d",&n,&m);
int *vertex=(int *)malloc(sizeof(int)*m);
int *next=(int *)malloc(sizeof(int... |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define NEW(p,n){p=malloc((n)*sizeof(p[0]));if(p==NULL){printf("not enough memory\n");exit(1);};}
//pの型の変数n個の要素分のメモリを確保し、そのアドレスをpに代入するマクロ
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define SWAP(type, x, y) do { type tmp =... |
i=1;main(a,b,c,x){for(scanf("%d%d%d",&a,&b,&c);~a&~b&~c&1&&31&++i;x=a+b+c,a=x-a>>1,b=x-b>>1,c=x-c>>1);printf("%d",i%32-1);} |
s,d,e;main(a,b,c){for(scanf("%d%d%d",&a,&b,&c);a%2+b%2+c%2<1&s<30;a=b+c>>1,b=d+c>>1,c=d+e>>1)d=a,e=b,s++;printf("%d",s<30?s:-1);} |
#include<stdio.h>
int main(){
int i,A,B,C,a,b,c;
scanf("%d%d%d",&A,&B,&C);
for(i=0;i<10000;i++){
if(A%2==1||B%2==1||C%2==1)break;
a=B/2+C/2;
b=A/2+C/2;
c=A/2+B/2;
A=a;
B=b;
C=c;
}
if(i==10000)printf("-1\n");
else printf("%d\n",i);
} |
#include<stdio.h>
int main(){
int a,b,c,num=0,a1,b1,c1,f=1;
scanf("%d%d%d",&a,&b,&c);
while(a%2==0 && b%2==0 && c%2==0){
a1=a/2;
b1=b/2;
c1=c/2;
a=b1+c1;
b=a1+c1;
c=a1+b1;
num++;
if(a==b && b==c){
f=0;
printf("-1\n");
break;
}
}
if(f==1)printf("%d\n",num);
} |
#include<stdio.h>
int main()
{
int a,b,c;
int A,B,C;
scanf("%d%d%d",&a,&b,&c);
int sum=0;
int f=0;
int t=1000;
while(t--){
if(a%2!=0||b%2!=0||c%2!=0){
f=1;
break;
}
A=a;
a=(b+c)/2;
B=b;
b=(A+c)/2;
C=c;
c=(A+B)/2;
sum++;
}
if(f==1) printf("%d\n",sum);
else printf("-1\n");
} |
#include<stdio.h>
int main()
{
int A,B,C;
int a,b,c;
while(scanf("%d%d%d",&A,&B,&C)!=EOF)
{
int t=1000;
int q=0;
while(t--)
{
if(A%2==1 || B%2==1 || C%2==1) break;
a=A/2;
b=B/2;
c=C/2;
A=b+c;
B=a+c;
C=a+b;
q++;
}
if(t>0) printf("%d\n",q);
else printf("-1\n");
}
} |
#include <stdio.h>
#include <stdlib.h>
#define ll long long int
int main(void){
ll A,B,C,ans=0;
scanf("%lld%lld%lld",&A,&B,&C);
while(1){
if(A%2==1 || B%2==1 || C%2==1)break;
if(A==B && B==C){
ans = -1;
break;
}
ans++;
ll a=A,b=B,c=C;
A = (b+c)/2;
B = (a+c)/2;
C = (a+b)/2;
}
printf("%lld",ans... |
#include<stdio.h>
int main(int argc, char const *argv[]){
long a,b,c,ans=0,sum;
scanf("%ld %ld %ld",&a,&b,&c);
if(a%2==0 && b%2==0 && c%2==0){
if(a==b && b==c) ans=-1;
else{
sum=a+b+c;
c=c-b;
b=b-a;
while(c%2==0 && b%2==0 && a%2==0){
ans++;
a=(sum-a)/2;
b/=2;
c/=2;
}
}
}
print... |
#include<stdio.h>
int main()
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
int n=1000;
int f=0;
int sum=0;
while(n--)
{
if(a%2!=0||b%2!=0||c%2!=0)
{f=1;
break;
}
else
{ int x,y,z;
x=a;
y=b;
z=c;
a=(y/2)+(z/2);
b=(x/2)+(z/2);
c=(x/2)+(y/2);
sum++;
}
}
if(f==1)
printf("%d\... |
#include<stdio.h>
#include<stdlib.h>
int main(){
int A,B,C,a,b,c;
int counter=0;
scanf("%d%d%d",&A,&B,&C);
if ( A==B && B==C )
{
(A%2 == 0) ? puts("-1"):puts("0");
exit(0);
}
while (A%2==0 && B%2==0 && C%2==0)
{
counter++;
a = B/2 + C/2;
b = A/2 + C/2;
c = A/2 + B/2;
A = a;
B = b;
C = ... |
#include <stdio.h>
int main()
{
int A, B, C;
scanf("%d %d %d", &A, &B, &C);
if (A % 2 == 0 && A == B && B == C) printf("-1\n");
else {
int a, b, c, count = 0;
while (A % 2 == 0 && B % 2 == 0 && C % 2 == 0) {
count++;
a = (B + C) / 2;
b = (C + A) / 2;
c = (A + B) / 2;
A = a;
B = b;
C = c;
... |
#include <stdio.h>
int main()
{
int a,b,c;
int i=0;
int tmp=0,tmc=0;
scanf("%d%d%d",&a,&b,&c);
int flag=0;
while(a%2==0&&b%2==0&&c%2==0){
tmp=a;
tmc=b;
a=b/2+c/2;
b=tmp/2+c/2;
c=tmp/2+tmc/2;
i++;
if(i>10000){
flag=1;
break;
}
}
if(flag==1)
... |
#include <stdio.h>
int main(){
long long int A, B, C;
scanf("%lld%lld%lld", &A, &B, &C);
if(A == B && B == C && A % 2 == 0 && B % 2 == 0 && C % 2 == 0){
printf("-1\n");
return 0;
}
long long int sum = A + B + C, ans = 0;
while(A % 2 == 0 && B % 2 == 0 && C % 2 == 0){
A = (sum - A) / 2;
B = (sum - B) / 2;... |
#include<stdio.h>
int main()
{
int a,b,c,sum1,sum2,sum3,count=0;
scanf("%d%d%d",&a,&b,&c);
while(a%2==0 && b%2==0 && c%2==0)
{
sum1=a/2;
sum2=b/2;
sum3=c/2;
a=sum2+sum3;
b=sum1+sum3;
c=sum1+sum2;
count++;
if(a==b && b==c)
{
... |
#include "stdio.h"
int main(){
int a,b,c,a1,b1,c1;
scanf("%d %d %d",&a,&b,&c);
int count=0;
while(1){
if((a%2==1)||(b%2==1)||(c%2==1)){
break;
}
if((a==b)&&(a==c)){
count=-1;
break;
}
a1=a,b1=b,c1=c;//can i group together for one row?//ok
a=(b1+c1)/2;
b=(c1+a1)/2;
c=(a1+b1... |
#include <stdio.h>
#include <math.h>
int main(void){
long long int a,b,c,na,nb,nc;
double m = pow(10,9);
int i=0;
scanf("%lld %lld %lld", &a, &b, &c);
while(1){
if(a%2 || b%2 || c%2) break;
if(a==b && b==c){
printf("-1\n");
return 0;
}
na = b/2+c/2;
nb = a/2+c/2;
nc = a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.