Cod sursa(job #1800092)
| Utilizator | Data | 7 noiembrie 2016 12:39:31 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.05 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int main()
{
int i,n,a,b,c,x; bool y; ifstream f("euclid3.in"); ofstream g("euclid3.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b>>c;
if (c>0)
{
x=0-c/a;
y=true;
while (x<=abs(c/a))
{
if ((c-a*x )% b==0) {g<<x<<" "<<(c-a*x)/b<<endl;
y=false;
break;
}
else {x++;}
}
if (y) {g<<"0 0"<<endl;}
{
}
}
else {
x=0-abs(c/a);
y=true;
while (x<=abs(c/a))
{
if ((c-a*x )% b==0) {g<<x<<" "<<(c-a*x)/b<<endl;
y=false;
break;
}
else {x++;}
}
if (y) {g<<"0 0"<<endl;}
{
}
}
}
return 0;
}
