Submission #1609021


Source Code Expand

#include <bits/stdc++.h>
#include<string.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define Max(x,y,z) max(x,max(y,z))
#define Min(x,y,z) min(x,min(y,z))
#define fr(i,s,e) for(i=s;i<e;i++)
#define rf(i,s,e) for(i=s-1;i>=e;i--)
#define pb push_back
#define eb emblace_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define trace1(x)                cerr<<#x<<": "<<x<<endl
#define trace2(x, y)             cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z)          cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d)       cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e)    cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl
#define vl vector<long long>
 
#define vi vector<int> 
#define vii vector< vector<int> >
#define vll vector< vector<long long> >
#define vpi vector< pair<int,int> >   
#define vpl vector< pair<ll,ll> >   
typedef pair<pair<int, ll>,int> P;
 #define mod %1000000007
// #define p 41
bool less_vectors(const vector<int>& a,const vector<int>& b) 
{
   return a.size() > b.size();
}
 
ll gcd(ll a,ll b)
{
if(a%b==0)
   return b;
   else
        return gcd(b,a%b);
}
class compr
{
   public:
bool operator()(pair<pair<int,ll>,int>  p1,pair<pair<int,ll>,int> p2)
{
   if(p1.ff.ss!=p2.ff.ss)
        return p1.ff.ss>p2.ff.ss;
        else
             if(p1.ss!=p2.ss)
             return p1.ss>p2.ss;
             else
                  return p1.ff<p2.ff;
             
}

};
ll fastexpo(ll a,ll b)
{
   //trace2(a,b);
   ll res=1;
   while(b>0)
   {
        if(b%2==1)
             res=(((res)mod)*((a)mod))mod;
        a=(((a)mod)*((a)mod))mod;
        b/=2;
   }
   //trace1(res);
   return res;
}
ll fastexpom(ll a,ll b,ll m)
{
ll res=1;
   while(b>0)
   {
        if(b%2==1)
             res=(((res)%m)*((a)%m))%m;
        a=(((a)%m)*((a)%m))%m;
        b/=2;
   }
   return res;
}
ll modinv(ll a,ll m=1000000007)
{
return fastexpom(a,m-2,m);
}
bool cmp(pair<int,int> p1,pair<int,int> p2)
{
	if((p1.ss-p1.ff)!=(p2.ss-p2.ff))
		return p1.ss-p1.ff<p2.ss-p2.ff;
	else
		return p1.ff<p2.ff;
}
bool cmp(string s1,string s2)
{
	if(s1.length()!=s2.length())
		return s1.length()>s2.length();
	else
		return s1<s2;
}
int main()
{
  	IOS;
 	#ifndef ONLINE_JUDGE
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	#endif
	int n;
	cin>>n;
	vl a(n);
	vl b(n);
	ll cnt=0;
	for(int i=0;i<n;i++)
	{
		cin>>a[i]>>b[i];
	}
	for(int i=n-1;i>=0;i--)
	{
		//trace3(a[i],b[i],cnt);
		if(((a[i]+cnt)%b[i]))
			cnt+=b[i]-(a[i]+cnt)%b[i];
	}
	cout<<cnt;
  return 0;
}  

Submission Info

Submission Time
Task A - Multiple Array
User M83
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3043 Byte
Status RE
Exec Time 101 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:108:32: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  freopen("input.txt","r",stdin);
                                ^
./Main.cpp:109:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  freopen("output.txt","w",stdout);
                                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
RE × 2
RE × 18
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt RE 97 ms 384 KB
02.txt RE 101 ms 256 KB
03.txt RE 95 ms 256 KB
04.txt RE 95 ms 256 KB
05.txt RE 95 ms 256 KB
06.txt RE 95 ms 256 KB
07.txt RE 95 ms 256 KB
08.txt RE 95 ms 256 KB
09.txt RE 95 ms 256 KB
10.txt RE 96 ms 256 KB
11.txt RE 95 ms 256 KB
12.txt RE 95 ms 256 KB
13.txt RE 95 ms 256 KB
14.txt RE 96 ms 256 KB
15.txt RE 96 ms 256 KB
16.txt RE 95 ms 256 KB
s1.txt RE 95 ms 256 KB
s2.txt RE 95 ms 256 KB