Submission #21994834

---

Source Code Expand

#include "bits/stdc++.h" 
using namespace std;
#define ll  int
#define rep(i,a,b) for(ll i=a;i<b;i++)

#define pb                push_back
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))

#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
const int mod=1e9+7;
inline int add(int x, int y){ x += y; if(x >= mod) x -= mod; return x;}
inline int sub(int x, int y){ x -= y; if(x < 0) x += mod; return x;}
inline int mul(int x, int y){ return (x * 1ll * y) % mod;}

const int num=1e5;

int dp[num];
int a,b,n;
void kuch(int k){
	dp[0]=1;
	for(int i=1;i<=100000;i++){
		if(i<k)
		dp[i]=dp[i-1];
		else 
		dp[i]=add(dp[i-1],dp[i-k]);
	}
//	cout<<"main\n";
//	for(int i=0;i<=4;i++)
//	cout<<dp[i]<<" ";
//	cout<<endl;
	for(int i=1;i<=100000;i++){
		dp[i]=add(dp[i-1],dp[i]);
	}
}

void solve(int io)
{
	ll n,m;
	cin>>n>>m;
	int dp[n+1];
	rep(i,0,n+1)dp[i]=0;
	while(m--){
		int a,b;
		cin>>a>>b;
		dp[a]+=1;
		dp[b+1]-=1;
	}
	rep(i,1,n+1){
		dp[i]=dp[i-1]+dp[i];
	}
	ll suf[n+1];
	memset(suf,0,sizeof(suf));
	rep(i,1,n+1){
		suf[dp[i]]++;
	}
	for(int i=n-1;i>=1;i--){
		suf[i]+=suf[i+1];
	}
	ll q,x;
	cin>>q;
	while(q--){
		cin>>x;
		cout<<suf[x]<<endl;
	}
}
int main()
{
//	cal();
	IOS
	
	int a,b,c;
	cin>>a>>b>>c;
	
	a=a*a;
	b=b*b;
	c=c*c;
	if(a+b<c){
		cout<<"Yes";
		
	}
	else cout<<"No";
	return 0;
	ll test=1;
//	cin>>test;
	
	rep(i,0,test){
//		cout<<"y\n";
		solve(i+1);
	}
//	
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve(int)’:
./Main.cpp:38:16: warning: unused parameter ‘io’ [-Wunused-parameter]
   38 | void solve(int io)
      |            ~~~~^~
./Main.cpp: In function ‘void kuch(int)’:
./Main.cpp:34:8: warning: iteration 99999 invokes undefined behavior [-Waggressive-loop-optimizations]
   34 |   dp[i]=add(dp[i-1],dp[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~
./Main.cpp:33:15: note: within this loop
   33 |  for(int i=1;i<=100000;i++){
      |              ~^~~~~~~~

Judge Result