提出 #8372573

---

ソースコード 拡げる

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<math.h>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<fstream>
#include<set>
#include<climits>
#include<cmath>
#include<sstream>
#include<stdlib.h>
#include<memory.h> 
#include<time.h>
#include<iomanip>
using namespace std;
const unsigned long long BIGEST=1000000000000000000+100000000000000000;
const long long BIGER=1000000000000000000;
const int BIG=1000000000;
const long long MOD=1000000007;
const long long LMOD=998244353;
#define Sf scanf
#define Pf printf
#define ll long long
#define Fi first
#define Se second
#define P2 pair
#define Cb make_pair
#define Vct vector
#define Que queue
#define Era erase
#define Sz size
#define Pii pair<int,int>
#define Pll pair<long long,long long>
#define Pb push_back
#define Clr clear
#define Cot continue
#define Psh push
#define Ins insertvhjm
#define Str string
#define Pq priority_queue
ll a[100005];
ll b[100005];
ll c[100005];

int main()
{
	ll n,k;
	Sf("%lld%lld",&n,&k);
	if((2*k+5*n-1)*n/2>=(2*k+2*n-1)*n)
	{
		//puts(":)");
	}
	else
	{
		puts("-1");
		return 0;
	}
	for(ll i=1;i<=n;i++)
	{
		a[i]=k+i-1;
		b[i]=k+i-1+n;
		c[i]=k+i-1+2*n;
	}
	/*
	for(ll i=1;i<=n;i++)
	{
		cout<<a[i]<<" "<<b[i]<<" "<<c[i]<<endl;
	}
	*/
	int t=2*n-b[1];
	for(ll i=1;i<=n;i++)
	{
		if(/*c[i]>a[i]+b[i]*/b[i]<2*n)
		{
			cout<<i<<" "<<(2*n-b[i])<<endl;
			swap(a[i],a[n-t+i]);
		}
		else
		{
			break;
		}
	}
	for(ll i=1;i<=n;i++)
	{
		//cout<<a[i]<<" "<<b[i]<<" "<<c[i]<<endl;
		Pf("%lld %lld %lld\n",a[i],b[i],c[i]);
		if(a[i]+b[i]<c[i])
		{
			puts("-1");
			return 0;
		}
	}
	return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:52:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  Sf("%lld%lld",&n,&k);
                      ^

ジャッジ結果