Cod sursa(job #729919)
Utilizator | Data | 31 martie 2012 00:33:42 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int v[15000],n,i,j,t,k,ct;
long x;
int main()
{
ifstream in("br.in");
ofstream out("br.out");
in>>n>>t;
for(i=1;i<=n;i++)
in>>v[i];
for(i=1;i<=t;i++)
{
in>>k>>x;
while(x-v[k]>=0)
{
x=x-v[k];
ct++;
if(k==n)
k=0;
k++;
if(ct==n)
x=-1;
}
out<<ct<<"\n";
ct=0;
}
}