mirror of
https://github.com/tiennm99/codeforces.git
synced 2026-10-14 08:18:09 +00:00
[Init] Solved solutions
This commit is contained in:
1 parent
51f667ac81
commit
20542601dd
131 files changed
+4148
No files matched your search
+46
@@ -0,0 +1,46 @@
|
||||
using System;
|
||||
using System.Collections.Generic;
|
||||
using System.Linq;
|
||||
using System.Text;
|
||||
using System.Threading.Tasks;
|
||||
|
||||
namespace _119A
|
||||
{
|
||||
class Program
|
||||
{
|
||||
static void Main(string[] args)
|
||||
{
|
||||
int[] a = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
|
||||
Console.WriteLine(P(a[0], a[1], a[2]) ? 1 : 0);
|
||||
}
|
||||
static bool P(int a, int b, int c)
|
||||
{
|
||||
while (true)
|
||||
{
|
||||
int gcd = GCD(a, c);
|
||||
c -= gcd;
|
||||
if (c == 0)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
gcd = GCD(b, c);
|
||||
c -= gcd;
|
||||
if (c == 0)
|
||||
{
|
||||
return true;
|
||||
}
|
||||
}
|
||||
}
|
||||
static int GCD(int a, int b)
|
||||
{
|
||||
int t;
|
||||
while (b != 0)
|
||||
{
|
||||
t = a % b;
|
||||
a = b;
|
||||
b = t;
|
||||
}
|
||||
return a;
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in new issue
Block a user